The beauty of programming-Microsoft technical interview experience 15 chapter download address

The following is the "Beauty of programming-Microsoft technical interview experience" directory. The sample chapter and the serial number of the sample chapter published on the Internet have been marked and can be downloaded directly.

The reader of this book has established the "the beauty of programming" Learning Exchange edition, http://curay.5d6d.com/bbs.php? Gid = 18. Welcome to visit. Thank you very much!

I wish you a pleasant reading ~

Contents
Chapter 4 game joy-questions encountered in the game... 1
1.1 let the CPU usage curve listen to your command... 3 (Example 1)
1.2 Question about playing handsome Chinese chess... 13 (chapter 2)
1.3 sorting of one slice... 20 (Chapter 3)
1.4 book purchasing problems... 30
1.5 quickly identify faulty machines... 35
1.6 beverage supply... 40 (chapter 4)
1.7 light and shade cutting... 45
1.8 Xiaofei's elevator scheduling algorithm... 50
1.9 arrange meeting efficiently... 54
1.10 efficient download with two threads... 59
1.11 Nim (1) a row of stone games... 64
1.12 Nim (2) "NLP" game analysis... 67 (chapter 5)
1.13 Nim (3) Two-heap stone game... 72
1.14 serialization game design... 86 (Chapter 6)
1.15 construct Sudoku... 91
1.16 games... 99
1.17 tetris games... 108
1.18 mining game... 116
Chapter 2 The charm of numbers-techniques in numbers... 2nd
2.1 calculate the number of 1 in the binary number... 119 (chapter 7)
2.2 do not be intimidated by the factorial... 125 (Chapter 8)
2.3 search for posting "Water King"... 129 (Chapter 9)
2.4 The number of 1... 132 (chapter 10)
2.5 find the maximum K number... 139 (chapter 11)
2.6 precise expression of floating point number... 147 (Chapter 12)
2.7 maximum public approx... 150
2.8 find the qualified integer... 155
2.9 Fibonacci series... 160
2.10 search for the maximum and minimum values in the array... 166
2.11 find the nearest point... 171
2.12 quickly search for two numbers that meet the conditions... 178
2.13 Maximum Product of the sub-array... 182
2.14 calculate the maximum value of the sum of the sub-arrays of the array... 185
2.15 maximum value of the sum of sub-arrays (two-dimensional)... 192
2.16 find the longest incrementing sub-sequence in the array... 198
2.17 array cyclic shift... 204
2.18 array split... 207
2.19 interval coincidence judgment... 211
2.20 program understanding and time analysis... 215
2.21 only add interview questions... 217
Chapter 1 Structure Method-exploration of strings and linked lists... 3rd
3.1 question about the inclusion of string movement... 221
3.2 The telephone number corresponds to the English word... 224
3.3 calculate string similarity... 230 (chapter 13)
3.4 delete a node from a table with no headers... 234
3.5 generation of the shortest digest... 237
3.6 programming to determine whether two linked lists are intersecting... 241
3.7 maximum value operation in the queue... 244
3.8 calculate the maximum distance between nodes in a binary tree... 250 (chapter 14)
3.9 rebuilding a binary tree... 256
3.10 layered traversal of Binary Trees... 262
3.11 program error correction... 268
Chapter 2 fun of mathematics-fun of mathematics games... 4th
4.1 question about plane ride by King Kong... 275 (chapter 15)
4.2 tile covered floor... 279
4.3 change the ticket price to 0... 282
4.4 points in the triangle... 286
4.5 tape file storage optimization... 291
Black and white balls in 4.6 barrels... 294
4.7 ant crawlers... 299
4.8 triangle test cases... 303
4.9 how much does DT know... 307
4.10 digital puzzles and replies... 315
4.11 probability of game mining... 322