---
title: "2024-04-25"
---

- [x] Anki Flashcards
- [x] KoL
- [ ] Sheet Music (10 min.)
- [ ] Go (1 Life & Death Problem)
- [ ] Korean (Read 1 Story)
- [x] Interview Prep (1 Practice Problem)
- [x] Log Work Hours (Max 3 hours)

* Talk with Mike about yesterday's "Grokking the System Interview" and "Designing Data-Intensive Applications" reading.
* Notes on nearly complete trees. Refine terminology to favor "perfect/complete" over "complete/nearly complete".
* Read Heapsort section in "Introduction to Algorithms". Still need to implement and translate into notes though.