Loading collection data...
Collections are a way for you to organize kata so that you can create your own training routines. Every collection you create is public and automatically sharable with other warriors. After you have added a few kata to a collection you and others can train on the kata contained within the collection.
Get started now by creating a new collection.
The way the results are displayed makes it challenging to troubleshoot your query. I agree with Voila that it would be better to have the traditional SQL test assertion data display. Thanks and all the best!
Thank you for the prompt response - the error was in my query not in tests!
Hi! I clearly mentioned it in the description, "Ensure the age ranges include the entire span (e.g., up to but not including 21 years for the 18-20 bracket)." And the test that you mentioned checks exactly it: that person who is 40.5 would be a part of -40 bracket
Hi!
I believe that there might be an error in the 'Edge Test Case'. The only employee present in that data set is above 40 (born Aug. 2/1983) but the solution seems to require the employee to be between 26 and 40. Could you please look into this?
This comment is hidden because it contains spoiler information about the solution
Not a kata issue ! The first solution does not pass because it returns the largest number in the array regardless of the sorting criteria. The second solution is correct and passes all the time.
i don't think regexp should be 8kyu
Read the description again.
I can see that there is a negative opinions about this approach but I am still quite new and still learning so I could someone please explain how this approach even works? I'm not really able to see the connection between how i's reversed order matching the reversed order of n produces the right result...
Thank you in advance for your time and help!
I can see that there is a lot of negative opinions about this approach but I am still quite new and still learning so I could someone please explain how this approach even works? I'm not really able to see the connection between how i's sorted ascending order matching the reversed order of n produces the right result...
Thank you in advance for your time and help!
This comment is hidden because it contains spoiler information about the solution
This comment is hidden because it contains spoiler information about the solution
Same issue in Ruby...
Interesting but for me it was quite difficult and I think it's closer to a 5kyu or 6kyu.
Nice one but in my opinion it should be 8ky...
Loading more items...