My solution uses flawed logic, but it only very occasionaly bombs a ( random ) test.

There should be a fixed test that my solution would fail.

I'm too lazy to figure out the exact edge case - this kata has too many other issues.

This may be accomplished with a BST, and will most likely fail through traditional iteration

Except a linear solution doesn't have an O(n * log(n)) time complexity and will most likely return the result faster. This "hint" should be removed.