Tag: #coding interview

Prefix Sum pattern: LeetCode problems and interview guide

The Prefix Sum pattern is one of the most useful array techniques for solving LeetCode problems involving subarray sums, range queries, cumulative values, and counting subarrays. This section covers common variations, recognition rules, and practical examples from LeetCode.

Linked list patterns for LeetCode and coding interviews

Essential linked list patterns for LeetCode and coding interviews, including traversal, search, and inserting nodes at the front and back

Heap patterns for coding interviews: how to recognize and solve heap problems

Heap problems often look different, but most of them are built around a small set of recurring patterns. Top K Elements, K-way Merge, Two Heaps, and Repeated Min/Max cover the most common ways Heap and Priority Queue are used in LeetCode and coding interview problems.

Fast & Slow pointers pattern: Tortoise and Hare technique for coding interview

The Fast & Slow pointers pattern uses two pointers moving at different speeds to detect cycles, find middle elements, and solve Linked List and sequence problems efficiently.

Binary Search patterns

The Binary Search pattern can be divided into four main variations. Finding a target in a sorted array is Classic Binary Search. The other three - Boundary Search, Binary Search on Answer, and Modified Sorted Data - represent more advanced ways of applying the Binary Search pattern.

PreviousPage 2 of 3Next