LIS-like DP problem where the direct approach is not optimal
Filed under Amazon
The question
An OA problem similar to the standard Longest Increasing Subsequence problem, but applying LIS directly does not give the optimal solution.
No write-up yet. Related questions below have one.
Related Amazon questions
Collected from public candidate posts and coding forums. Updated Nov 2026.