1-D Dynamic Programming — Interview English Scripts¶
本章共 12 題。
題目對照表¶
| # | Problem | Source | English Script |
|---|---|---|---|
| 1 | Climbing Stairs | 題解 | 講稿 |
| 2 | Min Cost Climbing Stairs | 題解 | 講稿 |
| 3 | House Robber | 題解 | 講稿 |
| 4 | House Robber II | 題解 | 講稿 |
| 5 | Longest Palindromic Substring | 題解 | 講稿 |
| 6 | Palindromic Substrings | 題解 | 講稿 |
| 7 | Decode Ways | 題解 | 講稿 |
| 8 | Coin Change | 題解 | 講稿 |
| 9 | Maximum Product Subarray | 題解 | 講稿 |
| 10 | Word Break | 題解 | 講稿 |
| 11 | Longest Increasing Subsequence | 題解 | 講稿 |
| 12 | Partition Equal Subset Sum | 題解 | 講稿 |
說明¶
- 所有講稿採固定 10 段面試口述模板。
- 英文句型偏短，適合即時口說。
[CHECK]表示來源未明確定義，需面試時先問清楚。