codereview.stackexchange.com - Julia's new school (Day 3)

Dec. 4, 2016

Plan to work on code review section, try to know more top-talents, and what are most valuable things to look into.

Day 3:

Part A: 
1.Study google employer and questions he answered:

http://codereview.stackexchange.com/users/26190/ruds

segmented tree,

1.  Travelling Salesman with Four Cities
http://codereview.stackexchange.com/questions/39353/travelling-salesman-with-four-cities/39354#39354

Great teaching about modularity, function design (DRY principles), and

2. Algorithm: K distance from leaf
http://codereview.stackexchange.com/questions/60765/print-all-nodes-that-are-at-distance-k-from-a-leaf-node/60894#60894

Algorithm: K distance from leaf

Another source code reference:
http://k2code.blogspot.ca/2015/09/print-all-nodes-that-are-at-distance-k.html

Practice the algorithm - 15 minutes.

3. Teach dividing different abstraction levels -
Code should be organized in terms of abstractions

http://codereview.stackexchange.com/questions/37478/improve-this-image-file-browser-remove-redundancy/37481#37481


4. Binary Search Tree
http://codereview.stackexchange.com/questions/67014/binary-search-tree/67155#67155