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
Kotov135vs.supercatex

Find the maximum number

Code
Diff
  • def find_max(arr):
    return max(arr)
    • def find_max(arr):
    • return 0
    • return max(arr)
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
  • returnhundred() = parse(Int, string(VERSION)[end]) * 2 * 5 * 3 + 2 * 5
    • function returnhundred() {
    • return 10 ** 2;
    • }
    • returnhundred() = parse(Int, string(VERSION)[end]) * 2 * 5 * 3 + 2 * 5
Marcos Adrianovs.moraga

Template Literals

Code
Diff
  • const bg = 'gray';

const css = `
  <style>
  body {
    background: ${bg};
    color: black;
  }
  </style>`;
    • var bg = 'gray';
    • const bg = 'gray';
    • var css = '' +
    • '<style>' +
    • 'body {' +
    • ' background: '+ bg + ';' +
    • ' color: black;'
    • '}' +
    • '</style>';
    • const css = `
    • <style>
    • body {
    • background: ${bg};
    • color: black;
    • }
    • </style>`;
Marcos Adrianovs.moraga

Parâmetros opcionais em funções

Code
Diff
  • // reescreva em ES6
function main(a, b = 2, c = 3) {    
    return a * b * c;
}
    • // reescreva em ES6
    • function main(a, b, c) {
    • if (typeof b == 'undefined')
    • b = 2;
    • if (typeof c == 'undefined')
    • c = 3
    • function main(a, b = 2, c = 3) {
    • return a * b * c;
    • }
Marcos Adrianovs.moraga

Var, let ou const

Code
Diff
  • // Exercício 1
const titulo = "UOL - O melhor conteúdo";


// Exercício 2
const tags = []

tags.push(...['A', 'B']);


// Exercício 3
let descricao = "Em 1999";

descricao += " em São Paulo";


// Exercício 4
const materia = {titulo: "Barão de Limeira"};

materia.titulo = "Alameda " + materia.titulo;


// Exercício 5
for (let i = 10; i--;) {
  console.log(i);
}


// Exercício 6
for (let tag of ['A', 'B']) {
  console.log(tag);
}


// Exercício 7
for (var j = [].length; j--;) {}

if (j === -1) {
  console.log('Não encontrei');
}


// Exercício 8
let a = 123;

{
  a *= 2;
}

console.log(a);


// Exercício 9
let state = 'active';

function stop() {
  state = 'paused';
}

stop();


// Exercício 10
const TRUE = !0;
    • // Exercício 1
    • var titulo = "UOL - O melhor conteúdo";
    • const titulo = "UOL - O melhor conteúdo";
    • // Exercício 2
    • var tags = []
    • const tags = []
    • tags.push(...['A', 'B']);
    • // Exercício 3
    • var descricao = "Em 1999";
    • let descricao = "Em 1999";
    • descricao += " em São Paulo";
    • // Exercício 4
    • var materia = {titulo: "Barão de Limeira"};
    • const materia = {titulo: "Barão de Limeira"};
    • materia.titulo = "Alameda " + materia.titulo;
    • // Exercício 5
    • for (var i = 10; i--;) {
    • for (let i = 10; i--;) {
    • console.log(i);
    • }
    • // Exercício 6
    • for (var tag of ['A', 'B']) {
    • for (let tag of ['A', 'B']) {
    • console.log(tag);
    • }
    • // Exercício 7
    • for (var j = [].length; j--;) {}
    • if (j === -1) {
    • console.log('Não encontrei');
    • }
    • // Exercício 8
    • var a = 123;
    • let a = 123;
    • {
    • a *= 2;
    • }
    • console.log(a);
    • // Exercício 9
    • var state = 'active';
    • let state = 'active';
    • function stop() {
    • state = 'paused';
    • }
    • stop();
    • // Exercício 10
    • var TRUE = !0;
    • const TRUE = !0;
rdiogovs.moraga

Sobrescrevendo o constructor da classe base

Code
Diff
  • class Component {
  constructor(dom) {
    console.log('Parent class constructor executed!');
    this.dom = dom;
  }
  
  onCreate() {
    return true;
  }
}

class Collection extends Component {

  constructor(body,bool) {
    super(body,bool)
  }

}
    • class Component {
    • constructor(dom) {
    • console.log('Parent class constructor executed!');
    • this.dom = dom;
    • }
    • onCreate() {
    • return true;
    • }
    • }
    • class Collection {
    • //
    • class Collection extends Component {
    • constructor(body,bool) {
    • super(body,bool)
    • }
    • }
rods25vs.moraga

Criando uma Classe

Code
Diff
  • class Component {
  constructor(dom) {
    this.dom = dom
  }
  
  onCreate() {
    return this.dom
  }
}
    • function Component(dom) {
    • this.dom = dom;
    • this.onCreate = function() {
    • return this.dom;
    • class Component {
    • constructor(dom) {
    • this.dom = dom
    • }
    • onCreate() {
    • return this.dom
    • }
    • }
pearcebasmanmvs.an171

Sum of Odds

Code
Diff
  • fn sum_odd(a: i32, b: i32) -> i32 {
    (a..=b).filter(odd).sum()
}

fn odd(n: &i32) -> bool {
    n % 2 == 1
}
    • function sumNechet(a, b) {
    • fn sum_odd(a: i32, b: i32) -> i32 {
    • (a..=b).filter(odd).sum()
    • }
    • function нечетное(число) {
    • fn odd(n: &i32) -> bool {
    • n % 2 == 1
    • }