Skip to content

Tag Archives: Hash

Given an array of equal-length strings arr[], the task is to make all the strings of the array equal by replacing any character of a… Read More
Given an array arr[] of size N and an integer K, the task is to find the length of the longest subarray having Bitwise XOR… Read More
Given two arrays A[] and B[] of size N, the task is to count the minimum number of swaps of similar indexed elements required to… Read More
Given a string S of length N and an integer K, the task is to find the minimum character replacements required to make the string… Read More
Given a string S consisting of lowercase alphabets of size N, the task is to count all substrings which contains the most frequent character in… Read More
Given string str of length N and an array arr[] of integers, for array element arr[i](1-based indexing), reverse the substring in indices [arr[i], N –… Read More
Given a string, str, the task is to find the indices of the given string such that the count of lexicographically smaller characters on the… Read More
A cryptographic hash is a fixed size string (or text) that is used as an identifier/fingerprint of some data. These are particularly useful in determining… Read More
Given an array arr[] consisting of N positive integers, the task is to maximize the number of subsequences that can be obtained from an array… Read More
Given an array arr[] consisting of N integers, the task is to print all adjacent integer pairs from the array which appears more than once… Read More
Given an array arr[] of N integers. For each element in the array, the task is to count the possible pairs (i, j), excluding the… Read More
String matching algorithms have greatly influenced computer science and play an essential role in various real-world problems. It helps in performing time-efficient tasks in multiple… Read More
Given an integer K and an array arr[] consisting of N integers, the task is to find the length of the subarray of smallest possible… Read More
Given an array arr[] of N elements. The task is to count the total number of indices (i, j) such that arr[i] = arr[j] and… Read More
Given matrices txt[][] of dimensions m1 x m2 and pattern pat[][] of dimensions n1 x n2, the task is to check whether a pattern exists… Read More