Mia (Miao)Line-by-line Interpretation of Python Bisect Module Source CodeBinary search is a very basic algorithm for programming. The main method is to reduce the search area to half each time until we get the…4 min read·Sep 28, 2022----
Mia (Miao)Two Examples of Applying the Union-Find Structure in Graph ProblemsWe solved two LeetCode problems with DFS and BFS algorithms in this story:3 min read·May 17, 2022----
Mia (Miao)Two examples of DFS/BFS graph traversalThe two LeetCode problems that we are going to discuss are similar because they both can be solved by DFS or BFS algorithms, but different…3 min read·May 14, 2022----
Mia (Miao)The Monotonic Array and Its Two Imaginary Boundaries907. Sum of Subarray Minimums2 min read·Apr 12, 2022----
Mia (Miao)A Linear Solution of Parentheses Coding Problems in O(1) Space ComplexityMany string problems involve the check and count of valid parenthesis.3 min read·Apr 1, 2022----
Mia (Miao)The Essence of Algorithm: Greedy IIToday we are going to solve a pretty straightforward yet a bit interesting problem.4 min read·Mar 30, 2022----
Mia (Miao)The Essence of Algorithm: Greedy algorithmsGreedy problems usually look like “Find the minimum number of something to do something” or “Find the maximum number of something to fit in…4 min read·Mar 25, 2022----
Mia (Miao)The Essence of Algorithm: Prefix SumPrefix sum is a very common method to solve many array problems. Here is an interesting one: Given an integer length and an array updates…2 min read·Mar 24, 2022----
Mia (Miao)The Essence of Algorithm: Lowest Common AncestorLowest Common Ancestor is one of the commonest tree problems in code challenges. Let’s dive deep into the series of problems and try to…3 min read·Mar 23, 2022----