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
gcesnik3vs.jcksnparsons

Dumb Rock Paper Scissors

Code
Diff
  • function dumbRockPaperScissors(player1, player2) {
  if(player1 == "Rock" && player2 == "Paper"){
    return "Player 2 wins";
  }
  else if(player1 == "Rock" && player2 == "Scissors" ){
       return "Player 1 wins";
  }
  else if(player1 == "Scissors" && player2 == "Paper"){
      return "Player 1 wins";
  }
  else if(player1 == "Scissors" && player2 == "Rock"){
        return "Player 2 wins";
  }
  else if(player1 == "Paper" && player2 == "Scissors"){
            return "Player 2 wins";
  }
  else if(player1 == "Paper" && player2 == "Rock"){
    return "Player 1 wins";
    
  }
  else if(player1 == "Paper" && player2 == "Paper"){
    return "Draw";
  }
   else if(player1 == "Rock" && player2 == "Rock"){
    return "Draw";
  }
   else if(player1 == "Scissors" && player2 == "Scissors"){
    return "Draw";
  }

}
    • function dumbRockPaperScissors(player1, player2) {
    • if(player1 == "Rock" && player2 == "Paper"){
    • return "Player 2 wins";
    • }
    • else if(player1 == "Rock" && player2 == "Scissors" ){
    • return "Player 1 wins";
    • }
    • else if(player1 == "Scissors" && player2 == "Paper"){
    • return "Player 1 wins";
    • }
    • else if(player1 == "Scissors" && player2 == "Rock"){
    • return "Player 2 wins";
    • }
    • else if(player1 == "Paper" && player2 == "Scissors"){
    • return "Player 2 wins";
    • }
    • else if(player1 == "Paper" && player2 == "Rock"){
    • return "Player 1 wins";
    • }
    • else if(player1 == "Paper" && player2 == "Paper"){
    • return "Draw";
    • }
    • else if(player1 == "Rock" && player2 == "Rock"){
    • return "Draw";
    • }
    • else if(player1 == "Scissors" && player2 == "Scissors"){
    • return "Draw";
    • }
    • }
gcesnik3vs.jcksnparsons

Non Repeating Character Optimization

Code
Diff
  • const firstNonRepeatingCharacter = (str) => {
  console.log("haha");
    for (let i = 0; i < str.length; i++) {
        let seenDuplicate = false;
        for (let j = 0; j < str.length; j++) {
            if (str[i] === str[j] && i !== j) {
                seenDuplicate = true;
                break;
            }
        }
        if (!seenDuplicate) {
            return str[i];
        }
    }
    return null; // return null if no unique character is found
};
    • const firstNonRepeatingCharacter = (str) => {
    • console.log("haha");
    • for (let i = 0; i < str.length; i++) {
    • let seenDuplicate = false;
    • for (let j = 0; j < str.length; j++) {
    • if (str[i] === str[j] && i !== j) {
    • seenDuplicate = true;
    • break;
    • }
    • }
    • if (!seenDuplicate) {
    • return str[i];
    • }
    • }
    • return null; // return null if no unique character is found
    • };
mcarracedovs.gaston-areco-tq

Find maximum number that can be formed using digits of a given number

Code
Diff
  • import java.util.Arrays;

public class MaxNumber {
    public static long print(long number) {
      String numberStr = Long.toString(number);
      char[] digits = numberStr.toCharArray();
      Arrays.sort(digits);
      for (int i = 0; i < digits.length / 2; i++) {
            char temp = digits[i];
            digits[i] = digits[digits.length - i - 1];
            digits[digits.length - i - 1] = temp;
        }
      String maxNumberStr = new String(digits);
       number =  Long.parseLong(maxNumberStr);
        return number;
    }
}
    • import java.util.Arrays;
    • public class MaxNumber {
    • public static long print(long number) {
    • return number
    • String numberStr = Long.toString(number);
    • char[] digits = numberStr.toCharArray();
    • Arrays.sort(digits);
    • for (int i = 0; i < digits.length / 2; i++) {
    • char temp = digits[i];
    • digits[i] = digits[digits.length - i - 1];
    • digits[digits.length - i - 1] = temp;
    • }
    • String maxNumberStr = new String(digits);
    • number = Long.parseLong(maxNumberStr);
    • return number;
    • }
    • }
IUrixlAgainvs.diode4

