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

Basic Select 2 (BIE)

Code
Diff
  • -- Code Here
SELECT name, age FROM customers
    • --- Code Here
    • -- Code Here
    • SELECT name, age FROM customers
AndhikaPJvs.rishadharis

Basic Select (BIE)

Test Basic SQL

Code
Diff
  • -- Code here
SELECT * FROM customers
    • -- Code here
    • SELECT * FROM customers
lnscendvs.qcarlin

Add numbers of an array

Code
Diff
  • const addArr = arr => arr.reduce((a, b) => a + b, 0) || null;
    • function addArr(arr){
    • if(arr.length === 0) return null
    • let final = 0
    • arr.forEach(num => {
    • final += num
    • })
    • return final
    • }
    • const addArr = arr => arr.reduce((a, b) => a + b, 0) || null;
poacosta87vs.TheFimerCode

Return 100

Code
Diff
  • def return_hundred(n = 2):
    return (n*n*n+n)**n
    • def return_hundred():
    • return 10000000000000000000000000000000 - 9999999999999999999999999999900
    • def return_hundred(n = 2):
    • return (n*n*n+n)**n
kalmiavs.who??

Why you don't complete this kumite

Code
Diff
  • def why():
    lst = ['w', 'h', 'y']
    return ' - '.join(lst)
    • def why():
    • return 'w - h - y'
    • lst = ['w', 'h', 'y']
    • return ' - '.join(lst)
Mi_Shavs.aw3r1se

Calculate the nth Fibonacci number

Recursion
Mathematics
Code
Diff
  • const fibonacci = n => n <= 1 ? n : fibonacci(n - 1) + fibonacci(n - 2);
    • function fibonacci(n) {
    • if (n <= 1) return n;
    • return fibonacci(n - 1) + fibonacci(n - 2);
    • }
    • const fibonacci = n => n <= 1 ? n : fibonacci(n - 1) + fibonacci(n - 2);
TadaHrdvs.cjpearce

Number of digits

Algorithms
Code
Diff
  • fn digits(n: u64) -> usize {
    n.to_string().len()
}
    • fn digits(mut n: u64) -> usize {
    • std::iter::from_fn(|| { n = n / 10; Some(n) }).
    • take_while(|n| *n > 0)
    • .count() + 1
    • fn digits(n: u64) -> usize {
    • n.to_string().len()
    • }
cringengineer-rssvs.Luuk Saint

Return Only Number or Zero.

Code
Diff
  • const returnInputNumber = (n) => Number.isInteger(n) ? n : 0;
    • const returnInputNumber = (n = 0) => {
    • return typeof n === "number" ? n : 0;
    • };
    • const returnInputNumber = (n) => Number.isInteger(n) ? n : 0;