Most interview problems at Google start with arrays. You'll use hash maps for fast lookup, two pointers for optimization, and in-place algorithms for space efficiency.
You'll work through LeetCode problems: Two Sum, 3Sum, Trapping Rain Water, Container With Most Water, Search in Rotated Sorted Array, and First Missing Positive. Each teaches a pattern you'll use repeatedly.
