Dynamic Programming
Longest Increasing Subsequence (LIS)
Tracks the best increasing subsequence ending at each position.
State view
Longest Increasing Subsequence (LIS)
step 1
Variables
No scalar variables on this step.
Collections
No collection patches on this step.
speed
1.00x
timeline1 / 53
Variables
0 trackedVariables appear as the algorithm updates them.
Call stack
0 framesRecursive algorithms push frames here.
Event log
0 entriesNarrated algorithm events appear here.