Leetcode 1121. Divide Array Into Increasing Sequences

Partition the array's elements into disjoint strictly increasing sequences that together use every element (or decide the minimum number of such sequences / whether a valid partition exists). The core challenge is assigning duplicates across sequences while preserving strict order, typically solved with greedy/priority-queue or matching/flow ideas.