Posts by Zeeshan Alam

Author Biographical Info:

Longest Common Substring in C++ using dynamic programming

By Zeeshan Alam

In this tutorial, we will learn about how to find the longest common substring(LCS) by using a dynamic approach. We will also see the code implementation in c++ to find the longest.... Read More

Build balanced BST from sorted array in C++

By Zeeshan Alam

In this tutorial, we will learn to how to build a balanced BST(binary search tree) from a sorted array in C++. We will also see examples to understand the concept in a better way. .... Read More

Root to leaf path sum in a Binary tree in C++

By Zeeshan Alam

In this tutorial, we will learn about how to find the root to leaf path sum in a binary tree. We will also see the recursive code implementation in C++. We will also see the exampl.... Read More

Cutting a Rod problem in C++

By Zeeshan Alam

In this tutorial, we will learn about cutting a rod problem in C++. We will also see the use of dynamic programming to solve the cutting of the rod problem. We will also see exampl.... Read More

Longest Increasing Subsequence in C++

By Zeeshan Alam

In this tutorial, we will learn about how to find the longest increasing subsequence in C++ using dynamic programming. We will also see the code implementation in C++. We will also.... Read More

Level of a Node in a Binary Tree in C++

By Zeeshan Alam

In this tutorial, we will learn about how to find the level of the node in a binary tree. We will also see the code implementation in c++. We will also see examples to understand t.... Read More

Top view of binary tree in C++

By Zeeshan Alam

In this tutorial, we will learn about the top view of the binary tree in c++. We will also see the code implementation to find out the top view of the binary tree. We will also see.... Read More

Bottom view of the binary tree in C++

By Zeeshan Alam

In this tutorial, we will learn about the bottom view of the binary tree in C++. We will also see the code implementation to print the bottom view of the binary tree. We will see e.... Read More