← Microsoft questions
CodingReported in a candidate post, Nov 2024

Maximum sum of subsequence with no adjacent elements

Filed under Microsoft

Given an array of integers, compute the maximum sum of a subsequence such that no two selected elements are adjacent in the original array (House Robber problem).

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

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