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
Code
Diff
  • def should_return_1():
        ad = lambda a,b: a and b
        demux = lambda i,s: (i and not s,i and s)
        nand = lambda a,b: not(a and b)
        nor = lambda a,b: not(a or b)
        return 10000000000000000000000000000 / 10000000000000000000000000000
    #33333333333333
    • def should_return_1():
    • ad = lambda a,b: a and b
    • demux = lambda i,s: (i and not s,i and s)
    • nand = lambda a,b: not(a and b)
    • nor = lambda a,b: not(a or b)
    • return 10000000000000000000000000000 / 10000000000000000000000000000
    • #33333333333333
Code
Diff
  • def why():
        return ''.join([chr(int(i, 16)) for i in ['0x77', '0x20', '0x2d', '0x20', '0x68', '0x20', '0x2d', '0x20', '0x79']])
    
    • def why():
    • return f"w - h - y"
    • #eeeepppppppppppppppppppppp
    • return ''.join([chr(int(i, 16)) for i in ['0x77', '0x20', '0x2d', '0x20', '0x68', '0x20', '0x2d', '0x20', '0x79']])
Code
Diff
  • remainder = lambda x,y: x % y if x and y else -1
    • def remainder(x, y):
    • if x == 0 or y == 0:
    • return -1
    • rem = x % y
    • return rem
    • remainder = lambda x,y: x % y if x and y else -1

Here !

Code
Diff
  • module HelloWorld exposing (hello)
    -- thx for adding an Elm Kumit !
    hello : String
    hello =
      String.foldl String.cons "" "!mlE ,olleH"
    • module HelloWorld exposing (hello)
    • -- thx for adding an Elm Kumit !
    • hello : String
    • hello = "Hello, Elm!"
    • hello =
    • String.foldl String.cons "" "!mlE ,olleH"
Code
Diff
  • export const maxNumber = (arr: number[]): number => Math.max(...arr);
    • export function maxNumber(arr: number[]): number {
    • let max = 0;
    • for (let item of arr) {
    • if (item > max) { max = item; }
    • }
    • return max;
    • }
    • export const maxNumber = (arr: number[]): number => Math.max(...arr);
Code
Diff
  • -- Code Here
    SELECT
      d.city_name kota,
      SUM(c.confirmed_cases) confirmed_cases,
      SUM(c.recovered_cases) recovered_cases,
      SUM(c.death_cases) death_cases
    FROM cases c, dati d
    WHERE c.dati_code = d.code
    GROUP BY d.city_name
    ORDER BY confirmed_cases DESC;
    • --- Code Here
    • -- Code Here
    • SELECT
    • d.city_name kota,
    • SUM(c.confirmed_cases) confirmed_cases,
    • SUM(c.recovered_cases) recovered_cases,
    • SUM(c.death_cases) death_cases
    • FROM cases c, dati d
    • WHERE c.dati_code = d.code
    • GROUP BY d.city_name
    • ORDER BY confirmed_cases DESC;