Algorithms that run our Universe

Fibonacci Hashing

In this article, an underlooked kind of hash function is to be discussed, the Fibonacci Hashing. It is another form of multiplicative hashing function that is related to the golden ratio.

Algorithms

Implementing Quick Sort in Java

In this article, we are going to learn about the implementation of quick sort algorithm in Java.

Algorithms

Stack vs Queue [Differences]

In this article, we will be discussing about "Stack vs Queue" in detail.

Algorithms

Iterative In-order Traversal

In this article, we have explored the concept of Iterative In-order Traversal along with detailed step by step example and complete implementation.

Problems on Binary Tree

Degenerate or Pathological Tree

Degenerate or Pathological Tree is a variant of Binary Tree which we have explored in depth along with code implementation for Degenerate or Pathological Tree.

String Algorithms

Power Set of String in Lexicographic order

In this article, we have explored what is the meaning of Power Set of String and the algorithm to generate Power Set of String in Lexicographic order.

Graph Algorithms

Directed vs Undirected Graph

In this article, we have explained the differences between Directed and Undirected Graphs based on different attributes such as adjacency matrix, entropy and much more.

Algorithms

Convert Binary to Hexadecimal, Octal, Decimal

In this article, we will discuss how we can convert a binary number to a hexadecimal, octal, and decimal number.

Algorithms

Iterative post-order traversal

In this article, we have explained how to do Iterative post-order traversal of a Binary Tree using 3 different techniques along with complete implementation.

trie

Dictionary using Trie

In this article, we will learn about the Trie data structure and its application in dictionary.

Algorithms

Weight Balanced Binary Tree

A self-balancing binary search tree is a type of binary tree that automatically adjusts its structure on insertion or deletion in order to maintain balance. Here, we will learn about Weight Balanced Binary Tree, which is a type of self-balancing binary search tree.

Sorting Algorithms

Bubble sort vs Selection sort

Bubble sort and Selection sort are both comparison-based sorting algorithms which can be differentiated through the methods they use for sorting. But before going through the key differences between them, let's understand how both of these algorithms work.

Algorithms

3D Kadane's algorithm

In this article we are going to learn about what kadane's algorithm is and will also see how to apply it on 3-dimensional arrays to generate a sub-cube with maximum sum of its elements (3D Kadane's algorithm).

backtracking

Backjumping

In this article, we have covered the concept of Backjumping which is an improvement to the Backtracking Algorithm. We will solve the N Queens Problem by making use of the Backjumping Algorithm. We have presented the Time and Space Complexity for various cases.

String Algorithms

Minimum Window Substring

Given two strings A and B. We need to find the smallest substring of A that has all the characters in B. If there is no such string, then the answer will be an empty string.

Problems on Binary Tree

Almost complete binary tree

In this article, we have explored the concept of Almost complete binary tree.

Algorithms

Strictly Binary Tree

A binary tree is a type of the tree data structure in which a parent node has at most two child nodes. Here, we will understand an important type of binary tree called Strictly Binary Tree and see how it differs from other binary tree types.

Problems on Binary Tree

Perfect Binary Tree

Perfect Binary Tree is one of the types of Binary Tree data structure. In this article, we will learn about the Perfect Binary Tree and its properties. We will also see how it differs from other types of Binary Tree.

String Algorithms

N-th Permutation of a string

Given a string of length of `m` containing only lowercase alphabets. Find out the lexicographic `nth` permutation of the given string.

Algorithms

Complete Binary Tree

In this article, we will learn about the what is the tree, Binary tree and complete binary tree also how it differs from a general Binary Tree in terms of different operations.

String Algorithms

Lexicographic next string

In this article, we are going to find the lexicographic next string for the given string.

Algorithms

Preorder traversal in Binary Tree [Iterative + Recursive]

Preorder traversal is one of the traversal in binary tree in which the root node is visited first then the left subtree and then the right subtree. The order can be written as ROOT LEFT RIGHT.

Time Complexity

Time and Space Complexity of Merge Sort on Linked List

In this article, we will learn about the space and time complexity of the Merge sort algorithm on Linked List using Mathematical analysis of various cases.

Algorithms

Add digits of a number [Algorithm + Time Complexity]

In this article, we have explained the algorithm to add digits of a number N and presented the time and space complexity analysis. We have present an implementation in C Programming Language as well.

Algorithms

First K maximum occurring words

In this article, we will understand the different approaches to return the first k maximum occurring words from a given array. It includes core Data Structures and Algorithm topics such as Arrays, HashMap, Sorting, Priority Queue and Heap, Trie, and Bucket sort.