Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

Click here to see the full article post

Space complexity for approaches #2 and #3 should be O(N) for the recursive call stack.

N is redundant in this problem. The complexity of #2 and #3 should be expressed in terms of K: O (log K).

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.