Learner Reviews & Feedback for Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming by Stanford University

The course was excellent. I did not have enough time for all the optional videos, but I still feel like I learned a ton and I can always come back to them later, which is great. This specialization feels like it's getting a little easier for me with every course, which means that it's very well constructed and doing what it's supposed to do.

Some assigments are really difficult. Often I was glad to read some tips in the forum. But the course is definitely challenging and makes you learn many things.

Very great class!

Great material and love the professor, Tim. Some quiz questions are tricky, but liked it overall.

Great Pace - good examples - always going to the point - clear and providing good info in regards to the subject in study.

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.

Nice course

Harder than the first two courses and I really enjoy it!

Excellent course, I found this course hard as compared to earlier two courses. Many of the Lectures needs to be viewed twice to understand to my minimum level of satisfaction. Quizzes make sure that you understand concepts well and programming assignments are excellent!

NICE

The most difficult course in the specialization so far. I learned a lot.

Difficult but enriching course! Really helpful to me :D

Really great and challenging course!!!!

Great course! Challenging and fun.

hard but worthwhile

Fantastic course that covered a good variety of content in sufficient details and delves into the fundamentals without sacrificing clarity.

I thought this course was kind of harder than the 2 previous one in the specialization (mainly the problems sets which require way more thinking)

It's a very good quality course to strenghten the basics, but in depth.

Dynamic Programming is much more clear to me after watching these lectures.

I really liked this course as well as the first two courses from the algorithms specialization. I agree with other reviewers that this course is more challenging, which is a good thing - I learned a lot and enjoyed solving harder problems.

The course is very detailed and does complete justice to the title. I would call this an intermediate level course and would recommend that this be done after the first two courses in the specialization.

Coming to the quality of lectures. The material was presented in a very logically consistent manner. By far the best lectures on dynamic programming that I've seen.

I have only say, fantastic.

The best Coursera class I took so far! The instructor has a good pedagogic approach -- for every problem he discusses, he starts with an intuitive explanation illustrated on a simple example, and afterwards provides a rather rigorous justification for the algorithms (omitting only secondary details).

I found the problems challenging, and the quizzes required quite some thought, not only repeating/slightly modifying statements made already in the lectures. This made it feel closer to a real class than the other Coursera courses I took so far.

It was a great course, I really want to thank Tim for another great work.

Excellent lectures on Dynamic Programming! The examples chosen in lectures are really typical! I tried to practice on more DP problems on Geeksforgeeks. Surprisingly many DP problems are just extension of the examples gone through in these videos. Reading the CLRS book after watching the lectures become much much easier!

I like this course, though some programming assignments takes me much time. It worth doing it. I learn a lot from this course.