DSA Concept Animations

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

Fundamentals

5

Divide And Conquer

Memoization Vs Tabulation

Recurrence Relation

Recursion Call Stack

Bit Manipulation

5

Bitwise Operators

Arrays & Two Pointers

9

Container Water

Fast and Slow Pointers

Kadane's Algorithm

Linked Lists

1

Stacks & Queues

6

Monotonic Queue

Monotonic Stack

Hashing

2

Hash Table Open Addressing

Hash Table Separate Chaining

Sorting

13

Searching

2

Backtracking

9

Combination Sum

Generate Parentheses

Subsets via Bitmask

Trees & Heaps

11

Binary Search Tree

Morris Traversal

Tree Traversals

Red Black Trees

Tries

2

Autocomplete with Trie

Dynamic Programming

12

Longest Increasing Subsequence

Unbounded Knapsack

Graphs

17

Cycle Detection

Topological Sort

Articulation Points

Bipartite Check

Kosaraju's Algorithm

Max-Flow / Min-Cut

Tarjan's Algorithm

String Matching

8

Manacher's Algorithm