Open hobovsky opened 1 year ago
For kata 1.-5., I have no good idea what to pick and what to remove. They all are very similar.
Kata 1. disables sorting, but I am not sure if it is a reasonable restriction, and definitely not easy to translate. Except 1., all other kata can be solved with sorting and picking two first elements.
All kata seem to have reoccurring complaints about "things not working", what makes me think that some tests can be derailed by mutating inputs (for example, sorting in place, or removing one of values).
Kata 5. has additional obstacle of avoiding duplicates. I don't know if it makes it sufficiently different. Kata 6. is a bit more generic, so maybe it would be worth keeping. At least in some languages it's been reported to be affected by overflow of the result.
Even if it will be difficult to establish what exactly is a duplicate and what is not, still kata 2., 3., and 4. are the same kind of tasks so maybe we could at least remove two of them.
These two Largest pair sum in array / Sum of two lowest positive integers should be removed. And this one Product of Largest Pair should stay (is it possible to combine previous ones with this one?) a.k.a Product and Sum of Largest Pair :thinking:
I vote to keep 4 and 6 only since these 2 katas differ most in terms of i) sum vs product ii) 2 lowest vs n largest
Retire the rest 1 (searching for other sort-related katas, one can copy or reimplement the sorting function from scratch easily) 2 Too similar with above two and least languages and solves 3 Too similar with above two 5 avoiding duplicates is not unique enough as there is like 3-4 more Zizou katas that have such requirements
I vote to keep 6 (more generic version of task), and one out of [2, 3, 4].
From #39
Difference between biggest 2 numbers
sort
disabled in JS, output: difference between 2 biggest numbersProduct of Largest Pair
Largest pair sum in array
Sum of two lowest positive integers
Maximum Triplet Sum (Array Series #7)
Product Of Maximums Of Array (Array Series #2)
n
biggest numbersSmallest Pair Sum (beta)- unpublished