day 3:
problem 4: linkedlist added up. Experiance: save data, then do the next. corner cases are important and should be considered at the very beginning.
Problem 5: Find the head of a cycle list. any duplicated problem can use hash table. In this question, we can also use race iterator to solve the problem.