- Petty released the sbsc winnings, $700 for 1st place, $50 for 10th. End of season party this saturday.
- Path-planning is an np-complete problem. The traveling salesman is an np-complete problem. Dijkstra’s algorithm alone is solvable in polynomial time.
- Traveling salesman is just visit every city in the country once in the shortest path. In other terms: visit every node in a graph once, where the edges can have different weights (like distances between cities).
- ! to run shell commands from ipython.
- Spoke with the google recruiter. Gave her my feedback from the other day, and combined with the interviewer’s fb, decided we’ll do a 2nd phone interview. This is good – I wanted another datapoint. We’ll do it next tuesday.
- With py requests, can pass it in directly with ?key=value or via params={key: value}
- You should typically use the rel links for next and prev when dealing with a paginated API, rather than just looping over an integer range and building the URL yourself. Sometimes the url will change.
- Dentist and haircut.
- Interesting report on the (primarily) medical state of psychedelics, and the effect on market investments we’ll see in years to come: https://www.reddit.com/r/investing/comments/emkhwt/2020_psychedelic_industry_insights_report/.
- Went through a bit of highscalability. It really is a great blog.
- Jitter can be a good thing. Sometimes it’s best to intentionally add a bit of entropy in. Helps avoid thundering herds.
- Spent most of today on the Netflix take-home assignment. Private github repo.
- breakpoint() is only available in py3.7 and beyond, it’s still import pdb; pdb.set_trace() for all vers before then.