Line: 1 to 1 | ||||||||
---|---|---|---|---|---|---|---|---|

## LeetCode Exercise 9## Dynamic Programming | ||||||||

Changed: | ||||||||

< < | ## Due: April 22, 9:00am | |||||||

> > | ## Due: April 24, 9:00am | |||||||

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. 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 ## Hints:Turn in: - Source code for your solution
- Samples runs showing the operation with input and outputs.
- An explanation of how this problem includes the concept of an optimal substructure.
| ||||||||

Changed: | ||||||||

< < | - A complete runtime asymptotic analysis.
| |||||||

> > | - A complete runtime asymptotic analysis.
| |||||||

Be prepared to discuss you solutions in class. \ No newline at end of file |

View topic | History: r4 < r3 < r2 < r1 | More topic actions...

Copyright © 2008-2019 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.

Ideas, requests, problems regarding TWiki? Send feedback

Ideas, requests, problems regarding TWiki? Send feedback