Algorithms Voronoi Diagram In this article, we discuss the voronoi diagram in depth and how to use Fortunes Sweep Line algorithm to compute it. This is an important topic in Computational Geometry.
Algorithms Oriented area of a triangle In this article, we discuss how to find the area of an oriented Polygon using the shoelace algorithm and as an example we find the area of an oriented triangle.
Algorithms Self Crossing Problem This article delves into the illustrious Self Crossing problem and looks at how we can solve it. This can be solved efficiently using Computational Geometry ideas.
Algorithms Select a random node from Linked list In this article, we have presented two algorithms to select a random node from Linked list efficiently while maintaining uniform randomness.
Algorithms Swap two bits in a number In this problem, we have to swap bits in a given number or an integer. This can be solved in constant time O(1) using XOR operation.
Algorithms Check if given point is inside a convex polygon In this post, we discuss how to check if a given point is inside a convex polygon using the Graham scan algorithm and list application areas for the solution.
Algorithms Number of Integral points inside a triangle In this article, we have explored an insightful approach/ algorithm to find the number of interior integral points of a triangle. This is an important concept in the field of computational geometry.
Algorithms Find mirror image of point in 2D plane In this article, we will learn how to find the mirror image position of a point in a 2D plane along with C++ implementation of the approach.
Time Complexity Time and Space Complexity of Interpolation Search In this post, we discuss interpolation search algorithm, its best, average and worst case time complexity and compare it with its counterpart search algorithms. We derive the average case Time Complexity of O(loglogN) as well.
Algorithms Orientation of three ordered points In this article, we will discuss about algorithms to detect the orientation of three given ordered points. Orientation imply collinear, Clockwise or Anti-clockwise.
Algorithms Reservoir Sampling Technique In this article, we have explained the Reservoir Sampling Technique which is the basis of Randomized Algorithms. We have covered two methods Simple Reservoir and Variable Probability.
Algorithms Reverse bits of an Integer In this article, we have explored an efficient algorithm to Reverse bits of an Integer. The challenge is to do this in-place without using auxiliary memory.
Algorithms Reverse Integer In this article, we will explore an efficient algorithm to reverse a 32 bit Integer. This involve edge cases where the reverse integer is out of bounds.
Algorithms GCD Sort of an Array In this article, we have explored an insightful approach/ algorithm to sort an array by comparing the Greatest Common Divisor of two of the elements.
Algorithms Search element in rotated sorted array In this article, we have explored how to search an element in a Rotated Sorted Array efficiently in O(logN) time with constant space O(1).
System Design System design of Uber In this article, we shall be looking into the system design and architecture of Uber, a ride-sharing application that caters to millions of customers worldwide.
Time Complexity Time and Space Complexity of Kruskal’s algorithm for MST In this article, we have explored Time and Space Complexity of Kruskal’s algorithm for MST (Minimum Spanning Tree). We have presented the Time Complexity of different implementations of Union Find and presented Time Complexity Analysis of Kruskal’s algorithm using it.
Machine Learning (ML) Best First Search algorithm Best First Search is a searching algorithm which works on a set of defined rules. It makes use of the concept of priority queues and heuristic search. The objective of this algorithm is to reach the goal state or final state from an initial state by the shortest route possible.
Machine Learning (ML) A * Search Algorithm In this article, we are going to have a look at the A * Search Algorithm , its properties, some of its advantages and disadvantages as well as real life applications.
Algorithms Median of Medians Algorithm In this post, we explained the median of medians heuristic, its applications and usefulness as well as its limitations. Median of Medians Algorithm is a Divide and Conquer algorithm.
Algorithms Making A Large Island by changing one 0 to 1 In this article, we have explored an insightful approach/ algorithm to find the largest island by changing one 0 to 1 in MxN matrix. This is an extension of Number of Islands in MxN matrix (of 0 and 1).
Algorithms Time & Space Complexity of Bellman Ford Algorithm In this post, we do an analysis the Bellman Ford's single source shortest path graph algorithm to find its computational Time and Space complexity for Best case, Worst case and Average Case.
Algorithms Maximum String Partition problem: Partition Labels In this article, we have explored approaches to solve the maximum string partition problem (Partition Labels) efficiently.
Algorithms Alien Dictionary problem: Sorted order of characters In this article, we are given a sorted list of words in some alien dictionary. Based on the list, we have to generate the sorted order of characters in that alphabet. This problem can be solved using the idea of Topological Sort and Direct Acyclic Graphs.
Algorithms Shortest Superstring problem In this article, we have explained three approaches to solve the Shortest Superstring problem. This involve concepts like DFS and Dynamic Programming.
