Kumite (ko͞omiˌtā) is the practice of taking techniques learned from Kata and applying them through the act of freestyle sparring.
You can create a new kumite by providing some initial code and optionally some test cases. From there other warriors can spar with you, by enhancing, refactoring and translating your code. There is no limit to how many warriors you can spar with.
A great use for kumite is to begin an idea for a kata as one. You can collaborate with other code warriors until you have it right, then you can convert it to a kata.
I have undertaken a study of recursion. I find myself reaching for it fairly consistenly to solve different Kata but often find my understanding of certain concepts laking enough that I end up going with an iterative approach instead.
the goal of this was to produce in exponent notation the prime factors of a number.
The problem with this one is that because I created a new dictionary at the top of primeFactoring and because there is not an array or dictionary passed into it I ended up creating another function (factorPart) to fill the dictionary.
even ignoring all the messy formating code the solution seems convoluted.
What would be a better approach and what concepts should be understood to improve this answer?
def primeFactoring(n):
dict = {}
print(n)
factorPart(n,dict)
output = ""
for d, v in dict.items():
if v > 1:
output += str(d)+"^"+str(v)+" X "
else: output += str(d)+" X "
output = output.strip(" X ")
print(dict) #key being the factor and value being the number of occurrences
print(output) #formated in exponant form
return output
def factorPart(num, dict):
x = 2
while x <= num:
if num / x == num // x:
dict[x] = dict[x] + 1 if x in dict else 1
return factorPart(num // x, dict)
x+=1import codewars_test as test
# TODO Write tests
import solution # or from solution import example
# test.assert_equals(actual, expected, [optional] message)
@test.describe("Example")
def test_group():
@test.it("test case")
def test_case():
test.assert_equals(1 + 1, 2)
test.assert_equals(primeFactoring(11223144), "2^3 X 3^3 X 223 X 233")Summary
In this kata you have to make a function named converter.
What Does the converter Function do?
It converts a negitive number to a positive one and a positive number to a negetive one.
- Check the parameter
- If it is not integer just
return False
-
Check the word if it is negitive or positive
-
Convert the number
- if negitive convert to positive
- if positive convert to negitive
Now just return the final answer... Done!
Examples
-
# Negitive to Positive convert(-1) === 1 convert(-72) === 72 # Positive to Negitive convert(24) === -24 convert(32) === -32 # Invalid Sequences convert("23") === False convert("-94") === False convert(True) === False convert([123, 321]) == False convert({123, 1232, 34}) === False
def convert(number):
if isinstance(number, int):
# Check if number is negitive
if number < 0:
# negitive -> positive
return (abs(number))
else:
# positive -> negitive
return (number * -1)
else:
return Falseimport codewars_test as test
# TODO Write tests
import solution # or from solution import example
# test.assert_equals(actual, expected, [optional] message)
@test.describe("These are your Test results")
def test_group():
@test.it("test case")
def test_case():
test.assert_equals(convert(-1), 1)
test.assert_equals(convert(234), -234)
test.assert_equals(convert(-3472398574349325748132), 3472398574349325748132)
test.assert_equals(convert([2, 42, "3"]), False)Recent Moves:
The function is condensed down to one line using ES6 arrow functions
function findMax(arr){ let max = arr[0]; for(let i = 0; i < arr.length; i++){ if(max < arr[i]){ max = arr[i]; } } return max; }1 − const findMax = arr => Math.max(...arr);
1 + function findMax(arr){2 + let max = arr[0];
3 + for(let i = 0; i < arr.length; i++){4 + if(max < arr[i]){5 + max = arr[i];
6 + }
7 + }
8 + return max;
9 + }
Given a positive number n > 1 find the prime factor decomposition of n. Format the result as a string in the following form :
"(p_1**n_1)(p_2**n_2)...(p_k**n_k)"
where a ** b means a to the power of b
with the p_i in increasing order without the "**n_i".
Examples:
n = 17 should return "(17)"
n = 10976 should return "(2**5)(7**3)"
n = 86240 should return "(2**5)(5)(7**2)(11)"
require 'prime' def primeFactors(n) Prime.prime_division(n).map do |n| "(#{n[0]}#{n[1] > 1 ? '**' + n[1].to_s : ''})" end*"" end1 1 require 'prime'
2 − 3 3 def primeFactors(n)
4 − result = ''
5 − Prime.prime_division(n).each do |n|
6 − result += '(' + n[0].to_s7 − n[1] < 2 ? result += ')' : result += '**' + n[1].to_s + ')'
8 − end
9 − 10 − result
3 + Prime.prime_division(n).map do |n|
4 + "(#{n[0]}#{n[1] > 1 ? '**' + n[1].to_s : ''})"5 + end*""
11 11 end
Test.assert_equals(primeFactors(7), "(7)") Test.assert_equals(primeFactors(343), "(7**3)") Test.assert_equals(primeFactors(10976), "(2**5)(7**3)") Test.assert_equals(primeFactors(7775460), "(2**2)(3**3)(5)(7)(11**2)(17)") Test.assert_equals(primeFactors(9484985), "(5)(193)(9829)") Test.assert_equals(primeFactors(16516513), "(13)(359)(3539)")1 + Test.assert_equals(primeFactors(7), "(7)")
2 + Test.assert_equals(primeFactors(343), "(7**3)")
3 + Test.assert_equals(primeFactors(10976), "(2**5)(7**3)")
1 1 Test.assert_equals(primeFactors(7775460), "(2**2)(3**3)(5)(7)(11**2)(17)")
5 + Test.assert_equals(primeFactors(9484985), "(5)(193)(9829)")
6 + Test.assert_equals(primeFactors(16516513), "(13)(359)(3539)")
In my opinion, the code is cleaner with destructuring and math.hypot. Also, snake_case is preferred.
import math def goes_to_jail(directions): x = 0 ; y = 0 for north,east,south,west in directions: x += (east - west) * 274 y += (north - south) * 80 if math.hypot(x, y) > 2025: return True return False1 − def goesToJail(directions):
2 − location=[0,0]
3 − #North+East are postive numbers West+South are a negative numbers
4 − for direction in directions:
5 − location[0]=location[0]+(direction[0]*80)-(direction[2]*80)
6 − location[1]=location[1]+(direction[1]*274)-(direction[3]*274)
7 − #a squared + b squared = c squared
8 − if( (location[0]**2+location[1]**2)**(1/2) > 2000 ):
1 + import math
2 + 3 + def goes_to_jail(directions):
4 + x = 0 ; y = 0
5 + for north,east,south,west in directions:
6 + x += (east - west) * 274
7 + y += (north - south) * 80
8 + if math.hypot(x, y) > 2025:
9 9 return True
10 10 return False
import codewars_test as test # TODO Write tests import solution # or from solution import example # test.assert_equals(actual, expected, [optional] message) @test.describe("Example") def test_group(): @test.it("") def test_case(): test.assert_equals(goes_to_jail([[1,0,0,0],[0,0,1,0]]), False) test.assert_equals(goes_to_jail([[9,0,0,4],[15,0,0,1],[3,5,3,1],[0,1,5,0]]), True) test.assert_equals(goes_to_jail([[2,0,2,4],[3,0,3,1],[0,1,5,0],[1,0,3,4]]), True) test.assert_equals(goes_to_jail([[1,0,0,3],[3,0,1,2],[5,0,1,0]]), False) test.assert_equals(goes_to_jail( [[0,0,0,3],[2,0,1,0],[3,0,1,5],[0,3,1,0]] ), True)1 1 import codewars_test as test
2 2 # TODO Write tests
3 3 import solution # or from solution import example
4 4 5 5 # test.assert_equals(actual, expected, [optional] message)
6 6 @test.describe("Example")7 7 def test_group():
8 8 @test.it("")9 9 def test_case():
10 − test.assert_equals(goesToJail([[1,0,0,0],[0,0,1,0]]), False)
11 − test.assert_equals(goesToJail([[9,0,0,4],[15,0,0,1],[3,5,3,1],[0,1,5,0]]), True)
12 − test.assert_equals(goesToJail([[2,0,2,4],[3,0,3,1],[0,1,5,0],[1,0,3,4]]), True)
13 − test.assert_equals(goesToJail([[1,0,0,3],[3,0,1,2],[5,0,1,0]]), False)
14 − test.assert_equals(goesToJail( [[0,0,0,3],[2,0,1,0],[3,0,1,5],[0,3,1,0]] ), True)
10 + test.assert_equals(goes_to_jail([[1,0,0,0],[0,0,1,0]]), False)
11 + test.assert_equals(goes_to_jail([[9,0,0,4],[15,0,0,1],[3,5,3,1],[0,1,5,0]]), True)
12 + test.assert_equals(goes_to_jail([[2,0,2,4],[3,0,3,1],[0,1,5,0],[1,0,3,4]]), True)
13 + test.assert_equals(goes_to_jail([[1,0,0,3],[3,0,1,2],[5,0,1,0]]), False)
14 + test.assert_equals(goes_to_jail( [[0,0,0,3],[2,0,1,0],[3,0,1,5],[0,3,1,0]] ), True)
Golfed solution.
function* generateInterval(a,b,c){for(;c>0?a<=b:a>=b;a+=c)yield a}1 − function* generateInterval(start, stop, step) {2 − if (step >= 0) { // infinite lists with step 0 are a-okay3 − for (let cursor=start; cursor<=stop; cursor+=step) yield cursor;
4 − } else if (step < 0) {5 − for (let cursor=start; cursor>=stop; cursor+=step) yield cursor;
6 − }
7 − }
1 + function* generateInterval(a,b,c){for(;c>0?a<=b:a>=b;a+=c)yield a}