← Paytm questions

Maximum sum non-adjacent subsequence

Filed under Paytm · Also reported at Samsung

Given an array of integers, find the maximum sum of a subsequence where no two selected elements are adjacent to each other in the original array.

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

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