DSAverse
Dynamic Programming
Loading Dynamic Programming...
DP Table Filling
?
?
?
?
?
?
?
?
?
?
?
?
?
?
?
subproblems
O(2^n)→O(n)
Initializing Sorting Algorithms...
Sorting
Trees
Graphs
Preparing interactive visualizations...
Dynamic Programming
Loading Dynamic Programming...
DP Table Filling
Find the longest strictly increasing subsequence in an array using 1D DP. Watch dp[i] values grow as the algorithm discovers longer chains.
Click Play to begin.
O(n²)O(n log n)O(n)Question 1 of 3
What is the initial value of dp[i] in the LIS algorithm?