Yasir Explains/Algorithms
Yasir Explains

Algorithms

All Courses

Algorithms

Master fundamental algorithm design paradigms through interactive visualizations and step-by-step walkthroughs.

Chapters

Greedy Algorithms

String Algorithms

Dynamic Programming

Dynamic Programming (Advanced)

Graphs and Basic Traversal Techniques

Single-Source Shortest Path Algorithms

Max-Flow, NP-Completeness, Backtracking & Branch and Bound

Algorithms feedback

Community voices

Feedback about Algorithms from faculty, students, industrial engineers, and visitors.

Give feedback
Md. Farhan Monsur Adnan
Student

c243097@ugrad.iiuc.ac.bd

Spring 26
Course · Algorithms

Assalamu Alaikum Sir. I really liked both the website and the way you teach the course. Your explanations are clear and easy to understand, which made learning algorithms much more interesting. The website is also very well organized, and having all the course materials in one place makes it really convenient to study. Overall, it has been a great learning experience. Thank you, Sir, for all your effort.

Md. Estiak Hossain Fahim
Student

c243131@ugrad.iiuc.ac.bd

Spring 2026
Course · Algorithms

This learning website is very student-friendly and easy to understand. The explanations are simple, clear, and well-structured, making even complex topics like sorting, graphs, and data structures easy to learn. The UI/UX is clean and user-friendly, which helps learners focus on concepts without confusion. Overall, it is a very helpful platform for beginners as well as university students who want to build a strong foundation in algorithms.

Syed Nafiz Ahnaf
Student

c243147@ugrad.iiuc.ac.bd

5th semester, spring-2026
Course · Algorithms

Problem-Solving Mindset: The course transformed my programming approach by teaching me to systematically break down massive, complex problems into manageable sub-problems. ​Code Optimization: Learning Big-O notation taught me to instinctively prioritize Time and Space Complexity over basic functional correctness. ​Algorithmic Foundations: I gained a solid computational foundation by mastering core paradigms like Divide-and-Conquer, Greedy Algorithms, and Graph Theory. Mathematical Rigor: The transition into abstract mathematical proofs was quite overwhelming, meaning that introducing visual recursion trees first would make the theory much easier to grasp. ​Dynamic Programming (DP): Formulating states and transition tables proved to be highly challenging, which makes dedicating extra tutorial sessions to DP intuition incredibly necessary.

Abrar Shahriar Shahjahan
Student

c243134@ugrad.iiuc.ac.bd

Spring 2026
Course · Algorithms

It was very helpful for me to get through this, as a learner it helped me a lot to understand the topics of this course.Overall a good experience