Yahoo India Web Search

Sign In

Search results

  1. www.geeksforgeeks.org › practice-problems-on-hashingPractice Problems on Hashing - GeeksforGeeks

    Jul 8, 2021 · These are the types of questions asked in hashing. Type 1: Calculation of hash values for given keys –. In this type of questions, hash values are computed by applying given hash function on given keys. Que – 1. Given the following input (4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199) and the hash function x mod 10, which of the following ...

  2. www.geeksforgeeks.org › hashing-data-structureHashing in Data Structure - GeeksforGeeks

    • What Is Hashing in Data Structure?
    • Hash Table in Data Structure
    • Hash Function
    • What Is A Hash Collision?
    • Collision Resolution Techniques
    • Applications of Hashing
    • Basics of Hashing in Data Structure
    • Easy Problem on Hashing
    • Medium Problem on Hashing
    • Hard Problem on Hashing

    Hashing is a technique used in data structures to store and retrieve data efficiently. It involves using a hash functionto map data items to a fixed-size array which is called ahash table. How it works: 1. Hash Function:You provide your data items into the hash function. 2. Hash Code:The hash function crunches the data and give a unique hash code. ...

    See full list on geeksforgeeks.org

    A hash table is also known as a hash map. It is a data structure that stores key-value pairs. It uses a hash functionto map keysto a fixed-size array, called a hash table. This allows in faster search, insertion, and deletionoperations.

    See full list on geeksforgeeks.org

    Thehash functionis a function that takes a key and returns an index into the hash table. The goal of a hash function is to distribute keys evenly across the hash table, minimizing collisions (when two keys map to the same index). Common hash functions include: 1. Division Method: Key % Hash Table Size 2. Multiplication Method: (Key * Constant) % Ha...

    See full list on geeksforgeeks.org

    A hash collision occurs when two different keys map to the same index in a hash table. This can happen even with a good hash function, especially if the hash table is full or the keys are similar. Causes of Hash Collisions: 1. Poor Hash Function:A hash function that does not distribute keys evenly across the hash table can lead to more collisions. ...

    See full list on geeksforgeeks.org

    There are two types of collision resolution techniques: 1. Open Addressing: 1.1. Linear Probing:Search for an empty slot sequentially 1.2. Quadratic Probing:Search for an empty slot using a quadratic function 2. Closed Addressing: 2.1. Chaining:Store colliding keys in a linked list or binary search tree at each index 2.2. Cuckoo Hashing: Use multip...

    See full list on geeksforgeeks.org

    Hash tables are used in a wide variety of applications, including: 1. Databases:Storing and retrieving data based on unique keys 2. Caching: Storing frequently accessed data for faster retrieval 3. Symbol Tables: Mapping identifiers to their values in programming languages 4. Network Routing: Determining the best path for data packets

    See full list on geeksforgeeks.org

    Introduction to Hashing – Data Structure and Algorithm Tutorials
    What is Hashing?
    Index Mapping (or Trivial Hashing)
    Separate Chaining for Collision Handling

    See full list on geeksforgeeks.org

    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
    Maximum distance between two occurrences of same element in array

    See full list on geeksforgeeks.org

    Find Itinerary from a given list of tickets
    Find number of Employees Under every Employee
    Longest subarray with sum divisible by k
    Find the largest subarray with 0 sum

    See full list on geeksforgeeks.org

    Clone a Binary Tree with Random Pointers
    Largest subarray with equal number of 0s and 1s
    All unique triplets that sum up to a given value
    Palindrome Substring Queries

    See full list on geeksforgeeks.org

  3. medium.com › @vivek-srivastava › hashing-problems-inHashing Problems in Data Structures - Medium

    Dec 15, 2018 · Top 75 Hashing Problems. Hash tables are extremely useful data structure as lookups take expected O (1) time on average, i.e. the amount of work that a hash table does to perform a lookup is at ...

  4. www.geeksforgeeks.org › top-50-problems-on-hashTop 50 Problems on Hash Data Structure asked in SDE ...

    Jul 3, 2023 · Given below are the most frequently asked interview questions on Hash: Easy Level Problems on Hash Data Structure. Find whether an array is a subset of another array. Find the frequency of each character in a string. Find the first non-repeating character in a string. Find the intersection of two arrays.

  5. favtutor.com › blogs › hashing-in-data-structureHashing in data structure (Complete Guide with Examples)

    May 4, 2021 · Hash Table is a data structure that stores the key-value pair. Each value is assigned to a key which is created using the hash function. This hash table stores values as student information for corresponding roll numbers as keys. The entry in the hash table is “null” if the key does not have its corresponding information.

  6. www.scholarhat.com › hashing-in-data-structuresHash Function in Data Structure: Types and Functions [With ...

    The hashing algorithm translates the key to the hash value. This identifier can be a string or an integer. There are some types of hash keys: Public key - It is an open key used solely for data encryption. Private key - It is known as a symmetric key used for both purposes, encryption and decryption. SSH public key - SSH is a set of both public ...

  7. People also ask

  8. www.techiedelight.com › hashing-in-data-structureHashing – Practice Problems | Techie Delight

    Hashing – Practice Problems. Hash tables are extremely useful data structures as lookups take expected O (1) time on average, i.e. the amount of work that a hash table does to perform a lookup is at most some constant. Several data structures and algorithm problems can be very efficiently solved using hashing which otherwise has high time ...