Learn Algorithms & Data Structures

Shortest path in weighted graphs with non-negative edges.

Layer-by-layer traversal; finds shortest path in unweighted graphs.

Explores deeply first; basis for cycle detection and traversals.

Order DAG nodes to respect dependencies.

Efficiently merges sets and checks connectivity with path compression.

Greedy algorithm for minimum spanning tree using sorting and DSU.

Linear-time maximum subarray sum.

Maintain a moving window to handle subarray/substring problems.

Divide-and-conquer sort using partitioning.

Stable divide-and-conquer sort with O(n log n).

Contiguous storage with O(1) indexing.

Nodes linked by pointers; flexible inserts/deletes.

LIFO structure; great for undo, parsing, DFS.

FIFO structure; scheduling, BFS.

Key-value with expected O(1) ops via hashing.

Retrieve min/max in O(log n).

Ordered tree enabling sorted ops; rotations keep balance.

Prefix tree for fast string queries.

Range queries and updates in O(log n).

Compact structure for prefix sums in O(log n).