Posts by Zeeshan Alam
Author Biographical Info: Not available
Longest Common Subsequence in C++ using Recursion
In this tutorial, we will learn about how to find the longest common subsequence (LCS) in C++ by using recursion. We will also see the code implementation in c++ to find the longes.... Read More
Mirror of a Binary Tree in C++
In this tutorial, we will learn about how to build a mirror of the binary tree in C++. We will also see examples to understand the concept in a better way. Find or Create the Mir.... Read More
Lowest common ancestor (LCA) in a Binary tree in C++
In this tutorial, we will learn about the lowest common ancestor in a binary tree in C++. We will also see the pseudocode to how to find LCA in a binary tree. We will also see exam.... Read More
Longest Common Substring in C++ using dynamic programming
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++
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++
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++
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++
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