Lesson 2 · Chapter III
技術面試開場Tech Screen Opening
面試官問問題前要先確認 — 規格、要求 input/output、邊邊條件、時間複雜度。
📜 Dialogue · 對話腳本
Interview & Job Hunt
A
Here's the problem: find the longest substring with unique characters.
題目:找出沒有重複字元的最長子字串。
Y
Let me make sure I understand — characters are ASCII or Unicode?
確認一下 — 字元是 ASCII 還是 Unicode?
A
Assume ASCII for now.
先假設 ASCII。
Y
Got it. Can the input be empty? And what's the expected size?
了解。輸入可以是空字串嗎?預期長度多大?
A
Empty is fine. Up to 10^5 characters.
空可以。最多 10 萬字元。
📝 Key Phrases · 重點片語
6 expressions to remember
let me make sure I understand
確認一下我理解
assume for now
先假設
edge cases
邊界條件
expected size
預期長度 / 規模
time complexity
時間複雜度
up to X
最多到 X