Your question is Two Sum Optimization. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
Given a sorted array of integers, find two numbers that sum up to a specific target value. How does the sorted nature of the array change your approach to optimizing space and time complexity?