## Construct a tree from Inorder and Level order traversals | Set 2

Given inorder and level-order traversals of a Binary Tree, construct the Binary Tree. Following is an example to illustrate the problem. Examples: Input: Two arrays… Read More »

Given inorder and level-order traversals of a Binary Tree, construct the Binary Tree. Following is an example to illustrate the problem. Examples: Input: Two arrays… Read More »

Double hashing is a collision resolving technique in Open Addressed Hash tables. Double hashing uses the idea of applying a second hash function to key… Read More »

In hashing there is a hash function that maps keys to some values. But these hashing function may lead to collision that is two or… Read More »

In this article, we will discuss the types of questions based on hashing. Before understanding this, you should have idea about hashing, hash function, open… Read More »

Given two sorted matrices mat1 and mat2 of size n x n of distinct elements. Given a value x. The problem is to count all… Read More »

Given a string containing alphabets in lowercase and uppercase, find the maximum count of distinct lowercase alphabets present between two uppercase alphabets. Examples : Input… Read More »

Given a linked list, find majority element. An element is called Majority element if it appears more than or equal to n/2 times where n… Read More »

Given a linked list, and a number, check if their exist two numbers whose sum is equal to given number. If there exist two numbers,… Read More »

Given an array, find elements which appears prime number of times in the array with minimum k frequency (frequency >= k). Examples : Input :… Read More »

Given two lists list1 and list2 containing m and n items respectively. Each item is associated with two fields: name and price. The problem is… Read More »

Given an array of size N. Find the number of pairs (i, j) such that XOR = 0, and 1 <= i < j <=… Read More »

Given an array of n integers, find the sum of f(a[i], a[j]) of all pairs (i, j) such that (1 <= i < j <=… Read More »

Given a BST and a sum, find if there is a pair with given sum. Input : sum = 28 Root of below tree Output… Read More »

You are given a string S, and a list of words L i.e array/vector of strings (Words in list L are all of the same… Read More »

Given an array of n integers(duplicates allowed). Print “Yes” if it is a set of contiguous integers else print “No”. Examples: Input : arr[] =… Read More »