A naukri.com initiative
Medium
1w
348
Image Credit: Medium
Dynamic Programming — Longest Increasing Subsequence
- We are given an array of numbers.
- Our goal is to find the length of the longest increasing subsequence.
- The recurring theme to solve this is using dynamic programming.
- The time complexity of the solution is O(n²).
Read Full Article
20 Likes
For uninterrupted reading, download the app