My Reading Log

nafSadh // notes // YaGIP / rl / Resources

2018.11

• Lecture on Perfect Hashing by Prof. David R. Karger, MIT
• Cram List - seriously?
• Negotn article · service
• [↻] DCP 3 - de/serialize bin tree
• [↻] DCP 4 - first missing positive integer · gfg

2018.12

• Success storie on Reddit: A B
• The Craft of Writing Effectively - UChicago Leadership Lab, Larry McEnerney
• Suffix Tree and other adv string d.s. - Erik Damien
• DCP 9 · Max sum of non-adj nums · on Gainlo
• Dynamic Programming
  • Prof. Jeff Erickson - L5, UIUC – ongoing
  • TC Article – to follow up
  • Refdash – to follow up
  • CodeChef – to follow up
• Insert into cyclic sorted l-list – LC blog
• Yet another personal experience
• [↻] DCP 25 – Kleene star string matching LC 10
• Pramp DS&A how to
• Soft questions
• Arbitrage opportunity with Bellman-Ford
• Amazon Leadership

2018.Fin

• My Goodreads 2018

2019.01

• On notebooks
• Breakout List
• a generic backtracking subset approach
• Distributed Ledgers, Blockchains and Smart Contracts
• 10 Lessons I Learned as a Software Engineering Interviewer
• Haseeb Q.
• JS intvw ques
• LRU w/ doubly linked list and hashed maps
• Hoisting in JS
  • Hoisting - MDN entry
  • JS var and fn hoisting
• Haseeb – yet another job search guide
• [↻] Median of 2 sorted array LC4, ln(m+n) like bin search
• on Graphs - UIUC Prof Jeff Erickson
• Trouble hiring senior engineers? It’s probably you
• Skyline Problem, related code sample
• H1B salary data
• Guide for Sys Design Intvw

2019.02

• Triplebyte certified Generalist Software Engineer
• Werner Vogels on Scalability
• The last stretch

TODO

• priority Q in Java a.k.a. heaps in real life
• r on how to prep
• interviewkickstart curriculum
• Gentle intro to complexity analysis
• G4G Top Algo+DS
• Code Kata
• Python API Time Complexity
• Kleppman talks – Author of Designing Data Int. Apps book
• Hired in Tech on Sys Design
• Scalability Q&A

Ref

• Big O Cheatsheet
• My list of Sys Design resources

Books to buy

• Manning on Micro services