## Load Factor and Rehashing

Prerequisites: Hashing Introduction and Collision handling by separate chaining How hashing works: For insertion of a key(K) – value(V) pair into a hash map, 2… Read More »

- Count pairs in array whose sum is divisible by K
- Find minimum difference between any two elements | Set 2
- Count sub-arrays whose product is divisible by k
- Queries to check if string B exists as substring in string A
- Minimum cost to modify a string
- Count of pairs of strings which differ in exactly one position
- Count all elements in the array which appears at least K times after their first occurrence
- Count number of distinct substrings of a given length
- Maximize the number of sum pairs which are divisible by K
- Sum of all odd frequency nodes of the Linked List
- Number of subarrays having sum of the form k^m, m >= 0
- Rearrange given string to maximize the occurrence of string t
- Number of pairs from the first N natural numbers whose sum is divisible by K
- Maximum count of pairs which generate the same sum
- Number of ways in which the substring in range [L, R] can be formed using characters out of the range
- Total distinct pairs of ugly numbers from two arrays
- Print all the sum pairs which occur maximum number of times
- Number of times the given string occurs in the array in the range [l, r]
- Count pairs with average present in the same array
- Total character pairs from two strings, with equal number of set bits in their ascii value
- Check if a given number divides the sum of the factorials of its digits
- Distinct pairs from given arrays (a[i], b[j]) such that (a[i] + b[j]) is a Fibonacci number
- Total distinct pairs from two arrays such that second number can be obtained by inverting bits of first

Prerequisites: Hashing Introduction and Collision handling by separate chaining How hashing works: For insertion of a key(K) – value(V) pair into a hash map, 2… Read More »

Definition: In Cryptography, SHA is cryptographic hash function which takes input as 20 Bytes and rendered the hash value in hexadecimal number, 40 digits long… Read More »

Given an array of positive integers (may contain duplicates), the task is to find the number of triplets whose product is equal to a given… Read More »

Given a number N, the task is to check whether it is fascinating or not. Fascinating Number: When a number( 3 digits or more )… Read More »

Given an array of integers arr[] representing digits of a number. The task is to write a program to generate the largest number possible using… Read More »

Top view of a binary tree is the set of nodes visible when the tree is viewed from the top. Given a binary tree, print… Read More »

Given a list of sentences and a list of phrases. The task is to find which sentence(s) contain all the words in a phrase and… Read More »

Given a string containing only two characters i.e. R and K (like RRKRRKKKKK). The task is to find the maximum value of N for a… Read More »

Given N strings. Find the longest possible subsequence from each of these N strings such that they are anagram to each other. The task is… Read More »

The java.lang.reflect.Method.hashCode() method returns the hash code for the Method class object. The hashcode returned is computed by exclusive-or operation on the hashcodes for the… Read More »

Given an array of distinct integers, print all the pairs having a positive value and negative value of a number that exists in the array.… Read More »

Given two strings str1 and str2, the task is to print the number of times str2 can be formed using characters of str1. However, a… Read More »

Prerequisite – Hashing A distributed system is a network that consists of autonomous computers that are connected using a distribution middleware. They help in sharing… Read More »

Given a binary search tree of n nodes with distinct values. Also given are Q queries. Each query consists of a node value that has… Read More »

Given a string containing lowercase characters. The task is to print the maximum occurring character in the input string. If 2 or more characters appear… Read More »