• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

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

November 17, 2014 by Dhaval Dave

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

Examples:

Input: arr[] = {10, 22, 28, 29, 32, 40}, x = 54
Output: 22 and 32

A simple solution is to consider every pair and keep track of closest pair (absolute difference between pair sum and x is minimum). Finally print the closest pair. Time complexity of this solution is O(n2)

An efficient solution can find the pair in O(n) time. The idea is similar to method 2 of this post. Following is detailed algorithm.

#include <iostream>
#include <climits>
#include <cstdlib>
using namespace std;

// Prints the pair with sum cloest to x
void printClosest(int arr[], int n, int x)
{
    int res_l, res_r;  
    int l = 0, r = n-1, diff = INT_MAX;
    while (r > l)
    {
       if (abs(arr[l] + arr[r] - x) < diff)
       {
           res_l = l;
           res_r = r;
           diff = abs(arr[l] + arr[r] - x);
       }
       if (arr[l] + arr[r] > x)
           r--;
       else
           l++;
    }
    cout <<" The closest pair is " << arr[res_l] << " and " << arr[res_r];
}

int main()
{
    int arr[] =  {10, 22, 28, 29, 32, 40}, x = 54;
    int n = sizeof(arr)/sizeof(arr[0]);
    printClosest(arr, n, x);
    return 0;
}

See Running code at http://ideone.com/q3F4OQ

Similar Articles

Filed Under: Adobe Interview Questions, Amazon Interview Question, Flipkart Interview Questions, Interview Questions, problem Tagged With: Array

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Generate largest number arranging a no. of given non negative integer numbers

K’th Largest Element in BST when modification to BST is not allowed

Find min element in Sorted Rotated Array (With Duplicates)

Word Break Problem

Find the kth number with prime factors 3, 5 and 7

Check Binary Tree is Binary Search Tree or not

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

Find Pythagorean Triplets in an array in O(N)

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Generate next palindrome number

C Program for TAIL command of UNIX

Doubly linked list

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Skiing on Mountains Matrix

Given a string, find the first character which is non-repetitive

Stock Buy Sell to Maximize Profit

Find if two rectangles overlap

Reliance Jio Software Developer Interview Experience

SAP Interview Questions

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Best Java Book | Top Java Programming Book for Beginners

Amazon Interview Experience – SDE Chennai

Hackerearth : Counting Subarrays

CodeChef Code SGARDEN

Count Possible Decodings of a given Digit Sequence

Cisco Hiring Event 21st – 22nd Feb 2015

Test Cases for Round Function

Trie Dictionary

Diagonal Traversal of Binary Tree

Copyright © 2025 · Genesis Framework · WordPress · Log in