Patience Sort ·
Piles Reveal the LIS
un
seel
.com · O(n log n) Longest Increasing Subsequence · Greedy piles + binary search
Dealt
0
Piles = LIS
0
State
—
Buried card
Pile top (tail)
Binary search / placing
LIS card
▶ Play
←
→
🔇 Unmute
Reset
Un
seel
.com · Patience Sort
Un
seel
.com · Patience Sort and the Longest Increasing Subsequence