← MAQ Software questions

Max sum non-adjacent, function overriding, snake & ladder, N-Queens

Filed under MAQ Software

Given an array of positive integers, find the maximum sum of a subsequence such that no two elements in the subsequence are adjacent 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 MAQ Software questions

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