← Oracle questions

House Robber problem

Filed under Oracle · Also reported at OYO

Given an array of non-negative integers representing the amount of money in each house, determine the maximum amount you can rob tonight without robbing two adjacent houses.

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

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