## LeetCode: Unique Binary Search Trees II

How to generate all the unique binary search trees with given values [1, N].

How to generate all the unique binary search trees with given values [1, N].

Do you know which is the slowest sorting algorithm? Let’s have fun with bogosort, sleep sort, and slow sort!

Breadth-First-Search(BFS) explained with visualization, a queue is used in the implementation.

Depth-First-Search(DFS) explained with visualization, contains implementations of iterative version and recursive version.

Solution for LeetCode: Two Sum II – Input array is sorted

This is a list of categories with classic and easy problems for LeetCode beginners.

Solution for Intersection of Two Linked Lists, naive solution and approaches of set and two pointers.

In this post, we will learn how disjoint-set(union-find) data structure works, then we implement a maze generator with it.

The random number is an important topic in computer science. In this post, we will discuss how random numbers are generated, how to use random numbers to shuffle cards.

Use quicksort as an example, explain my method for learning algorithms effectively, explore the differences between imperative and functional programming styles.