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
evanrhvs.mosleymos

Find if atleast 2 out of 3 booleans are ture.

-6 bytes

  1. Removed spaces around comparison
  2. Used len() instead of count
Code
Diff
  • def solution(l):return 2<=len(([1 for p in l if p is True]))
    • def solution(l):return 2 <= ([1 for p in l if p is True]).count(1)
    • def solution(l):return 2<=len(([1 for p in l if p is True]))
Polymorbismvs.crypto-cmd

tiagofaraujo's Kumite #5

-14 bytes, we could've just been using ternary all along!

Code
Diff
  • describeAge=a=>"You're a(n) "+(a<13?"kid":a<18?"teenager":a<65?"adult":"elderly")
    • describeAge=a=>`You're a(n) ${["kid","teenager","adult","elderly"][(a>=13)+(a>=18)+(a>=65)]}`;
    • describeAge=a=>"You're a(n) "+(a<13?"kid":a<18?"teenager":a<65?"adult":"elderly")
crypto-cmdvs.RMChannel

Ordinal Numbers

Fundamentals
Code
Diff
  • class OrdinalNumbers:
    def __init__(self, n):
        self.n = n
        
    def solution(self):
        t = int(str(self.n)[-1])-1
        return str(self.n)+ ("th" if ((self.n>10) and (self.n<20)) else (["st", "nd", "rd"][t:t+1] or ["th"])[0])
    • class OrdinalNumbers:
    • def __init__(self, n):
    • self.n = n
    • def solution(self):
    • if (self.n>10) and (self.n<20): return (str(self.n)+"th")
    • elif (str(self.n)[-1]=="1"): return (str(self.n)+"st")
    • elif (str(self.n)[-1]=="2"): return (str(self.n)+"nd")
    • elif (str(self.n)[-1]=="3"): return (str(self.n)+"rd")
    • else: return (str(self.n)+"th")
    • t = int(str(self.n)[-1])-1
    • return str(self.n)+ ("th" if ((self.n>10) and (self.n<20)) else (["st", "nd", "rd"][t:t+1] or ["th"])[0])
crypto-cmdvs.mouthbreather

Find the missing number in a sorted sequence of natural numbers.

Code
Diff
  • from typing import Sequence, Optional

def missing_integer(sequence: Sequence[int]) -> Optional[int]:
    return next((i + sequence[0] for i, num in enumerate(sequence) if num != i + sequence[0]), None)
    • from typing import Sequence, Optional
    • def missing_integer(sequence: Sequence[int]) -> Optional[int]:
    • for i in range(len(sequence)):
    • if sequence[i] != i + sequence[0]:
    • return i + sequence[0]
    • return next((i + sequence[0] for i, num in enumerate(sequence) if num != i + sequence[0]), None)