-
Notifications
You must be signed in to change notification settings - Fork 1
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Deduplicate - Calculation involving n biggest / smallest numbers #176
Comments
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. 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 🤔 |
I vote to keep 4 and 6 only since these 2 katas differ most in terms of Retire the rest |
I vote to keep 6 (more generic version of task), and one out of [2, 3, 4]. |
From #39
sort
disabled in JS, output: difference between 2 biggest numbersn
biggest numbersSmallest Pair Sum (beta)- unpublishedThe text was updated successfully, but these errors were encountered: