## Count Unary Numbers in a Range

Given two numbers A and B, A<=B, the task is to find the number of unary numbers between A and B, both inclusive. Unary Number:… Read More »

- Recursively Reversing a linked list (A simple implementation)
- Print the last k nodes of the linked list in reverse order
- Check if a word exists in a grid or not
- Program to check if an array is palindrome or not using Recursion
- Print all permutations of a string in Java
- Generating subarrays using recursion
- Recursive program to print all subsets with given sum
- Count ways to reach a score using 1 and 2 with no consecutive 2s
- Java Program to print distinct permutations of a string
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Count all Grandparent-Parent-Child Triplets in a binary tree whose sum is greater than X
- Generating all possible Subsequences using Recursion
- Printing all subsets of {1,2,3,...n} without using array or loop
- Check whether the two Binary Search Trees are Identical or Not
- Print all paths from top left to bottom right in a matrix with four moves allowed
- Count all possible position that can be reached by Modified Knight
- Find Nth term (A matrix exponentiation example)
- Print all subsequences of a string using ArrayList
- Longest Ordered Subsequence of Vowels
- Algorithms | Recurrences | Set 1
- Count of Numbers in a Range divisible by m and having digit d in even positions
- Maximum length of segments of 0's and 1's
- Find the value of ln(N!) using Recursion
- Number of Binary Strings of length N with K adjacent Set Bits
- Double Knapsack | Dynamic Programming
- Split the array into equal sum parts according to given conditions
- Check if the given binary tree has a sub-tree with equal no of 1's and 0's | Set 2
- Product of 2 numbers using recursion | Set 2
- Number of balanced bracket expressions that can be formed from a string
- Recursive Program for Binary to Decimal

Given two numbers A and B, A<=B, the task is to find the number of unary numbers between A and B, both inclusive. Unary Number:… Read More »

Given a natural number n, print all the subsets of the set without using any array or loop (only the use of recursion is allowed).… Read More »

Given n companies and m oil mines having values, the task is to distribute the mines among n companies in a fair manner. That is… Read More »

Given a chessboard of size 8 x 8 and the current position of Mirandote. All the rules of this chess game are same but the… Read More »

Given the root nodes of the two binary search trees. The task is to print 1 if the two Binary Search Trees are identical else… Read More »

Given an array. The task is to determine whether an array is a palindrome or not using recursion. Examples: Input: arr[] = {3, 6, 0,… Read More »

Given two numbers N and M. The task is to find the product of the 2 numbers using recursion. Note: The numbers can be both… Read More »

Given pointer to the head node of a linked list, the task is to recursively reverse the linked list. We need to reverse the list… Read More »

Given an array. The task is to generate and print all of the possible subsequences of the given array using recursion. Examples: Input : [1,… Read More »

Given an array, generate all the possible subarrays of the given array using recursion. Examples: Input : [1, 2, 3] Output : [1], [1, 2],… Read More »

We are given a recursive function that describes Nth terms in form of other terms. In this article we have taken specific example. Now you… Read More »

Given a string comprising of ones and zeros. The task is to find the maximum length of the segments of string such that a number… Read More »

Given two numbers and . The task is to find the number of ways in which a can be represented by a set such that… Read More »

Find the nth node from the end in the given linked list using a recursive approach. Examples: Input : list: 4->2->1->5->3 n = 2 Output… Read More »

Given an integer n and an array of positions ‘position[]’ (1 <= length(position[]) <= 2n), find the number of ways of proper bracket expressions that… Read More »