## About Posts

Posts are more formal than WiKi, in which I will do some research and try to dive deeper. I will also present the references at the end of posts.

## All Posts

Most recent posts in chronological order:

Summary A spanning tree of some graph G is a subgraph that is a tree which includes all of the vertices of G, with a minimum possible number ...

Read More
Summary An Eulerian path is a path in a finite graph that visits every edge exactly once (allowing for revisiting ...

Read More
Summary No one is supposed to invent the Boyer–Moore voting algorithm during the interview. The point is how to write ...

Read More
Summary Pimpl is used to hide implementation details for library consumers. It hides headers, data members, as well as private ...

Read More
Summary Lowest Common Ancestor (LCA) is a typical rooted tree related problem. A simple solution is use dfs to traverse ...

Read More
Summary Given a modular MOD, if we want to calculate the division of two integers, we could use the technique ...

Read More
Summary Quick Select is typical technique to select the top k elements (the rest of array is not sorted) from ...

Read More
Summary A common problem in undirected or directed graph is to calculate the shortest path between two nodes. There are ...

Read More
Summary There are a number of questions in the form that given a string, evaluate the value of it. These ...

Read More
Summary Bit manipulation is all about tricks. bitset is also a common data structure in set problems. Details Flip Last ...

Read More