← Flipkart questions
CodingReported in a candidate post, Jan 2021

Maximum sum without adjacent elements

Filed under Flipkart

Find the maximum sum of a subsequence in an array such that no two elements in the subsequence are adjacent in the original array. AI-generated content.

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

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