blue_green_deployments

What is blue green deployment.


If you are around devops people or people who are working with deployments in your industry. You must have heard of the name blue green deployment. Most of the companies in the world use this technique to get the least down time for their respective products. This deployment is old but still one of the

Pure and impure functions

Difference between pure and impure functions.


What are pure and impure functions? Pure functions: These are functions which are sure to provide exact result when the same arguments are passed. For having a function as pure function if must not have any external variable, data store call, ajax request or any other global variables. This means that you can be completely

Binary Tree and its traversal using python.

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

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

Algorithms: Coding a linked list in python

Algorithms: Coding a linked list in python


So next in the algorithm section we are going to write a linked list using python. If you don’t know what is linked list you can read it here. Algorithms: Coding a linked list in python A linked list is a linear collection of data elements, called nodes, each pointing to the next node by

Major algorithms asked during Interviews.

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