• Hash tables high space fast speed.
• S&P has almost quintupled since the low of the 08-09 crisis.
• I know the # in a URL, but its formal name is anchor or fragment identifier, the subsection to focus to.
• Escape room up in Big Bear.
• Among the bay friends, final percentages and rankings were:
1. frank 58.8
2. nick 58.8
3. david 57.1
4. quique 56.0
5. art 55.9
6. diego 55.7
7. brian 51.2
8. omar 47.5
• Approximate payouts:
• 1st $730
• 2nd $325
• 3rd $180
• 4th $140
• 5th $115
• 6th $90
• 7th $80
• 8th $70
• 9th $60
• 10th $50
• 1st place comparison:
• Westgate Supercontest: 59 pts, 58-2-25, 69.4%.
• South Bay Supercontest: 53 pts, 52-2-31,  62.4%
• Would have tied for 25th in the full contest.
• The 9 people who tied for 26th last year each got a payout of $14,844.65.
• Brainstormed a few more return questions.
• Practice problems:
• Improved the 2sum solution. Much faster.
• https://leetcode.com/problems/remove-nth-node-from-end-of-list. 
• https://leetcode.com/problems/3sum. 3 sum solution, got it down to O(n^2). Basically solving n 2sum problems.
• There's another one "3SumClosest" where instead of summing to 0, you're finding the triplet that sums closest to an input target. Instead of keeping matches, keep ALL in a hash table then just return the max. Same O(n^2).
• Another: https://leetcode.com/problems/4sum/. 4sum is the same, just wrap the 3sum solution with another loop around n, the input list. It doesn't matter if you're targeting zero or another explicit number with the sum. The general algo is O(n^(k-1)), where k is the number of items in the sum.
• https://leetcode.com/problems/valid-parentheses. Just tracking opening and closing characters. Easy. Use a stack, loop through once.