LeetCode 198: House Robber — Step-by-Step Visual Trace
📰 Dev.to · tracelit
Given an array of non-negative integers representing the amount of money in each house, determine the maximum amount you can rob without robbing two adjacent houses.
Given an array of non-negative integers representing the amount of money in each house, determine the maximum amount you can rob without robbing two adjacent houses.