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
adamveld12

Recursive Factorial

Recursion
Algorithms
Computability Theory
Logic
Theoretical Computer Science

A recursive factorial function.

Factorial = fun (Y, 0) ->  1;
      (Y, N) -> N * Y(Y, N - 1)
  end,

io:format("~p~n", [Factorial(Factorial, 5)]),

init:stop().
AmirHesamivs.poacosta87

Add numbers of an array

Code
Diff
  • const addArr = (arr) => {
  let sum = arr.reduce((accumulator, currentValue) => accumulator + currentValue, 0);
  return sum || null;
};
    • const addArr = (arr) => {
    • let sum = 0;
    • for (let i = 0; i < arr.length; i++) {
    • sum += arr[i];
    • }
    • let sum = arr.reduce((accumulator, currentValue) => accumulator + currentValue, 0);
    • return sum || null;
    • };
rishadharisvs.rishadharis

Basic Select (BIE)

Code
Diff
  • -- Code here
select * from customers
    • -- Code here
    • select * from customers
shunz19vs.ReturnMaster

Return 100

Truuuuuuuuuu

Code
Diff
  • function returnhundred() {
return ((true+true+true)+0+(true+true+true)+1+(true)+11+(true)+1+(true)+11+(true)+1+(true)+11+(true)+0+
        (true+true+true)+0+(true+true+true)+1+(true)+11+(true)+1+(true)+11+(true)+1+(true)+11+(true)+0+
        0*11+(true)+0*11+0+(true)+0*1111111+1+(true)+11+(true)+1+(true)+11+(true)+1+(true)+11+(true)+0+
        0*11+(true)+0*11+0+(true)+0*1111111+1+(true)+11+(true)+1+(true)+11+(true)+1+(true)+11+(true)+0+
        0*11+(true)+0*11+0+(true)+0*1111111+1+(true)+11+(true)+1+(true)+11+(true)+1+(true)+11+(true)+0+
        0*11+(true)+0*11+0+(true)+0*1111111+1+(true+true+true)+1+(true+true+true)+1+(true+true+true)+0+
        0*11+(true)+0*11+0+(true)+0*1111111+1+(true+true+true)+1+(true+true+true)+1+(true+true+true)+0)*100/256
}
    • function returnhundred() {
    • return 10 ** 2;
    • return ((true+true+true)+0+(true+true+true)+1+(true)+11+(true)+1+(true)+11+(true)+1+(true)+11+(true)+0+
    • (true+true+true)+0+(true+true+true)+1+(true)+11+(true)+1+(true)+11+(true)+1+(true)+11+(true)+0+
    • 0*11+(true)+0*11+0+(true)+0*1111111+1+(true)+11+(true)+1+(true)+11+(true)+1+(true)+11+(true)+0+
    • 0*11+(true)+0*11+0+(true)+0*1111111+1+(true)+11+(true)+1+(true)+11+(true)+1+(true)+11+(true)+0+
    • 0*11+(true)+0*11+0+(true)+0*1111111+1+(true)+11+(true)+1+(true)+11+(true)+1+(true)+11+(true)+0+
    • 0*11+(true)+0*11+0+(true)+0*1111111+1+(true+true+true)+1+(true+true+true)+1+(true+true+true)+0+
    • 0*11+(true)+0*11+0+(true)+0*1111111+1+(true+true+true)+1+(true+true+true)+1+(true+true+true)+0)*100/256
    • }
adamveld12

Hello World!

io:format("Hello World!~n"),

init:stop().
xcthulhu

xcthulhu's Kumite #20

class Solution {
    public static void main(String[] args) {
        System.out.println("Hello darkness, my old friend...");
    }
}