Ue Kiao, PhD - OpenGenus IQ: Computing Expertise & Legacy

String isomorphism

In this article, we will learn about string isomorphism and algorithms to solve this problem efficiently.

Graph and subgraph isomorphism

In this article, we will learn about graph and subgraph isomorphism and the algorithms to check for graph and subgraph isomorphism.

List of Mathematical Algorithms

Mersenne prime numbers

When 2^n -1 is prime, it is said to be a Mersenne prime. In this article, we have explored this concept of Mersenne prime numbers in depth along with algorithms + implementations to find Mersenne prime numbers.

Algorithms

Greedy Algorithm vs Dynamic programming

In this article, we will discuss greedy methods vs dynamic programming. Both of them are used for optimization of a given problem. Optimization of a problem is finding the best solution from a set of solutions.

Algorithms

Time and Space Complexity of Prim’s algorithm

In this article, we will learn more about Prim's algorithm and analyze its complexity for different cases and implementation approaches.

Algorithms

Interpolation Search [EXPLAINED]

In this article, we have explained the concept of Interpolation Search and analyzed the performance of interpolation search in terms of time and space complexity.

backtracking

Iterative Backtracking

In this article, we will be exploring the idea of backtracking with the help of iteration (Iterative Backtracking) along with example as well. The Time and Space Complexity will be discussed at the end of the article.

Algorithms

Generate all palindromes less than N

In this problem, we will see how to generate palindromic number in a given range efficiently by exploring the patterns of palindromes.

Algorithms

Scramble String problem

We will be given two strings a, and b we have to check whether one string is scrambled version of other string or not.

Algorithms

Biconnected graph

A biconnected graph is a graph that is connected and has no articulation points.

Graph Algorithms

Entropy of Graph

In graph theory, entropy is the index for describing the structure and function of a network. Entropy is related to amount of information stored in a graph. This is used in field of computer science to check compression of data as compressed data is more random and hence has higher entropy.

Algorithms

Geometric Hashing

Geometric hashing is a computer vision technique used to detect geometric features in images and matching them to a database with such features. What makes geometric hashing stand out is that it can detect overlapping objects.

List of Mathematical Algorithms

Zeckendorf's theorem

The Zeckendorf's theorem states that every positive integer can be represented uniquely as a sum of one or more distinct non-neighboring or non-consecutive Fibonacci numbers.

game theory

Game Tree

In this article, we have covered the concept of how Backtracking help us to solve Game Tree. We will solve the Game Tree Problem by making use of the Minimax Algorithm. We have presented the Time and Space Complexity for various cases.

Computer Architecture

Formula for CPU FLOPs (theoretical max)

In this article, we have presented the formula to calculate theoretical max FLOPs for a given CPU system and understand the logic behind it.

Hashing

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.

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.

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.

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.

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.

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

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.

trie

Find word with maximum frequency using Trie

In this article, we will design an algorithm to Find word with maximum frequency using Trie Data Structure.

Algorithms

Hashing: Complete Guide

In hashing, we convert key to another value. It is a searching technique. In linear search the time complexity is O(n),in binary search it is O(log(n)) but in hashing it will be constant. We make use of a hash function and a hash table.

Algorithms

Merge Insertion Sort

Merge Insertion Sort is the combination of Merge sort and Insertion sort that minimizes the worst case time complexity for smaller value of n.