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.

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.

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.

Very interesting. I learned a lot of new things. 5 stars!

Just a few things that could be improved:

-- The video and its audio are not really synchronized (maybe because the video is pretty old)

-- The subtitles are not good. Even the english ones were not written by someone who knows what the professor is talking about...

Nowadays there are better solutions to validate whether someone solved a programming task. geeksforgeeks.org and hackerrank.com for example just execute the program with test input.

But all in all: Very positive experience.

I'm absolutely happy with the time that I spent on this course. Now I finished my third course on the Algorithms Specialization from Tim Roughgarden. I love the instructor the way he speaks is amazing. Zero uhmms absolutely zero schmschm. Amazing! I'm looking forward to start the fourth course of the specialization which is the final one. It's been 2 and a half months since I started the Algorithms Specialization. Thanks for such a great content.

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.

Tim does an excellent job explaining things at depth and at the same time keeping things interesting. The quizes and programming assignments are well thought and carefully balanced vs the material taught. They force you to stretch just a bit beyond the lectures, which is a good thing IMHO.

And there is a wealth of advanced/optional material for the curious.

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.

Excellent Course. I really enjoyed it. Stretched my imagination and analytical capacity to new frontiers. The problems studied during the course stimulate you to learn more about new algorithms and coding, There's so much more to learn now. Many thanks to Professor Roughgarden and his team for making this available. Keep the 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!

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!

Great course for who is willing to learn new algorithms and having hard time to learn them alone by reading text box. The explanation is easy and clear. And the material is essential for who want to get started in greedy algorithms and dynamic programming.

It's a hard and challenging course. I'm really excited about the knowledge I gain. The greedy algorithms are really not so easy and you always can make an error. The Union-Find with ranking and Dynamic Programming are the pearl of the Course.

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.

This course is really challenging compared to previous courses. Problems introduced in Dynamic Programming are harder than I expected and course books they recommended will be needed to understand better about the lecturers of this course.

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.

Tim Roughgarden is a fantastic teacher! He really cares about explaining in a simple manner and also give you useful hints and advices to dive deeper in all the topics of the course. Thanks, Tim!

I am very confident in the skills I learned. I have read some books on algorithms but this course makes the application so clear regardless of your programing language.

Very well explained and I learned a lot from the course. Recommended to anyone for learning Algorithms. Some of the problem sets make you think outside the box.

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.

Great course overall, but the problem sets are short of answers or explanations, so sometimes I feel really hard to understander some questions.

A bit more difficult course comparing to the first two parts. Be prepared to spend more times on problem solving and programming assignments.

I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.

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

I love how clear the videos (and notes) are and re-watching them really helped a lot! I wish there was more discussion on the forms though!