← Amazon questions

Longest subsequence with alternating diff less than K

Filed under Amazon

Given a string and an integer K, find the length of the longest subsequence such that the absolute difference between any two adjacent characters in the subsequence is less than K.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.