📊 Arrays
Arrays are the foundation of every coding interview. Most interview problems can be reduced to "scan this array efficiently." Master the four core techniques here and you have a tool for ~40% of LeetCode.
This category contains 45 problems. Use the patterns below to recognize what's being asked, then jump to the problem list at the bottom.
🧠 Key Patterns
- Two Pointers — Sorted array, find pair/triplet, partition. Move two indices inward or in lockstep.
- Sliding Window — Subarray with property (sum, length, distinct). Grow right, shrink left.
- Binary Search — Sorted/monotonic array, search for value or boundary. .
- Prefix Sum / Difference Array — Range sum queries, count-of-prefix tricks. range after prep.
- Hash Map — Lookups, frequency counts, complement pairs (e.g. Two Sum).
- Kadane / DP-on-array — Max subarray, contiguous best/worst.
⚠️ Common Pitfalls
- Off-by-one in
left <= rightvsleft < rightbinary search loops. - Sliding-window: forgetting to shrink the window when the constraint breaks.
- Integer overflow in
(left + right) / 2— useleft + (right - left) / 2.
📚 Study Resources
📺 Videos
- NeetCode — Arrays & Hashing playlist
- Aditya Verma — Sliding Window Master Class
- Errichto — Binary Search
📖 Books
- Cracking the Coding Interview — Gayle Laakmann McDowell — Ch. 1 (Arrays & Strings)
- Algorithm Design Manual — Steven Skiena — Ch. 3 (Data Structures), Ch. 4 (Sorting)
- Elements of Programming Interviews (C#/Java/Python) — Aziz, Lee, Prakash — Ch. 5–6
🌐 Articles & References
💻 All Arrays Problems
Sum
LeetCode 15 | Difficulty: Medium
Sum Closest
LeetCode 16 | Difficulty: Medium
Sum
LeetCode 18 | Difficulty: Medium
Check If a Number Is Majority Element in a Sorted Array
LeetCode Link
Container With Most Water
LeetCode 11 | Difficulty: Medium
Contains Duplicate
LeetCode 217 | Difficulty: Easy
Contains Duplicate II
LeetCode 219 | Difficulty: Easy
Count Number of Nice Subarrays
LeetCode 1370 | Difficulty: Medium
Find Minimum in Rotated Sorted Array
LeetCode 153 | Difficulty: Medium
Find Minimum in Rotated Sorted Array II
LeetCode 154 | Difficulty: Hard
K Radius Subarray Averages
LeetCode 2211 | Difficulty: Medium
Longest Turbulent Subarray
LeetCode 1020 | Difficulty: Medium
Longest Turbulent Subarray
LeetCode 978
Majority Element
LeetCode 169 | Difficulty: Easy
Majority Element II
LeetCode 229 | Difficulty: Medium
Maximum Average Subarray I
LeetCode 643 | Difficulty: Easy
Maximum Length of Repeated Subarray
LeetCode 718 | Difficulty: Medium
Maximum Product Subarray
LeetCode 152 | Difficulty: Medium
Maximum Size Subarray Sum Equals k
LeetCode Link
Maximum Subarray
LeetCode 53 | Difficulty: Medium
Maximum Subarray
LeetCode 53 | Difficulty: Medium
Maximum Subarray Sum with One Deletion
LeetCode 1288 | Difficulty: Medium
Minimum Size Subarray Sum
LeetCode 209 | Difficulty: Medium
Missing Ranges
LeetCode Link
Move Zeroes
LeetCode 283 | Difficulty: Easy
Pivot Index
LeetCode 724 | Difficulty: Easy
Plus One
LeetCode 66 | Difficulty: Easy
Product of Array Except Self
LeetCode 238 | Difficulty: Medium
Recover the Original Array
LeetCode 2241 | Difficulty: Hard
Remove Duplicates from Sorted Array
LeetCode 26 | Difficulty: Easy
Remove Duplicates from Sorted Array II
LeetCode 80 | Difficulty: Medium
Remove Duplicates from Sorted List
LeetCode 83 | Difficulty: Easy
Remove Duplicates from Sorted List II
LeetCode 82 | Difficulty: Medium
Rotate Array
LeetCode 189 | Difficulty: Medium
Search in Rotated Sorted Array
LeetCode 33 | Difficulty: Medium
Search in Rotated Sorted Array II
LeetCode 81 | Difficulty: Medium
Search Insert Position
LeetCode 35 | Difficulty: Easy
Sliding Window Maximum
LeetCode 239 | Difficulty: Hard
Subarray Product Less Than K
LeetCode 713 | Difficulty: Medium
Subarray Sum Equals K
LeetCode 560 | Difficulty: Medium
Subarrays with K Different Integers
LeetCode 1034 | Difficulty: Hard
Summary Ranges
LeetCode 228 | Difficulty: Easy
Trapping Rain Water
LeetCode 42 | Difficulty: Hard
Two Sum
LeetCode 1 | Difficulty: Easy
Two Sum II - Input Array Is Sorted
LeetCode 167 | Difficulty: Medium