โ† OYO questions
CodingReported in a candidate post, Sep 2019

Maximum Sum with No Two Elements Adjacent

Filed under OYO

Given an array of positive integers, find 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 OYO questions

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