Skip to content

Tag Archives: Hash

Kotlin HashMap is a collection which contains pairs of object. Kotlin Hash Table based implementation of the MutableMap interface. It stores the data in the… Read More
Given an unsorted array arr[] of size n, the task is to find the minimum difference between any pair in the given array.  Input: arr[]… Read More
Given a string S of length N consisting of lower-case English alphabets and an integer ‘l’, find the number of distinct substrings of length ‘l’… Read More
Given two strings A, B and some queries consisting of an integer i, the task is to check whether the sub-string of A starting from… Read More
Given two binary strings s and t. The task is to rearrange the string s in such a way that the occurrence of string t… Read More
Given a linked list, the task is to find the sum of all the odd frequency nodes from the given linked list.Examples:   Input: 8 ->… Read More
Given an array arr[] of N integers where |arr[i] ≤ 1000| for all valid i. The task is to count the pairs of integers from… Read More
Given two arrays a[] and b[], the task is to count the pairs (a[i], b[j]) such that (a[i] + b[j]) is a Fibonacci number.Note that… Read More
Given string str consisting of lower case alphabets only and an integer K. The task is to find the minimum cost to modify the string… Read More
Given an array of strings arr[] and two integers l and r, the task is to find the number of times the given string str… Read More
Given two arrays arr1[] and arr2[], the task is to take an element from first array (say a) and one element from second array (say… Read More
Given an integer N, the task is to check whether N divides the sum of the factorials of its digits. Examples:  Input: N = 19 Output:… Read More
Given an array arr[] of strings of equal lengths. The task is to calculate the total number of pairs of strings which differ in exactly… Read More
Given an integer k and an array arr[], the task is to count the number of sub-arrays that have the sum equal to some positive… Read More
Given two arrays arr1[] and arr2[] of sizes N and M where 0 ≤ arr1[i], arr2[i] ≤ 1000 for all valid i, the task is… Read More

Start Your Coding Journey Now!