• 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

System Design: Designing a LLD for Hotel Booking

Subset Sum Problem Dynamic programming

Diagonal Traversal of Binary Tree

Find Percentage of Words matching in Two Strings

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

HackeEarth Flipkart’s Drone

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

Binary Tree in Java

Find the number ABCD such that when multipled by 4 gives DCBA.

Right view of Binary tree

Generate next palindrome number

simple sql injection

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

Add Sub Multiply very large number stored as string

Code Chef PRGIFT Solution

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Templates in C++

Reverse a Linked List in groups of given size

Cisco Hiring Event 21st – 22nd Feb 2015

Closed Parentheses checker

Check Binary Tree is Binary Search Tree or not

Facebook Interview Question : Interleave List

Urban Ladder Written Test.

Practo Hiring Experience

Best Java Book | Top Java Programming Book for Beginners

Find two non repeating elements in an array of repeating elements

Apriori algorithm C Code Data Mining

Minimum insertions to form a palindrome

SAP Off Campus Hiring_ March 2015 Sample Questions

Copyright © 2026 · Genesis Framework · WordPress · Log in