面试场景
高频考察问题建模、边界条件与口头表达的清晰度。
常见误区
只背模板不解释为什么，容易在追问里失分。
练习策略
每轮练 3-5 题，固定复盘复杂度和可替代解法。
推荐练习顺序
题库
有序集合 题库
先展示一段最适合快速浏览的题目列表，继续滚动时再慢慢续载，避免专题页被长列表一下子拉穿。
慢加载专题题库
适合这类题很多的专题，先扫结构，再逐步深入。
当前展示 24 / 59 道题目
每次续载 24 题天际线问题
The Skyline Problem requires calculating a city's silhouette using array manipulation and divide-and-conquer techniques …
存在重复元素 III
The problem involves finding a pair of indices in an array where the index and value differences are within given limits…
计算右侧小于当前元素的个数
Solve the Count of Smaller Numbers After Self problem using binary search and optimized algorithms.
区间和的个数
Count the number of subarray sums within a given inclusive range using optimized divide-and-conquer techniques efficient…
将数据流变为多个不相交区间
The problem involves designing a class to summarize a data stream of non-negative integers as disjoint intervals using b…
矩形区域不超过 K 的最大数值和
Solve the "Max Sum of Rectangle No Larger Than K" problem using binary search over the valid sum space to optimize space…
132 模式
Identify whether a given integer array contains a 132 pattern subsequence using efficient stack and search techniques.
翻转对
Count the number of reverse pairs in a given integer array using efficient algorithms like binary search and merge sort.
非重叠矩形中的随机点
Design an algorithm to pick random points within non-overlapping rectangles using binary search and reservoir sampling.
掉落的方块
Solve Falling Squares by efficiently computing maximum stack heights using arrays with segment tree optimization techniq…
Range 模块
Design a RangeModule to track and query half-open intervals using segment trees or ordered sets.
我的日程安排表 I
Implement a calendar supporting non-overlapping event bookings using binary search for efficient insertion and conflict …
我的日程安排表 II
Implement a calendar that allows double bookings but prevents triple bookings, managing overlapping intervals efficientl…
我的日程安排表 III
Implement My Calendar III to track maximum overlapping events efficiently using binary search and segment tree technique…
矩形面积 II
The problem involves calculating the total area covered by multiple rectangles, ensuring overlap is counted only once.
考场就座
Simulate an exam room where each student chooses a seat maximizing distance to others, using design plus heap structures…
最大频率栈
Design a stack-like data structure to manage elements and handle frequent stack operations, including popping the most f…
奇偶跳
Determine the number of valid starting indices in an array where you can reach the end with alternating odd and even jum…
推文计数
Design an efficient solution to track and retrieve tweet counts over different frequencies using binary search and hash …
点菜展示表
Generate a restaurant display table from orders by counting each food item per table using array scanning and hash looku…
绝对差不超过限制的最长连续子数组
Find the longest subarray with elements whose absolute difference is within a specified limit using a sliding window app…
找到处理最多请求的服务器
Given k servers and a series of requests, find the busiest server(s) using greedy strategies and efficient server tracki…
通过指令创建有序数组
The problem asks to compute the cost of inserting elements into a sorted array using a series of instructions.
数组的最小偏移量
Given a positive integer array, repeatedly double or halve elements to minimize the difference between its largest and s…
swap_vert在题库框内继续向下滚动，也会自动续载