Search Results for: python algorithm

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: 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

Implementing graph with python and how to traverse.

When we talk about algorithms, graphs are one of the most important parts to know about. In this session, we will talk about graphs and implementing graph in python. What is a graph? A graph is a data structure consists of nodes and edges. It is nonlinear and can form very complex structures. If you

Sieve of eratosthenes in python for Generating Prime numbers

Prime numbers are very important. Most of the modern day encryption decryption relies heavily on these prime numbers. Thus generating these prime number is a good task in itself. In this article we will see how we can generate list of prime number using sieve of Eratosthenes. What is sieve of Eratosthenes? To find all the prime

Length of Longest Increasing Subsequence (LIS) in python [Dynamic Programming]

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

Build desktop notifier using python and notify2.

You must have heard about desktop notifier, today we are going to build one and see how it works. We are going to do it using python and we will do it on ubuntu for now. So, lets start to build desktop notifier using python. Lets build desktop notifier using python For building this we

Level order traversal of a binary tree in python.

Binary tree are the tree where one node can have only two child and cannot have more than two. Level order traversal of a binary tree. Level order traversal means that we visit the nodes level by level. Like for below tree the level order traversal will be  Its Level order traversal will be 1

Are you preparing for DevOps and SRE Interview?

Here is a book for you.


Interview preparation and interview questions for DevOps and SRE







A good reads for last-minute preparations for handling DevOps and SRE interviews at companies like LinkedIn, Visa, Atlassian, etc.