Data Structures

Learn data structures for coding interviews: arrays, linked lists, stacks, queues, hash tables, trees, heaps, graphs, and tries.

Concepts

Ordered indexable collection for O(1) access by position.

Nodes linked by pointers — insert and delete without shifting a contiguous block.

Last-in, first-out collection for undo, parsing, and nested work.

First-in, first-out collection for scheduling, BFS, and buffering.

Key-to-value lookup in average O(1) via hashing into buckets.

Hierarchical nodes with parent–child links for ordered and nested data.

Priority queue backed by a binary heap for fast min or max access.

Nodes and edges modeling networks, dependencies, and paths.

Prefix trees for fast autocomplete, dictionary lookup, and word search.