Your solution is buggy! For example 4fff1aaaaaaaaaaa your code returns true because fff is length 3 -> --count = 1 -> 1*10 +1 = 11 = aaaaaaaaaaa.length()
Java automatically converts arithmetic operations on bytes into an integer value. So your cast (int) is unnecessary. Additionally, you should not change the method signature to satisfy this kata.
It's quite simple - you check all the paths until a & b || c & d returns true. Sometimes there are two possible ways - such as in the banana case. For this reason there is the || in our solution for both recursive paths
This one is cool
Your solution is buggy! For example 4fff1aaaaaaaaaaa your code returns true because fff is length 3 -> --count = 1 -> 1*10 +1 = 11 = aaaaaaaaaaa.length()
This comment is hidden because it contains spoiler information about the solution
Java automatically converts arithmetic operations on bytes into an integer value. So your cast (int) is unnecessary. Additionally, you should not change the method signature to satisfy this kata.
This is an anoying kata
this is b€€€s€€€
Cool - i didn't know this method. kudos
I had to read about this data structure first - now i consider it as the best approach
This comment is hidden because it contains spoiler information about the solution
Compared to other Kyu-7 katas, it is too complicated. 6 would be more appropriate.
Nice one - Code Golf :) Please check my solution as well :D
In Python it runs in 1 second
It's quite simple - you check all the paths until a & b || c & d returns true. Sometimes there are two possible ways - such as in the banana case. For this reason there is the || in our solution for both recursive paths
Why is this best practice? This is bullshit - my code works 40x faster.
Overkill
Loading more items...