LeetCode 167 — Two Sum II (Input Array Is Sorted) | Full Solution Explained

Difficulty Pattern Companies Leetcode Link Medium Two Pointers Amazon, Google, Microsoft, Adobe leetcode.com/problems/two-sum-ii-input-array-is-sorted 📌 Before reading this post, I recommend reading the Two Pointers Pattern Guide on this blog. It will make this solution click much faster. If you’ve solved the original Two Sum (LeetCode #1), you might think this is the same problem. It’s not — and that one small difference (the array is sorted) completely changes the best approach. This problem is a textbook example of the Two Pointers pattern. Once you understand why the solution works — not just what the solution is — you’ll be able to apply the same logic to dozens of other problems. Let’s go through everything from scratch. The Problem Given a 1-indexed array of integers called numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Return the indices of the two numbers (1-indexed) as an integer array of length 2. C