Topics
Browse problems by data structure and algorithm topic.
Dynamic Programming
Optimal substructure, overlapping subproblems, and state design.
459 problems
Array
Index-based sequences, scanning, and in-place mutation patterns used in most interviews.
433 problems
Greedy
Locally optimal choices that yield global solutions.
378 problems
Math
Number theory, combinatorics, and arithmetic tricks.
376 problems
SQL
Relational queries and aggregation.
341 problems
String
Character arrays, parsing, pattern matching, and text algorithms.
268 problems
Hash Table
O(1) lookups, frequency maps, and set-based reasoning.
260 problems
Two Pointers
Opposite or same-direction pointers on arrays and strings.
193 problems
Design
Data structure design and API-oriented problems.
165 problems
Binary Search
Search on sorted ranges and answer-space binary search.
137 problems
Tree
Binary trees, traversals, and hierarchical recursion.
120 problems
Breadth-First Search
Level-order exploration and shortest unweighted paths.
115 problems
Graph
Nodes, edges, connectivity, and shortest paths.
107 problems
Sort
Sorting-based solutions and comparison strategies.
99 problems
Depth-First Search
Deep traversal, backtracking setups, and components.
85 problems
Bit Manipulation
Bitwise ops, masks, and constant-space tricks.
75 problems
Stack
LIFO structures for parsing, monotonic stacks, and nested structures.
73 problems
Backtracking
Explore-and-prune search for combinations and permutations.
60 problems
Linked List
Pointer manipulation, reversal, and cycle detection.
47 problems
Binary Heap
Priority queues for top-k, scheduling, and graph algorithms.
44 problems
Simulation
Step-by-step process modeling.
40 problems
Recursion
Base cases, divide-and-conquer, and recursive state.
30 problems
Binary Search Tree
Ordered trees and BST invariants.
28 problems
Constructive Algorithms
Practice Constructive Algorithms interview problems with patterns, complexity analysis, and multi-language solutions.
26 problems
Geometry
Points, lines, intervals, and geometric invariants.
10 problems
Queue
FIFO processing, BFS layers, and sliding windows of events.
9 problems
Concurrency
Multi-threaded coordination problems.
9 problems