if your code failed in a few tests(not server issue like timeout):
u should focus on that num of each letter in second string(str2) which must be less than or equal to the same letter in (str1) like this:
My bad 😅
This comment is hidden because it contains spoiler information about the solution
No, why would it be true?
this test should be true right?
Had a lot of fun with this one. Thanks for putting it together.
Same thing, my solution, should work perfectly for every test case, but fails like 4
The basic implementation of that is enough to pass the kata, but... you have to avoid performances overhead in your implementation otherwise you may not pass the tests. So "keep it simple/stupid", but hunt for useless operations.
In the notes it says you must reverse the list "in-place".
Very confused on the problem. I thought we are supposed to reverse the list called seq. I did so but now the test cases show that my reversed list should equal the original. In the first case it states, [5, 4, 3, 2, 1] should equal [1, 2, 3, 4, 5] but [1, 2, 3, 4, 5] was what seq was originally. Any help?
But interesting to solve.
In java it's much easier with timeout as it seems.
For anyone else struggling with formatting in these comments the markdown approach was shared by another user in another kata so sharing it here: