Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3288. Length of the Longest Increasing Path
Given n distinct 2D points and an index k, find the maximum length of a strictly increasing sequence by both x and y that contains coordinates[k]. This is a 2D Longest Increasing Subsequence-style problem (n up to 1e5) where you must combine the longest increasing chain ending at k and the longest increasing chain starting at k.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.