Algorithms that run our Universe

SHA1 Algorithm (+ JavaScript Implementation)

In this article, we have explained the algorithmic steps in SHA1 Algorithm in depth. We have demonstrated an example by implementing SHA1 algorithm in JavaScript.

Algorithms

Binary Search in a Linked List

You are given a sorted singly linked list and a key (element to be searched), find the key in the linked list using binary search algorithm. The challenge is to find the middle element as Linked List does not support random access.

Problems on Binary Tree

Finding Diameter of a Tree using DFS

In this article, we will be discussing how to find the diameter of a tree or graph using Depth First Search (DFS).

Problems on Binary Tree

Diameter of a Binary Tree

In this problem, we are given input as the reference to the root of a binary tree. We need to find the diameter of the tree. We find the diameter using recursion and Depth First Search (DFS).

Algorithms

Understand Randomized Algorithms once and for all

In this post, we discuss what randomized algorithms are, and have a look at the Solovay-Strassen Primality Tester to see what they are like.

Algorithms

NP Complete Complexity

In this article, we have explored the idea of NP Complete Complexity intuitively along with problems like Clique problem, Travelling Salesman Problem and more.

Algorithms

Strategy to win Minesweeper

Many may think Minesweeper is a random game but it is a strategy game and you can win it everytime if you know the rules involved and proven strategies to play it.

Algorithms

C program to check whether brackets are Balanced in an Equation

We have developed a C program to check whether brackets are Balanced in an Equation using the Stack data structure and solving it in O(N) time.

Algorithms

Hospital Residents Problem

We have explored Hospital Residents Problem which is an matching problem similar to Stable Room Mates problem and Gale Shapley algorithm. In this, we match applicants to programs/ jobs.

Algorithms

Maximum cut problem

In this article we'll be discussing on the concept of Maximum cut problem. Firstly will understand its basic concept with Introduction. Secondly, with a graph example will deep-dive into the concept.

Algorithms

Find articulation point in Graph

In this article we'll be discussing on how to find articulation point in Graph. Firstly we'll discuss on the Introduction to Articulation Points. Secondly, we'll understand the Articulation Points concept with a graph example. At the end will write a Pseudo code & implementation for the same.

Algorithms

Number of substrings in a string divisible by 6

Given a string of integers, find the count of sub-strings of given string which are divisible by 6. This problem can be solved using Dynamic Programming in O(N) time complexity where N is the length of the string.

Algorithms

Algorithm to detect and remove loop in a Linked List

Given a Linked list, find out whether it contains a loop or not. If it does, then remove the loop and make the last node point to NULL.

Problems on Binary Tree

Algorithm to find Level of each node from root node

In this article we will be discussing on how to find the level of each node in a graph, the algorithm that we will be using to find the level of each node is breadth first search.

Problems on Binary Tree

Counting subtrees where nodes sum to a specific value

We will learn about counting the subtrees in a binary tree whose nodes sum to a given value. We will be trying different methods to solve our problem We will solve it in O(N) time complexity and O(H) space complexity where N is number of nodes and H is the height of the tree.

Algorithms

Algorithm to find all bridges in a Graph

In this article we'll be discussing on the algorithm to find all bridges in a Graph. Firstly we'll discuss on the Introduction to Bridges. Secondly, we'll understand the bridge concept with a graph example.

Algorithms

Algorithm to check if a linked list is sorted

In this article, we have explored an algorithm to check if a given Linked List is sorted or not in linear time O(N). It takes constant space O(1).

Algorithms

Approximation Algorithm for Travelling Salesman Problem

In this article we will briefly discuss about the Metric Travelling Salesman Problem and an approximation algorithm named 2 approximation algorithm, that uses Minimum Spanning Tree in order to obtain an approximate path.

Algorithms

Check if Linked List is Empty

Checking if the given Linked List is empty depends on the ways Linked List has been formed (with or without root). We have covered both approaches.

Algorithms

Word Break Problem

In this article we are going to talk about a very interesting problem: Word Break Problem. This can be solved using Dynamic Programming [O(N^2) time, O(N^2) space].

Algorithms

Check whether a Singly Linked List is Palindrome or not

Linked List can be palindrome if they have the same order when it traverse from forward as well as backward. This is solved using three methods: using stack, string and by reversing the list.

Algorithms

Cycle in a graph using degree of nodes of the graph

There are different ways of detecting cycle in a graph. Let us understand how to detect cycles in an undirected graph using the degree of each vertex.

Algorithms

Transpose Graph

In this article, we will explore the idea of Transpose Graph along with the basics of Graph Data Structures. We have presented an algorithm to get the transpose of a graph as well.

Problems on Binary Tree

Find number of Universal Value subtrees in a Binary Tree

In this article, we will be working on finding number of subtrees whose nodes have same value, called universal value subtree or simply univalue subtree.

Algorithms

Minimum number of increment operations to make K elements of an array equal

Given an array arr[] of n elements and an integer k, the task is to make any k elements of the array equal by performing only increment operations. This is solved using sliding window technique.