Ue Kiao, PhD

Algorithms

Shortest Unsorted Continuous Subarray

We have solved the problem "Shortest Unsorted Continuous Subarray" and explained the logic behind it and what are the different methods (like Monotonic Stack) we can use to solve it efficiently.

Algorithms

Factorial of large numbers

Factorial of a non-negative number n, denoted by n!, is the product of all positive numbers less than or equal to n. With the usual approach, we can compute factorial only till 20! due to size limitation of data type. We have present how to overcome this limitation.

Algorithms

Shortest Subarray with at least K as sum

In this problem, we find the length of the Shortest Subarray with at least K as sum. This can be solved in O(N) time complexity. This brings in the ideas of Monotonic Queue and Sliding Window.

Time Complexity

Time and Space complexity of Radix Sort

In this article, we have explained the Time and Space complexity of the radix sort with Mathematical and Intuitive Analysis.

Data Structures

Basics of R Tree

R-tree is an advanced height-balanced Tree Data Structure that is widely used in production for spatial problems (like geographical map operations). We have presented the need for R Tree along with the basics of R Tree

Algorithms

Counting Sort vs Radix Sort vs Bucket Sort

This article compares counting sort, radix sort, and bucket sort with important points that will help you make out the differences between these sorting algorithms.

Algorithms

Remove K digits to make smallest number

We will be solving the problem of removing K digits from a given number to form the smallest number possible without changing the order of the original number. We will use the idea of Monotonic Stack

Algorithms

K-th Smallest element in a row and column wise sorted matrix

We have discussed how can we find the kth smallest element in a given n x n matrix, in which every row and column is sorted in non-decreasing order and covered 3 approaches: brute force, using min-heap and using Binary Search.

Algorithms

Move negative elements to front of array

This article focuses on the algorithm to move the negative elements of an array to the front. This can be solved by the two-pointer approach.

Algorithms

Number of Substrings with distinct characters

We have explored various algorithms that will help us in determining the number of substrings that a string can have with distinct characters.

Algorithms

Minimum Cut Problem [Overview]

We have covered the basics of Minimum Cut Problem, its applications like Network Reliability, algorithms like Ford-Fulkerson Algorithm to solve it and much more.

Time Complexity

Time and Space complexity of Quick Sort

We have explained the different cases like worst case, best case and average case Time Complexity (with Mathematical Analysis) and Space Complexity for Quick Sort.

Algorithms

Reverse Delete Algorithm for MST

We have explored the Reverse Delete Algorithm for finding Minimum Spanning Tree (MST) along with time and space complexity, implementation and application.

Algorithms

Types of views in Binary tree

We have explored the different types of views of the binary tree (like Left, Right, Top and Bottom View) and discussed how to find them.

Algorithms

Time and Space complexity of Bubble Sort

In this article, we have explored the time and space complexity of Bubble Sort. We have covered the mathematical complexity analysis and different cases like worst case, best case, average case, space complexity and comparison with other sorting algorithms.

Algorithms

Insert element at bottom of Stack [Explained]

In this article, we have explained how to insert an element at the bottom of Stack using standard stack operations like push and pop. We have covered two approaches: iterative and recursive.

Algorithms

Median in stream of running integers [Explained 3 Algorithms]

Given that integers are being read from a data stream, we need to find the median of all the elements read so far starting from the first integer till the last integer. This is called the Median in Running stream of Integers.

String Algorithms

Number of palindromic substrings in a string

A string is a palindrome when it reads the same backward as forward and a substring is a contiguous sequence of characters within the string. We have discussed multiple approaches to find the number of palindromic substrings in a given string.

Algorithms

Least frequent element in an array

Given an array of N elements, our task is to find the least frequent element present in it. In this article, we are going to talk about 3 methods to solve this problem along with their implementation.

Algorithms

Minimum Comparisons to find Second Largest Element

In this article, we have demonstrated the mathematical analysis to find out the minimum number of Comparisons to find the second largest or the second smallest element.

Algorithms

Convert a binary tree into its mirror tree

Given a binary tree, we have to write an algorithm to convert the binary tree to its mirror tree. A mirror tree is another binary tree with left and right children of all non-leaf nodes interchanged.

Algorithms

Applications of Topological Sort [Explained]

In this article, we have covered various Applications of Topological Sort in depth. Topological Sort of a directed graph is a linear ordering of its vertices.

Algorithms

Time & Space Complexity of Counting Sort

In this article, we have explained the time complexity of Counting Sort for Average case, Worst case and Best case and also, covered the space complexity using Mathematical analysis.

Algorithms

Find GCD of all elements in an array

In this article, we have presented an algorithm to find the Greatest Common Divisor (GCD) of all elements of an array efficiently.

Algorithms

132 Pattern Problem [Solved]

In this article, we have explained what is 132 pattern problem and have discussed 3 different approaches to solve it in linear time O(N) where brute force approach takes O(N^3) time.