Coding Interviews

Q & A

#	Title
03_01	Find Duplication In Array
03_02	Find Duplication In Array II
04	Find In Partially Sorted Matrix
05	Replace Spaces
06	Print List In Reversed Order
07	Construct Binary Tree
08	Next Node In Binary Trees
09_01	Queue With Two Stacks
09_02	Stack With Two Queues
10_01	Fibonacci
10_02	Jump Floor
10_03	Jump Floor II
10_04	Rect Cover
11	Min Number In Rotated Array
12	String Path In Matrix
13	Robot Move
14	Cutting Rope
15	Number Of 1 In Binary
16	Power
17	Print 1 To Max Of N Digits
18_01	Delete Node In List
18_02	Delete Duplicated Node
19	Regular Expressions Matching
20	Numeric Strings
21	Reorder Array
22	Kth Node From End
23	Entry Node In List Loop
24	Reverse List
25	Merge Sorted Lists
26	Substructure In Tree
27	Mirror Of Binary Tree
28	Symmetrical Binary Tree
29	Print Matrix
30	Min In Stack
31	Stack Push Pop Order
32_01	Print Tree From Top To Bottom
32_02	Print Trees In Lines
32_03	Print Trees In Zigzag
33	Squence Of BST
34	Path In Tree
35	Copy Complex List
36	Convert Binary Search Tree

#	Title
01_02	中国象棋将帅问题

Name		Name	Last commit message	Last commit date
Latest commit History 61 Commits
img		img
note		note
solution		solution
.gitignore		.gitignore
LICENSE		LICENSE
README.md		README.md