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: 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: 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...
The concept of finding the minimum number of notes refers to a problem often encountered in programming, where the goal is to determine the smallest number of currency notes required...
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...
Welcome to the world of array manipulation! If you've ever found yourself pondering over the task of converting a straightforward array into a zigzag array, you're in the right place....