In-House interview: 1. Given two int arrays, return a third int array that contains all values in the first int array that aren't in the 2nd. If a value is duplicated in the first int array, only return it once in the output array. 2. Model a deck of cards
Sigiloso
1. Add all values from the 2nd array to a hash table. Go through the 1st array and check the hash. If it's not in there, add it to the output array and to the hash (so it can handle the case where a value is duplicated in the first array).