# Tag Archives: Hash

Given two strings str1 and str2, and a third-string shuffle, determine if shuffle is a valid shuffle of str1 and str2, where a valid shuffle… Read More
Given an array arr[] of size N that denotes the type of an element, and another time array time[] of size N where time[i] denotes… Read More
Given an array arr[][] of size N*3 where ith element represents that at time arr[i][0] secs, arr[i][2] coins appear at coordinate arr[i][1]. A player starts… Read More
Given two strings S and T and a 2D array replace[][], where replace[i] = {oldChar, newChar} represents that the character oldChar of T is replaced… Read More
What is Hashing? Hashing refers to the process of generating a fixed-size output from an input of variable size using the mathematical formulas known as… Read More
You are given an array of Email IDs, the task is to return the lexicographically first email ID of every single domain. Examples: Input: Emails[]… Read More
Given an array arr[] of size N. The task is to find an array of size N such that the ith element is the summation… Read More
Given a positive integer array arr[] of size N (1 ≤ N ≤ 105) and a positive integer K, the task is to find the… Read More
Given an array arr[] of length N, the task is to find the total number of elements that has frequency 1 in a subarray of… Read More
Given two strings X and Y, the task is to find the length of the longest common substring.  Examples: Input: X = “GeeksforGeeks”, y =… Read More
Given an array of size N and two integers M and K., All the integers in the array are in the range [1, M]. Find… Read More
There have always been arguments about how can be a sorting algorithm of linear time complexity be achieved, as all the traditional sorting algorithms are… Read More
Hashing refers to the process of generating a fixed-size output from an input of variable size using the mathematical formulas known as hash functions. This… Read More
Given an array A[] and positive integer K, the task is to count the total number of pairs in the array whose product is divisible… Read More
Given an integer N (which is always a power of 2) denoting the length of an array which contains integers in range [0, N-1] exactly… Read More