Algorithms
Bit Manipulation
Use AND, OR, XOR, and shifts to solve problems directly on the binary representation of numbers, often in O(1) space.
Read →
A field guide to engineering concepts
Look up how it actually works.
Search the library, filter by discipline, and open the concept behind the interview prompt.
- 34Concepts
- 2Disciplines
- 5Categories
- 34Matching
Data Structures
Arrays
Ordered indexable collection for O(1) access by position.
Read →
Data Structures
Linked Lists
Nodes linked by pointers — insert and delete without shifting a contiguous block.
Read →
Data Structures
Stacks
Last-in, first-out collection for undo, parsing, and nested work.
Read →
Data Structures
Queues
First-in, first-out collection for scheduling, BFS, and buffering.
Read →
Data Structures
Hash Tables
Key-to-value lookup in average O(1) via hashing into buckets.
Read →
Data Structures
Trees
Hierarchical nodes with parent–child links for ordered and nested data.
Read →
Data Structures
Heaps
Priority queue backed by a binary heap for fast min or max access.
Read →
Data Structures
Graphs
Nodes and edges modeling networks, dependencies, and paths.
Read →
Data Structures
Tries
Prefix trees for fast autocomplete, dictionary lookup, and word search.
Read →
Search
No concepts found
Try a different search term, or browse concepts by category.