• Remember the tool pycallgraph, useful in tandem with cprofile for getting lots of profile information about your module.
• NBC (Comcast) added another streaming service, Peacock.
• Only 5 companies have ever hit the trillion cap. Four comma club!
• Even in a workplace environment, put yourself in your colleagues' shoes. See things from your customer's perspective. Really helps.
• Placed Amazon fresh order last night.
• Finished servant season 1. Good, but left lots of questions and loose ends. Need season 2.
• New Eminem album.
• I love the integrations between the google calendar and gmail. Autocreation of flights, hotels, events, etc - fantastic.
• Really interesting:
• 
• Got an unsolicited call from facebook today. Recruiter for senior positions in infra/scalability. Bay area based. Set up a coding interview for next week.
• Practice problems.
• https://leetcode.com/problems/combination-sum-iii. Backtracking. Define the recursive case, define some fail-fast mechanisms as exit conditions. Throw loops in if you need to check multiple starting points.
• https://leetcode.com/problems/climbing-stairs. Recursion, with dp for speed.
• https://leetcode.com/problems/plus-one. Reverse to LSB first, the iterate toward more significant digits, incrementing or carrying the one.
• https://leetcode.com/problems/merge-sorted-array/.
• https://leetcode.com/problems/subsets. Generate all subsets. Just iterate, and add the current number to all previous solutions. Exponential.
• https://leetcode.com/problems/word-search/. Seeing if a word exists in a 2d grid. Cool problem. I love graphs.
• https://leetcode.com/problems/unique-paths/. Recursion with DP and backtracking. Sum left and up. Just think about the recursive case, you'll get it!
• https://leetcode.com/problems/unique-paths-ii. Same, but with obstacles. A bit harder. Lots more corner cases to consider.
• https://leetcode.com/problems/sqrtx. Iterative, or binary search across range(0, maxint).
• https://leetcode.com/problems/count-and-say. Bottom-up iteration!
• https://leetcode.com/problems/valid-sudoku/. Writing a sudoku validator. Not hard.
• https://leetcode.com/problems/first-missing-positive/. Didn't solve this one, looked it up though. Very complex problem, but simple solution.
• The neuroscience behind mindfulness is clear. Breathe, smile, stand tall. All work.
• Python itertools.combinations/permutations.
• Google coding interview #2 today. Went well.
• Lunch with briley at wing ferno.
• Put new (2021) registration on the BMW.
• When doing DFS or BFS, you can keep track of the depth/level. Just store each node as (val, depth) instead of (val), then increment it within the (for neighbor in neighbors: queue.append()).