Leetcode 354(Hard) Russian Doll Envelopes: Simple C++ Solution

Описание к видео Leetcode 354(Hard) Russian Doll Envelopes: Simple C++ Solution

In this video, I provide a simple solution with an explanation to the Leetcode 354: Russian Doll Envelopes After Self in the hard category. The problem is a 2D version of the Longest Increasing Subsequence Problem, we reduce this problem to the one-dimensional equivalent. The solution to which we implement in O(Nlog(N)) time.

Комментарии

Информация по комментариям в разработке