20250712

• brunch w/ Yudai
• reviewed pull requests
  • LeetCoee 104. Maximum Depth of Binary Tree
    • I feel that great engineers tend to write very simple logic, avoiding if conditions or other types of conditional branching.
  • LeetCode 127. Word Ladder
    • This was my first hard problem… it was hard to understand the solution though I should have thought of BFS to find one of the shortest paths.
• finished reading The Trading Game: A Confession

TODO:

• Union Find (Disjoint Set)
• revisit ACID
• check how many steps Python can take in a second
• check available facilities for passport request

index 20250711 20250713