Any solution with O(n^2) or less time complexity?


  • 0
    J

    It seems to me the proposed solutions are mostly O(n^3) time complexity with some pruning. Would appreciate some idea on O(n^2) or less time complexity?


Log in to reply
 

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