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...
CONCEPTS USED: Collatz conjecture DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given a positive number N, write a recursive function and sum all the number until N reaches to 1 after performing...
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given two strings S1 and S2, print the count of all their Interleaving Strings. NOTE: Interleaving String is a string that has...
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given a number N, print its decreasing sequence (i.e. keep subtracting by 5) till it reaches (<=0) and then print its increasing...
CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): With a given array of size N, find the largest (maximum) and smallest (minimum) element from the elements. See original problem...
CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): With a given array of size N and steps K, we have to print the array after K rotations to the...
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given a sorted array A containing N distinct elements, your task is to find the Mth permutation of the given array. For...
Concepts Used Strings, LPS array KPS Algorithm Difficulty Level Hard Problem Statement (Simplified): Find the minimum number of characters required to add to the given string to make it a...
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: Mathematics Difficulty Level: Medium Problem Statement (Simplified): We have to find in how many ways we can arrange X number of men from M men and Y women...
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given a String T, find the 1st occurrence of the capital (uppercase) alphabet. Print its index if present, else -1. See original...
Concepts Used: Mathematics Difficulty Level: Hard Problem Statement (Simplified): In this problem, we have to find a total number of ways to form a team of size K from X...
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given a string, write a recursive code to print all subsets of it. The subsets are to be printed in lexicographical(alphabetic) order....
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given an array containing N elements and an integer K, find the number of ways to calculate the value of K using...
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given an integer N, recursively find the multiplication of digits of N modulus with 10^9+7. See original problem statement here For Example:...
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given a digit N and an integer Sum, print all the N-digit integers whose digit sum is equal to the given Sum....
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an integer N, print all N-digit numbers with sum of digits at Even index equal to sum of digits at Odd...
CONCEPTS USED: Basic Mathematics, Co-ordinate Geometry DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given 4 coordinate points, check if the given quadrilateral formed from given coordinates forms a Square or not, print...
CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array A which contains the sorted time points at which a hero named Saitama punches and paralyzes his enemy...