Building Bridges
In this tutorial we shall solve building bridges problem with help of DP. This is a classical DP problem. Problem statement: Given a river,…
Box Stacking Problem
This is a classical DP problem. In this tutorial we shall see how to solve box stacking problem. We shall solve it by DP approach. Problem…
Rod Cutting Problem
In this tutorial we shall learn about rod cutting problem. Problem statement: You are given a rod of length n and you need to cut the cod in…
Get Max Coin In Game problem.
In this chapter we shall solve how to get maximum coin in a game problem with help of DP. Problem Statement: You and your friend are playing a…
Longest Bitonic Subsequence
In this tutorial we shall solve longest Bitonic subsequence using DP. Before solving the question, let’s understand what does Bitonic means.…
Dynamic Programming: Longest Increasing Subsequence
In this tutorial we shall look at longest increasing subsequence and we shall solve it by using Dynamic Programming. Problem Statement: You…
Print the nodes at k distance from the root of a binary tree
In this tutorial we shall see how to print all the nodes that is k distance from root. Problem statement: Given the root node and the distance…
Print all the paths from root node to leaf node
In this chapter we shall see how to print all the paths from root to leaf nodes. Problem Statement: You are given the root node of a binary…
Print the number of leaf nodes in a binary tree
In this chapter we shall print the number of leaf nodes in a binary tree. Problem Statement: You are given the root node of the tree. You need…
Add all the node values in a Binary Tree or Sum of a Binary tree
In this chapter, we shall see how to add all the nodes value. Problem Statement: Given a binary tree root node, return the sum of all the…