How do I get the intersection between two arrays as a new array?

by 
foreach element e in array A
    insert e into hash table H

foreach element e in array B
    if H contains e 
        print e

This algorithm is O(N) in time and O(N) in space.

To avoid the extra space, you can use the sorting based approach.

More Related Contents:

  1. Permutation of array
  2. Algorithm – How to delete duplicate elements in a list efficiently?
  3. Interview question – Search in sorted array X for index i such that X[i] = i
  4. Java equivalent to C++ arrow [closed]
  5. Fast algorithm to calculate n! / (q!)^r
  6. java vs C++ in pre and post increment
  7. How to make fibonacci method? [closed]
  8. is there an algorithm to reverse a chosen part of a number? [closed]
  9. Generating all permutations of a given string
  10. Finding the max/min value in an array of primitives using Java
  11. Which Java Collection should I use?
  12. Is there a way to simulate the C++ ‘friend’ concept in Java?
  13. Effective gif/image color quantization?
  14. Most elegant way to generate prime numbers [closed]
  15. Natural sort order string comparison in Java – is one built in? [duplicate]
  16. How to calculate elapsed time from now with Joda-Time?
  17. Picking a random element from a set
  18. How to call Java functions from C++?
  19. Java – Removing duplicates in an ArrayList
  20. Selenium WebDriver: Wait for complex page with JavaScript to load
  21. Tool to convert java to c# code [closed]
  22. How to generate a random permutation in Java?
  23. Flatten nested arrays in java
  24. Generate Random Numbers in Array [duplicate]
  25. Determine the most common occurrence in an array
  26. Finding the median value of an array?
  27. Finding the shortest path nodes with breadth first search
  28. Mergesort in java
  29. How can I perform multiplication without the ‘*’ operator?
  30. Time complexity of System.arraycopy(…)?

Leave a Comment