Begin a new Kumite
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.
Performance
Got rid of the sort.
Don't think you can get much better using trial division.
function getDiv(n){ let factor0 = []; let factor1 = []; let end0 = Math.sqrt(n); let end1 = Math.ceil(end0); for (let i = 1; i !== end1; ++i) { if (n % i === 0) { factor0.push(i); factor1.unshift(n / i); } } if (end0 === end1) { factor0.push(end0); } factor0.push(...factor1); return factor0; }1 − var sortNumber = function(a, b){return a - b;};2 − 3 3 function getDiv(n){4 − var factL= [], i;
5 − for (i = 1; i <= Math.floor(Math.sqrt(n)); i += 1) {2 + let factor0 = [];
3 + let factor1 = [];
4 + let end0 = Math.sqrt(n);
5 + let end1 = Math.ceil(end0);
6 + for (let i = 1; i !== end1; ++i) {6 6 if (n % i === 0) {7 − factL.push(i);
8 − if (n / i !== i) factL.push(n / i);
8 + factor0.push(i);
9 + factor1.unshift(n / i);
9 9 }
10 10 }
11 − factL.sort(sortNumber);
12 − return factL;
12 + if (end0 === end1) {13 + factor0.push(end0);
14 + }
15 + factor0.push(...factor1);
16 + return factor0;
13 13 }
var sortNumber = function(a, b){return a - b;}; const Test = require("@codewars/test-compat"); function getDivCheck(n){ var factL= [], i; for (i = 1; i <= Math.floor(Math.sqrt(n)); i += 1) { if (n % i === 0) { factL.push(i); if (n / i !== i) factL.push(n / i); } } factL.sort(sortNumber); return factL; } describe("Static Cases", function(){ it("n = 200", function(){ Test.assertSimilar(getDiv(200), [1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 100, 200]); }); it("n = 560", function(){ Test.assertSimilar(getDiv(560), [ 1, 2, 4, 5, 7, 8, 10, 14, 16, 20, 28, 35, 40, 56, 70, 80, 112, 140, 280, 560 ]); }); it("n = 755", function(){ Test.assertSimilar(getDiv(755), [ 1, 5, 151, 755 ]); }); }); function randint(min, max) { return Math.floor(Math.random() * (max - min + 1)) + min; } describe("Random Cases", function(){ it("More than 1000 Random Tests with challenging values up to 1000000000(1e9)" , function(){ for (var i = 0; i <= 1000; i++) { var n = randint(1000, 1000000000); var result = getDivCheck(n), res = getDiv(n); it("Testing for n = " + n.toString(), function(){ Test.assertSimilar(res,result); }) } }) })1 + var sortNumber = function(a, b){return a - b;};2 + const Test = require("@codewars/test-compat");1 1 function getDivCheck(n){2 2 var factL= [], i;
3 3 for (i = 1; i <= Math.floor(Math.sqrt(n)); i += 1) {4 4 if (n % i === 0) {5 5 factL.push(i);
6 6 if (n / i !== i) factL.push(n / i);
7 7 }
8 8 }
… Expand 9 9 factL.sort(sortNumber);
10 10 return factL;
11 11 }
12 12 13 13 describe("Static Cases", function(){14 14 it("n = 200", function(){15 15 Test.assertSimilar(getDiv(200), [1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 100, 200]);
16 16 });
17 17 18 18 it("n = 560", function(){19 19 Test.assertSimilar(getDiv(560), [ 1, 2, 4, 5, 7, 8, 10, 14, 16, 20, 28, 35, 40, 56, 70, 80, 112, 140, 280, 560 ]);
20 20 });
21 21 22 22 it("n = 755", function(){23 23 Test.assertSimilar(getDiv(755), [ 1, 5, 151, 755 ]);
24 24 });
25 25 });
26 26 27 27 function randint(min, max) {28 28 return Math.floor(Math.random() * (max - min + 1)) + min;
29 29 }
30 30 31 31 describe("Random Cases", function(){32 − it("More than 1000 Random Tests with challenging values up to 1000000000(10e9)" , function(){34 + it("More than 1000 Random Tests with challenging values up to 1000000000(1e9)" , function(){33 33 for (var i = 0; i <= 1000; i++) {34 34 var n = randint(1000, 1000000000);
35 35 var result = getDivCheck(n), res = getDiv(n);
36 36 it("Testing for n = " + n.toString(), function(){37 37 Test.assertSimilar(res,result);
38 38 })
39 39 }
40 40 })
41 41 })
!n=n>1 ? n*!~-n : 1;factorial=!1 − def factorial(n):
2 − # your code goes here
3 − return
1 + !n=n>1 ? n*!~-n : 1;factorial=!
# FactCheck example: # TODO: replace with your own tests (TDD), these are just how-to examples. using FactCheck facts("Testing basics") do @fact factorial(5) --> 120 @fact factorial(6) --> 720 @fact factorial(3) --> 6 @fact factorial(0) --> 1 @fact factorial(1) --> 1 end1 − import codewars_test as test
2 − # TODO Write tests
3 − import solution # or from solution import example
4 − 5 − # test.assert_equals(actual, expected, [optional] message)
6 − @test.describe("Example")7 − def test_group():
8 − @test.it("test case")9 − def test_case():
10 − test.assert_equals(factorial(5), 120)
11 − test.assert_equals(factorial(6), 720)
12 − test.assert_equals(factorial(3), 6)
1 + # FactCheck example:
2 + # TODO: replace with your own tests (TDD), these are just how-to examples.
3 + using FactCheck
4 + facts("Testing basics") do5 + @fact factorial(5) --> 120
6 + @fact factorial(6) --> 720
7 + @fact factorial(3) --> 6
8 + @fact factorial(0) --> 1
9 + @fact factorial(1) --> 1
10 + end
Recursion
Algorithms
Computability Theory
Theoretical Computer Science
Arrays
Methods
Functions
Object-oriented Programming
Control Flow
Basic Language Features
Fundamentals
Classes
(ns flip.core) (defn flip [xs] (if (reversible? xs) (map flip (reverse xs)) xs))1 − class Array # Opens up the Array class for method creation
2 − def flip
3 − result = []
4 − me = self.reverse # Don't fret, I'll sort the Arrays out!
5 − 6 − me.each do |x|
7 − 8 − if x.class == Array then result << x.flip # Here's the recursion.
9 − else result << x
10 − end
11 − 12 − end
13 − 14 − return result
15 − end
16 − end
1 + (ns flip.core)
2 + 3 + (defn flip [xs]
4 + (if (reversible? xs)
5 + (map flip (reverse xs))
6 + xs))
(ns flip.test (:require [clojure.test :refer :all] [flip.core :refer [flip]])) (deftest flip-test (is (= (flip [1,2,3,4,5]) [5,4,3,2,1])) (is (= (flip [1,2,[3,4],5]) [5,[4,3],2,1])) (is (= (flip [1,2,[3,4,[5,6],7],8,[9,10]]) [[10,9],8,[7,[6,5],4,3],2,1])))1 − describe "Array#flip Kumite" do
2 − it "should have Array#flip defined" do
3 − Test.expect defined?([1,2,3,4,5].flip), "Array#flip is not defined."
4 − Test.assert_equals [1,2,3,4,5].flip, [5,4,3,2,1]
5 − Test.assert_equals [1,2,[3,4],5].flip, [5,[4,3],2,1]
6 − Test.assert_equals [1,2,[3,4,[5,6],7],8,[9,10]].flip, [[10,9],8,[7,[6,5],4,3],2,1]
7 − end
8 − end
1 + (ns flip.test
2 + (:require [clojure.test :refer :all]
3 + [flip.core :refer [flip]]))
4 + 5 + (deftest flip-test
6 + (is (= (flip [1,2,3,4,5]) [5,4,3,2,1]))
7 + (is (= (flip [1,2,[3,4],5]) [5,[4,3],2,1]))
8 + (is (= (flip [1,2,[3,4,[5,6],7],8,[9,10]]) [[10,9],8,[7,[6,5],4,3],2,1])))
Recent Moves:
Recursion
Algorithms
Computability Theory
Theoretical Computer Science
Arrays
Methods
Functions
Object-oriented Programming
Control Flow
Basic Language Features
Fundamentals
Classes
Recursion
Algorithms
Computability Theory
Theoretical Computer Science
Arrays
Methods
Functions
Object-oriented Programming
Control Flow
Basic Language Features
Fundamentals
Classes
f=lambda a:[list==type(x)and f(x)or x for x in a[::-1]]1 − class Array # Opens up the Array class for method creation
2 − def flip
3 − result = []
4 − me = self.reverse # Don't fret, I'll sort the Arrays out!
5 − 6 − me.each do |x|
7 − 8 − if x.class == Array then result << x.flip # Here's the recursion.
9 − else result << x
10 − end
11 − 12 − end
13 − 14 − return result
15 − end
16 − end
1 + f=lambda a:[list==type(x)and f(x)or x for x in a[::-1]]
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("test case") def test_case(): test.assert_equals(f([1,2,3,4,5]), [5,4,3,2,1]) test.assert_equals(f([1,2,[3,4],5]), [5,[4,3],2,1]) test.assert_equals(f([1,2,[3,4,[5,6],7],8,[9,10]]), [[10,9],8,[7,[6,5],4,3],2,1])1 − describe "Array#flip Kumite" do
2 − it "should have Array#flip defined" do
3 − Test.expect defined?([1,2,3,4,5].flip), "Array#flip is not defined."
4 − Test.assert_equals [1,2,3,4,5].flip, [5,4,3,2,1]
5 − Test.assert_equals [1,2,[3,4],5].flip, [5,[4,3],2,1]
6 − Test.assert_equals [1,2,[3,4,[5,6],7],8,[9,10]].flip, [[10,9],8,[7,[6,5],4,3],2,1]
7 − end
8 − end
1 + import codewars_test as test
2 + # TODO Write tests
3 + import solution # or from solution import example
4 + 5 + # test.assert_equals(actual, expected, [optional] message)
6 + @test.describe("Example")7 + def test_group():
8 + @test.it("test case")9 + def test_case():
10 + test.assert_equals(f([1,2,3,4,5]), [5,4,3,2,1])
11 + test.assert_equals(f([1,2,[3,4],5]), [5,[4,3],2,1])
12 + test.assert_equals(f([1,2,[3,4,[5,6],7],8,[9,10]]), [[10,9],8,[7,[6,5],4,3],2,1])
Strings
Changed to what I feel is a more direct approach.
import java.util.HashMap; import java.util.Map; import java.util.stream.Collector; class Dislexifier { public static final Map<Integer, Character> replaceMap; static { replaceMap = new HashMap<>(); replaceMap.put((int) 'a', '4'); replaceMap.put((int) 'o', '0'); replaceMap.put((int) 'e', '3'); replaceMap.put((int) 'i', '1'); } public static String theDislexifier(String str) { return str.chars() .mapToObj(c -> replaceMap.getOrDefault(c | 0x20, (char) c)) .collect(Collector.of( () -> new StringBuilder(str.length()), StringBuilder::append, StringBuilder::append, StringBuilder::toString )); } }1 1 import java.util.HashMap;
2 2 import java.util.Map;
3 − import java.util.stream.Collectors;
3 + import java.util.stream.Collector;
4 4 5 5 class Dislexifier
6 6 {7 − public static final Map<String, String> replaceMap;
7 + public static final Map<Integer, Character> replaceMap;
8 8 9 9 static {10 10 replaceMap = new HashMap<>();
11 − replaceMap.put("a","4");12 − replaceMap.put("o", "0");13 − replaceMap.put("e","3");14 − replaceMap.put("i","1");11 + replaceMap.put((int) 'a', '4');
12 + replaceMap.put((int) 'o', '0');
13 + replaceMap.put((int) 'e', '3');
14 + replaceMap.put((int) 'i', '1');
15 15 }
16 16 17 17 public static String theDislexifier(String str) {18 − return str.chars().mapToObj(cp -> String.valueOf((char)cp))
19 − .map(c -> replaceMap.getOrDefault(c.toLowerCase(),c))
20 − .collect(Collectors.joining());
18 + return str.chars()
19 + .mapToObj(c -> replaceMap.getOrDefault(c | 0x20, (char) c))
20 + .collect(Collector.of(
21 + () -> new StringBuilder(str.length()),
22 + StringBuilder::append,
23 + StringBuilder::append,
24 + StringBuilder::toString
25 + ));
21 21 }
22 22 }
Recent Moves:
Strings
Using Map and jdk8 streams :)
import java.util.HashMap; import java.util.Map; import java.util.stream.Collectors; class Dislexifier { public static final Map<String, String> replaceMap; static { replaceMap = new HashMap<>(); replaceMap.put("a","4"); replaceMap.put("o", "0"); replaceMap.put("e","3"); replaceMap.put("i","1"); } public static String theDislexifier(String str) { return str.chars().mapToObj(cp -> String.valueOf((char)cp)) .map(c -> replaceMap.getOrDefault(c.toLowerCase(),c)) .collect(Collectors.joining()); } }1 + import java.util.HashMap;
2 + import java.util.Map;
3 + import java.util.stream.Collectors;
4 + 1 1 class Dislexifier
2 2 {3 − public static String theDislexifier(String str)
4 − {5 − 6 − // TODO: Do your magic here
7 − 8 − return str.replace("a","4").replace("A","4").replace("o","0").replace("O","0").replace("e","3").replace("E","3").replace("i","1").replace("I","1");9 − }
7 + public static final Map<String, String> replaceMap;
8 + 9 + static {10 + replaceMap = new HashMap<>();
11 + replaceMap.put("a","4");12 + replaceMap.put("o", "0");13 + replaceMap.put("e","3");14 + replaceMap.put("i","1");15 + }
16 + 17 + public static String theDislexifier(String str) {18 + return str.chars().mapToObj(cp -> String.valueOf((char)cp))
19 + .map(c -> replaceMap.getOrDefault(c.toLowerCase(),c))
20 + .collect(Collectors.joining());
21 + }
10 10 }
Ruby golf.
def verify_sum(a,b)a.sum==b.sum rescue !1end def verify_sum(a,b)a&&b&&a.sum==b.sum||!1end1 − def verify_sum(a,b)f=->x{x.chars.sum &:ord};!!(a&&b&&f.(a)==f.(b))end1 + def verify_sum(a,b)a.sum==b.sum rescue !1end
2 + def verify_sum(a,b)a&&b&&a.sum==b.sum||!1end
# From Ruby 3.0, RSpec is used under the hood. # See https://rspec.info/ # Defaults to the global `describe` for backwards compatibility, but `RSpec.desribe` works as well. describe "Example" do it "should return the sum" do expect(verify_sum("Sebastian", "Patricia")).to eq(false) expect(verify_sum("Anna", "Nana")).to eq(true) expect(verify_sum("John", nil)).to eq(false) # The following is still supported, but new tests should now use them. # Test.assert_equals(add(1, 1), 2) end end1 − Test.assert_equals(verify_sum('Sebastian', 'Patricia'), false)2 − Test.assert_equals(verify_sum('Anna', 'Nana'), true)3 − Test.assert_equals(verify_sum('John', nil), false)1 + # From Ruby 3.0, RSpec is used under the hood.
2 + # See https://rspec.info/
3 + # Defaults to the global `describe` for backwards compatibility, but `RSpec.desribe` works as well.
4 + describe "Example" do
5 + it "should return the sum" do
6 + expect(verify_sum("Sebastian", "Patricia")).to eq(false)7 + expect(verify_sum("Anna", "Nana")).to eq(true)8 + expect(verify_sum("John", nil)).to eq(false)9 + # The following is still supported, but new tests should now use them.
10 + # Test.assert_equals(add(1, 1), 2)
11 + end
12 + end
13 +
Fundamentals
row=lambda x,y:[*range(x,y+1)]1 − row=lambda x,y:list(range(x,y+1))
1 + row=lambda x,y:[*range(x,y+1)]
test.assert_equals(row(0, 0), [0]) test.assert_equals(row(-5, 10), [-5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]) test.assert_equals(row(1, 15), [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]) test.assert_equals(row(10, 10), [10])1 − test.assert_equals(row(0, 0), [0])
2 − test.assert_equals(row(-5, 10), [-5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
3 − test.assert_equals(row(1, 15), [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15])
1 + test.assert_equals(row(0, 0), [0])
2 + test.assert_equals(row(-5, 10), [-5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
3 + test.assert_equals(row(1, 15), [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15])
4 4 test.assert_equals(row(10, 10), [10])
假裝世界沒有中文這個語文。