You're a robber planning to rob houses along a street. Each house has money, but adjacent houses have connected alarms. If you rob two adjacent houses, the alarm triggers. Given an array of money in each house, return the maximum you can rob without triggering alarms. Example: [,,,] returns (rob houses and ). Example: [,,,,] returns (rob houses , , ).
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/dynamic-programming/problem-house-robber
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████████████████████████████████████████████████████████████████████████████████████████