Advanced Algorithms

Detect Cycle in Graphs

October 30, 2019 • ☕️ 1 min read

A cycle is a path of edges and vertices wherein a vertex is reachable from itself

Dijkstra's Algorithm

October 30, 2019 • ☕️ 1 min read

An algorithm for finding the shortest paths between nodes in a graph

Eulerian Path Problem

October 30, 2019 • ☕️ 1 min read

A trail in a finite graph which visits every edge exactly once.

Hamiltonian Path Problem

October 30, 2019 • ☕️ 1 min read

Hamiltonian path is a path in an undirected or directed graph that visits each vertex exactly once

Hanoi Tower Mathematical Puzzle

October 30, 2019 • ☕️ 1 min read

A game consists of three rods and a number of disks of different sizes

Kruskal's Minimum Spanning Tree Algorithm

October 30, 2019 • ☕️ 1 min read

A minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest

Prim's Minimum Spanning Tree Algorithm

October 30, 2019 • ☕️ 1 min read

A greedy algorithm that finds a minimum spanning tree for a weighted undirected graph

Travelling Salesman Problem

September 13, 2019 • ☕️ 2 min read

Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?

Unique Paths Problem

August 20, 2019 • ☕️ 5 min read

A robot is located at the top-left corner of a m x n grid. The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid. How many possible unique paths are there?

Levenshtein Distance Algorithm

August 02, 2019 • ☕️ 5 min read

The Levenshtein distance is a string metric for measuring the difference between two sequences