Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Python

Solution: Russian Doll Envelopes

Explore how to solve the Russian Doll Envelopes problem by combining sorting and binary search techniques. This lesson guides you through sorting envelopes by width and height, then using a longest increasing subsequence approach on heights with binary search to find the maximum number of envelopes that can be nested. By the end, you will understand the algorithm's implementation and its time and space complexities.

We'll cover the following...

Statement

You are given a 2D array of integers, envelopes, where each element envelopes[i] = [wi, hi] represents the width and height of an envelope. An envelope can fit inside another if and only if its width and height are strictly smaller than the width and height of the other envelope. The task is to determine the maximum number of envelopes that can be nested inside each other, similar to Russian dollsRussian dolls, also known as stacking dolls or nesting dolls, are a set of wooden dolls of decreasing size placed one inside another. .

Constraints:

  • 1≤1\leq envelopes.length ≤103\leq 10^3 ...