Doubt Any DP Solution Can Pass the Largest Test Case


  • 0
    B

    The tag indicates this problem is a dynamic programming problem. But I doubt any dynamic programming solution ( with time complexity of O(n^2*m)) can pass the largest test case? Though the binary search is an efficient solution.


Log in to reply
 

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