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.

narayanswa30663vs.AlexWD

Longest Word

Code

Diff

var longestString = (str) => require('lodash')(str.split(' ')).maxBy('length');

- ~~var longestString = (str) => str.split(' ').sort((a, b) => b.length - a.length)[0];~~
- var longestString = (str) => require('lodash')(str.split(' ')).maxBy('length');

narayanswa30663vs.joelharkes

get smallest positive number from array

Code

Diff

function getMin(list) {
  x = Math.min(...list.filter(i => i > 0));
  return x !== Infinity ? x : 0
}

- function getMin(list) {
- let ret = list.reduce((prev, curr) => {
- if (curr <= 0) return prev;
- return (prev <= 0) ? curr : Math.min(curr, prev);
- ~~}, -1);~~
- return ret > 0 ? ret : 0;
- x = Math.min(...list.filter(i => i > 0));
- return x !== Infinity ? x : 0
- }

ecolbanvs.raulbc777

Permutation of an Array of Unique Elements in Python Using Itertools

Code

Diff

from itertools import *

def permut(arr):
    return [list(p) for p in permutations(arr)]

- from itertools import *
- def permut(arr):
- ~~resL = []~~
- ~~for perm in permutations(arr):~~
- ~~resL.append(list(perm))~~
- ~~return resL~~
- return [list(p) for p in permutations(arr)]

Unnamedvs.raulbc777

Fast and Concise Way to Count the Frequencies of all the Elements of an Array

Code

Diff

def counter(arr)
    arr.each_with_object(Hash.new(0)) { |n, counts| counts[n] += 1 }
end

def count_occur_each_element(arr)
    counter(arr).sort
end

- def counter(arr)
- counts = Hash.new 0
- ~~arr.each do |n|~~
- ~~counts[n] += 1~~
- ~~end~~
- ~~return counts~~
- arr.each_with_object(Hash.new(0)) { |n, counts| counts[n] += 1 }
- end
- def count_occur_each_element(arr)
- ~~if arr == []~~
- ~~return []~~
- ~~end~~
- ~~count_pairs = []~~
- counts = counter(arr)
- ~~counts.each do |k, v|~~
- ~~count_pairs << [k, v]~~
- ~~end~~
- count_pairs.sort!
- ~~return count_pairs~~
- counter(arr).sort
- end

Test Cases

Diff

def counter_check(arr)
    counts = Hash.new 0
    arr.each do |n|
        counts[n] += 1
    end
    return counts
end

def count_occur_each_element_check(arr)
    if arr == []
        return []
    end
    count_pairs = []
    counts = counter_check(arr)
    counts.each do |k, v|
        count_pairs << [k, v]
    end
    count_pairs.sort!
    return count_pairs
end

describe "Example Tests" do
  it "Very Simple Ones" do
    arr = [1, -2, 7, 2, 1, 3, 7, 1, 0, 2, 3]
    Test.assert_equals(count_occur_each_element(arr), [[-2, 1], [0, 1], [1, 3], [2, 2], [3, 2], [7, 2]])

    arr = [2, -1, 1, 1, 1, 1, 2, 3, 3, 7, 7, 0]
    Test.assert_equals(count_occur_each_element(arr), [[-1, 1], [0, 1], [1, 4], [2, 2], [3, 2], [7, 2]])
  end
end

def build_rand_arr(l)
    arr = []; max_ = l/20
    max__ = -1 *max_
    while true
        elem = rand(max__..max_)
        arr << elem
        break if arr.length == l
    end
    return arr
end

describe "Random Tests" do
  it "Challenging Cases" do
    for h in 0..50
        len = rand(1000..10000)
        arr = build_rand_arr(len)
        result = count_occur_each_element_check(arr)
        res = count_occur_each_element(arr)
        it "Testing for an array of length " + arr.length.to_s do
          Test.assert_equals(res, result)
        end
    end
  end
end

- ~~def counter(arr)~~
- def counter_check(arr)
- counts = Hash.new 0
- arr.each do |n|
- counts[n] += 1
- end
- return counts
- end
- def count_occur_each_element_check(arr)
- if arr == []
- return []
- end
- count_pairs = []
- ~~counts = counter(arr)~~
- counts = counter_check(arr)
- counts.each do |k, v|
- count_pairs << [k, v]
- end
- count_pairs.sort!
- return count_pairs
- end
- describe "Example Tests" do
- it "Very Simple Ones" do
- arr = [1, -2, 7, 2, 1, 3, 7, 1, 0, 2, 3]
- Test.assert_equals(count_occur_each_element(arr), [[-2, 1], [0, 1], [1, 3], [2, 2], [3, 2], [7, 2]])
- arr = [2, -1, 1, 1, 1, 1, 2, 3, 3, 7, 7, 0]
- Test.assert_equals(count_occur_each_element(arr), [[-1, 1], [0, 1], [1, 4], [2, 2], [3, 2], [7, 2]])
- end
- end
- def build_rand_arr(l)
- arr = []; max_ = l/20
- max__ = -1 *max_
- while true
- elem = rand(max__..max_)
- arr << elem
- break if arr.length == l
- end
- return arr
- end
- describe "Random Tests" do
- it "Challenging Cases" do
- for h in 0..50
- len = rand(1000..10000)
- arr = build_rand_arr(len)
- result = count_occur_each_element_check(arr)
- res = count_occur_each_element(arr)
- it "Testing for an array of length " + arr.length.to_s do
- Test.assert_equals(res, result)
- end
- end
- end
- end

