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
Arrays
Code
Diff
  • #include <vector>
    #include <unordered_map>
    #include <numeric>
    
    int unique_sum(const std::vector<int>& n)
    {
      std::unordered_map<int,int> frequencies;
      for (auto i : n) 
          ++frequencies[i]; 
      
      return std::accumulate(begin(n), end(n), 0, [&](auto sum, auto i){
        return frequencies[i] == 1 ? sum + i : sum;
      });
    }
    • #include <vector>
    • #include <map>
    • #include <unordered_map>
    • #include <numeric>
    • int unique_sum(const std::vector<int>& n) {
    • auto histogram=[&](){
    • std::map<int,int> nums;
    • for (auto i:n) ++nums[i];
    • return nums;
    • };
    • int unique_sum(const std::vector<int>& n)
    • {
    • std::unordered_map<int,int> frequencies;
    • for (auto i : n)
    • ++frequencies[i];
    • int sum=0;
    • for (auto [k,c]:histogram()) if (c==1) sum+=k;
    • return sum;
    • return std::accumulate(begin(n), end(n), 0, [&](auto sum, auto i){
    • return frequencies[i] == 1 ? sum + i : sum;
    • });
    • }
Code
Diff
  • #include <stdlib.h>
    #include <string.h>
    #include <ctype.h>
    
    char *fun(const char *input)
    {
      size_t  len    = strlen(input);
      char   *result = malloc(len + 1);
      for (size_t i = 0; input[i]; i++)
        result[i] = toupper(input[i]);
      return result[len] = '\0', result;
    }
    • def fun(s): return s.upper()
    • #include <stdlib.h>
    • #include <string.h>
    • #include <ctype.h>
    • char *fun(const char *input)
    • {
    • size_t len = strlen(input);
    • char *result = malloc(len + 1);
    • for (size_t i = 0; input[i]; i++)
    • result[i] = toupper(input[i]);
    • return result[len] = '\0', result;
    • }

I created a single parameterized test to avoid redundant tests for the same output function without additional logic.

Code
Diff
  • #Onelined again...
    def above_two(arg): return (arg < 2) or (arg >= 2)
    • def above_two(arg):
    • return (arg < 2) or (arg >= 2)
    • #Onelined again...
    • def above_two(arg): return (arg < 2) or (arg >= 2)