-
- Amazon surged $200 (10%) afterhours yesterday too. That’s 2 crazy days.
- Like react offers jsx allowing you to blend html in js, jss allows css style declarations in js.
- Gradle is another build tool similar to maven. Groovy DSL.
- Netflix onsite. Went well. Refreshing to be surrounded by only senior folk. Parts of the culture (freedom and responsibility) are only possible in this type of env. Should hear back on Monday. Took extensive notes, all in private drive. This role is almost the exact same as my role at SpaceX, but in Java.
- Got to see the family up in the bay before flight back to LA. The city was buzzing with niners energy for Sunday.
- Thoughtworks is a software consulting firm.
- ConcurrentHashMap is thread safe. You can have multiple modify at once. It’s a bit slower.
-
- Interesting take on pipenv dying: https://medium.com/telnyx-engineering/rip-pipenv-tried-too-hard-do-what-you-need-with-pip-tools-d500edc161d4. I have always used pip-tools directly, the conclusion of the article. Sometimes the pieces are easier to maintain than the wrapper.
- Tsla’s afterhours chaos was met, opening @638.
- Barstool got valuated at 450m due to a casino deal of 163m, 36% stake.
- Filed a claim for the yahoo security breach class action settlement. #AHC00896336.
- Practice problems: https://leetcode.com/problems/contains-duplicate/. Simple tuning.
- Got the offer from Disney. Bob Iger is the CEO.
- Finalized the bay flight 5 hours before takeoff, 21 hours before interview time. Crunch. In Los Gatos now preparing.
- Caught up on the last 2 highscalability posts.
- Reviewed concurrency. Threading, multiprocessing, async. I feel very strong in this already, but wanted to review just in case.
- Read the netflix culture doc again to familiarize. It’s applicable anywhere. Some good corporate stances in there.
- Thought back through sx-setuptools, atlassian admin, and the full monorepo/build setup I had in place at SpaceX. Decisions made in development, performance metrics, etc. Runbooks, internet shield, default static analysis, py3 migration, crossplatform. Everything is files. Depgraph. Change targeting upstream n=2. Artifact provenance. On-call, devops, production support, pagerduty, escalations. Sentry, sensu, splunk. Sprintplanning, 60 day cycling, user storymapping. All the standard facets of a ci team.
- Went through some heavier frontend stuff than usual: https://github.com/yangshun/front-end-interview-handbook/blob/master/questions/javascript-questions.md. Took all notes in drive.
-
- Remember: camelCase snake_case PascalCase kebab-case
- Wearables (airpods and watch) gave apple huge profits this quarter.
- Read some resources from jack regarding the founder of ghsmart: https://geoffsmart.com/. A few takeaways:
- Really probe into the future of the department. Get a lay of the land from someone who lives there. Big projects, big changes, big consolidations? You get (1) a better idea of compatibility and future job responsibilities and (2) a better way to cater your responses/skillsets to match. I could be better about this one.
- Prepare yourself. Know yourself. Think about what you want for your future. Have explicit decisions made regarding your own trajectory. This then bleeds into most aspects of the interview process. You have honest answers as gut instincts, rather than canned answers you’ve rehearsed. You come across more confident. You’re able to articulate genuine reflections of yourself and your relationship to the employer’s needs. I value this one, and have spent a lot of time practicing it already.
- Need to have metrics, scorecards. Need to have them as a leader to be objective/accurate. Need to ask about them as a contributor/candidate to be transparent/inspire.
- My master’s degree 10 years ago involved a lot of AI, ML, stochastics, probabilistics, etc, but I haven’t immersed myself deeply in those fields since. These areas are rapidly expanding within the professional world, and I’ll focus some of my free time to keep up to date on such tech in the months to come.
- Submitted refs and accomplishments for citadel.
- HFT = high frequency trading. You can do it at a rate that enables skimming.
- Disney onsite in glendale.
- Met with Art at brews brothers after, got dave’s hot chicken.
- Interesting thought about misophonia – hearing is the only primary sense you can’t really shut off. If you experience aversion to touch, you can move away. For taste, you can spit it out. For smell, you can plug your nose or breathe through your mouth. For sight, you can close your eyes. For sound, you can plug your ears, but it’s much less effective and isn’t practical like the other options.
- TSLA surged over $650, over %10, in afterhours after the earnings report.
- Submitted formal references and accomplishments letter to citadel.
- Ping is not over TCP, it’s ICMP (internet control message protocol). It doesn’t have a port.
- If you have n items in an array, the number of unique binary search trees that can be created from it is called the catalan number. https://en.wikipedia.org/wiki/Catalan_number.
- Database normalization. There are 3 basic thresholds: first/second/third normal form.
- 1NF: primary keys are unique, each col stores info in its simplest form, no redundant columns.
- 2NF: all the other columns depend on the prim key.
- 3NF: all other columns depend on the prim key directly, not transitively.
-
- Did a bit of research on ghsmart. Downloaded and started reading Who, the book from the creator, to get an idea of the process.
- Read a bit more of The Man Who Solved the Market while doing laundry.
- Coordinated further with citadel for a few items. Acquired refs, drafted an accomplishments-onepager, scheduled comp call. Details noted in my private repo.
- Finished season 2 of the sinner. S1 was better, but 2 was still good. 3 premieres in a couple weeks.
- Looked up specific amazon roles in the bay for transfer.
- Authored a 2-page retrospective for last year, an annual review for self-employment.
- Instagram ads are getting crazy. Just counted, it’s 4 followed posts and then 1 sponsored, repeated. 20%. 6 minutes in a 30 minute television slot. 1/5 of an entire website. The standard is just ridiculous nowadays. Go Wikipedia!
- AWS IoT = internet of things. Connecting devices to the cloud. The primary location for bay aws is palo alto.
-
- Python bin() and int(num, 2) (for base 2) to convert between binary numbers (represented as strings) and integer datatypes.
- f'{n:032b}’ will format n (an integer) as a 32digit binary number with padded zeros.
- Coronavirus is affecting the markets.
- Talked with Citadel about next steps. Scope of influence ; room to impact. This really is my most important comparator moving forward. More than title/salary/sector.
- DS&A:
- Between all platforms (leetcode, hackerrank, geeksforgeeks, interviews themselves) I’ve done ~200 practice problems.
- FB coding interview II.
- Graded on 4 aspects of the DS&A questions. Problem solving. Communication. Converting algorithms and data structures to executable code. Validation (testing).
- Notes all in gdrive. 2 coding questions. Did both. I like that they were formatted in real-world applications, with a quick discussion before diving into the algorithm.
- I continue to be impressed with facebook’s process, in direct relation to its closest interview cousin Google. The focus is multiheaded, from intuition to coding to behavior. Google is much more what, Facebook is much more what how why when where who.
- Cut and wrapped 32 homemade pumpkin peanut butter bars for the next month.
- Paid the last rent (maybe last rent ever?) for feb in hermosa. Gave Sherisse formal 30d notice.
- If a bonus is paid as a supplemental wage, it’s taxed at the flat rate of 25%. If it’s added onto the year-end paycheck, it’s additional income and is taxed at whatever aggregate tax bracket that income is within (which is obviously worse).
-
- Practice problems:
- https://leetcode.com/problems/intersection-of-two-linked-lists/. To find the FIRST COMMON element in two arrays, or two linked lists, etc, the most natural way is to loop over one and create a set (hash table) and then loop over the second until you find a match. This is O(m+n) time and O(n) space. You can improve by using two pointers. Iterate one by one, and then if you’ve reached the end of the list, move it to head of the other list. Conclude once you’ve reached the end of that one. If there’s a match, you’ll find the first one. Write it out to see how it makes sense.
- https://leetcode.com/problems/word-break-ii/. Harder, but cool. Just like the other word break, just keep track of a dp memo that tracks word combinations up to that index. Then only check that index out if the previous index is non-empty (words ended there, so we have more possibilities).
- https://leetcode.com/problems/find-peak-element/. Interesting. Just check the right side (half, so log) instead of both left and right comparisons each time. The solution is wrong for this one, assuming a sorted input.
- https://leetcode.com/problems/fraction-to-recurring-decimal. This problem is much harder than it seems. Basically recurse down and perform the division each time, like you would in handwritten longdivision, and carry the decimal place over by 1 each time. Memoize to detect if you’ve seen a cycle already.
- https://leetcode.com/problems/excel-sheet-column-number. Very elegant solution, oneliner. ord of the char, adjusted, then * 26 raised to the power of the digit.
- https://leetcode.com/problems/excel-sheet-column-title/. Little tougher, but still an easy problem.
- https://leetcode.com/problems/rotate-array. Easy oneliner. Another cool solution is reverse the string, then reverse the first k items, then reverse the last n-k items.
- https://leetcode.com/problems/largest-number. Cool problem. Remember if you want to do any custom sorting, like by digit value or ANYTHING else, you can define your own custom Comparator class with __lt__ defined, then pass it as a key to sorted().
- Scheduled haircut for wed.
- Remember heaps, min and max. Can create (heapify) in O(n). Check the top element (min/max) is O(1). Popping the top, or removing an element, or inserting an element are all the same O(logn), because you have to rebuild part of the heap after.
- Great bday for Katilin, they did an awesome job planning dinner/jeop/paintNsip.
- Watched the Bellator and UFC fights from last night.
- Kobe.
- Pro Bowl.
- Remember that [None]*5 in python will make all items mirror each other, since lists are mutable. To make individual pointers, just do [None for _ in range(5)].
-
- Practice problems.
- https://leetcode.com/problems/sort-list/. You can do bubble in n^2 time and 1 space, or use extra space to create another data structure regular sort nlogn with n space. Doing nlogn time and 1 space requires a weird in-place mergesort.
- https://leetcode.com/problems/lru-cache/. Implemented my own lru cache with an eviction policy. Get() and Put() are both O(1) in time. Achieved with a deque (the keys) and a dict (the key-val mapping).
- https://leetcode.com/problems/evaluate-reverse-polish-notation. Cool, but easy. Iterate through and simply perform operations as they come. Trick: manage your own index. You could use a stack, but mine collapses values in place, making it more memory efficient.
- https://leetcode.com/problems/max-points-on-a-line. This one has a 16% acceptance rate, the lowest I’ve seen. Did it in about half an hour. Line math, mx + b, then iterate over and track points on that line. Lots of corner cases: divide by zero, high-precision math (using the Decimal library).
- Youtube creator awards. The diamond play buttons is for >10m subs, and there are about 500 channels total that have been given it. The red play button is for >50m. The red diamond is for >100, and only a couple channels have gotten this (pewdiepie and t-series).
- Confirmed disney onsite for next wed.
- Watched rosemary’s baby for the first time. Maybe shocking 50 years ago, but not a great movie by today’s standards.
