Line: 1 to 1  

LeetCode Exercise 6  
Changed:  
< <  Due: Nov 3, 11:55 pm  
> >  Due: Nov 1, 11:55 pm  
Moodle Link 
Line: 1 to 1  

LeetCode Exercise 6  
Changed:  
< <  Due: Oct 3, 11:55 pm  
> >  Due: Nov 3, 11:55 pm  
Moodle Link 
Line: 1 to 1  

LeetCode Exercise 6  
Added:  
> >  Due: Oct 3, 11:55 pm  
198. House RobberYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night. 
Line: 1 to 1  

LeetCode Exercise 6  
Line: 9 to 9  
Given a list of nonnegative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.
You are to use dynamic programming for this solution.  
Changed:  
< <  Problem  
> >  Problem  
Changed:  
< <  You are to find a dynamic programming solution to this problem, and implement it on Leetcode.  
> >  You are to find a dynamic programming solution to this problem, and implement it on Leetcode.  
Then you will do a runtime analysis of your solution. 
Line: 1 to 1  

Added:  
> > 
LeetCode Exercise 6
198. House RobberYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night. Given a list of nonnegative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police. You are to use dynamic programming for this solution. ProblemYou are to find a dynamic programming solution to this problem, and implement it on Leetcode. Then you will do a runtime analysis of your solution. Turn in:
