Wei En completed this course, spending 4 hours a week on it and found the course difficulty to be medium.
Professor Roughgarden has done a great job in explaining the content. I've finally understood what big-O notation, etc. means, after taking this course. The lack of interactive visuals (which I find to be necessary for studying how an algorithm works) may bother you.
The exercises are quite well done and provide a few challenging questions. Additionally, there are theory problems in the course pages which are optional and gets students to think creatively.
In general, this is a great introduction to algorithms, if you're not particularly bothered by the lack of interactive visuals.