A comprehensive collection of problems to master data structures and algorithms. Click the circle to mark problems as solved.
60 must-do Array problems for FAANG interviews
60 problems
Master binary search, sorting techniques, divide & conquer, and classic optimization problems
31 problems
Master matrix traversal, searching, optimization, and classic 2D problems
13 problems
Complete string problems set for coding interviews (Beginner to Hard)
25 problems
Master singly, doubly, and circular linked lists with classic interview and advanced problems
32 problems
Master bitwise operations for optimization, tricks, and low-level problem solving
14 problems
Learn greedy decision making for optimization, scheduling, resource allocation, and classic problems
34 problems
Master recursion, decision trees, and constraint-based search problems using backtracking
20 problems
Master stack and queue operations, monotonic stacks, sliding window, and queue-based BFS problems
Master binary tree traversal, construction, properties, and advanced tree DP problems
30 problems
Master BST properties, construction, traversal, balancing, and advanced BST problems
23 problems
Complete guide to graph traversal, shortest paths, MSTs, SCCs, flows, and classic graph problems
Master heap operations, priority queues, and heap-based optimization problems
21 problems
Master optimization, overlapping subproblems, and classic DP patterns from basic to advanced
Learn prefix-based searching, string processing, and efficient dictionary problems using Trie
10 problems