MONOPOLY
CONCEPTS USED: Recursion and memorization. DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT$($SIMPLIFIED$)$: There are notes having values V1,V2,V3...Vn arranged in a row. You and your friend take turns alternatively. In each turn...
Longest Palindromic Substring
CONCEPTS USED: Recursion,Dynamic programming. DIFFICULTY LEVEL: Hard PROBLEM STATEMENT (SIMPLIFIED): You are given a string str, find the longest palindromic substring in str. Longest Palindromic Substring of string str:LPS[i...j], where...
REVERSE A LINKED LIST
Concepts Used Linked list,recursion. Difficulty Level Easy. Problem Statement : Given pointer to the head node of a linked list, the task is to reverse the linked list. See original...
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 1st row and...
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: Interleaving String is a string that has...
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...
PERMUSEQ
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...
First Capital Using Recursion
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...
POWERLEX
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....
Mike and Exam
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...
Multiplication of Digits
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:...
N Digit Sum
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....
N Digit Sum Even Odd
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...
Quadrilateral
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...