Update README for problem 332

Author: anirudhology

README.md

@@ -115,6 +115,7 @@ LeetCode solutions in Go programming language.
 | 322        | Coin Change                                               | [Solution](problems/dynamic_programming/coin_change.go)                                    | Medium     | Dynamic Programming                   |
 | 323        | Number Of Connected Components In An Undirected Graph     | [Solution](problems/union_find/number_of_connected_components_in_an_undirected_graph.go)   | Medium     | Union Find, Graph                     |
 | 329        | Longest Increasing Path In A Matrix                       | [Solution](problems/dynamic_programming/longest_increasing_path_in_a_matrix.go)            | Hard       | Dynamic Programming, DFS              |
+| 332        | Reconstruct Itinerary                                     | [Solution](problems/graph/reconstruct_itinerary.go)                                        | Hard       | Graph, Heap                           |
 | 338        | Counting Bits                                             | [Solution](problems/bit_manipulation/counting_bits.go)                                     | Easy       | Bit Manipulation, Dynamic Programming |
 | 347        | Top K Frequent Elements                                   | [Solution](problems/array/top_k_frequent_elements.go)                                      | Medium     | Array, Bucket Sort                    |
 | 355        | Design Twitter                                            | [Solution](problems/design/design_twitter.go)                                              | Medium     | Design, Heap                          |