← Accenture questions
CodingEasy to Medium

Longest subsequence with adjacent difference k

Filed under Accenture

Given an array of integers `nums` and an integer `k`, find the length of the longest subsequence such that the absolute difference between any two adjacent elements in the subsequence is equal to `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 Accenture questions

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