01 — problem
Russian Doll Envelopes — LeetCode #?. Full problem statement, examples, and constraints live at https://leetcode.com/problems/russian-doll-envelopes. DSAPatterns tracks this problem for pattern coverage and progress tracking.
02 — notes
Full examples and constraints live on the original LeetCode prompt. Use the link in the sidebar when you want the canonical statement.
03 — hints
Start by identifying the core longest increasing subsequence (lis) idea that reduces the search space.
If you get stuck, check whether a standard longest increasing subsequence (lis) technique applies here.