get rekt (get lua'd)

Strings
Mathematics
Logic

Hi

Code
Diff
  • local solution = {}

function solution.initperson(name, iq)
  return {name=name,iq=iq}
end
        
local you = solution.initperson("you",0)

print(string.format("%s have %s IQ!", you.name, 1/you.iq)) -- String placeholder since 1/0 returns "inf" lol

return solution
    • local solution = {}
    • function solution.initperson(name, iq)
    • return {name=name,iq=iq}
    • end
    • local you = solution.initperson("you",0)
    • print(you.name.." have "..1/you.iq.." IQ!")
    • print(string.format("%s have %s IQ!", you.name, 1/you.iq)) -- String placeholder since 1/0 returns "inf" lol
    • return solution
pearcebasmanmvs.SergeGuea

Higher-Order Functions Series - Is the meetup language-diverse?

Code
Diff
  • struct Developer {
    language: Language
    /* left out the rest because it would just generate unused warnings */
}

enum Language {
    Python,
    Ruby,
    JavaScript
}

fn is_language_diverse(list: &[Developer]) -> bool {
    let (mut python, mut ruby, mut javascript) = (0, 0, 0);
    for developer in list {
        match developer.language {
            Language::Python => python += 1,
            Language::Ruby => ruby += 1,
            Language::JavaScript => javascript += 1,
        }
    }
    python.max(ruby).max(javascript) <= 2 * python.min(ruby).min(javascript)
}
    • function isLanguageDiverse(list) {
    • const counts = {};
    • for (let i = 0; i < list.length; i++) { // ho usato un ciclo for per contare quante volte appare un linguaggio
    • const language = list[i].language; // ho assegnato il linguaggio corrente a una variabile
    • counts[language] = counts[language] ? counts[language] + 1 : 1; // ho usato un operatore ternario per incrementare il contatore
    • }
    • const countsValues = Object.values(counts); // ho usato Object.values per ottenere i valori dell'oggetto counts
    • const maxCount = Math.max(...countsValues); // ho usato Math.max per trovare il valore massimo
    • const minCount = Math.min(...countsValues); // ho usato Math.min per trovare il valore minimo
    • return maxCount <= 2 * minCount; // ho usato un operatore ternario per restituire true o false
    • }
    • //Test cases
    • struct Developer {
    • language: Language
    • /* left out the rest because it would just generate unused warnings */
    • }
    • const list1 = [{ firstName: 'Daniel', lastName: 'J.', country: 'Aruba', continent: 'Americas', age: 42, language: 'Python' },
    • { firstName: 'Kseniya', lastName: 'T.', country: 'Belarus', continent: 'Europe', age: 22, language: 'Ruby' },
    • { firstName: 'Sou', lastName: 'B.', country: 'Japan', continent: 'Asia', age: 43, language: 'Ruby' },
    • { firstName: 'Hanna', lastName: 'L.', country: 'Hungary', continent: 'Europe', age: 95, language: 'JavaScript' },
    • { firstName: 'Jayden', lastName: 'P.', country: 'Jamaica', continent: 'Americas', age: 18, language: 'JavaScript' },
    • { firstName: 'Joao', lastName: 'D.', country: 'Portugal', continent: 'Europe', age: 25, language: 'JavaScript' }];
    • enum Language {
    • Python,
    • Ruby,
    • JavaScript
    • }
    • const list2 = [{ firstName: 'Daniel', lastName: 'J.', country: 'Aruba', continent: 'Americas', age: 42, language: 'Python' },
    • { firstName: 'Kseniya', lastName: 'T.', country: 'Belarus', continent: 'Europe', age: 22, language: 'Ruby' },
    • { firstName: 'Sou', lastName: 'B.', country: 'Japan', continent: 'Asia', age: 43, language: 'Ruby' },
    • { firstName: 'Hanna', lastName: 'L.', country: 'Hungary', continent: 'Europe', age: 95, language: 'JavaScript' },
    • { firstName: 'Jayden', lastName: 'P.', country: 'Jamaica', continent: 'Americas', age: 18, language: 'JavaScript' },
    • { firstName: 'Joao', lastName: 'D.', country: 'Portugal', continent: 'Europe', age: 25, language: 'JavaScript' },
    • { firstName: 'Joao', lastName: 'D.', country: 'Portugal', continent: 'Europe', age: 25, language: 'JavaScript' }];
    • fn is_language_diverse(list: &[Developer]) -> bool {
    • let (mut python, mut ruby, mut javascript) = (0, 0, 0);
    • for developer in list {
    • match developer.language {
    • Language::Python => python += 1,
    • Language::Ruby => ruby += 1,
    • Language::JavaScript => javascript += 1,
    • }
    • }
    • python.max(ruby).max(javascript) <= 2 * python.min(ruby).min(javascript)
    • }
    • console.log(isLanguageDiverse(list1)); // false
    • console.log(isLanguageDiverse(list2)); // true
pearcebasmanmvs.pearcebasmanm

Higher-Order Functions Series - Generic Solution

Code
Diff
  • trait HasAge {
    fn age(&self) -> i32;
}

fn find_oldest<T: HasAge + Clone>(list: &[T]) -> Vec<T> {
    if let Some(max_age) = list.iter().map(T::age).max() {
        list.iter().filter(|e| e.age() == max_age).cloned().collect()        
    } else {
        Vec::new()
    }
}
    • mod preloaded;
    • use preloaded::Developer;
    • trait HasAge {
    • fn age(&self) -> i32;
    • }
    • fn find_senior(list: &[Developer]) -> Vec<Developer> {
    • let max_age = list.iter().map(|d| d.age).max().unwrap();
    • list.iter().filter(|d| d.age == max_age).copied().collect()
    • fn find_oldest<T: HasAge + Clone>(list: &[T]) -> Vec<T> {
    • if let Some(max_age) = list.iter().map(T::age).max() {
    • list.iter().filter(|e| e.age() == max_age).cloned().collect()
    • } else {
    • Vec::new()
    • }
    • }
kreetinamebavs.dn1cw

Calculate even numbers in array

Code
Diff
  • function calculateEvenNumbers(array $numbers): int {
  return count(array_filter($numbers, function($num) { return $num % 2 === 0; }));
}
    • function calculateEvenNumbers(array $numbers): int {
    • $count = 0;
    • foreach ($numbers as $number) {
    • if ($number % 2 === 0) {
    • $count++;
    • }
    • }
    • return $count;
    • return count(array_filter($numbers, function($num) { return $num % 2 === 0; }));
    • }
rowcasedvs.HaradirFailed Tests

one number multiplication table, and you enter that number.

fix the code lol

Code
Diff
  • #include <stdio.h>

int prnt_mltply(int m, int n) {
    int i = 1;
    while(i <= m) {
        int j = 1;
        while(j <= n) {
            printf("%d * %d = %d \n", i, j, i * j);
            j++;
        }
        i++;
        printf("\n");
    }
    return m - n;
}
    • #include<stdio.h>
    • int main()
    • {
    • int i=1;
    • while(i<=5)
    • {
    • int j=1;
    • while(j<=12)
    • {
    • printf("%d * %d =%d
    • ", i,j, i*j);
    • j++;
    • #include <stdio.h>
    • int prnt_mltply(int m, int n) {
    • int i = 1;
    • while(i <= m) {
    • int j = 1;
    • while(j <= n) {
    • printf("%d * %d = %d
    • ", i, j, i * j);
    • j++;
    • }
    • i++;
    • printf("\n");
    • }
    • i++;
    • printf("\n");
    • }
    • return(0);
    • return m - n;
    • }
Test Cases
Diff
  • #include <criterion/criterion.h>

int prnt_mltply(int m, int n);
void tester(int m, int n, int expected);

Test(prnt_mltply, Sample_Test)
{
    tester(5, 12, 60);
}

void tester(int m, int n, int expected) {
    int submitted = prnt_mltply(m, n);
    cr_assert_eq(                                    submitted,     expected,
        "< Incorrect Result >\n \nm = %d\nn = %d\n \nSubmitted: %d\nExpected:  %d",
                                  m,      n,         submitted,     expected
    );
}
    • // TODO: Replace examples and use TDD by writing your own tests. The code provided here is just a how-to example.
    • #include <criterion/criterion.h>
    • // replace with the actual method being tested
    • int foo(int,int);
    • int prnt_mltply(int m, int n);
    • void tester(int m, int n, int expected);
    • Test(the_multiply_function, should_pass_all_the_tests_provided) {
    • cr_assert_eq(foo(1, 1), 1);
    • Test(prnt_mltply, Sample_Test)
    • {
    • tester(5, 12, 60);
    • }
    • void tester(int m, int n, int expected) {
    • int submitted = prnt_mltply(m, n);
    • cr_assert_eq( submitted, expected,
    • "< Incorrect Result >\n \nm = %d\nn = %d\n \nSubmitted: %d\nExpected: %d",
    • m, n, submitted, expected
    • );
    • }