ProDeveloperTutorial

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…

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…

In this tutorial we shall solve longest Bitonic subsequence using DP. Before solving the question, let’s understand what does Bitonic means.…

In this tutorial we shall look at longest increasing subsequence and we shall solve it by using Dynamic Programming. Problem Statement: You…

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…

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…

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…

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…

In this tutorial we shall check if the tree is a sum tree or not. Problem Statement: You are given the root node of a binary tree. You need to…

In this chapter, we shall see if 2 trees are identical. Problem statement:  You are given root node of 2 binary trees, you need to check if 2…