Difference: LeetCode9 (1 vs. 4)

Revision 42019-04-21 - JimSkon

Line: 1 to 1
 
META TOPICPARENT name="Math391F2016"

LeetCode Exercise 9

Dynamic Programming
Changed:
<
<
Due: April 22, 9:00am
>
>
Due: April 24, 9:00am
  Moodle Link

Teams

Line: 33 to 33
 
  1. Source code for your solution
  2. Samples runs showing the operation with input and outputs.
  3. An explanation of how this problem includes the concept of an optimal substructure.
Changed:
<
<
  1. A complete runtime asymptotic analysis.
>
>
  1. A complete runtime asymptotic analysis.

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

Revision 32019-03-31 - JimSkon

Line: 1 to 1
 
META TOPICPARENT name="Math391F2016"

LeetCode Exercise 9

Dynamic Programming
Line: 6 to 6
  Moodle Link

Teams

Changed:
<
<
Group 1 Kyle, Thomas
Group 2 Preston, Charlie
Group 3 John, Flynn
Group 4 Isaac, Boning
>
>
Group 1 Preston, Kyle, Thomas
Group 2 John, Flynn
Group 3 Isaac, Boning
 
120. Triangle120

Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.

Revision 22019-03-24 - JimSkon

Line: 1 to 1
 
META TOPICPARENT name="Math391F2016"

LeetCode Exercise 9

Dynamic Programming
Changed:
<
<
Due: Nov 18, 11:55 pm
>
>
Due: April 22, 9:00am
 
Changed:
<
<
Moodle Link
>
>
Moodle Link

Teams

Group 1 Kyle, Thomas
Group 2 Preston, Charlie
Group 3 John, Flynn
Group 4 Isaac, Boning
 
120. Triangle120

Given 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:

Revision 12016-11-11 - JimSkon

Line: 1 to 1
Added:
>
>
META TOPICPARENT name="Math391F2016"

LeetCode Exercise 9

Dynamic Programming
Due: Nov 18, 11:55 pm

Moodle Link

120. Triangle120

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

[
     [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:

  1. Source code for your solution
  2. Samples runs showing the operation with input and outputs.
  3. An explanation of how this problem includes the concept of an optimal substructure.
  4. A complete runtime asymptotic analysis.
Be prepared to discuss you solutions in class.
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 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