DS-Algo Playground
Interactive visualizations, multi-language code examples, and quizzes to master Data Structures and Algorithms.
Your Progress
0%Topics
Arrays
Contiguous memory, O(1) random access, dynamic resizing, and common array operations.
Linked Lists
Node-pointer chains, O(1) insert/delete at head, traversal, and pointer manipulation.
Stack
LIFO data structure with O(1) push, pop, and peek operations.
Queue
FIFO data structure with O(1) enqueue and dequeue operations.
Hash Table
Key-value storage with O(1) average lookup using hash functions.
Binary Search Tree
Hierarchical structure enabling O(log n) search, insert, and delete.
Heap
Complete binary tree with O(log n) insert and extract-max/min.
Bubble Sort
Simple comparison sort that repeatedly swaps adjacent elements. O(n²) average.
Selection Sort
Finds the minimum element and places it at the beginning. O(n²).
Insertion Sort
Builds sorted array one element at a time. O(n²) average, O(n) best.
Merge Sort
Divide-and-conquer sort with guaranteed O(n log n). Stable.
Quick Sort
Efficient in-place sort using pivot partitioning. O(n log n) average.
Binary Search
Efficient O(log n) search on sorted arrays by halving the search space.
BFS
Level-by-level graph traversal using a queue. Shortest unweighted paths.
DFS
Explores graph branches as deep as possible using a stack or recursion.
Two Pointers
Scan arrays from both ends for pair-finding and partitioning problems.
Sliding Window
Maintain a window over a contiguous subarray for range problems.
Dynamic Programming
Break complex problems into overlapping subproblems with memoization.
Recursion
Function calling itself. Visualize call stacks and memoization.