Strongly connected component and Tarjan Algorithm
How Tarjan Algorithm efficiently finds strongly connected components (SCCs) in directed graphs using DFS.
Adjacency Array
Ajacency array, a space-efficient graph representation best suited for static graphs.
Union-Find Problems in Leetcode
A summary of union-find problems in Leetcode.
Heap related problems in Leetcode
A summary of heap related problems in Leetcode.
Linked List Problems in Leetcode
A summary of linked list problems in Leetcode.
Two-pointer in Leetcode Problems
A powerful method for solving string, array, linked list related problems in leetcode.
Importance sampling
A general technique for estimating properties of a particular distribution, while only having samples generated from a different distribution.
Rejection sampling
A technique to generate observations from a distribution.
Classical Multidimensional Scaling
A method used to translate pairwise distances of n objects into n points in Cartesian space. (pic from wiki)
Hello World
Who am I, what do I do, and why do I create this blog.