Update README.md

Author: Li Yin

README.md

@@ -12,10 +12,32 @@ The book serie uses Python 3 as programming language, and LeetCode Problems as e
 ## The Purpose of *The Comprehensive Coding Interview Guide*
 My purpose here is to offer any person who is interested with getting hands dirty with algorithms and coding a practical and strict manual to guide them through this process. The content is supposed to not only correct (that the code and algorithms work) and catchy  but also discreet (i.e , to know why it works, when it works, and how it works but not as theoretical as the *Introduction to Algorithms*).
 
-## The Data Structures and Algorithms Concepts
+## Part 1: The Data Structures and Algorithms Concepts
+As the first part of the serie, this part includes: 
+1. Introduction, 
+2. Fundamental Algorithm
+Design and Analysis (divide and conquer, complexity analysis), 
+3. Data Structures (connect the doubts of data structures and Python built-in data types/Modules), 
+4. Complete Search (searching on linear data structres, graph, tree), 
+5. Advanced Algorithm Design (Dynamic programming, greedy algorithm),
+6. Math and Bit Manipulation
+
+LeetCode problems as used as exercise, only id and the title of the questions are given.
+## Part 2: The LeetCode Problem Catalog
+The Second part of the series focusing on catagorize problems and solve them type by type.
+1. Dynamic Programming Questions (15%)
+2. Array Questions (15%)
+3. Linked List, Stack, Queue, and Heap Questions (12%)
+4. String Questions (15%)
+5. Tree Questions (10%)
+6. Graph Questions (15%)
 
 ## Feedback
 If you like the example chapters that I put here, please leave your comment here. This book comes with a lot of hard work --personally, I paused my PhD program for a semester to focus on. Therefore, your comment is important to lead to the publication of the work. 
 
 If you have ideas to imporove the book, about formating, more contents, or correct the erros are also very welcome too. 
-## Cooperation
+## Possible Cooperation
+If you are excellent with algorithms, or top leaders on the LeetCode Weekly contest, or made in the ACM ICPC contest, and are interested into helping and potentially coauthor on some parts of the book, please do not hesitate to contact me. 
+
+## Copyright
+The book is copyrighed and protected, please do not spread without permission.