The LIS or longest increasing subsequence means to find a subsequence in list of numbers in which the subsequence’s elements are in ascending order and in which the subsequence is as long as possible. This subsequence does not have to be continuous. Here we have to find the length of the longest increasing subsequence. We

# Tag: algorithms

## Algorithms: Binary Search Tree and its functionality in python

Back in the algorithms section with python we are going to see how we can code Binary Search Tree and its functionality in python. Binary search tree are binary tree where the left child is less than root and right child is greater than root. We will be performing insertion, searching, traversal, min and other

## Algorithms: Left view of a binary tree.

In the algorithm section I am here going to share how to get the left view of the binary tree. For that you must know what is binary tree. Algorithms: Left view of a binary tree. Binary tree are the tree where one node can have only two child and cannot have more than two.

## Algorithms: Mirror a Binary tree using python

In this article we are going to see how we can mirror a binary tree using python. Lets see what are binary tree Algorithms: Mirror a Binary tree using python Binary tree are the tree where one node can have only two child and cannot have more than two. Traversal means visiting all the nodes

## Major algorithms asked during Interviews.

Here I am going to mention the list of major algorithms asked during Interviews. You can find the list as below. Major algorithms asked during Interviews. Graph 1. Breadth First Search (BFS) 2. Depth First Search (DFS) 3. Shortest Path from source to all vertices **Dijkstra** 4. Shortest Path from every vertex to every other