The core of every technical interview.
Arrays to graphs: complexity, sorting, dynamic programming, and NP-completeness.
Arrays & lists
Dynamic arrays, linked lists, and complexity analysis
Unit 2Stacks & queues
LIFO and FIFO structures and their applications
Unit 3Trees
Binary trees, search trees, and traversals
Unit 4Balanced trees & heaps
AVL trees and priority queues
Unit 5Hash tables
Hashing, collisions, and load factors
Unit 6Sorting
Comparison sorts and their limits
Unit 7Graphs
Representations, BFS, DFS, and shortest paths
Unit 8Dynamic programming
Memoization and classic DP problems
Unit 9Advanced algorithms
Greedy algorithms, NP-completeness, and heuristics
Unit quizzes
Auto-scored quizzes for every unit, plus a final exam. Each attempt draws fresh questions from a larger bank and shuffles the answers, so retakes are never the same.
Arrays & lists quiz
Five auto-scored questions on arrays & lists.
UNIT 2 · QUIZStacks & queues quiz
Five auto-scored questions on stacks & queues.
UNIT 3 · QUIZTrees quiz
Five auto-scored questions on trees.
UNIT 4 · QUIZBalanced trees & heaps quiz
Five auto-scored questions on balanced trees & heaps.
UNIT 5 · QUIZHash tables quiz
Five auto-scored questions on hash tables.
UNIT 6 · QUIZSorting quiz
Five auto-scored questions on sorting.
UNIT 7 · QUIZGraphs quiz
Five auto-scored questions on graphs.
UNIT 8 · QUIZDynamic programming quiz
Five auto-scored questions on dynamic programming.
UNIT 9 · QUIZAdvanced algorithms quiz
Five auto-scored questions on advanced algorithms.
FINAL EXAMFinal exam
15 questions across every unit.
