We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I think the problem should go in another category. The DP solution has n^2 complexity and to pass all tests a non-DP solution is required. Maybe it is discussable weather the nlogn complexity solution is DP or not, but still very misleading here ...
The Longest Increasing Subsequence
You are viewing a single comment's thread. Return to all comments →
I think the problem should go in another category. The DP solution has n^2 complexity and to pass all tests a non-DP solution is required. Maybe it is discussable weather the nlogn complexity solution is DP or not, but still very misleading here ...