Generate all Pairs of 0 and 1
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...
Substring Start End Same
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...
Shubhaluxumy loves Binary Number
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 1^{st} row and...
Range Even
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...
Matrix and combination
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,...
Mike and Binary Number
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...
Check Palindrome
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...
Sum of Sequence
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...
Pragya and Gold Medalist
CONCEPTS USED: Recursion DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given two strings S1 and S2, print the count of all their Interleaving Strings. > >NOTE: >>1. Interleaving String is a string...
Print the Pattern
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...