Given two arrays: arr1[0..m-1] and arr2[0..n-1]. Find whether arr2 is a subset of arr1 or not. Both the arrays are not in sorted order.
Category - Hashing
An efficient solution based on hash map is discussed. We need to check the Horizontal Distances from root for all nodes and two nodes have the same.
open addressing is a method for handling collisions. In Open Addressing, all elements are stored in the hash table itself. So at any point, size of table
Since a hash function gets us a small number for a key which is a big integer or string, there is possibility that two keys result in same value.
we use arrays and keep the data sorted, then a phone number can be searched in O(Logn) time using Binary Search, but insert and delete operations