Line: 1 to 1  

LeetCode Exercise 9Dynamic Programming  
Changed:  
< <  Due: April 22, 9:00am  
> >  Due: April 24, 9:00am  
Moodle Link
Teams  
Line: 33 to 33  
 
Changed:  
< < 
 
> > 
 
Be prepared to discuss you solutions in class. \ No newline at end of file 
Line: 1 to 1  

LeetCode Exercise 9Dynamic Programming  
Line: 6 to 6  
Moodle Link
Teams  
Changed:  
< < 
 
> > 
 
120. Triangle120Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. 
Line: 1 to 1  

LeetCode Exercise 9Dynamic Programming  
Changed:  
< <  Due: Nov 18, 11:55 pm  
> >  Due: April 22, 9:00am  
Changed:  
< <  Moodle Link  
> >  Moodle Link
Teams
 
120. Triangle120Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.  
Line: 10 to 12  
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.
For example, given the following triangle  
Deleted:  
< <  
[  
Changed:  
< <  [2], [3,4], [6,5,7], [4,1,8,3]  
> >  [2], [3,4], [6,5,7], [4,1,8,3]  
]
The minimum path sum from top to bottom is 11 (i.e., 2 + 3 + 5 + 1 = 11).  
Changed:  
< <  Note: Bonus point if you are able to do this using only O(n) extra space, where n is the total number of rows in the triangle.  
> >  Note: Bonus point if you are able to do this using only O(n) extra space, where n is the total number of rows in the triangle.  
You are to find a dynamic programming solution to this problem, and implement it on Leetcode.
Hints: 
Line: 1 to 1  

Added:  
> > 
LeetCode Exercise 9Dynamic ProgrammingDue: Nov 18, 11:55 pm120. Triangle120Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the following triangle
[ [2], [3,4], [6,5,7], [4,1,8,3] ] The minimum path sum from top to bottom is 11 (i.e., 2 + 3 + 5 + 1 = 11). Note: Bonus point if you are able to do this using only O(n) extra space, where n is the total number of rows in the triangle. You are to find a dynamic programming solution to this problem, and implement it on Leetcode. Hints:Turn in:
