โ† Paytm questions

Sum of non-consecutive subarray

Filed under Paytm

Given an array of integers, find the maximum possible sum of a subsequence (or subarray without adjacent elements) such that no two selected elements are consecutive 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.