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
ahmdxrzkyvs.rishadharis

Basic Select (BIE)

Code
Diff
  • -- Code here
SELECT * FROM customers;
    • -- Code here
    • SELECT * FROM customers;
WestwardLand968vs.ReturnMaster

Return 100

Closest I can get using the special numbers (pi, e, and golden ratio); about 0.15 off.

Code
Diff
  • import math

def hundred():
    golden = ((1 + 5 ** 0.5)/2)
    return round((math.pi * math.e) ** golden * math.sqrt(math.pi * math.e) + math.pi * golden + golden / math.e + golden / (math.pi ** golden))
    • function returnhundred() {
    • return 10 ** 2;
    • }
    • import math
    • def hundred():
    • golden = ((1 + 5 ** 0.5)/2)
    • return round((math.pi * math.e) ** golden * math.sqrt(math.pi * math.e) + math.pi * golden + golden / math.e + golden / (math.pi ** golden))
mirandathiagovs.moraga

Criando uma Classe

Code
Diff
  • class Component{

  constructor(dom){
    this.dom = dom;
  }
  
  onCreate() {
    return this.dom;
  }
}
    • function Component(dom) {
    • this.dom = dom;
    • class Component{
    • this.onCreate = function() {
    • constructor(dom){
    • this.dom = dom;
    • }
    • onCreate() {
    • return this.dom;
    • }
    • }
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().
Goga-exevs.coolcoder7892

Multiply and Add One

Code
Diff
  • def multiply_and_add_one(a, b): 
    return a * b + 1
    • def multiply_and_add_one(a, b):
    • r = a * b
    • return r + 1
    • def multiply_and_add_one(a, b):
    • return a * b + 1
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;
    • };