This post discusses the solution to a popular 2 dimensional dynamic programming problem known as “Edit Distance”. A working understanding of dynamic programming is needed to understand this post.
This post deals with the solution to a popular 1 dimensional dynamic programming problem. Recommended to read post on Dynamic Programming before reading this.
This posts gives an introduction to the vast and important concept of dynamic programming. This will give anyone the tools needed to start writing complex DP algorithms.
“The tower of Hanoi” is a mathematical puzzle that was invented by the French mathematician Édouard Lucas in 1883. However, legend has it that this concept was originally invented by Indian priests who were acting out the command of an ancient prophecy.
This is an algorithm used to traverse a graph consisting of nodes and edges. In this, we traverse a graph “breadth-wise”. This means we visit all the nodes of the graph by going down the different levels of the graph. However, this poses a problem.
A calculator is an object of everyday use and none of us can imagine a life without it. Therefore, I decided to make a calculator of my own using pyqt5.
This is an algorithm that is used to traverse a graph Depth-wise. We move forward in depth and visit all the adjacent nodes of a given starting node.
This is also a kind of divide and conquer algorithm where we divide the array into two parts and then call the same function on the two parts and finally merge the sorted halves.
This is a basic sorting algorithm which repeatedly finds the smallest number and replaces it with the number on the first index, then the second index and so on.
In this sorting algorithm we divide adjacent elements into “bubbles” and repeatedly swap them if they are in the wrong order, until there are no more swaps possible.