DSA Yatra
Interactive Visualizers
Step through common data structures and algorithms. Play, pause, change speed — build intuition before you code.
Bubble Sort
Watch bubble sort compare and swap adjacent elements step by step.
Selection Sort
Repeatedly pick the smallest remaining element and place it at the front.
Quick Sort
Partition around a pivot and recursively sort the left and right halves.
Merge Sort
Divide the array in halves, sort each side, then merge them back together.
Array Operations
Insert, delete, and access elements to see how arrays shift in memory.
String Palindrome
Two-pointer walk to check if a string reads the same forwards and backwards.
HashMap Buckets
See how keys are hashed to buckets and how collisions chain together.
Two Pointers — Pair Sum
Move two pointers inward on a sorted array to find a target sum.
Sliding Window — Longest Substring
Expand and contract a window to find the longest substring without repeats.
Binary Search
Narrow a sorted range by half at each step to find a target in O(log n).
Recursion — Fibonacci Tree
Expand the recursive call tree for fib(n) and watch values bubble up.
Linked List Operations
Insert, delete, and reverse a singly linked list one pointer at a time.
Stack — Push, Pop & Balanced Parentheses
Push and pop on a LIFO stack, or watch it validate balanced brackets.