Leetcode 354. Russian Doll Envelopes
Given pairs (w,h), find the maximum number of envelopes that can be strictly nested (both width and height increasing) without rotation. Key insight: sort by width (and by height descending for equal widths) and reduce to finding the longest increasing subsequence on heights.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.