AlgoMaster Logo
All categories

DSA Concept Animations

Core data structures and algorithms: arrays, trees, graphs, heaps, sorting, and searching.

Fundamentals

5
Big O Notation
Divide And Conquer
Memoization Vs Tabulation
Recurrence Relation
Recursion Call Stack

Bit Manipulation

5
Bit Masking
Bitwise Operators
Count Set Bits
Power of Two
Single Number

Arrays & Two Pointers

14
Container Most Water
Container Water
Dynamic Array
Fast and Slow Pointers
Gas Station
Jump Game Ii
Kadane's Algorithm
Move Zeroes
Prefix Sum
Quickselect
Sliding Window
Trapping Rain Water
Two Pointers
Two Sum

Linked Lists

1
Linked List

Stacks & Queues

6
Circular Queue
Deque
Monotonic Queue
Monotonic Stack
Queue
Stack

Hashing

2
Hash Table Open Addressing
Hash Table Separate Chaining

Sorting

13
Bubble Sort
Bucket Sort
Counting Sort
Cyclic Sort
Heap Sort
Insertion Sort
Merge Sort
Quick Sort
Radix Sort
Selection Sort
Shell Sort
External Sort
Tim Sort

Searching

2
Binary Search
Naive Search

Backtracking

9
Combination Sum
Generate Parentheses
N Queens
Permutations
Subsets
Sudoku Solver
Word Search
Maze Solver
Subsets via Bitmask

Trees & Heaps

11
Binary Heap
Binary Search Tree
Morris Traversal
Tree Traversals
AVL Trees
B-Trees
Fenwick Tree
Quad Trees
Red Black Trees
Segment Tree
Skip Lists

Tries

2
Autocomplete with Trie
Trie

Dynamic Programming

12
Bitmask Dp
Coin Change
Dp On Trees
Edit Distance
Fibonacci
Knapsack
LCS
Longest Increasing Subsequence
Matrix Chain
Subset Sum
Unbounded Knapsack
Unique Paths

Graphs

17
Cycle Detection
Dijkstra
Graph BFS
Graph DFS
Kruskal
Prim
Topological Sort
Union Find
A* Search
Articulation Points
Bellman Ford
Bipartite Check
Bridges
Floyd-Warshall
Kosaraju's Algorithm
Max-Flow / Min-Cut
Tarjan's Algorithm

String Matching

8
KMP
Aho-Corasick
Boyer-Moore
Manacher's Algorithm
Rabin-Karp
Suffix Array
Suffix Tree
Z-Algorithm