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
  • import itertools
    
    def return_hundred():
        return p(p(0)+p(0))*p(p(p(0)) - p(0)) + p(p(0))*(p(p(0)) - p(0)) + p(0)**(p(p(0)) - p(0))
    
    def p(n):
        """n'th prime"""
        pr = primes()
        for _ in range(n): next(pr) # consume n-1 values
        return next(pr)
    
    def primes():
        seen = set()
        for n in itertools.count(start=2):
            if not any((n % p ==0)for p in seen ):
                yield n
                seen.add(n)
                
    • def return_hundred():
    • return globals()[__import__('inspect').stack()[0][3][6]]
    • import itertools
    • def return_hundred():
    • return p(p(0)+p(0))*p(p(p(0)) - p(0)) + p(p(0))*(p(p(0)) - p(0)) + p(0)**(p(p(0)) - p(0))
    • _= 100
    • def p(n):
    • """n'th prime"""
    • pr = primes()
    • for _ in range(n): next(pr) # consume n-1 values
    • return next(pr)
    • def primes():
    • seen = set()
    • for n in itertools.count(start=2):
    • if not any((n % p ==0)for p in seen ):
    • yield n
    • seen.add(n)
Numbers
Data Types
Fundamentals

7 more than list comp

Code
Diff
  • perfect=lambda a:list(filter(lambda x:x**.5%1==0,a))
    • import math
    • def check(x):
    • return math.sqrt(x) % 1 == 0
    • def perfect(l): return list(filter(check,l))
    • perfect=lambda a:list(filter(lambda x:x**.5%1==0,a))