2020-01-24 – Mostly Software

Flatbuffer is a memory-efficient protobuf alternative.
Watched kingpin. Old, but great premise.
You can connect a websocket directly to a message queue like kafka.
Netflix responded to schedule an onsite next week. Looks like we can make Friday happen.
Disney responded to schedule a phone interview, I said asap, and talked to senior software engineer later in the day.
Amazon followup onsite interview for senior leveling today at the santa monica office.
FB wanted to chat again on monday.
Started watching the tv show sinner on the chicago flight, like it so far.
Ads becoming harder to spot in google search results now. Just a black word “ad” where the favicon should be.
23andMe and DigitalOcean both laid off a substantial number. Surprising. I like both businesses.
AB was arrested, bailed, and required to go through a mental health evaluation.
Practice problems:

https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/. LCA if it’s a binary search tree.
https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree. LCA if it’s any binary tree. The problem from yesterday. Recurse node by node. Exits: (1) return false if none, past leaf (2) return true if node is equal to node1 or node2. Propagate that True up, bc you know it’s a child. Recurse down left and right. If ever left and right (or self) return True, that’s you’re answer.
https://leetcode.com/problems/sliding-window-maximum/. My solution worked, slicing the window and taking the max. This beat 20% time and 60% mem on leetcode. I actually got the optimizations right in the interview too, using deque, and only iterating through if the current_max is the one leaving on the left. This solution beat 33% and 24% on leetcode.