CONCEPTS USED: Binary Search DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array H of lengths of Magical Ropes and array R of the rate by which rope increases daily, print...
CONCEPTS USED: Searching DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given a sorted array A and a number x. find the largest value in the array that is less than or equal...
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given N pairs of Binary Numbers 0 and 1, your task is to generate all possible combinations such that for each 0...
CONCEPTS USED: Binary Search, Mathematics DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given a number N, your task is to find the count of all such numbers that have N trailing zeros...
CONCEPTS USED: Searching DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given an array A of unique heights of buildings. The sun is facing buildings from left to right, print the number of...
Concepts Used Strings, Hashing Difficulty Level Easy Problem Statement (Simplified): Check if string B can be achieved by A by rearranging letters of A. If yes print Yes else No;...
Concepts Used Strings Difficulty Level Hard Problem Statement (Simplified): Find the maximum answer by evaluating the given string and putting a bracket anywhere in the string. See original problem statement...
Concepts Used Strings, Hash Table Difficulty Level Hard Problem Statement (Simplified): Find the total number of children standing on each square after 10100 rotations by every individual child. Each child...
Arrays are the data structures that enables us to store data of similar type under the same variable name. It can be used to store the details of the student...
Concepts Used Strings Difficulty Level Hard Problem Statement (Simplified): Print the decimal output of the fraction of two given numbers and enclose the repeating part in decimal places in brackets....
CONCEPTS USED: Arrays DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array A of N positive integers. The task is to find the maximum of j - i such that A[j]...
CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given an array A with N-1 elements, with elements from 1 to N present into it. Find a single missing element....
CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given a magical container such that whenever :- A Red Stone is added to the ith bag, the quality factor of...
CONCEPTS USED: Post Min array DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array A with N elements, your task is to divide the array in maximum possible segments such that...
CONCEPTS USED: Hashing DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given an array A with N elements containing all elements from 0 to N-1, your task is to find the maximum length...
CONCEPTS USED: Hashing DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given an array A with N integers, find the count of unique integers in the array. See original problem statement here For...
CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Print all those elements that have no element greater than them in the right side of the array. Print elements from...
Finding the number of subarrays with a sum greater than or equal to a given value K is a common problem in array manipulation. The task involves determining the count...
Concepts used: Two Pointers Technique Difficulty level: Medium Problem statement(SIMPLIFIED): Given an array A with N elements arranged in an ascending order, also given a number K. Check if their...
In this article, we will be looking at how we can solve the problem Greater than neighbor, in which you are given an Array and you need to print all...
CONCEPTS USED: Searching DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given a number N, find the smallest number that has same set-of-digits as N and is greater than N. If N is...
CONCEPTS USED: Suffix Sum Arrays DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array of N integers and an integer K, the task is to find the maximum sum taking every...
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 Arithmetic Progression...
CONCEPTS USED: Hashing DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given N ages of students of a college and some conditions which determine whether A can Friend Request B or not. Determine...
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given a string S, print the count of all contiguous substrings that start and end at the same character. For Example: Input...
CONCEPTS USED: Binary Search DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given two numbers N(number of rows) and I(index of a row), such that given a 0 in the 1st row and...
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: Recursion DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given a matrix M*N containing only lowercase english alphabets, your task is to select elements from the first row one by one,...
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given a number N, your task is to print all possible permutations of its Binary Representation. NOTE : Print the output in...
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given a number N, check whether the number is palindrome or not using recursion. The palindrome number remains the same when its...