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.
Fundamentals
Strings
Another one thread using 'deque' method
from collections import deque def reverse_string(string): reversed_str = deque("") [reversed_str.appendleft(letter) for letter in string] return "".join(reversed_str)- from collections import deque
- def reverse_string(string):
return string[::-1]- reversed_str = deque("")
- [reversed_str.appendleft(letter) for letter in string]
- return "".join(reversed_str)
from collections import deque def test(): dequedStr = deque("test") return ''.join([dequedStr.popleft() for x in range(len(dequedStr))])from itertools import compress- from collections import deque
- def test():
string = "letters inside a string"digits = [0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]result = compress(string, digits)return ''.join(list(result))- dequedStr = deque("test")
- return ''.join([dequedStr.popleft() for x in range(len(dequedStr))])
#include <string> #include <numeric> #include <algorithm> #include <string_view> class StringComparer { public: static inline auto verifySum(std::string_view w1, std::string_view w2) -> bool { return sumOfCharacters(w1) == sumOfCharacters(w2); } static inline auto sumOfCharacters(std::string_view word) -> int { return std::accumulate(std::begin(word), std::end(word), 0, [](int sum, const char ch) { return sum + static_cast<int>(ch); }); } };- #include <string>
- #include <numeric>
- #include <algorithm>
- #include <string_view>
- class StringComparer {
- public:
static bool verifySum(const std::string& w1, const std::string& w2) {int sumW1 = sumOfCharacters(w1);int sumW2 = sumOfCharacters(w2);return sumW1 == sumW2;- static inline auto verifySum(std::string_view w1, std::string_view w2) -> bool {
- return sumOfCharacters(w1) == sumOfCharacters(w2);
- }
static int sumOfCharacters(const std::string& word) {return std::accumulate(word.begin(), word.end(), 0, [](int sum, char ch) {- static inline auto sumOfCharacters(std::string_view word) -> int {
- return std::accumulate(std::begin(word), std::end(word), 0, [](int sum, const char ch) {
- return sum + static_cast<int>(ch);
- });
- }
- };
Condensed into a single line
def foo(n): if n == 0: while True: yield 0 else: for v in foo(n-1): yield v+1USING: kernel math generators combinators.extras ;IN: exampleGEN: foo ( n -- gen )[ [ 0 yield ] forever ][ 1 - foo [ [ next 1 + yield ] keep ] forever drop ] if-zero ;- def foo(n):
- if n == 0:
- while True:
- yield 0
- else:
- for v in foo(n-1):
- yield v+1
import codewars_test as test from itertools import islice from solution import foo take = lambda gen, n: list(islice(gen, n)) depth = 100 vals = 300 @test.describe("Example") def _(): @test.it("test case") def _(): test.assert_equals(take(foo(depth), vals), [depth]*vals)USING: example tools.testest generators arrays ;IN: example.tests- import codewars_test as test
- from itertools import islice
- from solution import foo
CONSTANT: depth 100CONSTANT: vals 300- take = lambda gen, n: list(islice(gen, n))
: run-tests ( -- )"Example" describe#{"test case" it#{<{ depth foo vals take -> vals depth <array> }>}#}#;- depth = 100
- vals = 300
MAIN: run-tests- @test.describe("Example")
- def _():
- @test.it("test case")
- def _():
- test.assert_equals(take(foo(depth), vals), [depth]*vals)