## What are Hash Functions and How to choose a good Hash Function?

Prerequisite: Hashing | Set 1 (Introduction) What is a Hash Function? A function that converts a given big phone number to a small practical integer… Read More »

- k-th missing element in an unsorted array
- Find the longest string that can be made up of other strings from the array
- Minimum length substring with exactly K distinct characters
- Rearrange characters in a string such that no two adjacent are same using hashing
- Flip minimum signs of array elements to get minimum sum of positive elements possible
- Sum of nodes in bottom view of Binary Tree
- Count duplicates in a given linked list
- Sum of nodes in top view of binary tree
- Split the array elements into strictly increasing and decreasing sequence
- Find uncommon characters of the two strings | Set 2
- Design a stack which can give maximum frequency element
- Count equal pairs from given string arrays
- Minimum number of given operations required to convert a permutation into an identity permutation
- Remove all occurrences of any element for maximum array sum
- Count of pairs of strings which differ in exactly one position
- Minimum Bitwise XOR operations to make any two array elements equal
- Longest subsequence such that every element in the subsequence is formed by multiplying previous element with a prime
- Two equal sum segment range queries
- Count all elements in the array which appears at least K times after their first occurrence
- Minimum changes required to make a Catalan Sequence
- Count of pairs between two arrays such that the sums are distinct
- Partiton the string in two parts such that both parts have at least k different characters
- Minimum number of given operations required to reduce the array to 0 element
- Find the lexicographically smallest sequence which can be formed by re-arranging elements of second array
- Find d to maximize the number of zeros in array c[] created as c[i] = d*a[i] + b[i]
- Maximum length of a sub-array with ugly numbers
- Print characters having odd frequencies in order of occurrence
- Rearrange given string to maximize the occurrence of string t
- Number of Positions to partition the string such that atleast m characters with same frequency are present in each substring
- Number of ways in which the substring in range [L, R] can be formed using characters out of the range

Prerequisite: Hashing | Set 1 (Introduction) What is a Hash Function? A function that converts a given big phone number to a small practical integer… Read More »

Given two trees each of N nodes. Removing an edge of the tree partitions the tree in two subsets. Find the total maximum number of… Read More »

Given an array A[] and positive integer K, the task is to count the total number of pairs in the array whose sum is divisible… Read More »

Given a string str containing only lowercase characters. The task is to print the characters along with their frequencies in the order of their occurrence… Read More »

Extendible Hashing is a dynamic hashing method wherein directories, and buckets are used to hash data. It is an aggressively flexible method in which the… Read More »

Given a chemical formula as a string, the task is to get the count of atoms in this chemical formula. Examples: Input: str = “Fe2H3OH”… Read More »

The task is to find the triangle of numbers arising from Gilbreath’s conjecture. Gilbreath’s conjecture: It is observed that given a sequence of prime numbers,… Read More »

Given an array arr[] of integers of size N and an integer K. One can perform the Bitwise XOR operation between any array element and… Read More »

Given an array arr[] of size N. The task is to find X – Y for each of the element where X is the count… Read More »

Given a string array arr[], the task is to find the longest sub-sequence of the array with at least one character appearing in all the… Read More »

Given two string arrays s1[] and s2[]. The task is to find the count of pairs (s1[i], s2[j]) such that s1[i] = s2[j]. Note that… Read More »

Given a sorted array of N integers. The task is to find the longest subsequence such that every element in the subsequence is reachable by… Read More »

Given an infinitely long binary tree having a pattern as below: 1 / \ 2 3 / \ / \ 4 5 6 7 /… Read More »

Given two arrays a[] and b[], the task is to find the count of all pairs (a[i], b[j]) such that a[i] + b[j] is unique… Read More »

Given an array of strings arr[], the task is to find the largest string in the array which is made up of the other strings… Read More »