## Difference between Recursion and Iteration

A program is called recursive when an entity calls itself. A program is call iterative when there is a loop (or repetition). Example: Program to… Read More »

- Reduce a number to 1 by performing given operations
- Water Jug Problem using Memoization
- Ways to write N as sum of two or more positive integers | Set-2
- Sum of the nodes of a Singly Linked List
- Print all the combinations of a string in lexicographical order
- Check if two trees have same structure
- Difference between Recursion and Iteration
- Perform the given queries on the rooted tree
- Number of ways to represent a number as sum of k fibonacci numbers
- Next greater Number than N with the same quantity of digits A and B
- Count all pairs of adjacent nodes whose XOR is an odd number
- Find nth term of a given recurrence relation
- Sum of the alternate nodes of linked list
- Product of the alternate nodes of linked list

A program is called recursive when an entity calls itself. A program is call iterative when there is a loop (or repetition). Example: Program to… Read More »

Given a linked list, the task is to print the product of alternate nodes of the given linked list. Examples: Input : 1 -> 8… Read More »

Given a linked list, the task is to print the sum of the alternate nodes of the linked list. Examples: Input : 1 -> 8… Read More »

Given a rooted tree and not necessarily binary. The tree contains N nodes, labeled 1 to N. You are given the tree in the form… Read More »

Given a number and two digits and . The task is to find the least number not less than N which contains the equal number… Read More »

Given a number N, the task is to find the number of ways N can be partitioned, i.e. the number of ways that N can… Read More »

Let an be a sequence of numbers, which is defined by the recurrence relation a1=1 and an+1/an=2n. The task is to to find the value… Read More »

Given a Binary Tree as shown below. The task is to count all pair of adjacent nodes whose XOR is an odd number. Explanation: Initially,… Read More »

Given a singly linked list. The task is to find the sum of nodes of the given linked list. Task is to do A +… Read More »

Given two binary trees. The task is to write a program to check if the two trees are identical in structure. In the above figure… Read More »

Given two jugs with the maximum capacity of m and n liters respectively. The jugs don’t have markings on them which can help us to… Read More »

Given a number N. The task is to reduce the given number N to 1 in the minimum number of steps. You can perform any… Read More »

Given a string str, print of all the combinations of a string in lexicographical order. Examples: Input: str = “ABC” Output: A AB ABC AC… Read More »

Given two numbers N and K. Find the number of ways to represent N as the sum of K Fibonacci numbers. Examples: Input : n… Read More »

Given a function gcd(a, b) to find GCD (Greatest Common Divisor) of two number. It is also known that GCD of three elements can be… Read More »