Check Array Subset | Hashing | C++ Solution
Check Array Subset, is a Hashing related problem and in this post we will see how we can solve this challenge in C++
given two arrays ,check whether arr2 is a subset of arr1 or not 1.can be done using binary search also by sorting the arrays and looking for elements of arr2 in arr1,but it won't handle the case when the arr2 has duplicates 2. using hash
Please check the main.cpp snippet for the solution.
This solution originally posted at: Github by @susantabiswas