Dynamic Programming (DP) Longest Increasing Subsequence [3 techniques] In this article, we have explained the problem of Longest Increasing Subsequence along with 3 techniques (Brute force, Binary Search, Dynamic Programming).
Data Structures Dynamic Array Dynamic Array solves the problem of array where the size needs to fixed beforehand. On average, dynamic array achieves same performance as an array by using resize operation.