Problem Statement
Max money robbing houses. Cannot rob adjacent houses.
Approach
dp[i] = max(dp[i-1], dp[i-2] + nums[i]). Take or skip.
Time & Space Complexity
Time O(n), Space O(1).
This experience deserves a bigger screen
The DSA Visualizer is designed for deep focus,
side-by-side code, and real-time execution insight.
On small screens, that level of clarity can't be preserved.
Open on a tablet (landscape) or desktop for the intended experience.
Desktop experience preview