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
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
  • const returnhundred = () => +[[+!+[]]+[+[]]+[+[]]];
    • function returnhundred() {
    • return 10 ** 2;
    • }
    • const returnhundred = () => +[[+!+[]]+[+[]]+[+[]]];
Marcos Adrianovs.moraga

Herdando classes e sobrescrevendo métodos

Code
Diff
  • class Component {
  constructor(dom) {
      this.dom = dom;
  }
  
  onCreate() {
    console.log('onCreate from parent class');
    return 'missing';
  }
  
  static on(event, callback) {
    callback();
  }
  
  async emit(event, data) {}
}

class Title extends Component {
  onCreate() {
    super.onCreate();
    return 'super!';
  }
}
    • class Component {
    • constructor(dom) {
    • this.dom = dom;
    • }
    • onCreate() {
    • console.log('onCreate from parent class');
    • return 'missing';
    • }
    • static on(event, callback) {
    • callback();
    • }
    • async emit(event, data) {}
    • }
    • class Title extends Component {
    • onCreate() {
    • super.onCreate();
    • return 'super!';
    • }
    • }
Marcos Adrianovs.moraga

Deep matching e default values

Code
Diff
  • const results = [
  {materia: {conteudo: {titulo: 'São Paulo'}}, tags: [1, 2, 3]},
  {materia: {conteudo: {}}, tags: [3, 2]},
  {materia: {conteudo: {titulo: 'Rio de Janeiro'}}, tags: [3, 2]},
];

for (const {materia: {conteudo: {titulo = 'Brasil'}}} of results) console.log(titulo);
    • let results = [
    • const results = [
    • {materia: {conteudo: {titulo: 'São Paulo'}}, tags: [1, 2, 3]},
    • {materia: {conteudo: {}}, tags: [3, 2]},
    • {materia: {conteudo: {titulo: 'Rio de Janeiro'}}, tags: [3, 2]},
    • ];
    • for (const result of results) {
    • let titulo = result.materia.conteudo.titulo || 'Brasil';
    • console.log(titulo);
    • }
    • for (const {materia: {conteudo: {titulo = 'Brasil'}}} of results) console.log(titulo);
victorteixeiravs.moraga

Method shorthand e computed property names

Code
Diff
  • // reescreva usando ES6

var prop = 'myProp';

var obj = {
  [prop]: 123,
  myFunc() {
    return this[prop];
  } 
};

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

Template Literals

Code
Diff
  • var bg = 'gray'

var css = `
  <style>
  body { 
    background: ${bg};
    color: black;
  } 
  </style>`
    • var bg = 'gray';
    • var bg = 'gray'
    • var css = '' +
    • '<style>' +
    • 'body {' +
    • ' background: '+ bg + ';' +
    • ' color: black;'
    • '}' +
    • '</style>';
    • var css = `
    • <style>
    • body {
    • background: ${bg};
    • color: black;
    • }
    • </style>`
rods25vs.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;
daryna.plrsvs.an171

Sum of odd numbers in a rang

Code
Diff
  • function sumNechet(a, b) {
  let sum = 0;
  for (let i = a; i <= b; i++) {
    if (i % 2 !== 0) sum += i;
  }
  return sum;
}
    • function sumNechet(a, b) {
    • let sum = 0;
    • for (let i = a; i <= b; i++) {
    • if (i % 2 !== 0) sum += i;
    • }
    • return sum;
    • }
    • function нечетное(число) {
    • }
nachorojo2015vs.qcarlin

Add numbers of an array

Esta solucion es clave, tenela en cuenta pa.

Code
Diff
  • function addArr(arr){
  return arr.reduce((num,acc)=>num+acc,0) || null
}
    • function addArr(arr){
    • if(arr.length === 0) return null
    • let final = 0
    • arr.forEach(num => {
    • final += num
    • })
    • return final
    • return arr.reduce((num,acc)=>num+acc,0) || null
    • }