Start readme for chapter 2

Author: StBogdan

chapter_2/readme.md

@@ -0,0 +1,14 @@
+# Chapter 2: Linked Lists
+
+The complexity table is for a quick lookup, more details in the actual file (e.g. explaining the symbols used)
+
+| Nr. 	| Title 	| Solution 	| Time 	| Space 	| Notes 	|
+|:---:	|:-----:	|:--------:	|:----:	|:-----:	|:-----:	|
+| 2.1 	| Remove dups               | [Python](./p2_1.py) | O(n) 	| O(n) 	| 	|
+| 2.2 	| Return Kth to last        | [Python](./p2_2.py) | O(n*log(n)) 	| O(n) 	| 	|
+| 2.3 	| Delete Middle Node        | [Python](./p2_3.py) | O(n) 	| O(1) 	| 	|
+| 2.4 	| Partition                 | [Python](./p2_4py)  | O(n) 	| O(1) 	| 	|
+| 2.5 	| Sum Lists                 | [Python](./p2_5.py) | O(min(n,m)) 	| O(1) 	| 	|
+| 2.6 	| Palindrome                | [Python](./p2_6.py) | O(n) 	| O(n) 	| 	|
+| 2.7 	| Intersection              | [Python](./p2_7.py) | O(n*m) 	| O(1) 	| 	|
+| 2.8 	| Loop Detection            | [Python](./p2_8.py) | O(n*m) 	| O(1) 	| 	|