Question

2. Use hashing (solve_with_Hash(int[] array, int k)) Initialize a counter variable to O: Insert all elements of array in a hashtable For every element in array: counter0 a. b. c. .Look for array[i] . Look for array [幻 + k in the hash map, if found then increment counter. -k in the hash map, if found then increment counter. Remove arrayli] from hash table. d. return counter For example: Input : array[] {1, 5, 3, 4, 2), k 3 Output: 2 Explanation: There are 2 pairs with difference 3, the pairs are (4, 1) and 15, 2) import java.util.Arrays; import java.util.HashSet; public class Lab2 public static void main(String [largs) int[] arr-1, 5, 3, 4, 2}; int k = 3; long start = System .currentTimem llis(); System.out.println("Count is "+ solve_with_Hash(arr,k)); // should be 2 System.out.println("Total execustion time (taken by solve_with_Hash):" +(System.currentTimeMiLlis()-start)); start System.currentTimeMiLLis); System.out.println("InInCount is "+ 5olvewith Soct (arr,k)); / should be 2 System.out.println("Total execustion time (taken by solve_with_Sort):" +(System.currentTimeMiLlis()-start)); public static int solve_with_Hash(int[] arr, int k) int counter = 0; HashSet

Answer 1

import java.util.*;
import java.io.*;

public class Main
{


    public static int solve_with_Hash(int arr[],int k)
    {

        int count=0;

        // create hash set


        HashSet<Integer> hs=new HashSet<>();


        for (int i:arr)
        {

            hs.add(i);
        }
      //iterator for hashset
        Iterator <Integer>itr = hs.iterator();

        while(itr.hasNext())
        {
     
            int p=(int)itr.next();

            if(hs.contains(p+k))
                count++;
            if(hs.contains(p-k))
                count++;
            // remove element
            itr.remove();


        }


       return count;






    }

    public static void main(String args[]) throws Exception
    {

      int[] arr={1,5,3,4,2};
      int k=3;

// function call
        System.out.println("\n\n count is : "+solve_with_Hash(arr,k));

    }
}

Sample Run:

sample IC: n,java [samplel- Intelliü IDEA Eie Edit צ¡ew Navigate gode Analyze Befactor Build Run lools VCs window Help sampleSrc Main Main.java HashMap.java Hash0 Run Main Mairi Main Main C:\Program Files\JavaJdkー10.0.2\bin\Java . exe" -javaagent:C:\Program Files\JelBra ins\inteni] IDEA Community Edition 2018.2\lib\idea rL.jar-6016 Ilcount is 2 11社 Process finished with exit code θ O IDE and Plugin Updatos Intellil IDFA is ready to update Event Lag >e 4: Run : 6: TODO -Terminal Messages Compilation completed successfully in 1 s B09 ms (a minute ago) 876 chars, 62 line breaks 36:30 CRLF 수 UTF-8 수 01:26 O Type here to search 08-04-2019

Please upvote me...

for any query plzz comment ;)