Deck · Coding Interview Prep
Data Structures & Algorithms
Interview canon for data structures and algorithms: arrays, hashmaps, stacks/queues, linked lists, trees, heaps, graphs, sorting, searching, recursion, dynamic programming, Big-O, two pointers, and sliding window (CLRS-aligned).
53 cards · audited · SM-2 spaced repetition
Included with the full Coding Interview Prep program — 3 decks, 156 cards.
Sample cards
What is Big-O notation?
What do Θ (Theta) and Ω (Omega) notations mean?
What is the time complexity of accessing an element by index in an array?
What is the average time complexity of hash map lookup, insert, and delete?
What two collision-resolution strategies do hash tables use?
Showing 5 of 53 cards. Unlock the program to study them all.
More in Coding Interview Prep
Master data structures & algorithms — and the rest of Coding Interview Prep.
One program. 156 audited cards across 3 decks.