Available question text
Find the longest subsequence of nums such that the absolute differences between consecutive chosen elements are non-increasing. This is an LIS-like DP problem where you must track states by last element (or index) and the previous absolute difference — n ≤ 10^4 and values ≤ 300 (so differences are bounded) which guides feasible DP/optimization approaches.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3409. Longest Subsequence With Decreasing Adjacent Difference
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source