Update README

Author: codethecoffee

README.md

@@ -5,10 +5,12 @@ organizing the questions by category and linked to the solution I wrote for each
 | Number | Question | Hints | Python Solution | C++ Solution |
 |:------:|:--------:|-------|:---------------:|:------------:|
 | 1 |[Two Sum](https://leetcode.com/problems/two-sum/) | Use a hash table to keep track of the indices of the numbers you've encountered so far. | [Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0001_two_sum.py)  | [C++ Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/c%2B%2B_solutions/0001_two_sum.cpp) |
+| 24 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) | Implement both the iterative and recursive solution. What do we do if the linked list has an odd number of nodes? | [Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0024_swap_nodes_in_pairs.py) | |
 | 56 |[Merge Intervals](https://leetcode.com/problems/merge-intervals/)| Sort the intervals by increasing start time. |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0056_merge_intervals.py) | |
 | 66 | [Plus One](https://leetcode.com/problems/plus-one/) |  Try iterating through each digit backwards. What do you do when the digit is a 9? | [Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0066_plus_one.py)| |
 | 88 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | Look at one element from each of the arrays, compare them, and make a decision depending on their relation to each other. | [Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0088_merge_sorted_arrays.py)| |
 | 122 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/solution/) | What should we do every time there is a valley followed by a peak in price? | [Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0122_best_time_to_buy_and_sell_stock_II.py) | |
+| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | Try a recursive solution. Split the list up into the first node and the rest of the list. | [Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0206_reverse_linked_list.py) | |
 | 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | Maintain a hash set that keeps track of the numbers we've encountered so far. | [Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0217_contains_duplicate.py) | |
 | 344 | [Reverse String](https://leetcode.com/problems/reverse-string) | Use the two pointer approach. Try implementing an iterative and recursive solution. | [Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0344_reverse_string.py)| |
 | 392 | [Is Subsequence](https://leetcode.com/problems/is-subsequence/) | Use two pointers to iterate through the two strings simultaneously. | [Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0392_is_subsequence.py)| |