Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 354. Russian Doll Envelopes
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source