Given a source array of integers with possible duplicates and a target integer, write algorithm to find out 2 numbers in source array whose sum is equal to target integer

Question

Accepted Answer

Algorithm to find 2 numbers in an array whose sum is equal to a target integer

Use a hash table to store the difference between target and each element in the array
Iterate through the array and check if the current element exists in the hash table
Return the pair of elements that sum up to the target integer

Accepted Answer

using System;

class GFG{

  // Function to find and print pair

  static bool chkPair(int [] A, int size, int x) {

      for (int i = 0; i < (size - 1); i++) {

          for (int j = (i + 1); j < size; j++) {

              if (A[i] + A[j] == x) {

                  Console.WriteLine("Pair with a given sum " + x +

                                     " is (" + A[i] + ", " + A[j] + ")");

                  return true;

}

}

}

      return false;

}

  public static void Main()

{

      int [] A = {0, -1, 2, -3, 1};

      int x = -2;

      int size = A.Length;

      if (chkPair(A, size, x)) {

          Console.WriteLine("Valid pair exists");

}

      else {

          Console.WriteLine("No valid pair exists for " + x );

}

}

}

Given a source array of integers with possible duplicates and a target integer, write algorithm to find out 2 numbers in source array whose sum is equal to target integer

Top Google Software Developer interview questions & answers

Popular interview questions of Software Developer

Top HR questions asked in Google Software Developer