编程之美 Beauty of Programming
[Essentials]
1.1 CPU usage ***
1.2 Bit operation
1.3 Pancake flipping ***
1.4 Dynamic programming ***
1.5 Xor (Extension ***)
1.6
1.7
1.8
1.9
1.10
1.11 NIM (Extension ***)
1.12 NIM ***
1.13 NIM ***
1.14
1.15
1.16
1.17
1.18
3.1 String Rotation ==> Concatenation
3.2 Loop <==> Recursive
3.3 Levenshtein distance (Edit distance), computing: DP ***
3.4 Singly linked list
3.5 How to extract short excerpts: two pointer scan ***
3.6 Intersection of linked list***
3.7 Queue.MaxElement() implementations***
3.8 Maximum distance in a binary tree
3.9 Reconstruct binary tree (Extension problems***)
3.10 Binary tree: level-order traversal
3.11 Binary search ***
4.1 Plane Seating: Probability calculation***
4.2 Tile Cover (Extension problems***)
4.3 Catalan number ***
4.4 Point in triangle
4.5 Expectation (proof ***)
4.6 Probability ==> XOR ***
4.7 Independence ***
4.8 Design test cases: regular, invalid, boundary
4.9 Sudoku ***
4.10 Palindrome
4.11 Probability in Minesweeper ***