Kumite

Start a new Kumite

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.

pawptartvs.Blzs20053 months ago
Multiply and Add One
CodeDiffdef multiply_and_add_one(a, b):
    r = 0
    
    while b != 0:
        r += a if b & 1 else 0
        
        a <<= 1
        b >>= 1
        
    return r + 1

  multiply_and_add_one = lambda a, b: a * b + 1
def multiply_and_add_one(a, b):
    r = 0
    
    while b != 0:
        r += a if b & 1 else 0
        
        a <<= 1
        b >>= 1
        
    return r + 1

Fork
Discuss (0)
Fixture

kledsonzgvs.solwtraub

3 months ago

Check same case

Se a ou b não é uma letra, retorna -1, caso contrário, retorna 1 se estes dois argumentos estivem na mesma "caixa" ("caixa alta" ou "caixa baixa").

Code

Diff

public class Kata
{
    public static int SameCase(char a, char b)
    {
        return !char.IsLetter(a) || !char.IsLetter(b) ? -1 : char.IsUpper(a) == char.IsUpper(b) ? 1 : 0;
    }
}

- public class Kata
- {
- public static int SameCase(char a, char b)
- {
- ~~return (char.IsUpper(a) && char.IsUpper(b)) || (char.IsLower(a) && char.IsLower(b)) ? 1 : 0;~~
- return !char.IsLetter(a) || !char.IsLetter(b) ? -1 : char.IsUpper(a) == char.IsUpper(b) ? 1 : 0;
- }
- }

Test CasesDiffusing NUnit.Framework;
using System;

namespace Solution
{
    [TestFixture]
    public class SolutionTest
    {
        [Test]
        public void TrueTests()
        {
            Assert.That(Kata.SameCase('a', 'u'), Is.EqualTo(1));
            Assert.That(Kata.SameCase('A', 'U'), Is.EqualTo(1));
            Assert.That(Kata.SameCase('Q', 'P'), Is.EqualTo(1));
            Assert.That(Kata.SameCase('w', 'y'), Is.EqualTo(1));
            Assert.That(Kata.SameCase('c', 'm'), Is.EqualTo(1));
            Assert.That(Kata.SameCase('N', 'W'), Is.EqualTo(1));
        }

        [Test]
        public void FalseTests()
        {
            Assert.That(Kata.SameCase('a', 'U'), Is.EqualTo(0));
            Assert.That(Kata.SameCase('A', 'u'), Is.EqualTo(0));
            Assert.That(Kata.SameCase('Q', 'p'), Is.EqualTo(0));
            Assert.That(Kata.SameCase('w', 'Y'), Is.EqualTo(0));
            Assert.That(Kata.SameCase('c', 'M'), Is.EqualTo(0));
            Assert.That(Kata.SameCase('N', 'w'), Is.EqualTo(0));
        }

        [Test]
        public void NotLetters()
        {
            Assert.That(Kata.SameCase('a', '*'), Is.EqualTo(-1));
            Assert.That(Kata.SameCase('A', '%'), Is.EqualTo(-1));
            Assert.That(Kata.SameCase('Q', '1'), Is.EqualTo(-1));
            Assert.That(Kata.SameCase('w', '-'), Is.EqualTo(-1));
            Assert.That(Kata.SameCase('c', '8'), Is.EqualTo(-1));
            Assert.That(Kata.SameCase('N', ':'), Is.EqualTo(-1));
        }

