No. This kata just requires an O(n log n) algorithm to solve, you don't need any require() calls to work. An O(n^2) one will fail the test though.
this needs an answer though
Loading collection data...
No. This kata just requires an O(n log n) algorithm to solve, you don't need any require() calls to work. An O(n^2) one will fail the test though.
this needs an answer though