You are given a sorted array of distinct integers `numbers`. Determine whether there exist two elements in the array that add up to a specified target sum `targetSum`. If such a pair exists, return the indices of these two elements in the array. Otherwise, return an empty array.
Analyze constraints and compute optimal solutions step-by-step.
No dry run loaded.
🚀 Practice this problem
Run code, get AI hints & track streak