堆模式

数组中的第K个最大元素

Find the kth largest element in an unsorted array using optimal approaches like Quickselect or heaps.

天际线问题

The Skyline Problem requires calculating a city's silhouette using array manipulation and divide-and-conquer techniques …

查找和最小的 K 对数字

Find K Pairs with Smallest Sums combines arrays and heap usage to select the smallest sum pairs efficiently.

根据字符出现频率排序

Sort Characters By Frequency requires counting characters efficiently and rearranging a string in descending frequency o…

考场就座

Simulate an exam room where each student chooses a seat maximizing distance to others, using design plus heap structures…

细分图中的可到达节点

The Reachable Nodes In Subdivided Graph problem requires efficiently finding the reachable nodes using graph traversal a…

排序数组

Sort an array using an optimal algorithm, focusing on time and space complexity considerations.

最后一块石头的重量

In the 'Last Stone Weight' problem, we smash the two heaviest stones until one remains, using heaps or sorting.

多次求和构造目标数组

This problem requires constructing a target array from an array of ones, using multiple sum operations and a priority qu…

概率最大的路径

Find the path with the highest success probability in a graph from a start node to an end node, using edge probabilities…

找出第 K 大的异或坐标值

Compute the kth largest XOR coordinate in a 2D matrix using prefix sums, bit manipulation, and optimized selection techn…

积压订单中的订单总数

Determine the total number of unfulfilled buy and sell orders using heaps to simulate backlog processing efficiently in …

求出 MK 平均值

Find the MKAverage of a stream of integers using a queue-driven approach with efficient state management.

座位预约管理系统

Manage seat reservations efficiently using a design combining priority queue to always return the lowest available seat …

使用服务器处理任务

Assign tasks to servers efficiently using arrays and heaps, resolving ties by weight and index while tracking availabili…

股票价格波动

Design an efficient algorithm for managing stock price fluctuations with incorrect and unordered data in a data stream.

序列顺序查询

Track rankings of locations with names and scores, adding new locations and retrieving top-ranked ones efficiently.

按奇偶性交换后的最大数字

Maximize a number by swapping digits of the same parity using sorting and priority queue techniques efficiently.

无限集中的最小数字

Design a data structure to handle the smallest missing element in an infinite set, with the ability to add and remove el…

设计数字容器系统

Learn to implement a Number Container System using hash tables and design techniques to efficiently track numbers and in…

过桥的时间

Time to Cross a Bridge involves simulating worker movements using arrays and heaps to determine when the last worker cro…

从数量最多的堆取走礼物

Take Gifts From the Richest Pile uses a heap to simulate the process of taking gifts from the richest pile over a number…

设计可以求最短路径的图类

Implement a dynamic weighted directed graph with efficient shortest path queries and edge additions in real time.

前往目标的最小代价

Find the minimum cost path between two points, using special roads or direct moves in a 2D space.