面试场景
高频考察问题建模、边界条件与口头表达的清晰度。
常见误区
只背模板不解释为什么，容易在追问里失分。
练习策略
每轮练 3-5 题，固定复盘复杂度和可替代解法。
推荐练习顺序
#题目难度分类
1044
最长重复子串
Find the longest duplicated substring in a string using binary search, sliding window, and rolling hash techniques.
困难
字符串
1923最长公共子路径
The Longest Common Subpath problem requires finding the longest subpath shared by all paths in a graph using binary sear…
困难
数组
1977划分数字的方案数
Calculate the number of valid non-decreasing integer sequences from a string using state transition dynamic programming …
困难
字符串
2223构造字符串的总得分和
Calculate the sum of scores of built strings by analyzing longest common prefixes with suffixes in a string using effici…
困难
字符串
3213最小代价构造字符串
This problem asks you to construct a target string using given words at minimal cost using dynamic programming technique…
困难
数组