Kumite

Show My Kumite Only?
Filter by Language:
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.

user5196477vs.Javatlacati

Hello Bash with test

Prints "Hello Bash" and any parameters to stdout.

#!/bin/bash

echo Hello Bash!

if [ $# -eq 1 ]; then
  echo "Hello, $1!"
else
  echo "No parameters found."
fi

Test Cases

Diff

# TODO: replace with your own tests (TDD). An example to get you started is included below.

# run the solution and store its result
 output = run_shell args: ['Kumite']

 describe "Solution" do
   it "should return the argument passed in" do
     expect(output).to include('Hello Bash!')
   end
 end

Recent Moves:

Javatlacati

Hello Bash with test

Shows how to use bash kta and how to create simple tests

echo Hello Bash!

# TODO: replace with your own tests (TDD). An example to get you started is included below.

# run the solution and store its result
 output = run_shell

 describe "Solution" do
   it "should return the argument passed in" do
     expect(output).to include('Hello Bash!')
   end
 end

naturalethicvs.narayanswa30663

get smallest positive number from array

Code

Diff

const getMin = (l) => l.filter(i => i > 0).sort((a, b) => a - b)[0] || 0

Recent Moves:

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
}

joelharkesvs.strider820

get smallest positive number from array

The function should find the smallest (positive) number in the array.

The array can contain the following values:

Positive number
Negavitve number
0
Null value

If no number is found, you should return 0

Note: Zero is also counted as a positive number.

#Examples

[1, 2, 3, 4] => 1
[-2, 0, 4] => 0
[-2, -5] => 0

Test Cases

Diff

describe("Solution", function(){
  it("test1", function(){
    var list = [0, 1, 1, 3];
    Test.assertEquals(getMin(list), 1, "test fails");
  });
  it("test2", function(){
    var list = [7, 2, null, 3, 0, 10];
    Test.assertEquals(getMin(list), 2, "test fails");
  });
  it("test3", function(){
    var list = [null, -2];
    Test.assertEquals(getMin(list), 0, "test fails");
  });
  it("test4", function(){
    var list = [Number.MAX_VALUE];
    Test.assertEquals(getMin(list), Number.MAX_VALUE, "test fails");
  });
  it("test5", function(){
    var list = [0.5,7, 2, null, 3, 0, 10];
    Test.assertEquals(getMin(list), 0.5, "test fails");
  });
  it("dynamic test", function(){
    var minValue = null;
    var list = [];
    for(var i = 20; i > 0; i--){
      var toAdd = (Math.random()*1000 - 500);
      if(toAdd >= 0 && (minValue === null || minValue > toAdd))
        minValue = toAdd;
      list.push(minValue);
    }
    Test.assertEquals(getMin(list), minValue, "test fails");
  });
  
  it("long dynamic test", function(){
    var minValue = null;
    var list = [];
    for(var i = 100; i > 0; i--){
      var toAdd = (Math.random()*1000 - 500);
      if(toAdd >= 0 && (minValue === null || minValue > toAdd))
        minValue = toAdd;
      list.push(minValue);
    }
    Test.assertEquals(getMin(list), minValue, "test fails");
  });
});

drogimexvs.renjian93

get smallest positive number form array

Code

Diff

var getMin = function (list){
  var list = (!list) ? 0 : list.filter(function(v){ return (v > 0 && v < Number.MAX_VALUE); });
  return Math.min.apply(null,list) | 0;
}

Test Cases

Diff

describe("Solution", function(){
  it("test1", function(){
    var list = [0, 1, 1, 3];
    Test.assertEquals(getMin(list), 1, "test fails");
  });
  it("test2", function(){
    var list = [7, 2, null, 3, 0, 10];
    Test.assertEquals(getMin(list), 2, "test fails");
  });
  it("test3", function(){
    var list = [null, -2];
    Test.assertEquals(getMin(list), 0, "test fails");
  });
  it("test4", function(){
    var list = [5,null, -2, {a:"5"}, [1,2,3],3];
    Test.assertEquals(getMin(list), 3, "test fails");
  });
});

ajooluzvs.mkelty

Find the nth Fibonacci number

Сan not be stored list in the memory

Code

Diff

def fib(x):
    f1, f2 = 0, 1
    for x in range(x):
        f1, f2 = f2, (f1 + f2)
    return f2

narayanswa30663vs.AlexWD

Longest Word

Code

Diff

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

justZERO

Quicksort

Algorithms
(ns quicksort.core)

(defn quick-sort [nums]
  (if (< (count nums) 2) nums
    (concat
      (quick-sort (filter #(< % (first nums)) nums))
      (filter #(= % (first nums)) nums)
      (quick-sort (filter #(> % (first nums)) nums)))))
(ns quicksort.test
  (:require [clojure.test :refer :all]
            [quicksort.core :refer [quick-sort]]))
            
(deftest quick-sort-test
  (is (= (quick-sort '(2 3 1)) '(1 2 3)))
  (is (= (quick-sort '(9 -1 -2 10)) '(-2 -1 9 10)))
  (is (= (quick-sort '(1 2 666 233 0 8 34 -1)) '(-1 0 1 2 8 34 233 666))))

dinglemousevs.ALVO

Matching Brackets

Stacks

Arrays

Code

Diff

import java.util.*;

public class MatchingBrackets {

  static final Map<Character, Character> brackets = new HashMap<Character, Character>() {{
    put(')','(');
    put('}','{');
    put(']','[');
  }};
  
  public static boolean isBalanced(final String braces) {
    final Stack<Character> stack = new Stack<>();
    for (final char brace : braces.toCharArray()) {  
      if (!stack.isEmpty() && stack.peek() == brackets.get(brace)) {
        stack.pop();
      } else {
        stack.push(brace);
      }
    }
    return stack.isEmpty();
  }
}

 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
 }

 var getMin = function (list){
-−
+  var min = Number.MAX_VALUE;
-−
+  for (var i = 0; i < list.length; i++) {
-−
+    if (+list[i] <= 0) {
-−
+      continue;
-−
+    }
-−
+    min = Math.min(min, +list[i]);
-−
+  }
-−
+  return min = min === Number.MAX_VALUE ? 0 : min;
   var list = (!list) ? 0 : list.filter(function(v){ return (v > 0 && v < Number.MAX_VALUE); });
   return Math.min.apply(null,list) | 0;
 }

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

Filter by Language:

Confirm