## Min Query

Concepts Used Segment Trees Difficulty Level Easy Problem Statement : Given an array of N elements and Q queries. In each query he is given two values l, r. We...

Skip to content
## Min Query

## Plagiarism Test

## Sum Query

## Maximum Divisor

## Consecutive Permutation

## XOR Maximum

## Find words

## Tug of War

## Unique Power Set

## Possible Numbers

Concepts Used Segment Trees Difficulty Level Easy Problem Statement : Given an array of N elements and Q queries. In each query he is given two values l, r. We...

Concepts Used BFS , Recursion Difficulty Level Easy Problem Statement : Given a binary tree, and a node X, we have to sum all the nodes except the node X....

Concepts Used Segment Trees Difficulty Level Easy Problem Statement : Given an array of N elements and Q queries. In each query he is given two values l,r. We have...

Concepts Used Segment Trees, GCD Difficulty Level Medium Problem Statement : Given an array of N elements and Q queries. In each query, two values is given l and r....

Concepts Used Segment Trees Difficulty Level Hard Problem Statement : Given an array of N unique elements and Q queries. In each query, we are given two values l,r. We...

Concepts Used Trie Difficulty Level Medium Problem Statement : Given array of N numbers, we need to find the maximum xor between any pair of the numbers. See original problem...

Concepts Used Trie Difficulty Level Easy Problem Statement : Given a blank dictionary. Now in the first set of operations, you have to insert N integers in the dictionary. And...

Concepts Used Back Tracking Difficulty Level Hard Problem Statement : Given a set of n integers, divide the set in two subsets of n/2 sizes each such that the difference...

Concepts Used Back Tracking Difficulty Level Medium Problem Statement : Given N integers print all the distinct power sets of the sequence in lexicographical order. See original problem statement here...

Concepts Used Back Tracking Difficulty Level Easy Problem Statement : Given a string, we have to find total number of different sequences that can be formed using the letters in...