If you look at it from a performance point of view, this solution will benefit when compared with a solution that uses Sequence. During my research, Sequence takes between 5 and 13 seconds, while a solution based on while takes 0 seconds

duplicate issue

duplicate issue

duplicate issue

Why on earth does nobody care to fix this kata? It is WRONG. When you want to beat somebody by one, you need to have ONE more point - not the exact same score, which is what the tests require you to do. PLEASE FIX THIS! Thank you.

• Random tests do not generate cases expecting -1
• Random tests only check for a valid equation, not that it is the lowest digit, nor that it is a digit not present in the input.
• Tests should use assertEquals() with input in the assertion message. Remove the println().
• Some more fixed tests have been established and added to Java, JS. Please add them also here.

WOW

I agree with you! 😂 Umayer you did a good job on this one, but try to rethink your solution using the KISS principle 😊

Cool

Excellent points. I agree, this should not have been upvoted as Best Practice.

This solution does use O(number/3) memory. It is possible to solve it in much less memory.

The debates about goto and continue are eternal and Never say Never. It's highly recommended to avoid using these features, but in some particular seldom cases they can be really helpful to solve the existing problem and keep code clean. There is even a special chart in Complete Code about goto :D I'm 100% agree with you that continue could be ommitted here as well as with others marks.

i and j are any two indices in the array. If one element in the array is larger than another one, change it to the difference between the two.