Start a new Kumite
AllAgda (Beta)BF (Beta)CCFML (Beta)ClojureCOBOL (Beta)CoffeeScriptCommonLisp (Beta)CoqC++CrystalC#D (Beta)DartElixirElm (Beta)Erlang (Beta)Factor (Beta)Forth (Beta)Fortran (Beta)F#GoGroovyHaskellHaxe (Beta)Idris (Beta)JavaJavaScriptJulia (Beta)Kotlinλ Calculus (Beta)LeanLuaNASMNim (Beta)Objective-C (Beta)OCaml (Beta)Pascal (Beta)Perl (Beta)PHPPowerShell (Beta)Prolog (Beta)PureScript (Beta)PythonR (Beta)RacketRaku (Beta)Reason (Beta)RISC-V (Beta)RubyRustScalaShellSolidity (Beta)SQLSwiftTypeScriptVB (Beta)
Show only mine

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.

Ad
Ad
Fundamentals
Strings
Code
Diff
  • from collections import deque
    
    def reverse_string(string):
        dequed_str = deque(string)
        return ''.join([dequed_str.pop() for _ in range(len(dequed_str))])
    • from collections import deque
    • def reverse_string(string):
    • return string[::-1]
    • dequed_str = deque(string)
    • return ''.join([dequed_str.pop() for _ in range(len(dequed_str))])
Code
Diff
  • from itertools import compress
    
    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))
    
    • from itertools import compress
    • def test():
    • return "".join(map(lambda i: {'1': 't', '2': 'e', '3': 's', '4': 't'}[str(i)], range(1, 5)))
    • 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))

Condensed into a single line

Code
Diff
  • namespace Solution
    {
        public class MyCalculator
        {
            public int Add(int a, int b) => a + b;
        }
    }
    • namespace Solution
    • {
    • public class MyCalculator
    • {
    • public int Add(int a, int b)
    • {
    • return a + b;
    • }
    • public int Add(int a, int b) => a + b;
    • }
    • }
Code
Diff
  • def foo(n):
        if n == 0:
            while True:
                yield 0
        else:
            for v in foo(n-1):
                yield v+1
    • USING: kernel math generators combinators.extras ;
    • IN: example
    • GEN: 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
Code
Diff
  • from functools import reduce
    
    def est_height(gender, dad_height, mom_height):
        return reduce(lambda x, y: x + y, [dad_height, mom_height]) / 2 + ((-1) ** ("girl" == gender)) * 0.5
        
    • from functools import reduce
    • def est_height(gender, dad_height, mom_height):
    • match gender:
    • case "boy":
    • return reduce(lambda x, y: x + y, [dad_height, mom_height]) / 2 + 0.5
    • case "girl":
    • return reduce(lambda x, y: x + y, [dad_height, mom_height]) / 2 - 0.5
    • return reduce(lambda x, y: x + y, [dad_height, mom_height]) / 2 + ((-1) ** ("girl" == gender)) * 0.5