Hashing Codes

1. Basic Hashing Concept
2. Check if the given array is a subset of another array with No duplicate elements
3. Check if a given array is a subset of another array assuming that duplicate elements can be present in any or both of the given arrays
4. Minimum operations to make all elements equal in an array
5. Check if the given array contains duplicate elements within k distance from each other
6. Find out the Maximum and Minimum frequency of a no in the array
7. Count all the (i,j) Pairs such that b[i] + b[j] == k (count of such pairs.) i
8. Count All ((i,j) pairs such that b[i] - b[j] == k (count of such pairs.) i
9. Count all i,j pairs where i
10. Find Sum of Range [l……….r] where(l<=r) using Prefix sum.
11. Find count of number of subarrays with sum is equal to k
12. Find largest/smallest subarray with sum k in Given Array
13. Find count of shortest/largest subarrays with sum k in given array
14. Frequency of a given no in an array
15. Two Sum (LC Problem)
16. Cumulative Sum Frequency
17. Max diff b/w two occurrence of same element in an array
18. First Unique Character in the String
19. Find Common Characters
20. LCS (Longest Consecutive Sequence) (LC 128)
21. Find the length of largest subarray with 0 sum
22. No of subarrays with sum exactly equal to k