Data Structures Li Chao Segment Tree In this article, we discuss the Li Chao tree, a segment tree which can be persistent and is faster in practice compared to the convex hull trick.
Time Complexity Time and Space complexity of Trie In this article, we will understand the Complexity analysis of various Trie operations. We have covered Time and Space Complexity of Trie for various cases like Best case, Average Case and Worst Case.
System Design System Design of Pastebin In this article, we will be looking into the system design of Pastebin which is a content hosting service for simple text files. The scale of use of this applications makes the System Design interesting.
Data Structures Persistent Trie In this article, we discuss the Trie data structure and how to make it persistent to solve various problems optimally.
Time Complexity Time and Space Complexity of Heap data structure operations In this article, we have explored the Time and Space Complexity of Heap data structure operations including different cases like Worst, Average and Best case. At the end, we have added a table summarizes the complexities.
Algorithms Delete middle element of Queue In this article, we discuss how to delete the middle element of a queue without using other data structures. We have explained both iterative and recursive approach.
Algorithms Delete middle element of Stack In this article, we discuss an iterative and recursive approach to delete the middle element of a stack.
Algorithms Nearest smaller and greater numbers with same number of set bits In this article, we shall explore the various ways we can find the Nearest smaller and greater numbers with same number of set bits for given number.
computational geometry Find mirror image of point in 3D plane In this article, we will learn how to find the mirror image of a point (x,y,z) in 3D-plane.
Algorithms Longest Substring with at Least K repeating characters In this article, we have presented two algorithms to find the Longest Substring with at Least K repeating characters.
Algorithms Find smallest of 3 integers without comparison In this guide, we will go through how to get the smallest of three numbers without using Comparison operation. We have presented 3 different techniques using decrement, division and shift operation.
Algorithms Legendre's conjecture In this article, we have explained Legendre's conjecture, presented an implementation of an Algorithm to verify Legendre's conjecture till a given limit and have provided output which you can analyze.
Algorithms Shortest distance between a Line and Point in 3D plane In this article, we have presented two algorithms to find the Shortest distance between a Line and Point in 3D plane. This involves idea of Projection and Parallelogram.
Algorithms Absolute value of Integer using Bitwise Operations In this article, we have explained two approaches to find the Absolute value of Integer using Bitwise Operations namely Right shift, OR and XOR operations.
Algorithms Furthest Pair of Points (+ Rotating Calipers Method) In this article, we have explained how to solve the problem of Furthest Pair of Points using Rotating Calipers Method. We have presented the naive approach as well.
Compiler Design Different Code Optimizations in Compiler Design In this article, we have listed and explained Different Code Optimizations in Compiler Design such as Peephole optimization, loop unrolling, Loop-invariant code motion and much more.
Algorithms Parallel Bubble Sort In this article, we have explored how to implement Bubble Sort in parallel on multiple threads / cores. We have presented two approaches: one is slower than the sequential approach but the other approach is significantly faster than all other approaches for large input.
Algorithms Average Height of Random Binary Search Tree In this post, we discuss the average height of a Random Binary Search Tree (BST) (that is 4.31107 ln(N) - 1.9531 lnln(N) + O(1)) by discussing various lemmas and their proofs. We omit full proofs and discuss the essential key points for easier understanding.
Time Complexity Time and Space Complexity of Hash Table operations This article covers Time and Space Complexity of Hash Table (also known as Hash Map) operations for different operations like search, insert and delete for two variants of Hash Table that is Open and Closed Addressing.
Algorithms Delaunay Triangulation In this article, we discuss Delaunay Triangulation, its relation to Voronoi diagrams and algorithms to compute Delaunay Triangulation. This is an important topic in Computational Geometry.
Algorithms Create a Heap from Array of N integers In this post, we discuss the heap data structure and how to create a min and max heap from N given integers in form of an Array. Similarly, inserting elements one by one take O(N logN) time but the optimal approach takes O(N) time.
Algorithms Goldbach's Conjecture In this article, we shall be looking at the intriguing Goldbach's Conjecture, one of the best known unsolved problems in mathematics. Later on, in the article, we shall find the Goldbach pairs of all numbers that range from 1000 to 2000.
Algorithms Average height of Random Binary Tree In this article, we have explored an insightful approach/ algorithm to find the average height of Random Binary Tree which is of the order O(N^0.5). This will strengthen our understanding of binary trees and their applications.
Algorithms Closest Pair of Points In this article, we have explored different algorithms using which we can find the Closest Pair of Points in a given set of N points efficiently in O(N logN) time. This involves the idea of Divide and Conquer.
Time Complexity Time & Space Complexity of AVL Tree operations In this article, we will dive into the Time & Space Complexity and Complexity analysis of various AVL Tree operations like searching, inserting and deleting for different cases like Worst, Best and Average Case.
