tag

#lis

3 pages tagged

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 354: Russian Doll Envelopes

Problem Restatement We are given a list of envelopes. Each envelope has: [width, height] One envelope can fit inside another only if both dimensions are strictly smaller. That means: w1 < w2 and h1 < h2 We want the maximum number of envelopes we can nest inside each other. This is called the Russian doll property. We may reorder the envelopes in any way. Input and Output Item Meaning Input...
leetcode dynamic-programming binary-search lis sorting May 10, 2026
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Patience Sort

Patience Sort Patience sort builds a set of piles using rules similar to the patience card game. Each element is placed on the leftmost pile whose top element is greater than or equal to it. After all elements are distributed into piles, the piles are merged to produce a sorted sequence. This algorithm is closely related to the longest increasing subsequence problem. Problem Given a sequence $A$ of length $n$,...
algorithms sorting patience-sort lis
Wiki › Algorithms › 01. Searching and Sorting › 9. Partial, Online, and Adaptive Sorting ›

Patience Sorting (LIS)

Patience Sorting for LIS Patience sorting is a technique that simulates a card game to compute the longest increasing subsequence (LIS) . It builds piles with specific ordering rules and uses binary search to maintain efficiency. You use it when you need the LIS in ( O(n \log n) ) time. Problem Given a sequence ( A ) of length ( n ), find the longest strictly increasing subsequence: [...
algorithms sorting lis patience-sorting