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.