← Capgemini questions
CodingHard

Maximum length increasing path sequence with difference of 1

Filed under Capgemini

Find and print the length of the longest path sequence starting from any cell in a matrix such that consecutive cells along the path strictly increase with a difference of exactly 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 Capgemini questions

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