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
nachorojo2015vs.qcarlin

Add numbers of an array

Esta solucion es clave, tenela en cuenta pa.

Code
Diff
  • function addArr(arr){
  return arr.reduce((num,acc)=>num+acc,0) || null
}
    • function addArr(arr){
    • if(arr.length === 0) return null
    • let final = 0
    • arr.forEach(num => {
    • final += num
    • })
    • return final
    • return arr.reduce((num,acc)=>num+acc,0) || null
    • }
Gloria Bara vs.rishadharis

Basic Filtering 7 Is (BIE)

Code
Diff
  • -- Code Here
select*from transactions
where customer is NULL;
    • --- Code Here
    • -- Code Here
    • select*from transactions
    • where customer is NULL;
pristiandewiabbyvs.rishadharis

Basic Filtering 5 Not In (BIE)

Code
Diff
  • select * from transactions where store not in ('BIE Store Jakarta', 'BIE Store Bandung');
    • -- Code Here
    • select * from transactions where store not in ('BIE Store Jakarta', 'BIE Store Bandung');
Gloria Bara vs.rishadharis

Basic Select with Alias (BIE)

Code
Diff
  • -- Code Here
SELECT name AS nama, age AS umur FROM customers;
    • --- Code Here
    • -- Code Here
    • SELECT name AS nama, age AS umur FROM customers;
rapikarosaliavs.rishadharisFailed Tests

Basic Filtering 3 (BIE)

Code
Diff
  • SELECT store,total_price FROM transactions
WHERE date >='2022-01-01' AND date <='2022-01-03'
    • -- Code Here
    • SELECT store,total_price FROM transactions
    • WHERE date >='2022-01-01' AND date <='2022-01-03'
abubakar13vs.rishadharis

Basic Select (BIE)

Code
Diff
  • -- Code here
SELECT * FROM customers
    • -- Code here
    • SELECT * FROM customers
jdx228vs.supercatex

Find the maximum number

Hahahaha

Code
Diff
  • find_max=lambda a:5
    • def find_max(arr):
    • return 0
    • find_max=lambda a:5
user1389114vs.nitinaggarwal1986

Prime Checker [Optimized]

Mathematics
Algorithms
Logic
Numbers
Code
Diff
  • def prime_checker(n):
    if n in [2, 3, 5]:
        return True
    elif n % 2 == 0 or n % 3 == 0 or n % 5 == 0:
        return False
    
    a = int(n ** 0.5 / 30)
    b = [7, 11, 13, 17, 19, 23, 29, 31]
    
    for i in [30 * j for j in range(a + 1)]:
        if True in [n % (i + q) == 0 for q in b if i + q is not n]:
            return False
    return True
    • """
    • https://en.wikipedia.org/wiki/Primality_test
    • This one has lesser tests or usage of % operator.
    • An alternative using primality mod 30 = 2 * 3 * 5 instead of 6 = 2 * 3
    • """
    • def prime_checker(n):
    • if n in [2, 3, 5]:
    • return True
    • elif n % 2 == 0 or n % 3 == 0 or n % 5 == 0:
    • return False
    • a = int(n ** 0.5 / 30)
    • b = [7, 11, 13, 17, 19, 23, 29, 31]
    • for i in [30 * j for j in range(a + 1)]:
    • if True in [n % (i + q) == 0 for q in b if i + q is not n]:
    • return False
    • return True
user8436785vs.ReturnMaster

Return 100

Code
Diff
  • const returnhundred = () => process.version.slice(1).split('.')[0] ** 2;
// WARNING: Only works in Node 10. Node 8 will give 80 and Node 6 will give 60
    • function returnhundred() {
    • return 10 ** 2;
    • }
    • const returnhundred = () => process.version.slice(1).split('.')[0] ** 2;
    • // WARNING: Only works in Node 10. Node 8 will give 80 and Node 6 will give 60