面试场景
高频考察问题建模、边界条件与口头表达的清晰度。
常见误区
只背模板不解释为什么，容易在追问里失分。
练习策略
每轮练 3-5 题，固定复盘复杂度和可替代解法。
推荐练习顺序
数组中的第K个最大元素
Find the kth largest element in an unsorted array using optimal approaches like Quickselect or heaps.
摆动排序 II
Rearrange an array in a way that every odd-indexed element is greater than its adjacent even-indexed elements.
前 K 个高频元素
Find the k most frequent elements from an array using efficient algorithms like hashing and sorting.
最接近原点的 K 个点
Find the k closest points to the origin in a 2D plane using array operations and Euclidean distance calculations efficie…
找出第 K 大的异或坐标值
Compute the kth largest XOR coordinate in a 2D matrix using prefix sums, bit manipulation, and optimized selection techn…
找出数组中的第 K 大整数
This problem asks to find the kth largest integer in an array of string numbers, highlighting sorting and string-based c…
裁剪数字后查询第 K 小的数字
Solve the Query Kth Smallest Trimmed Number problem by efficiently trimming and sorting strings in an array to answer qu…