Update table of contents

Author: thatguyintech

README.md

@@ -8,7 +8,7 @@ interviewcake, codefights, or different Facebook groups I'm a part of. I'll
 brainstorm solutions, write some code, and discuss tradeoffs. The point is to show
 up every day and **just do it**.
 
-Challenges by day (4 days missed):  
+Challenges by day (12 days missed):  
 [Day 1](./day1) - Design and implement a MinStack  
 [Day 2](./day2) - Return a random node from a linked list  
 [Day 3](./day3) - Flatten a Binary Tree into a linked list  
@@ -33,5 +33,45 @@ Challenges by day (4 days missed):
 [Day 22](./day22) - Permutations of a list  
 [Day 23](./day23) - Strings Rearrangement  
 [Day 24](./day24) - Strings Rearrangement (backtracking)  
+[Day 25](./day25) - Change of Vowels in a cycle  
+[Day 26](./day26) - Endian Wars  
+[Day 27](./day27) - Counting Binomial Coefficients  
+[Day 28](./day28)  
+[Day 29](./day29) - Count Good Strings   
+[Day 30](./day30)  
+[Day 31](./day31)  
+[Day 32](./day32)  
+[Day 33](./day33)  
+[Day 34](./day34) - Validate IP addresses  
+[Day 35](./day35) - Reverse a string, part 2  
+[Day 36](./day36) - Longest Consecutive Sequence  
+[Day 37](./day37) - Top K Frequent  
+[Day 38](./day38) - Implement a min heap
+[Day 39](./day38) - Implement a min heap better
+[Day 40](./day38) - Implement a min heap real good
+[Day 41](./day41) - Use heap implementation to redo Top K Frequent
+[Day 42](./day42)  
+[Day 43](./day43) - Implement a max heap better than the previous min heap
+[Day 44](./day44)  
+[Day 45](./day45)  
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+