Grokking the Coding Interview Patterns

Master the Two Pointers pattern: move two pointers through arrays, strings, or linked lists to find pairs, reverse, or partition data in linear time without nested loops.

Learn the Fast and Slow Pointers pattern: move two pointers at different speeds to detect cycles, find middle nodes, and solve linked list problems in O(1) space.

Use the Sliding Window pattern to process subarrays and substrings with a fixed or dynamic window, replacing nested loops with linear-time solutions.

Solve interval problems with confidence: merge overlapping ranges, insert new intervals, and find intersections or gaps for scheduling and timeline challenges.

Reverse, reorder, and modify linked lists in place by rewiring node pointers, solving classic linked list problems in O(1) extra space without building new lists.

Use the Two Heaps pattern to split data between a min-heap and a max-heap, giving fast access to middle values for problems like finding the median of a data stream.

Learn K-way Merge to combine k sorted arrays, lists, or streams into one sorted output using a min-heap, solving merge and kth-smallest problems efficiently.

Find the k largest, smallest, or most frequent elements with the Top K Elements pattern, using heaps to handle large or streaming data without sorting everything.

Adapt binary search to find targets, first and last occurrences, peaks, and elements in rotated sorted arrays, cutting the search space in half at every step.

Generate all subsets, combinations, and permutations with the Subsets pattern, using backtracking, iteration, or bit manipulation to explore every choice.

Makes locally optimal choices at each step, aiming for a globally optimal solution in problem-solving scenarios, often without reassessment.

Master backtracking to explore every possible choice, undo dead ends, and solve constraint problems like N-Queens, Sudoku, permutations, and combination sums.

Solves complex problems by breaking them into smaller overlapping subproblems and storing results to avoid redundant computations, optimizing time and space.

Use Cyclic Sort to place numbers from a 1 to n range at their correct index in place, quickly finding missing, duplicate, or misplaced numbers in O(n) time.

Learn Topological Sort to order nodes in a directed acyclic graph by their dependencies, solving course scheduling, build order, and task sequencing problems.

Combine sorting with binary search to organize data first and then query it fast, solving pairing, closest-value, and range problems more efficiently.

Solve matrix problems by traversing and transforming 2D grids: rotate, spiral, search, and update cells by row and column to master common grid challenges.

Use stacks and their last-in, first-out order to solve problems like balanced parentheses, expression evaluation, and undo operations with clean, efficient logic.

Learn graph fundamentals: represent nodes and edges, then traverse and analyze their connections to solve problems on networks, relationships, and paths.

Use Tree Depth-First Search to explore each branch fully before backtracking, solving path sum, tree height, and traversal problems with recursion or a stack.

Use Tree Breadth-First Search to visit nodes level by level with a queue, solving level order traversal, minimum depth, and tree view problems efficiently.

Learn the Trie (prefix tree) data structure to store words character by character, enabling fast prefix search, autocomplete, and word lookup.

Use hash maps to store key-value pairs with near constant-time lookup, insertion, and deletion, solving counting, frequency, and two-sum style problems fast.

Learn to track only the state a problem needs, such as counts, indices, or frequencies, to simplify logic and turn brute-force solutions into efficient ones.

Master Union Find (Disjoint Set Union) to merge sets and check connectivity fast, solving connected components, cycle detection, and network problems.

Design custom data structures, like LRU caches, by combining or extending standard ones to meet specific operation and performance requirements.

Use bitwise operations like AND, OR, XOR, and shifts to work directly on binary bits, solving problems like finding unique numbers and counting set bits.

Applies mathematical concepts and geometric properties to solve problems efficiently, often involving calculations, number properties, coordinate geometry, or transformations.

Put your skills to the test with coding challenges across patterns, practicing how to spot the right approach and write efficient algorithms.

Use a Monotonic Stack that keeps elements in increasing or decreasing order to find the next or previous greater or smaller element in linear time.

Use Prefix Sums to precompute running totals and answer any subarray sum query in constant time, solving range sum and subarray counting problems efficiently.

Use an Ordered Set to keep elements sorted as you insert, remove, and search, finding floor, ceiling, and kth elements efficiently in dynamic data.

Use a Segment Tree to answer range queries like sums, minimums, or maximums and update array values in O(log n) time, ideal for dynamic range query problems.

Learn the Binary Indexed Tree (Fenwick Tree) to compute prefix sums and update array elements in O(log n) time, solving range sum problems efficiently.

Use Graph Depth-First Search (DFS) to explore each path fully before backtracking, solving connectivity, pathfinding, and cycle detection problems.

Use Graph Breadth-First Search (BFS) to explore a graph level by level with a queue, finding shortest paths in unweighted graphs and solving connectivity problems.

Use State-Space BFS to explore possible states level by level, finding the fewest moves or transformations needed to reach a target, as in puzzles and word ladders.

Treat grid cells as graph nodes and neighboring moves as edges, then apply BFS and DFS to solve pathfinding, island counting, and region-based grid problems.

Find minimum-cost paths in weighted graphs using Dijkstra's algorithm and related techniques, solving network delay, routing, and cheapest-path problems.

Learn Minimum Spanning Trees with Kruskal's and Prim's algorithms to connect all nodes of a weighted graph at the lowest total cost, without any cycles.

Go beyond basic traversal with advanced graph algorithms for strongly connected components, cycle detection, connectivity, and network flow problems.