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

If you want to practice data structure and algorithm programs, you can go through data structure and algorithm interview questions.

### Problem :

Given a sorted array,we need to find a pair whose sum is closed to number X in Array.
For example:

### Solution :

#### Solution 1:

You can check each and every pair of numbers and find the sum close to X.
Java code:

#### Solution 2:

• We will maintain two indexes one at beginning (l=0) and one at end (r=n-1)
• iterate until l <  r
• Calculate diff as arr[l] + arr[r]-x
• if abs (diff) < minDiff then update the minimum sum and pair.
• If arr[l] + arr[r] is less than X, this means if we want to find sum close to X, do r–
• If arr[l] + arr[r] is greater than 0,this means if we want to find sum close to X , do l++
Java code:

Time complexity : O(NLogN)

### Java program to find a pair whose sum is closest to X:

When you run above program, you will get below output:

import_contacts

### You may also like: ## Related Posts

• 04 June

### Search for a range Leetcode – Find first and last position of element in sorted array

Table of ContentsApproach 1 (Using Linear Search)Approach 2 (Using Modified Binary Search-Optimal) In this article, we will look into an interesting problem asked in Coding Interviews related to Searching Algorithms. The problem is: Given a Sorted Array, we need to find the first and last position of an element in Sorted array. This problem is […]

• 28 March

### Sort an array of 0s, 1s and 2s

Table of ContentsProblemSolution If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. In this post, we will see how to sort an array of 0s, 1s and 2s.We have already seen a post on sort 0s and 1s in an array. Problem Given an array containing zeroes, […]

• 04 March

### Check if it is possible to reach end of given Array by Jumping

Table of ContentsProblemSolution If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. ﻿ ﻿ Problem Given an array with positive integers as elements indicating the maximum length of a jump which can be made from any position in the array. Check if it is possible to have […]

• 17 February

### Check if Array Elements are Consecutive

Table of ContentsProblemSolutionProgram to check if Array Elements are Consecutive If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs. In this post, we will see how to check if array elements are consecutive. Problem Given an array, we need to check if array contains […]

• 01 November

### Find the local minima in array

Table of ContentsProblemSolutionNaive approachEfficient approach If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. In this post, we will see how to find the local minima in the array. Problem An element is local minima if it is less than its neighbors. int [] arr = {10, […]

• 22 October

### Sliding Window Maximum in java

Table of ContentsProblemSolution If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. In this post, we will see about Sliding Window Maximum in java Problem Given an Array of integers and an Integer k, Find the maximum element of from all the contiguous subarrays of size K. […]

## Subscribe to our newletter

Get quality tutorials to your inbox. Subscribe now.