House Robber I / II (Recursion to DP)

Phone ScreenDatabricksLast reported August 2026Medium Frequency

Reported: 4× across candidate reports
First seen: June 2025
Last reported: August 2026
Reported outcome: mixed

Problem Overview

Databricks phone screen coding problems in this category span several related forms: 1. House Robber (LC 198 base): Given an array of non-negative integers representing the amount of money at each house, find the maximum amount you can rob without robbing two adjacent houses. Space optimization (O(1) space) is required…

5 candidate-reported follow-ups — the exact probes interviewers asked, with the trigger for each
The rest of the problem statement — full requirements, constraints, and edge cases
Approach and trade-offs — what passing candidates did, and the mistakes that sink people

Unlock the full Databricks catalog

Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Databricks question.

Unlock with Pro

Already a member? Sign in

Verified Source

Every question is reconstructed from multiple independent candidate reports. Verbatim follow-ups, not invented ones.

Codex Fact-Checked

Technical claims, formulas, and scale numbers are reviewed against primary sources.

Interviewer Follow-ups

The exact follow-ups reported by candidates, with the trigger that prompts each one — plus the mistakes that sink people.