Algorithms that run our Universe

Perlin Noise (with implementation in Python)

One of the most important algorithms in computer graphics and procedural generation is Perlin Noise. Perlin Noise is an algorithm that generates textures and terrain-like images procedurally (without the need for an artist to manually create the images).

prefix sum array

Corporate Flight Bookings problem [Solved]

In this article, we will solve Corporate Flight Bookings problem using prefix sum algorithm. In naïve approach, it will take a quadratic O(N^2) time complexity but using a prefix sum approach we can get better time complexity.

Data Structures

Abstract Data Type in Data Structure

In this article, we have explained the concept of Abstract Data Type in Data Structure in depth along with code examples and theoretical examples of Data Structures. The best examples of Abstract Data Type come from C++ STL (Standard Template Library) and Java Collections.

Algorithms

2D Sliding Window

In this article, we have explored how to apply the concept of Sliding Window on a 2D array that is 2D Sliding Window. We have presented the concept along with implementation and time and space complexity.

Algorithms

Nature Inspired Algorithms

There is no better teacher than nature herself , she never rushes but everything is established. Have you ever wondered how our human brain is able to distinguish thousands of dog breeds from cats' even if we had never seen few of the breeds before too?

backtracking

Kirkman Schoolgirls Problem

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

List of Mathematical Algorithms

Oppermann's conjecture

In this article, we have explored Oppermann's conjecture and implemented a program in an attempt to prove or disprove it. This is an important conjecture for prime numbers.

Hashing

Open Addressing - a collision handling method in Hash Tables

In this article, we have explored Open Addressing which is a collision handling method in Hash Tables. We have explored the 3 different types of Open Addressing as well.

recursion

Non-Tail Recursion

In this article, we will be in depth discussing about Non-Tail Recursion. The basic algorithm, its time complexity, space complexity, advantages and disadvantages of using a non-tail recursive function in a code.

Algorithms

K-th Largest Element in Array

In this article, We will discuss 4 different approaches to find the kth largest element in the given array.

Algorithms

Shannon Fano coding

In this article we are going to talk about the classic data compression algorithm called "Shannon-Fano code".

trie

Top K Frequent Words

In this article, we will study about different approaches to solve the problem "Top K Frequent Words". This will involve the concept of Priority Queue, Trie and Bucket Sort.

Problems on Binary Tree

BST to greater sum tree

In this article, we will be discussing about the problem "BST to greater sum tree" in detail. This involve the concept of inorder traversal.

Problems on Binary Tree

Minimum distance between two given nodes of Binary Tree

In this article, we will be discussing about the problem "Minimum distance between two given nodes of a Binary Tree" in detail. This involve the concept of lowest common ancestor.

Problems on Binary Tree

Connect Nodes at Same Level in Binary Tree

In this article, we will be discussing about the problem "Connect Nodes at Same Level in a Binary Tree" in detail. This involve the concept of Breadth First Search (BFS) or Level Order Traversal.

Problems on Binary Tree

Extreme nodes in alternate order

In this article, we will be discussing about the problem "Extreme nodes in alternate order in a Binary tree" in detail. This involve the concept of Breadth First Search (BFS) and level order traversal.

Interview Problems on Array

Car Pooling Problem

In this article, we have explored the Car Pooling Problem in depth and presented an efficient approach to solve it using the concept of Prefix Sum.

List of Mathematical Algorithms

Brocard's problem

In this article, we have explained the famous Brocard's problem and implemented solutions to find the 3 solutions to the problem.

Algorithms

Weighted Median Problem

Weighted Median is a measure of central tendency which is better than normal median. In this let us consider a weighted median value ‘wi’ when the elements are sorted such that the total weight of the elements to the left of wi is half of the total weight.

Problems on Binary Tree

Odd even level difference in a binary tree

In this article, I will be discussing about the problem "Children sum parent in a Binary Tree" in detail.

Problems on Binary Tree

Children sum parent in a Binary Tree

In this article, I will be discussing about the problem "Children sum parent in a Binary Tree" in detail.

C Programming

Find the absolute value of a number

In this article, we have explained how to find the absolute value of a number and implement the program in C Programming Language.

Algorithms

Divide by 3 [9 different ways]

In this article, we will go through different ways to divide by 3 in C++ Standard Template Library (STL) and general software techniques.

Algorithms

Two pointer technique in JavaScript

The two pointer technique is one of the tools to solve competitive programming and to solve technical interviews. We have explained how to use it in JavaScript.

quick sort

Quick sort using stack

In this article, we will study about Quick sort algorithm along with it's implementation using stack in C++. Before getting started with Quick sort using Stack we should know about stack data structure.