LIS

Definition

Finding the length of the longest strictly increasing subsequence in an array. Solved in O(N^2) using standard DP, or O(N log N) using Binary Search + DP.

Explain Like I'm New

Given a random list of numbers, finding the longest chain of numbers you can pick out that keep going up, without rearranging them.

Interactive Coding Challenges

Longest Increasing Subsequence

Solution Code

Console output will appear here...

O(N^2) Time. (Can be optimized to O(N log N) using Binary Search)