Optimal Substructure

Loading...
View Syllabus

Skills You'll Learn

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

Reviews

4.8 (1,017 ratings)
  • 5 stars
    87%
  • 4 stars
    11%
  • 3 stars
    2%
  • 2 stars
    0%
  • 1 star
    0%
SW

Feb 25, 2019

One of the best courses to make a student learn DP in a way that enables him/her to think of the subproblems and way to proceed to solving these subproblems. Definitely helpful for me. Thanks.

NT

Jun 14, 2019

As usual with Stanford and Tim Roughgarden, a high-quality course with an informal style but a lot of rigor. The assignments are challenging but doable. Highly recommended.

From the lesson
Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.

Taught By

  • Tim Roughgarden

    Tim Roughgarden

    Professor

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.