Leetcode 300. Longest Increasing Subsequence

Given an array of integers, return the length of the longest strictly increasing subsequence; the core challenge is to compute this efficiently—naive DP is O(n^2) but it can be reduced to O(n log n) using a patience‑sorting / binary‑search on tails approach.