Back

Tuesday common C++ interview problem: Longest increasing subsequence.

Given an array of integers (std::vector<int>), determine the length of the longest increasing (not necessarily contiguous) subsequence.

O(n^2) solution is sufficient, O(nlogn) solution is achievable.

Solve it yourself: https://compiler-explorer.com/z/r3x953ajK
Solution: https://compiler-explorer.com/z/4rodz65xv