Thank you LeetCode for updating your Explore Card content for Heaps, DP, and Graphs. These are great resources to help the self-taught programmer compete at the next level. However, a majority of the Hacker Cup problems are based on computational geometry. Also, a majority of Hash Code problems are based on mathematical optimization and queuing theory. Providing two additional modules could allow the self-taught programmer to compete at the highest levels. Ergo, please consider doing two more Explore Cards: one for computational geometry and another for linear optimization. Although this may seem funny, doing so could allow you to continue to tout superiority over other programming websites. Have a fantastic day and may the odds be ever in your favor!