## FIND SHELTER

CONCEPTS USED: Greedy algorithm. DIFFICULTY LEVEL: Easy. PROBLEM STATEMENT(SIMPLIFIED): Nishant is lost along with his N−1 wandering friends. Now they have to find some shelter. Nishant and his N−1 friends...

Skip to content
## FIND SHELTER

## DIGIT GAME

## Chocolates

## Find the Closest Palindrome

## Aman String

## Arithmetic Progression

## Range Even

## Pairs

## Minimum number of notes

## Benchmates

CONCEPTS USED: Greedy algorithm. DIFFICULTY LEVEL: Easy. PROBLEM STATEMENT(SIMPLIFIED): Nishant is lost along with his N−1 wandering friends. Now they have to find some shelter. Nishant and his N−1 friends...

CONCEPTS USED: Greedy algorithm. DIFFICULTY LEVEL: PROBLEM STATEMENT(SIMPLIFIED): Arnab is playing a game. He is given a number N in string format and now he is asked to remove M...

Concepts Used Sorting Difficulty Level Medium Problem Statement (Simplified): For given values of N and K, an array of N elements is given. You can pick at most K items...

Concepts Used Strings Difficulty Level Hard Problem Statement (Simplified): For given numbers we have to print the nearest anagram to it if two numbers are equidistant and anagram to the...

Concepts Used Strings Difficulty Level Easy Problem Statement (Simplified): Find the total number of pairs of indexes (i, j) such as subString(i, j) contains "aman" atleast once. See original problem...

Arithmetic Progression CONCEPTS USED: Hashing, Basic Mathematics DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array of N integers, print the value of all those elements, whose indexes form an increasing...

CONCEPTS USED: Recursion DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given a number N, your task is to print all even numbers (>0) from 1 to N using recursion. See original problem...

CONCEPTS USED: Hashing DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given M pairs of integers, where each integer is between 1 and N inclusive. Check if there exists two integers x and...

CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given various currency notes (1,2,5,10,20,50 ,100,500,1000) and N rupees. Print the minimum number of currency notes required to exchange for the...

CONCEPTS USED: Efficient Array Search DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given marks of N students sitting on a bench and a value of K, print the index of the student...