oxkharvs.Unnamed

Failed Tests

Javatlacati's Kumite #21

Code

Diff

object Scala extends App {
  object StringUtilities {
    def upper(strings: String*) = strings.map(_.toUpperCase).mkString(" ")
  }
  
  println( StringUtilities.upper("A", "First", "Scala", "Program") )
}

- object Scala extends App {
- object StringUtilities {
- def upper(strings: String*): Seq[String] = {
- ~~strings.map(_.toUpperCase)~~
- }
- def upper(strings: String*) = strings.map(_.toUpperCase).mkString(" ")
- }
- ~~println(StringUtilities.upper("A", "First", "Scala", "Program") mkString " ")~~
- println( StringUtilities.upper("A", "First", "Scala", "Program") )
- }

AlexWDvs.jayeshcp

Test Kumite

Code

Diff

var getAge = (today, dob) => (today && dob) ? (new Date(today)).getYear() - new Date(dob).getYear() : null;

- ~~var getAge = function(today, dob) {~~
- if(!today || !dob) {
- ~~return null;~~
- }
- var now = new Date(today);
- return now.getYear() - new Date(dob).getYear();
- };
- var getAge = (today, dob) => (today && dob) ? (new Date(today)).getYear() - new Date(dob).getYear() : null;

AlexWDvs.AlexWD

Middle Character

Code

Diff

var middleCharacter = (str) => str.slice(str.length/2 - !(str.length % 2), str.length/2+1);

- function middleCharacter(str) {
- return str.slice(str.length/2 - !(str.length % 2), str.length/2+1);
- };
- var middleCharacter = (str) => str.slice(str.length/2 - !(str.length % 2), str.length/2+1);

AlexWDvs.Dragoris

Third Greatest

Fundamentals

Arrays

Data Types

Code

Diff

var thirdGreatest = (arr) => arr.sort((a,b) => a - b)[arr.length - 3];

- function thirdGreatest(arr){
- return arr.sort( (a,b) => a - b)[arr.length-3]
- }
- var thirdGreatest = (arr) => arr.sort((a,b) => a - b)[arr.length - 3];

Test Cases

Diff

describe("Solution", function(){
  it("did you return the correct number?", function(){
    Test.assertEquals(thirdGreatest([4,8,1,5,3]), 4, "Better try again");
    Test.assertEquals(thirdGreatest([45,38,1,0,89,6,77]), 45, "Better try again");
    Test.assertEquals(thirdGreatest([878,1,1,0,46,123]), 46, "Better try again");
    Test.assertEquals(thirdGreatest([8,99,0]), 0, "Better try again");
    Test.assertEquals(thirdGreatest([1,1,2,3,3,4]), 3, "Better try again");
    Test.assertEquals(thirdGreatest([79831,436,683,3645,2399,0,0,66]), 2399, "Better try again");
    Test.assertEquals(thirdGreatest([6,33,7,41,3,388]), 33, "Better try again");
    
  });
});

- describe("Solution", function(){
- it("did you return the correct number?", function(){
- Test.assertEquals(thirdGreatest([4,8,1,5,3]), 4, "Better try again");
- Test.assertEquals(thirdGreatest([45,38,1,0,89,6,77]), 45, "Better try again");
- Test.assertEquals(thirdGreatest([878,1,1,0,46,123]), 46, "Better try again");
- Test.assertEquals(thirdGreatest([8,99,0]), 0, "Better try again");
- Test.assertEquals(thirdGreatest([1,1,2,3,3,4]), 3, "Better try again");
- Test.assertEquals(thirdGreatest([79831,436,683,3645,2399,0,0,66]), 2399, "Better try again");
- Test.assertEquals(thirdGreatest([6,33,7,41,3,388]), 33, "Better try again");
- });
- });

Freestyle Sparring

Longest Word

get smallest positive number from array

Permutation of an Array of Unique Elements in Python Using Itertools

Fast and Concise Way to Count the Frequencies of all the Elements of an Array

Javatlacati's Kumite #21

Test Kumite

Middle Character

Third Greatest

You have not created any collections yet.

Freestyle Sparring

Confirm

Collect: kata

You have not created any collections yet.