What you can study here
The lab currently covers sorting, searching, stack, queue, linked list, graph traversal, Dijkstra's algorithm, tree traversal, N-Queens, Fibonacci dynamic programming, activity selection, two sum, and min-heap insertion.
Student-focused DSA practice
DSALab is a small learning project built for students who want to understand what an algorithm is doing, not just memorize code. Each topic pairs a visual walkthrough with short notes and implementations in JavaScript, Python, Java, and C++. The goal is simple: make the movement of pointers, queues, recursion, heaps, and graph traversal easier to see.
The lab currently covers sorting, searching, stack, queue, linked list, graph traversal, Dijkstra's algorithm, tree traversal, N-Queens, Fibonacci dynamic programming, activity selection, two sum, and min-heap insertion.
The explanations are intentionally direct. They focus on what changes at each step: which values are compared, which node is visited, which item enters a queue, or why a recursive branch is abandoned.
DSALab is best for beginners, college students, and self-learners preparing for programming interviews or strengthening their computer science fundamentals.