## Median Again

Concepts Used Sorting Difficulty Level Medium Problem Statement (Simplified): Find the maximum possible median of provided odd-sized array where you can increase any element by one where each increment is...

## The Last Game

The Last Game Concepts Used Sorting Difficulty Level Easy Problem Statement (Simplified): Print the last number left in the array after deleting the largest number in the array then the...

## Ball Firing Game

Concepts Used Sorting Difficulty Level Hard Problem Statement (Simplified): For given two arrays, print the score of First Array and Second Array such that their difference is maximum. Scoring can...

## Aman Arithmetic progression

Concepts Used Sorting Difficulty Level Medium Problem Statement (Simplified): Print the total number of cases in which the current array sequence becomes Arithmetic Progression by adding a number at any...

## Copying Hero

Concepts Used Sorting Difficulty Level Medium Problem Statement (Simplified): We need to find the total number of steps need to make the current array of size N same as an...

## QUICK SORT

Concepts Used Qucik sort. Difficulty Level Hard. Problem Statement : You are given a pointer to the head of a linked list. Now the length of the linked list is...

## Largest number smaller than or equal to N and digits in non-decreasing order

Concepts Used Strings Difficulty Level Medium Problem Statement (Simplified): For a number given to us, we have to print a number less than or equal to the given number, and...

## Sort in a unique way

Concepts Used: Sorting Difficulty Level: Easy Problem Statement (Simplified): For a given array find the length of largest sorted sub-array in it, but if the current array is not sorted,...

## GCD of two numbers

Concepts Used: Mathematics Difficulty Level: Easy Problem Statement (Simplified): Print gcd of two given numbers. gcd(m,n) is the largest number possible which divides both. See original problem statement here Test...

## GCD of two very large numbers

Concepts Used: Mathematics Difficulty Level: Hard Problem Statement (Simplified): For given two large numbers M and N, find their gcd(M,N). GCD(M,N) is the larget number possible which divides both. See...