Find a Pair Whose Sum is Closest to zero in Array

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

Problem :

Given array of +ve and -ve integers ,we need to find a pair whose sum is closed to Zero in Array.
For example:

Solution :

Solution 1:

You can check each and every pair of numbers and find minimum sum.
Java code:

 Solution 2:

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

Time complexity : O(NLogN)

💻 Awesome Tech Resources:
  • Looking for ⚒️ tech jobs? Go to our job portal.
  • Looking for tech events? Go to tech events 🗓️ Calendar.️

Java program to find a pair whose sum is closest to zero:

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

import_contacts

You may also like:

Related Posts

  • 28 March

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

    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, ones and twos […]

  • 04 March

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

    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 a jumps combination […]

  • 17 February

    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 consecutive elements. For example: Input: array[] = {5, 3, 4, […]

  • 01 November

    Find the local minima in array

    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, 5, 3, 6, 13, 16, […]

  • 22 October

    Sliding Window Maximum in java

    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. For eg : […]

  • 20 October

    Count number of occurrences (or frequency) of each element in a sorted array

    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 count number of occurrences (or frequency) of each element in a sorted array Problem Given a Sorted Array of integers containing duplicates. Find the frequency of every unique element present […]

Leave a Reply

Your email address will not be published. Required fields are marked *

Subscribe to our newletter

Get quality tutorials to your inbox. Subscribe now.