Introduction
It is the Saturday afternoon. I just had a mocking interview 4:00 pm, so I asked the peer to solve a hard level algorithm called Leetcode 85: The Maximal Region. So the peer explained to me Leetcode 84: Histogram algorithm first, and then use a simple test case to show me how it is related to Leetcode 85. In less than 10 minutes, I fully understood the relationship between two algorithms. This is by far most strongest programmer I met so far.
The peer recommended me to read the book called Introduction to Algorithm, third edition, and also watch the MIT 6.046J/ 18.410J Introduction to Algorithms.
Book reading
Plan to read the book and write down some notes.
No comments:
Post a Comment