Frontend engineer, perpetual builder. I ship user-facing things and care a lot about the details.
前端工程師、不停在做東西的人。把使用者體驗放第一，對細節有高度的堅持。
Now
Updated 2026.05.05- →Shipping K-Line Prediction — an ETH/USDT direction app run by a 6-agent AI pipeline (PM, Architect, Engineer, Reviewer, QA, Designer)
- →Running an 8-agent autonomous writing pipeline (重啟之境 / The Node) — Characters, Narrator, Editor, and Translator collaborate to produce bilingual ZH/EN literary fiction
- →Building Market News Analyzer — daily stock signals fused from news sentiment, technicals, and fundamentals, synthesized via NVIDIA NIM API
- →Maintaining a self-curated engineering KB — articles ingested from diverse sources, auto-indexed with concept graph generation
Elsewhere
- GitHub@mshmwr ↗
- LinkedInyichenlee-career ↗
- Emailyichen.lee.20@gmail.com ↗
Selected projects
K-Line Prediction
AI-agent-directed app that predicts short-term ETH/USDT direction via pattern matching.
AI Novel Generator
Bilingual JRPG novel generated chapter by chapter with an AI translation pipeline.
Market News Analyzer
Daily stock signal CLI fusing news, technicals, fundamentals, and analyst ratings.
Recent notes
資深前端外商面試 ── LeetCode Cycle 系列複習機率排序
距離下一場資深前端面試只剩幾天，13 篇 cycle 全刷一輪不切實際。用三層權重把章節排成 Tier S/A/B/C，搭配時間預算表。內部使用。
11 minLeetCode Cycle 12 & 13：DP 五步法、背包、股票、LCS、編輯距離
DP 在面試桌前被當「決定生死」的題型——不是難在邏輯而是難在「看不出來是 DP」。Senior 面試看你能不能 30 秒內判定：這題有沒有重疊子問題＋最優子結構？有就 DP，沒有就 backtracking。Cycle 12 & 13 把 5 步法、背包、股票、LCS、編輯距離串成一張命題網。內部使用。
14 minLeetCode Cycle 10：圖 BFS / DFS、拓撲排序、Union-Find
樹是「沒有環的圖」——把樹的搜索套到圖上會無窮迴圈。Cycle 10 後半把命題從「樹好搜」進階到「圖怎麼搜」：visited set 為什麼必要、有向圖環怎麼測（三色 DFS）、拓撲排序兩種寫法、Union-Find 為什麼能 O(α(n)) 近似常數。內部使用。
13 minLeetCode Cycle 10：樹 BFS / DFS 進階——路徑、深度、LCA、序列化
Cycle 09 把 traversal 列舉完，Cycle 10 把問題從「列出全部」進階到「找特定資訊」。Senior 面試官追問樹題會盯三個地方——LCA 為什麼必須 postorder、最小深度為什麼不能套最大深度的解、序列化選 preorder 還是 BFS 怎麼影響 deserialize 難度。內部使用。
13 min
Colophon
Set in Fraunces and Nunito, with DM Mono for code and metadata. Built with Next.js, Tailwind CSS, and Firebase. No trackers.