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.
Mathematics
Algorithms
Numbers
""" https://en.wikipedia.org/wiki/Primality_test An alternative using primality mod 30 = 2 * 3 * 5 instead of 6 = 2 * 3 -- Using generator instead of list (works faster) """ def prime_checker(n): if n in [2, 3, 5]: return True elif n % 2 == 0 or n % 3 == 0 or n % 5 == 0 or n <= 1: return False sqrt_n = int(n ** 0.5 / 30) b = [7, 11, 13, 17, 19, 23, 29, 31] for i in (30 * k for k in range(sqrt_n + 1)): if any(n % (i + j) == 0 for j in b if i + j is not n): return False return True1 1 """
2 2 https://en.wikipedia.org/wiki/Primality_test
3 − This one has lesser tests or usage of % operator.
4 − An alternative using primality mod 30 = 2 * 3 * 5 instead of 6 = 2 * 3
3 + An alternative using primality mod 30 = 2 * 3 * 5 instead of 6 = 2 * 3
4 + -- Using generator instead of list (works faster)
5 5 """
6 6 def prime_checker(n):
7 7 if n in [2, 3, 5]:
8 8 return True
9 − elif n % 2 == 0 or n % 3 == 0 or n % 5 == 0:
9 + elif n % 2 == 0 or n % 3 == 0 or n % 5 == 0 or n <= 1:
10 10 return False
11 11 12 − a = int(n ** 0.5 / 30)
12 + sqrt_n = int(n ** 0.5 / 30)
13 13 b = [7, 11, 13, 17, 19, 23, 29, 31]
14 14 15 − for i in [30 * j for j in range(a + 1)]:
16 − if True in [n % (i + q) == 0 for q in b if i + q is not n]:
15 + for i in (30 * k for k in range(sqrt_n + 1)):
16 + if any(n % (i + j) == 0 for j in b if i + j is not n):
17 17 return False
18 − return True
18 + return True
Recent Moves:
Mathematics
Algorithms
Numbers
Optimized
function prime_checker (n) { if ([0,1].includes(n)) return false; if (n == 2) return true; if (n % 2 == 0) return false; for(let i = 3; i < Math.sqrt(n); i += 2) { if(n % i === 0) return false; } return true; }1 1 function prime_checker (n) {2 2 if ([0,1].includes(n)) return false;
3 3 if (n == 2) return true;
4 4 if (n % 2 == 0) return false;
5 − for(let i = 3; i < n; i += 2) {5 + for(let i = 3; i < Math.sqrt(n); i += 2) {6 6 if(n % i === 0) return false;
7 7 }
8 8 return true;
9 9 }
Mathematics
Algorithms
Numbers
""" https://en.wikipedia.org/wiki/Primality_test This one has lesser tests or usage of % operator. An alternative using primality mod 30 = 2 * 3 * 5 instead of 6 = 2 * 3 """ def prime_checker(n): if n in [2, 3, 5]: return True elif n % 2 == 0 or n % 3 == 0 or n % 5 == 0: return False a = int(n ** 0.5 / 30) b = [7, 11, 13, 17, 19, 23, 29, 31] for i in [30 * j for j in range(a + 1)]: if True in [n % (i + q) == 0 for q in b if i + q is not n]: return False return True… Expand 1 1 """
2 2 https://en.wikipedia.org/wiki/Primality_test
3 3 This one has lesser tests or usage of % operator.
4 4 An alternative using primality mod 30 = 2 * 3 * 5 instead of 6 = 2 * 3
5 5 """
6 6 def prime_checker(n):
7 7 if n in [2, 3, 5]:
8 8 return True
9 9 elif n % 2 == 0 or n % 3 == 0 or n % 5 == 0:
10 10 return False
11 11 12 12 a = int(n ** 0.5 / 30)
13 13 b = [7, 11, 13, 17, 19, 23, 29, 31]
14 14 15 − for i in [30 * j for j in range(a)]:
16 − if True in [n % (i + q) == 0 for q in b]:
15 + for i in [30 * j for j in range(a + 1)]:
16 + if True in [n % (i + q) == 0 for q in b if i + q is not n]:
17 17 return False
18 18 return True
import codewars_test as test from solution import prime_checker @test.describe("Example") def test_group(): @test.it("test case") def test_case(): test.assert_equals(prime_checker(653), True) test.assert_equals(prime_checker(654), False) test.assert_equals(prime_checker(5), True) test.assert_equals(prime_checker(777), False)# test.assert_equals(prime_checker(977), True) test.assert_equals(prime_checker(125), False)# test.assert_equals(prime_checker(997), True) test.assert_equals(prime_checker(709), True) test.assert_equals(prime_checker(15), False)# test.assert_equals(prime_checker(11), True) test.assert_equals(prime_checker(13), True) test.assert_equals(prime_checker(17), True) test.assert_equals(prime_checker(19), True) test.assert_equals(prime_checker(23), True) test.assert_equals(prime_checker(29), True) test.assert_equals(prime_checker(1021), True) test.assert_equals(prime_checker(39 * 41), False) test.assert_equals(prime_checker(553_105_253), True) test.assert_equals(prime_checker(982_451_653), True)… Expand 1 1 import codewars_test as test
2 2 from solution import prime_checker
3 3 4 4 @test.describe("Example")5 5 def test_group():
6 6 @test.it("test case")7 7 def test_case():
8 8 test.assert_equals(prime_checker(653), True)
9 9 test.assert_equals(prime_checker(654), False)
10 10 test.assert_equals(prime_checker(5), True)
11 11 test.assert_equals(prime_checker(777), False)#
12 12 test.assert_equals(prime_checker(977), True)
13 13 test.assert_equals(prime_checker(125), False)#
14 14 test.assert_equals(prime_checker(997), True)
15 15 test.assert_equals(prime_checker(709), True)
16 16 test.assert_equals(prime_checker(15), False)#
17 17 test.assert_equals(prime_checker(11), True)
18 18 test.assert_equals(prime_checker(13), True)
19 19 test.assert_equals(prime_checker(17), True)
20 20 test.assert_equals(prime_checker(19), True)
21 21 test.assert_equals(prime_checker(23), True)
22 22 test.assert_equals(prime_checker(29), True)
23 23 test.assert_equals(prime_checker(1021), True)
24 + test.assert_equals(prime_checker(39 * 41), False)
24 24 test.assert_equals(prime_checker(553_105_253), True)
25 25 test.assert_equals(prime_checker(982_451_653), True)
26 26
Mathematics
Algorithms
Numbers
Tries make me happy.
class ref: def __init__(self, data): self.data = data def is_happy(x, *, _trie=[False,10*[False]+[ref(True)]]+8*[False]+[ref(False)]): a = ref(False) while True: z = 0 # wasting some operations when x is in _trie. nobody cares though. t = _trie while x: r = x%10 if not t[r]: t[r] = (11-(not r))*[False] t = t[r] x //= 10 z += r**2 if t[-1]: a.data = t[-1].data return a.data t[-1] = a x = z1 − def is_happy(h: int, *, _unhappy={0}, _happy={1}) -> bool:2 − """Returns `True` if `h` is happy, `False` otherwise."""
3 − seen = set()
1 + class ref:
2 + def __init__(self, data):
3 + self.data = data
4 + 5 + def is_happy(x, *, _trie=[False,10*[False]+[ref(True)]]+8*[False]+[ref(False)]):
6 + a = ref(False)
4 4 while True:
5 − if h in _unhappy or h in seen:
6 − _unhappy.update(seen)
7 − return False
8 − elif h in _happy:
9 − _happy.update(seen)
10 − return True
11 − seen.add(h)
12 − tot = 0
13 − while h > 0:
14 − tot += pow(h % 10, 2)
15 − h //= 10
16 − h = tot
8 + z = 0 # wasting some operations when x is in _trie. nobody cares though.
9 + t = _trie
10 + while x:
11 + r = x%10
12 + if not t[r]:
13 + t[r] = (11-(not r))*[False]
14 + t = t[r]
15 + x //= 10
16 + z += r**2
17 + if t[-1]:
18 + a.data = t[-1].data
19 + return a.data
20 + t[-1] = a
21 + x = z
Recent Moves:
Mathematics
Algorithms
Numbers
A potential addition to this Kumite that I didn't do would be introducing an argument for radix.
If anybody feels like golfing this, check out code.golf/happy-numbers.
def is_happy(h: int, *, _unhappy={0}, _happy={1}) -> bool: """Returns `True` if `h` is happy, `False` otherwise.""" seen = set() while True: if h in _unhappy or h in seen: _unhappy.update(seen) return False elif h in _happy: _happy.update(seen) return True seen.add(h) tot = 0 while h > 0: tot += pow(h % 10, 2) h //= 10 h = tot1 − def is_happy(h: int) -> bool:
1 + def is_happy(h: int, *, _unhappy={0}, _happy={1}) -> bool:2 2 """Returns `True` if `h` is happy, `False` otherwise."""
3 3 seen = set()
4 − while h > 1 and h not in seen:
4 + while True:
5 + if h in _unhappy or h in seen:
6 + _unhappy.update(seen)
7 + return False
8 + elif h in _happy:
9 + _happy.update(seen)
10 + return True
5 5 seen.add(h)
6 6 tot = 0
7 7 while h > 0:
8 8 tot += pow(h % 10, 2)
9 9 h //= 10
10 10 h = tot
11 − return h == 1
using System.Linq; public class Kata { public static bool IsIsogram(string word) { var numberOfUniqueLetters = word.ToLower().Distinct().Count(); var areAllLettersUnique = word.Length == numberOfUniqueLetters; return areAllLettersUnique; } }1 1 using System.Linq;
2 2 3 3 public class Kata
4 4 {5 − public static bool IsIsogram(string str) => str.Length == str.ToLower().Distinct().Count();
5 + public static bool IsIsogram(string word)
6 + {7 + var numberOfUniqueLetters = word.ToLower().Distinct().Count();
8 + var areAllLettersUnique = word.Length == numberOfUniqueLetters;
9 + return areAllLettersUnique;
10 + }
6 6 }
Recent Moves:
An isogram a word where no letter repeats itself more than once, no matter what case it is.
Write a function that checks whether a word is an isogram or not.
using System.Linq; public class Kata { public static bool IsIsogram(string str) => str.Length == str.ToLower().Distinct().Count(); }1 − using System;
2 − using System.Linq;
1 + using System.Linq;
3 3 4 4 public class Kata
5 5 {6 − public static bool IsIsogram(string str)
7 − {8 − string seen = "";
9 − 10 − foreach(var c in str.ToLower()) {… Expand 11 − if(seen.Contains(c)) return false;
12 − seen = seen + c;
13 − }
14 − 15 − return true;
16 − }
5 + public static bool IsIsogram(string str) => str.Length == str.ToLower().Distinct().Count();
17 17 }
using System; using System.Linq; public class Kata { public static bool IsIsogram(string str) { string seen = ""; foreach(var c in str.ToLower()) { if(seen.Contains(c)) return false; seen = seen + c; } return true; } }1 − /*
2 2 using System;
3 − using System.Linq;
4 − */
2 + using System.Linq;
5 5 6 6 public class Kata
7 7 {8 8 public static bool IsIsogram(string str)
9 9 {10 − System.Collections.Generic.HashSet<int> seen = new System.Collections.Generic.HashSet<int>();
11 − foreach (char c in str)
12 − {13 − int c_insensitive = (int) c & 0x1f;
14 − if (seen.Contains(c_insensitive))
15 − {16 − return false;
17 − }
18 − seen.Add(c_insensitive);
8 + string seen = "";
9 + 10 + foreach(var c in str.ToLower()) {11 + if(seen.Contains(c)) return false;
12 + seen = seen + c;
19 19 }
14 + 20 20 return true;
21 21 }
22 22 }
Simple rainbow indentation, like you would use when writing in Python.
The second version is actually quite pointless, as I don't think Codewars users generally actually toggle the theme often, just settling on one and staying on it. Just a simple map function would probably be a lot better, as it would alter the document less to potentially break fewer scripts. That would be boring, though. It's also almost certainly possible to use low opacity to let the background's color change take care of everything, but I couldn't figure it out.
You could probably replace the current .nested-items system with <table>.
// make it look a little nicer $(".title-container").css("border", "none"); // too bright (function(xs) { let rainbowfy = (ix) => function() { $(this).css("background-color", xs[ix]); //.css("opacity", 0.5); //good if you hate using codewars if ($(this).hasClass("nested-items")) { $(this).children().each(rainbowfy((ix + 1) % xs.length)); } }; $("#snippet_list").children() .each(rainbowfy(0)); })(["red", "yellow", "lime", "cyan", "blue", "magenta"]); // overcomplicated version (function(xs) { let rainbow = [[48,49,51],[228,228,231]].map(x => xs.map(y => y.map((z, i) => (z + x[i]) / 2))); let theme = rainbow[+!$("html").hasClass("dark")]; let rainbowfy = (ix) => function() { $(this).attr("data-rainbow", ix); $(this).css("background-color", `rgb(${theme[ix]})`); if ($(this).hasClass("nested-items")) { $(this).children().each(rainbowfy((ix + 1) % xs.length)); } }; $("#snippet_list").children().each(rainbowfy(0)); let colorize = function() { let theme = rainbow[+$("html").hasClass("dark")]; for (let i = 0; i < xs.length; ++i) { $(`#snippet_list div[data-rainbow=${i}]`).css("background-color", `rgb(${theme[i]})`); } }; $(".js-toggle-dark-mode").click(colorize); })([[255,0,0],[255,255,0],[0,255,0],[0,255,255],[0,0,255],[255,0,255]]);1 − (function(x){2 − x.src="https://code.jquery.com/jquery-3.6.0.min.js";
3 − document.querySelector("head").appendChild(x);4 − })(document.createElement("script"));1 + // make it look a little nicer
2 + $(".title-container").css("border", "none");5 5 6 − $("<button>[ - - ! - - ]</button>")7 − .insertBefore(".nested-items")8 − .click(function(){$(this).next().toggle();});4 + // too bright
5 + (function(xs) {6 + let rainbowfy = (ix) => function() {7 + $(this).css("background-color", xs[ix]); //.css("opacity", 0.5); //good if you hate using codewars8 + if ($(this).hasClass("nested-items")) {9 + $(this).children().each(rainbowfy((ix + 1) % xs.length));
10 + }
11 + };
12 + $("#snippet_list").children()13 + .each(rainbowfy(0));
14 + })(["red", "yellow", "lime", "cyan", "blue", "magenta"]);
15 + 16 + // overcomplicated version
17 + (function(xs) {18 + let rainbow = [[48,49,51],[228,228,231]].map(x => xs.map(y => y.map((z, i) => (z + x[i]) / 2)));
19 + let theme = rainbow[+!$("html").hasClass("dark")];20 + let rainbowfy = (ix) => function() {21 + $(this).attr("data-rainbow", ix);22 + $(this).css("background-color", `rgb(${theme[ix]})`);23 + if ($(this).hasClass("nested-items")) {24 + $(this).children().each(rainbowfy((ix + 1) % xs.length));
25 + }
26 + };
27 + $("#snippet_list").children().each(rainbowfy(0));28 + let colorize = function() {29 + let theme = rainbow[+$("html").hasClass("dark")];30 + for (let i = 0; i < xs.length; ++i) {31 + $(`#snippet_list div[data-rainbow=${i}]`).css("background-color", `rgb(${theme[i]})`);32 + }
33 + };
34 + $(".js-toggle-dark-mode").click(colorize);35 + })([[255,0,0],[255,255,0],[0,255,0],[0,255,255],[0,0,255],[255,0,255]]);
// Since Node 10, we're using Mocha. // You can use `chai` for assertions. const chai = require("chai"); const assert = chai.assert; // Uncomment the following line to disable truncating failure messages for deep equals, do: // chai.config.truncateThreshold = 0; // Since Node 12, we no longer include assertions from our deprecated custom test framework by default. // Uncomment the following to use the old assertions: // const Test = require("@codewars/test-compat"); describe("Solution", function() { it("should test for something", function() { // Test.assertEquals(1 + 1, 2); // assert.strictEqual(1 + 1, 2); }); });1 + // Since Node 10, we're using Mocha.
2 + // You can use `chai` for assertions.
3 + const chai = require("chai");4 + const assert = chai.assert;
5 + // Uncomment the following line to disable truncating failure messages for deep equals, do:
6 + // chai.config.truncateThreshold = 0;
7 + // Since Node 12, we no longer include assertions from our deprecated custom test framework by default.
8 + // Uncomment the following to use the old assertions:
9 + // const Test = require("@codewars/test-compat");1 1 11 + describe("Solution", function() {12 + it("should test for something", function() {13 + // Test.assertEquals(1 + 1, 2);
14 + // assert.strictEqual(1 + 1, 2);
15 + });
16 + });
Recent Moves:
I have to learn JQuery, and I thought I might as well do something fun with it to practice. This can be considered an advanced Hello World.
This makes extremely popular Kumite easier to look through without the need of opening new tabs with different roots or whatever it is you're expected to do.
While testing this, I noticed there are a few div.nested-items elements that have nothing inside them. I suspect that this is the result of Kumite being removed in some way.
Things I want to add at soem point:
Elements containing the code of each individual Kumite that can be popped out and viewed like a window.
A tool taking two of these windows and showing the diff between them.
Something useful for comparing different solutions for code golf Kumite.
A simple query system for searching for Kumite of given languages or fitting certain criteria, meant to allow the button for unhiding elements to indicate whether something fitting is being hidden.
Hopefully this part of the site does not completely die by the time I'm satisfied with this.
(function(x){
x.src="https://code.jquery.com/jquery-3.6.0.min.js";
document.querySelector("head").appendChild(x);
})(document.createElement("script"));
$("<button>[ - - ! - - ]</button>")
.insertBefore(".nested-items")
.click(function(){$(this).next().toggle();});