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
eurydice5717vs.ilpropheta

The sum of the unique numbers

Arrays
Code
Diff
  • #include <vector>
#include <unordered_map>
#include <numeric>

int unique_sum(const std::vector<int>& n)
{
  int sum{0};
  std::unordered_map<int,int> frequencies;
  for (auto i : n) {
    auto &v=frequencies[i];
    if (v==0)      sum+=i;
    else if (v==1) sum-=i;
    v++;
  }
  return sum;
}
    • #include <vector>
    • #include <unordered_map>
    • #include <numeric>
    • int unique_sum(const std::vector<int>& n)
    • {
    • int sum{0};
    • 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;
    • });
    • for (auto i : n) {
    • auto &v=frequencies[i];
    • if (v==0) sum+=i;
    • else if (v==1) sum-=i;
    • v++;
    • }
    • return sum;
    • }
3xpthckrvs.tykbry

Reverse the letters in a String

Code
Diff
  • #include <stdlib.h>
#include <string.h>

char *reverse_string(const char *word) {
    if (!word) return NULL;

    size_t len = strlen(word);
    char *res = malloc(len + 1);
    if (!res) return NULL;

    for (size_t i = 0; i < len; i++)
        res[i] = word[len - i - 1];

    res[len] = '\0';
    return res;
}
    • #include <stdlib.h>
    • #include <string.h>
    • char *reverse_string(const char *word)
    • {
    • size_t len = strlen(word);
    • char *res = malloc(len + 1);
    • for (size_t i = 0; i < len; i++)
    • res[i] = word[len - i - 1];
    • return res[len] = '\0', res;
    • }
    • char *reverse_string(const char *word) {
    • if (!word) return NULL;
    • size_t len = strlen(word);
    • char *res = malloc(len + 1);
    • if (!res) return NULL;
    • for (size_t i = 0; i < len; i++)
    • res[i] = word[len - i - 1];
    • res[len] = '\0';
    • return res;
    • }
ewenn-hersstrongvs.Univer Sapphire Lotus

The Worst Sum Algorithm in History 💀

Code
Diff
  • def slow_sum(lst):
    return sum(lst) if lst else 0
    • import random
    • from random import randrange
    • def slow_sum(lst):
    • if lst:
    • s = sum(lst)
    • else:
    • s = 0
    • randrange(s-1, s+1)
    • while True:
    • temp = randrange(s-10000, s+10000)
    • if temp == s:
    • return temp
    • return sum(lst) if lst else 0
Interpretervs.leehunt

ohaegbua3615's Kumite #2

  • Eliminated unnecessary variable allocation (i inside the for loop).
  • Moved null terminator assignment into the loop, removing the need for an external assignment.
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), *p = result;
  
  while (len--)
    *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), *p = result;
    • for (size_t i = 0; i < len; i++)
    • char *result = malloc(++len), *p = result;
    • while (len--)
    • *p++ = toupper(*input++);
    • *p = '\0';
    • return result;
    • }