Lower bound versus upper bound tails [mp]

Micro pattern¶

Description¶

Use the first tail at least the value for strict growth and the first greater tail when equality may extend a sequence.

Problems¶

• 300. Longest Increasing Subsequence (Top Medium)
• 354. Russian Doll Envelopes (Dynamic Programming)
• 1964. Find the Longest Valid Obstacle Course at Each Position (Dynamic Programming)