LeetCode Question · Feb 2024

TikTok OA Very Hard SDE Longest Concave Subsequence

8 upvotes 1,218 views 3 replies

Question Details

Longest Concave Subsequence: A concave subsequence is a subsequence where the first and last elements are greater than all other elements in between. For example, [100, 0, 25, 11, 200] is...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Arrays Dynamic Programming