Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

Top 20 Hashing Technique based Interview Questions

  1. Find whether an array is subset of another array
  2. Union and Intersection of two Linked Lists
  3. Find a pair with given sum
  4. Find Itinerary from a given list of tickets
  5. Find four elements a, b, c and d in an array such that a+b = c+d
  6. Find the largest subarray with 0 sum
  7. Count distinct elements in every window of size k
  8. Find smallest range containing elements from k lists
  9. Palindrome Substring Queries
  10. Largest subarray with equal number of 0s and 1s
  11. Advantages of BST over Hash Table
  12. Check if an array can be divided into pairs whose sum is divisible by k
  13. Count the number of subarrays having a given XOR
  14. Implementing our Own Hash Table with Separate Chaining in Java
  15. Internal Working of HashMap in Java
  16. Find missing elements of a range
  17. Longest Consecutive Subsequence
  18. Print all subarrays with 0 sum
  19. Open Addressing for Collision Handling
  20. Separate Chaining for Collision Handling
  21. Given an array of pairs, find all symmetric pairs in it

Recent Articles on Hashing
Coding Practice on Hashing

Article Tags :
DSA
Hash
Recommended Articles
1. Open Addressing Collision Handling technique in Hashing
2. Separate Chaining Collision Handling Technique in Hashing
3. Reconstruct original string from resultant string based on given encoding technique
4. Array-Based Queues vs List-Based Queues
5. Decrypt the encoded string with help of Matrix as per given encryption decryption technique
6. LCA in a tree using Binary Lifting Technique
7. Kth ancestor of a node in an N-ary tree using Binary Lifting Technique
8. Encryption and Decryption of String according to given technique
9. Difference between Backtracking and Branch-N-Bound technique
10. Representation Change in Transform and Conquer Technique
11. C++ Program for Two Pointers Technique
12. C Program for Two Pointers Technique
13. Python3 Program for Two Pointers Technique
14. Sum of length of paths from every node to all other nodes using Tree Rerooting technique
15. Instance Simplification Method in Transform and Conquer Technique
16. Transform and Conquer Technique
17. Code Optimization Technique (logical AND and logical OR)
18. Improving Linear Search Technique
19. Rearrange an array in maximum minimum form using Two Pointer Technique
20. Bit Manipulation technique to replace boolean arrays of fixed size less than 64
21. Problem Reduction in Transform and Conquer Technique
22. PreComputation Technique on Arrays
23. Java Program for Two Pointers Technique
24. Javascript Program for Two Pointers Technique
25. Two-Pointer Technique in a Linked List