https://github.com/emahtab/house-robber
Find the maximum Sum for an array while not including any two adjacent elements
https://github.com/emahtab/house-robber
dynamic-programming leetcode problem-solving
Last synced: 7 months ago
JSON representation
Find the maximum Sum for an array while not including any two adjacent elements
- Host: GitHub
- URL: https://github.com/emahtab/house-robber
- Owner: eMahtab
- Created: 2020-06-07T17:28:24.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2024-10-15T05:01:09.000Z (about 1 year ago)
- Last Synced: 2025-02-02T03:24:49.125Z (9 months ago)
- Topics: dynamic-programming, leetcode, problem-solving
- Homepage:
- Size: 9.77 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0