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
Ubaluvs.user8654865

Number of digits

Algorithms

Using base-10 logarithm

Code
Diff
  • #include <math.h>
typedef signed long long i64;

int num_of_digits(i64 n){
  i64 k = n < 0 ? -n : n;
  return log10(k) + 1;
}
    • fn digits(mut n: u64) -> usize {
    • let mut l = 1;
    • while n >= 10 {
    • n /= 10;
    • l += 1;
    • }
    • l
    • }
    • #include <math.h>
    • typedef signed long long i64;
    • int num_of_digits(i64 n){
    • i64 k = n < 0 ? -n : n;
    • return log10(k) + 1;
    • }
virgile-aevs.ashsun

Are there three

Code
Diff
  • fn solution(mut x: i32) -> bool {
    x.to_string().contains('3')
}
    • fn solution(mut x: i32) -> bool {
    • match x.to_string().chars().into_iter().position(|s| s == '3') {
    • Some(_t) => true,
    • _e => false,
    • }
    • x.to_string().contains('3')
    • }
OysterShuckervs.zahash

meaning of life

My answer suggests that the meaning of life regards spending your life with a loved one.

Code
Diff
  • from statistics import mean

LIVES   = 1
SPAN    = 72
MONTHS  = 12
DAYS    = 7
COMPANY = 2 #3's a crowd

def meaning_of_life_is(ing=range(LIVES,SPAN//MONTHS*DAYS*COMPANY)):
    return '{}'.format(mean(ing), 'of', 'life')
    • def meaning_of_life_is():
    • return """
    • go crazy with your imagination and return anything you like.
    • strings, numbers, ... just don't return None.
    • may the most creative answer win
    • """
    • from statistics import mean
    • LIVES = 1
    • SPAN = 72
    • MONTHS = 12
    • DAYS = 7
    • COMPANY = 2 #3's a crowd
    • def meaning_of_life_is(ing=range(LIVES,SPAN//MONTHS*DAYS*COMPANY)):
    • return '{}'.format(mean(ing), 'of', 'life')
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
SmithGeorgevs.supercatex

Find the maximum number

Code
Diff
  • def find_max(arr):
    return sorted(arr)[-1]
    • def find_max(arr):
    • return 0
    • return sorted(arr)[-1]
MattZ306vs.ReturnMaster

Return 100

Code
Diff
  • const returnhundred = _ => [_=+!_+[+!!_]]*_
    • function returnhundred() {
    • return 10 ** 2;
    • }
    • const returnhundred = _ => [_=+!_+[+!!_]]*_
James Roitbergvs.moragaFailed Tests

Criando e executando uma Promise com async/await

Code
Diff
  • async function a() {
  return 'ok'
}

async function b() {
  try{
    const resolve = await a();
    console.log(resolve);
  }catch(reject){
    console.log(err);
  }
}
    • function a() {
    • return new Promise(function (resolve, reject) {
    • resolve('ok');
    • });
    • async function a() {
    • return 'ok'
    • }
    • function b() {
    • a().then(function(res) {
    • console.log(res);
    • }).catch(function(err) {
    • async function b() {
    • try{
    • const resolve = await a();
    • console.log(resolve);
    • }catch(reject){
    • console.log(err);
    • })
    • }
    • }
victorteixeiravs.moraga

Concatenar listas

Code
Diff
  • const main = () => {

  let a = [1, 2, 3];
  
  let b = [4, 5, 6];
  
  let c = [7, 8, 9];

  // converter para ES6
  var d =  [...a, ...b, ...c];
  
  return d.join(',');
}
    • const main = () => {
    • let a = [1, 2, 3];
    • let b = [4, 5, 6];
    • let c = [7, 8, 9];
    • // converter para ES6
    • var d = a.concat(b).concat(c);
    • var d = [...a, ...b, ...c];
    • return d.join(',');
    • }
esamaralvs.moraga

Method shorthand e computed property names

Code
Diff
  • // reescreva usando ES6

var prop = 'myProp';

var obj = {
  [prop]: 123,
  myFunc() {
    return this[prop];
  } 
};
    • // reescreva usando ES6
    • var prop = 'myProp';
    • var obj = {
    • myFunc: function() {
    • [prop]: 123,
    • myFunc() {
    • return this[prop];
    • }
    • };
    • obj[prop] = 123;
rdiogovs.moragaFailed Tests

Property Shorthand

Code
Diff
  • var title = 'UOL - O melhor conteúdo';

var share = {
  fb: {
    title: {title}
  },
  twitter: {
    tweet: {title}
  }
};
    • var title = 'UOL - O melhor conteúdo';
    • var share = {
    • fb: {
    • title: title
    • title: {title}
    • },
    • twitter: {
    • tweet: title
    • tweet: {title}
    • }
    • };