-
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 - sum of intervals #117
Comments
The problem here is that 1. is meant to be difficult, but some languages (reportedly including Python) can be passed with a solution which passes also the 7 kyu version. I think I'd still say the kata are not duplicates: kata 2. does not really spoil solutions for 1., and 1. should be just fixed to accept solutions of appropriate complexity. |
iirc, there are some other kata in yellow level reuqiring the same kind of stuff (& enforcing performances) so.... retire 1? Suggesting this, because I doubt fixing 20 languages will ever actually happen. |
@Blind4Basics do you have links to other similar kata with performance requirements? I already fixed several languages in 1. There is an easy fix: It is enough to increase bounds of intervals. This fix does not eliminate all O(n^2) solutions but remaining solutions are more complex than the intended solution. I am going to fix all languages soon. So I vote to keep both 1 and 2. |
you know how it is about finding something in the DB... (those kata obviously don't have sum of intervals in their name). Ok, if you can fix the languages, 👍 |
I think we can safely conclude this set as not duplicates. We need to identify nonconformant languages in 1. and fix it. |
I will try to fix all languages in 1 some time next week. |
Tasks:
Languages with large interval tests:
|
Conclusion
The text was updated successfully, but these errors were encountered: