The Complete Data Structures and Algorithms Course in Python (Udemy.com)

Elshad did an amazing job. It is easy to see that he cares a lot about his students through the quality of his work and the effort that goes into everything he does. He is thorough in his explanations and consistent in his presentation of every data structure. On top of that, he has created several animated slides to illustrate what is happening with the code. I can tell that he even thinks about the smallest details when he makes his slides, such as how to position information on the screen so it can be easily acquired, and his points are clear. I cannot imagine how many hundreds of hours went into making this course, including presenting the topics, writing Python code for each data structure, and providing example problems to help prep for interviews. After each section, he has included a way for students to add suggestions and give him feedback on that section so that he can make it better (and he does implement changes based on those suggestions). What more could someone ask for in a teacher?

This is one of the best course that one should enroll in if looking to understand DSA in depth in Python. The instructor has taken a lot of effort to make this course comprehensive and easy to understand with lot of visualization techniques. I would recommend everyone for this course.

This course is Excellent for me to learn Data Structures and Algorithms. For a non-CS background student like me, this course is perfect for learning DSA in Python. The animations are Great and easily understandable for anyone.

Honestly the best course on DSA. Thing about DSA is you'll never find a proper course that covers all topics and this one goes above and beyond in that regard. That being said, the downside is that the lectures aren't presented in an engaging way and you might often find yourself watching them at 1.5x speed.

I am sure a lot of effort went into designing this course, and there's also the fact that this course covers a wide range of topics. Hence, the three-star rating. The algorithms are also well-explained. However, as others have said, you don't really explain the code. For instance, your coding implementation of the Deletion in Trie, Topological Sort, and BFS for SSSPP were below average, and a lot of time was spent figuring out why you did what you did in the code. The implementation of Prim’s Algorithm is needlessly complex, and apparently, you’ve stopped responding too?

Elshad explains concepts in a very simple way. His way teaching skills makes this subject very easy to understand. Never found anyone who explained the DSA concepts in such an easy manner, and with real life examples. It has become one of my most favourite courses, just because of him. Elshad is one my most favourite teachers now. Thank you Elshad. Keep up the good work.

Generally speaking, it´s a well-organized course where I, as a beginner with zero experience could quickly grasp the concepts and principals of different data structures and algorithms. Meantime, I'm happy to see that the teacher has updated new lectures about graphs and Dijkstra Algo, which facilitated my understanding of these chapters. The most difficult part I think is dynamic programming as well as its corresponding exercises. A little suggestion: I think it'll be better if Elshad could make more videos explaining how to write the code and the logic behind it. For a beginner like me, I find it pretty hard...Plus, please upload more lectures on backtracking, I'll come back one day!

I am enjoying this course, the dry runs for Trees, Binary Trees and Graphs were amazing and easily understandable. Recently I finished Divide and Conquer, The dry runs can be better, specially in the second part where we have problems like p1= x+fn(p+1,q) followed by p2=fn(p,q+1) and then we take max or min of these two. But overall the course is amazing

The programming tricks and patterns are VERY useful (for example how to solve recursion problems). Sometimes though, there are some shortcuts which aren't explained or aren't really understandable. For example in Graph traversal algorithms we're told the 'visitedNodes array' should only contain visited elements. We then proceed to add to it both visitedElements AND unvisited neighbour nodes already present in the 'queue of nodes to process' (because some other node had the same neighbour). You can fix that in a number of ways. Now, the result is essentially the same as that obtained in the video, but when you're first learning about graphs you can spend an insane amount of time wondering why you added both visited and unvisited nodes to a structure called "visited". There are unexplained shortcuts like that here and there, and sometimes the videos are too detailed for not much really, but some tricks and examples shown make the concepts so much clearer ! Thanks !

good : - this course gathers all topics related to data structures and algorithms in one place, - the theory is very well explained - once you ask a question, the instructor and other students try to help you understand the answer bad : - the codes some times are buggy, but they get fixed as soon as reported - the codes in the resources mostly include no documentation - the algorithms which include lots of recursion in the code are really tough to trace and hence tough to follow the execution conclusion : for this price , this course is a great reference to review and brush up your knowledge on data structures and python. 100% worth going for. thank you Elshad.