面试场景
高频考察问题建模、边界条件与口头表达的清晰度。
常见误区
只背模板不解释为什么，容易在追问里失分。
练习策略
每轮练 3-5 题，固定复盘复杂度和可替代解法。
推荐练习顺序
LRU 缓存
Implement an efficient LRU Cache using hash table and doubly-linked list to achieve O(1) operations for get and put.
扁平化多级双向链表
Flatten a multilevel doubly linked list by correctly updating next, prev, and child pointers to create a single-level se…
全 O(1) 的数据结构
Implement a data structure that tracks string counts and retrieves max or min keys efficiently in constant time.
LFU 缓存
Implement an LFU Cache using linked-list pointer manipulation with constant-time get and put operations for interview sc…
设计浏览器历史记录
Implement a browser history tracker with back, forward, and visit operations using linked-list pointer manipulation effi…
设计一个验证系统
Implement an AuthenticationManager using linked-list pointer manipulation and a hash map to track token expirations effi…
设计一个文本编辑器
Design a text editor that supports text manipulation and cursor navigation operations efficiently with linked-list-based…
移除最小数对使数组有序 I
This problem asks for the minimum number of operations to make an array non-decreasing by removing pairs of elements.
移除最小数对使数组有序 II
The problem asks to find the minimum number of operations to make an array non-decreasing by removing pairs of elements.