Algorithms

Data Communication and Computer Networks

Distance Vector in Computer Network

In this article, we have covered the idea of Distance Vector in Computer Network in depth along with Routing and Distance Vector Routing protocol.

Interview Problems on Array

Maximum consecutive ones when at most k zeros can be flipped

In this article, we have explored algorithms to Find the longest sequence of consecutive ones when at most k zeros can be altered to 1. This involve techniques like Sliding Window approach.

Interview Problems on Array

MEX (minimum excluded) of a sequence (with updates)

In this article, we have explored approaches to find the MEX (minimum excluded) of a sequence (with updates) efficiently with pre-computation.

Algorithms

Find elements that appear more than N/3 times

In this article, we have solved the problem of finding elements that appear more than N/3 times. This involve ideas of Hash Map and Boyer Moore algorithm.

Algorithms

Max path sum between two nodes in Binary Tree

In this article, we have explored algorithms to find the Max path sum between two nodes in Binary Tree along with time and space complexity.

Algorithms

K-th smallest element of two sorted arrays

In this article, we have explored algorithms to find the K-th smallest element of two sorted arrays. This involve the idea of Binary Search.

Compiler Design

Sethi Ullman algorithm

The Sethi-Ullman algorithm is an optimal algorithm used for finding an optimal ordering of a computation tree. We discuss two generalizations that increase its applicability without increasing the cost.

Problems on Binary Tree

Boundary Traversal of Binary Tree

In this article, we have explored the approach of Boundary Traversal of Binary Tree along with Time and Space Complexity.

computational geometry

Section formula

In this article, we have explored the Section formula in Computational Geometry which deals with straight lines getting divided in a given ratio. This is an important concept.

computational geometry

Direction of point from line segment

In this article, we have explored algorithm to find the Direction of point from line segment.

Algorithms

Morris Inorder Traversal in Binary Tree

In this article, you will learn about a method to traverse a tree in O(1) space complexity that is without using recursion or stack. We will use the concept of Single Threaded Binary Tree.

List of Mathematical Algorithms

N-th root of a number

In this article, we have explained three different algorithms to find the N-th root of a number.

Algorithms

0-1 Knapsack problem using Branch and Bound

In this article, we have explored the Branch and Bound algorithm for 0-1 Knapsack problem.

Time Complexity

Iteration Method for Time Complexity

In the following article, we have presented the Iteration method for finding the Time complexity of an algorithm in detail.

Search Algorithms

Iterative Deepening Search

In this article, we are going to discuss about the Iterative Deepening Search Technique. It is also, known as Iterative Deepening Depth-First Search ( IDDFS) and is a modification of Depth First Search and Depth Limited Search.

backtracking

Backtracking Algorithm for Sudoku

In this article, we have covered the Backtracking Algorithm for Sudoku and compared with the Brute Force approach. We have presented the Time and Space Complexity for various cases.

Algorithms

Branch and Bound Technique

With this article, you have explained the idea of Branch and Bound Technique, types of Branch and Bound Technique and applications of the technique.

computational geometry

Check if line intersects circle

In this article, we have explained how to check if line intersects circle and have provided three mathematical proofs along with implementation.

Culture

Inventor of Linked List

Linked List is one of the most fundamental Data Structure and it was developed in 1953 by Hans Peter Luhn, Allen Newell, Cliff Shaw and Herbert Simon from IBM and RAND Corporation.

Algorithms

Fractional Knapsack problem

In this article, we have explored fractional knapsack problem with examples. We have covered multiple approaches to solve this.

Algorithms

Convert Octal to Decimal

In this article, we will be going to solve a problem named convert octal to decimal. This is a very basic problem of computer science involving ideas of base in number system and conversion.

Algorithms

Maximum size square submatrix with all 1s

In this article, we have explored various ways to solve the problem of finding maximum size square submatrix with all 1s. This can be solved using Dynamic Programming.

Algorithms

De Bruijn Sequences

In this article, we have explored De Bruijn Sequences and 3 algorithms to calculate De Bruijn Sequences using ideas like Hamiltonian Cycle, Euler's path.

Algorithms

Find Cube root using Binary Search

In this article, we have explained the algorithm to Find Cube root using Binary Search along with Time and Space Complexity analysis.

Algorithms

Search an element in Sorted 2D matrix

In this article, we will learn about how we can search for a particular element in a sorted 2D matrix.