Solved the sink problem with complexity n

It's also known as the celebrity problem.   The question is who is the one in a party who is known by other people but no one knows him?

It turns out that there is O(n) solution for this problem.  (The n^2 solution is rather trivial) I was able to think it through.

Good.  Sounds like I can check away another problem of CLRS.

Chapter 21 : Disjoint Set

Quickly browse it once.  Except Chapter 21.4 which involved the proof of union rank heuristics, it is not a very difficult chapter to read.

I like this, may be I will read in leisure of the chapters in graph as well.  There are around 20% of the Data Structure required understanding of the graph algorithms.