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
seraph776vs.lorezvn

Equality

Code
Diff
  • def is_equal(a, b):
    return 'no' if a != b else 'yes'
    • def is_equal(a, b):
    • return 'yes' if a == b else 'no'
    • return 'no' if a != b else 'yes'
Nerrokvs.seraph776

Hello Kotlin

Fundamentals
Code
Diff
  • def hello_message():
    return 'Hello World!'
    • def hello_message():
    • msg = 'Hello World!'
    • return msg
    • return 'Hello World!'
seraph776vs.Nerrok

Calculate factorial

Code
Diff
  • from math import factorial as code

def factorial(wars):
    return code(wars)
    • import math
    • def factorial(n):
    • return math.factorial(n)
    • from math import factorial as code
    • def factorial(wars):
    • return code(wars)
eurydice5717vs.user6285697

Parentheses Balancing

Code
Diff
  • bool isBalanced(const std::string& s) {
  int count = 0;
  for (const auto c: s) {
    if (count+= c=='(' ? +1: c==')'?-1:0; count <0)
      return false;
  }
  return count == 0;
}
    • bool isBalanced(const std::string& s) {
    • int count = 0;
    • for (size_t i = 0; i < s.length(); i++) {
    • if (s[i] == '(') {
    • count++;
    • }
    • if (s[i] == ')') {
    • if (count <= 0) { return false; }
    • count--;
    • }
    • for (const auto c: s) {
    • if (count+= c=='(' ? +1: c==')'?-1:0; count <0)
    • return false;
    • }
    • return count == 0;
    • }
th0m45y3vs.KamaleshPathy

Numbers Divided by 2

made it shorter

Code
Diff
  • unsigned long long div2(unsigned long long a){
  unsigned long long ans{};
  while (ans + ans + 1 < a) ans++;
  return ans;
}
    • unsigned long long div2(unsigned long long a){
    • unsigned long long ans = 0, i;
    • for (i = 1; i <= a; i++) {
    • if (i % 2){
    • continue;
    • } else {
    • ans++;
    • }
    • }
    • unsigned long long ans{};
    • while (ans + ans + 1 < a) ans++;
    • return ans;
    • }
seraph776vs.Monkey_Rain

Counting Up and Down

Fundamentals
Code
Diff
  • def number_print(n):
    x = [str(i) for i in range(1, n + 1)]
    y = x.copy()[len(x) - 2::-1]
    return 1 if n == 1 else int(''.join(x + y))
    • def numberprint(x):
    • final = ''
    • for i in range(1,x+1):
    • final += str(i)
    • for i in range(x-1,0,-1):
    • final += str(i)
    • return int(final)
    • def number_print(n):
    • x = [str(i) for i in range(1, n + 1)]
    • y = x.copy()[len(x) - 2::-1]
    • return 1 if n == 1 else int(''.join(x + y))