        [Test]
        public void RandomTest()
        {
            string chars = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmopqrstuvwxyz1234567890~/*-+:.,><.#@!&";
            Random rand = new Random();

            for (int i = 0; i < 200; i++)
            {
                char char1 = chars[rand.Next(chars.Length)];
                char char2 = chars[rand.Next(chars.Length)];
                Assert.That(Kata.SameCase(char1, char2), Is.EqualTo(SameCaseSolution(char1, char2)));
            }
        }

        private static int SameCaseSolution(char a, char b)
        {
            if (!char.IsLetter(a) || !char.IsLetter(b)) return -1;
            return (char.IsUpper(a) == char.IsUpper(b)) ? 1 : 0;
        }
    }
}

  namespace Solution {
  using NUnit.Framework;
  using System;
  [TestFixture]
  public class SolutionTest
  {
    [Test]
    public void TrueTests()
    {
      Assert.AreEqual(1, Kata.SameCase('a', 'u'));
      Assert.AreEqual(1, Kata.SameCase('A', 'U'));
      Assert.AreEqual(1, Kata.SameCase('Q', 'P'));
      Assert.AreEqual(1, Kata.SameCase('w', 'y'));
      Assert.AreEqual(1, Kata.SameCase('c', 'm'));
      Assert.AreEqual(1, Kata.SameCase('N', 'W'));
    }
    
    [Test]
    public void FalseTests()
    {
      Assert.AreEqual(0, Kata.SameCase('a', 'U'));
      Assert.AreEqual(0, Kata.SameCase('A', 'u'));
      Assert.AreEqual(0, Kata.SameCase('Q', 'p'));
      Assert.AreEqual(0, Kata.SameCase('w', 'Y'));
      Assert.AreEqual(0, Kata.SameCase('c', 'M'));
      Assert.AreEqual(0, Kata.SameCase('N', 'w'));
    }
    
    [Test]
    public void NotLetters()
using NUnit.Framework;
using System;
namespace Solution
{
    [TestFixture]
    public class SolutionTest
    {
      Assert.AreEqual(-1, Kata.SameCase('a', '*'));
      Assert.AreEqual(-1, Kata.SameCase('A', '%'));
      Assert.AreEqual(-1, Kata.SameCase('Q', '1'));
      Assert.AreEqual(-1, Kata.SameCase('w', '-'));
      Assert.AreEqual(-1, Kata.SameCase('c', '8'));
      Assert.AreEqual(-1, Kata.SameCase('N', ':'));
    }
    
    [Test]
    public void RandomTest() {
      string chars = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmopqrstuvwxyz1234567890~/*-+:.,><.#@!&";
      Random rand = new Random();
      char char1 = 'a';
      char char2 = 'a';
      
      for (int i = 0; i < 200; i++) {
        char1 = chars[rand.Next(0,76)];
        char2 = chars[rand.Next(0,76)];
        Assert.AreEqual(SameCaseSolution(char1,char2), Kata.SameCase(char1, char2));
      }
    }
    
    private static int SameCaseSolution(char a, char b) {
      if (!char.IsLetter(a) || !char.IsLetter(b)) return -1;
      if ((a >= 97) == (b >= 97)) return 1;
      return 0;
        [Test]
        public void TrueTests()
        {
            Assert.That(Kata.SameCase('a', 'u'), Is.EqualTo(1));
            Assert.That(Kata.SameCase('A', 'U'), Is.EqualTo(1));
            Assert.That(Kata.SameCase('Q', 'P'), Is.EqualTo(1));
            Assert.That(Kata.SameCase('w', 'y'), Is.EqualTo(1));
            Assert.That(Kata.SameCase('c', 'm'), Is.EqualTo(1));
            Assert.That(Kata.SameCase('N', 'W'), Is.EqualTo(1));
        }
        [Test]
        public void FalseTests()
        {
            Assert.That(Kata.SameCase('a', 'U'), Is.EqualTo(0));
            Assert.That(Kata.SameCase('A', 'u'), Is.EqualTo(0));
            Assert.That(Kata.SameCase('Q', 'p'), Is.EqualTo(0));
            Assert.That(Kata.SameCase('w', 'Y'), Is.EqualTo(0));
            Assert.That(Kata.SameCase('c', 'M'), Is.EqualTo(0));
            Assert.That(Kata.SameCase('N', 'w'), Is.EqualTo(0));
        }
        [Test]
        public void NotLetters()
        {
            Assert.That(Kata.SameCase('a', '*'), Is.EqualTo(-1));
            Assert.That(Kata.SameCase('A', '%'), Is.EqualTo(-1));
            Assert.That(Kata.SameCase('Q', '1'), Is.EqualTo(-1));
            Assert.That(Kata.SameCase('w', '-'), Is.EqualTo(-1));
            Assert.That(Kata.SameCase('c', '8'), Is.EqualTo(-1));
            Assert.That(Kata.SameCase('N', ':'), Is.EqualTo(-1));
        }
        [Test]
        public void RandomTest()
        {
            string chars = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmopqrstuvwxyz1234567890~/*-+:.,><.#@!&";
            Random rand = new Random();
            for (int i = 0; i < 200; i++)
            {
                char char1 = chars[rand.Next(chars.Length)];
                char char2 = chars[rand.Next(chars.Length)];
                Assert.That(Kata.SameCase(char1, char2), Is.EqualTo(SameCaseSolution(char1, char2)));
            }
        }
        private static int SameCaseSolution(char a, char b)
        {
            if (!char.IsLetter(a) || !char.IsLetter(b)) return -1;
            return (char.IsUpper(a) == char.IsUpper(b)) ? 1 : 0;
        }
    }
  }
}
}

ayushdey03082005vs.eiscoollol3 months ago
additon
CodeDiffadd=lambda x:x + x#look at the test case
     

  add=lambda x:x #look at the test case
add=lambda x:x + x#look at the test case
     

Fork
Discuss (0)
Fixture

MonsieurOrnixvs.MonsieurOrnix3 months ago
Maximum Number inside a Random Number
CodeDiffmodule MaxNum (maxNum) where

import Data.List
import Data.Ord

maxNum :: Int -> Int
maxNum = read . sortOn Down . show

  module MaxNum (maxNum) where
import Data.List
import Data.Ord
maxNum :: Int -> Int
maxNum = read . reverse . sort . show
maxNum = read . sortOn Down . show

Fork
Discuss (0)
Fixture

_Maikha_vs._Maikha_

3 months ago

The Worst Sum Algorithm in History 💀

Oh you know what? nevermind...

Code

Diff

```
slow_sum=sum
```
- slow_sum=lambda l:sum(l)
- slow_sum=sum

Interpretervs.Hypnoshroom333

3 months ago

ohaegbua3615's Kumite #2

no need to assign strlen to a seperate variable, saved some cycles.

Code

Diff

#include <stdlib.h>
#include <string.h>
#include <ctype.h>

char *fun(const char *input)
{
  char *result = malloc(strlen(input) + 1);
  char *p      = result;
  while (*p++ = toupper(*input++));
  return result;
}

- #include <stdlib.h>
- #include <string.h>
- #include <ctype.h>
- ~~char *fun(const char *input) {~~
- ~~size_t len = strlen(input);~~
- ~~char *result = malloc(len + 1);~~
- ~~char *p = result;~~
- ~~while ((*p++ = toupper(*input++)));~~
- ~~return result;~~
- char *fun(const char *input)
- {
- char *result = malloc(strlen(input) + 1);
- char *p = result;
- while (*p++ = toupper(*input++));
- return result;
- }

Freestyle Sparring

Multiply and Add One

Check same case

additon

Maximum Number inside a Random Number

The Worst Sum Algorithm in History 💀

ohaegbua3615's Kumite #2

Confirm

Collect: undefined