Update README.md

Author: another-guy

README.md

@@ -19,15 +19,16 @@
     * 1 TODO
     * 2 TODO
     * 3 Stacks and Queues
-        * 3.1 [MultiStack](https://github.com/another-guy/problem-solving-ts/blob/master/src/cracking-the-coding-interview/3-stacks-and-queues/3-1-single-array-multiple-stacks.cr.md)
+        * 3.1 [MultiStack](https://github.com/another-guy/problem-solving-ts/blob/master/src/cracking-the-coding-interview/3-stacks-and-queues/3-1-single-array-multiple-stacks.cr.md). [Code Review](https://codereview.stackexchange.com/questions/194051/multiple-stacks-implemented-via-a-linked-lists-on-top-of-single-fixed-size-array)
     * 4 Graphs
         * 4.1 Existence of path between nodes
     * 5 Bit Manipulation
         * 5.0 [Bitwise Operations Cheat Sheet](https://github.com/another-guy/problem-solving-ts/blob/master/src/cracking-the-coding-interview/5-bit-manipulation/5-0-cheat-sheet.md)
         * 5.1 Insert one bit sequence into another
-        * 5.3 [Flip bit to win](https://github.com/another-guy/problem-solving-ts/blob/master/src/cracking-the-coding-interview/5-bit-manipulation/5-3-flip-to-win.cr.md)
+        * 5.3 [Flip bit to win](https://github.com/another-guy/problem-solving-ts/blob/master/src/cracking-the-coding-interview/5-bit-manipulation/5-3-flip-to-win.cr.md). [Code Review](https://codereview.stackexchange.com/questions/194733/find-the-longest-length-of-sequence-of-1-bits-achievable-by-flipping-a-single-bi)
     * 6 TODO
     * 7 TODO
     * 8 Recursion and Dynamic Programming
         * 8.1 Triple step (non-recursive)
-        * 8.2 Robot in a grid (recursive and non-recursive)
+        * 8.2 Robot on a grid (recursive and non-recursive). [Code Review](https://codereview.stackexchange.com/questions/194979/robot-on-a-grid-find-a-path-between-two-corners-with-forbidden-cells-on-the-roa)
+        * 8.3 Magic index (recursive).