Nlgn using recursive???

  • 0

    how to find the shortest array including middle 2 in n? Is it possible?

  • 0

    O(nlogn) does not necessarily imply that you have to use divide and conquer technique. All numbers in the array are positive. What does this tell you?

Log in to reply

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