Hashing Data Structure

  • Last Updated : 06 Feb, 2023

Learn more about Hashing in DSA Self Paced Course
Practice Problems on Hashing
Recent Articles on Hashing

What is Hashing?

Hashing is a technique or process of mapping keys, and values into the hash table by using a hash function. It is done for faster access to elements. The efficiency of mapping depends on the efficiency of the hash function used.

Let a hash function H(x) maps the value x at the index x%10 in an Array. For example if the list of values is [11,12,13,14,15] it will be stored at positions {1,2,3,4,5} in the array or Hash table respectively.

Hashing Data Structure

Hashing Data Structure


Topics:

Introduction:

DSA-Self-Paced
Standard problem on Hashing:

Quick Links :

Recomended:

If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@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.


My Personal Notes arrow_drop_up