LeetCode 300. Longest Increasing Subsequence — Python Solution

Blind 75 — Programming & Technical Interview Questions — Explanation Series

The problem:

The explanation:

The is always the brute solution using depth-first search O(2^n). Then comes the dynamic programming solution O(n²). The is also another O(nlogn) solution that I will not explain since…