← Google questions
CodingReported in a candidate post, Mar 2025

Longest increasing subsequence where adjacent elements differ by exactly 1

Filed under Google

Given an integer array, find the length of the longest subsequence in which each chosen element is exactly 1 greater than the previous one (increasing, adjacent chosen elements differ by 1)…

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 Google questions

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