## Given a sorted array and a number x, find the pair in array whose sum is closest to x

ALGORITHM TIME COMPLEXITY: O(N) SPACE COMPLEXITY: O(1) 1. We initialize two pointer like variable left and right which point at the start …

Read moreGiven a sorted array and a number x, find the pair in array whose sum is closest to x