Skip to content

Category Archives: Recursion

Given a string str and a string array arr[], the task is to find the minimum count of substrings this can be splitted into such… Read More
Write a program in C++ to print an Array using Recursion Using static variable: Static variables have a property of preserving their value even after… Read More
Given a linked list which represents an integer number where each node is a digit of the represented integer. The task is to add a… Read More
Given an array arr[] and an integer K. The task is to divide the array into K parts ( subarray ) such that the sum… Read More
The basic version of the Tower of Hanoi can be found here. It is a twisted Tower of Hanoi problem. In which, all rules are… Read More
Given 3 integers N, M, and K. The task is to find maximum P such that N * KP ≤ M.  Examples:   Input :N =… Read More
Given an integer N. The task is to find the number in the range from 1 to N-1 which is having the maximum number of… Read More
Given a Binary Tree having positive and negative nodes, the task is to find the maximum sum level in it and print the maximum sum.… Read More
Consider a row of n coins of values v1 . . . vn, where n is even. We play a game against an opponent by… Read More
Given a string str, the task is to print all the permutations of str. A permutation is an arrangement of all or part of a… Read More
Given an N * N binary maze where a 0 denotes that the position can be visited and a 1 denotes that the position cannot… Read More
Given a linked list, the task is to reverse the contiguous even elements and print the updated linked list. Input: 1 -> 2 -> 3… Read More
Given two integers M and K, the task is to find the Kth smallest number with digit sum as M. Examples: Input: M = 5,… Read More
Given an array of distinct integer A, the task is to count the number of possible permutations of the given array A[] such that the… Read More
Given a Binary Tree, print Bottom-Right view of it. The Bottom Right view of a Binary Tree is a set of nodes visible when the… Read More