minimum jumps to reach end via prime teleportation core interview pattern 模式
1 道题目
模式页适合用来建立可复用解题框架。先识别题目特征，再按固定流程解释状态定义、转移和边界。
识别信号
- Candidate uses BFS for traversing the array efficiently.
- Candidate optimizes prime checking, ensuring good performance for large inputs.
解题流程
- 1. 明确窗口/状态定义
- 2. 更新状态并维护约束
- 3. 用边界样例验证
常见失分点
- Overlooking the need for efficient prime number checking in large arrays.