• 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

Search element in a matrix with all rows and columns in sorted order

Generic Object Oriented Stack with Template

Right view of Binary tree

Python Array String

Serialise Deserialise N-ary Tree

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

Length of the longest substring without repeating characters

Print vertical sum of all the axis in the given binary tree

How Radix sort works

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Connect n ropes with minimum cost

Add Sub Multiply very large number stored as string

Level order traversal in Spiral form

SAP Hiring Off-Campus General Aptitude

Given Set of words or A String find whether chain is possible from these words or not

Given a float number convert it into the string WITHOUT using any inbuilt Function

Find the smallest window in a string containing all characters of another string

HackeEarth Flipkart’s Drone

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

Minimum insertions to form a palindrome

Coin Collection Dynamic Programming

Count Possible Decodings of a given Digit Sequence

Sort Stack in place

Amazon Interview Experience – SDE Chennai

FizzBuzz Solution C C++

Maximum size of square sub matrix with all 1’s in a binary matrix

Find if a binary tree is height balanced ?

System Design: Designing a LLD for Hotel Booking

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

Word Break Problem

Copyright © 2026 · Genesis Framework · WordPress · Log in