🧮 Two Sum II – Input Array is Sorted

🔍 Problem Statement Given a 1-indexed array of integers numbers that is sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1 <= index...