**‘Recent Articles’ on Hashing**

**Topic :**

- Print a Binary Tree in Vertical Order | Set 2 (Hashmap based Method)
- Find whether an array is subset of another array
- Union and Intersection of two Linked Lists
- Given an array A[] and a number x, check for pair in A[] with sum as x
- Check if a given array contains duplicate elements within k distance from each other
- Given an array of pairs, find all symmetric pairs in it
- Group multiple occurrence of array elements ordered by first occurrence
- How to check if two given sets are disjoint?
- Pair with given product | Set 1 (Find if any pair exists)
- Find missing elements of a range
- Count pairs with given sum
- Convert an array to reduced form | Set 1 (Simple and Hashing)
- Return maximum occurring character in an input string
- Find the first repeating element in an array of integers
- Print All Distinct Elements of a given integer array
- Find all permuted rows of a given row in a matrix

- Find Itinerary from a given list of tickets
- Find number of Employees Under every Employee
- Check if an array can be divided into pairs whose sum is divisible by k
- Find four elements a, b, c and d in an array such that a+b = c+d
- Find the largest subarray with 0 sum
- Longest Consecutive Subsequence
- Count distinct elements in every window of size k
- Design a data structure that supports insert, delete, search and getRandom in constant time
- Length of the largest subarray with contiguous elements
- Find if there is a subarray with 0 sum
- Print all subarrays with 0 sum
- Find subarray with given sum | Set 2 (Handles Negative Numbers)
- Implementing our Own Hash Table with Separate Chaining in Java
- Vertical Sum in a given Binary Tree
- Group Shifted String
- Check for Palindrome after every character replacement Query

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.