• Jan 12, 2020

  • The MD5 hashing algorithm resolves to 128bit values.
  • CRUD create read update delete.
  • Final prep for amazon.
  • Few questions on glassdoor. Mostly behavioral, some algorithmic.
  • Few questions on careercup. Technical.
  • All the big hitters in my gdrive:
  • technical: a&ds, aws, databases, debugging, general software, linux, speed this up, sicp, system design, web.
  • behavioral: my questions, their questions, amazon leadership principles, logistics.
  • Few leetcode problems:
  • https://leetcode.com/problems/rectangle-overlap.
  • https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array
  • https://leetcode.com/problems/search-in-rotated-sorted-array.
  • https://leetcode.com/problems/jump-game-ii.
  • https://leetcode.com/problems/combination-sum/.
  • Signed the NDA.
  • Anything >= 1000 requests / second is usually a heavy load. For a smaller system, a few hundred can even be heavy. Google processes ~50k searches per second.
  • Can we get a favicon on bigocheatsheet pleeeease. https://www.bigocheatsheet.com/.
  • Last 2 divisional games, so conference championships will be Titans vs Chiefs and Niners vs Packers.
  • For recursive problems, you can:
  • Naive: Generate every single permutation/path and then run through and check each as valid/invalid.
  • Backtracking: Try a value, verify, drop if wrong and move on to the next. Continue if valid.
  • Powers of 2:
  • 2^10 ~thousand
  • 2^20 ~million
  • 2^30 ~billion
  • 2^40 ~trillion
  • Read sequentially from:
  • Disk at ~30 MB/s.
  • SSD at ~1 GB/s.
  • Memory at ~4 GB/s.
  • Fantastic overview of system design: https://github.com/donnemartin/system-design-primer.