Exercise: Queue Problems on LeetCode labuladong Original About 8895 words
362. 敲击计数器 https://leetcode.cn/problems/design-hit-counter 362. Design Hit Counter https://leetcode.com/problems/design-hit-counter 933. 最近的请求次数 https://leetcode.cn/problems/number-of-recent-calls 933. Number of Recent Calls https://leetcode.com/problems/number-of-recent-calls 346. 数据流中的移动平均值 https://leetcode.cn/problems/moving-average-from-data-stream 346. Moving Average from Data Stream https://leetcode.com/problems/moving-average-from-data-stream 622. 设计循环队列 https://leetcode.cn/problems/design-circular-queue 622. Design Circular Queue https://leetcode.com/problems/design-circular-queue 641. 设计循环双端队列 https://leetcode.cn/problems/design-circular-deque 641. Design Circular Deque https://leetcode.com/problems/design-circular-deque 1670. 设计前中后队列 https://leetcode.cn/problems/design-front-middle-back-queue 1670. Design Front Middle Back Queue https://leetcode.com/problems/design-front-middle-back-queue 2073. 买票需要的时间 https://leetcode.cn/problems/time-needed-to-buy-tickets 2073. Time Needed to Buy Tickets https://leetcode.com/problems/time-needed-to-buy-tickets Prerequisites
Before reading this article, you need to learn:
The common focus of queue problems is the "First-In-First-Out" order property of elements. For example, maintaining certain temporal properties of elements within the queue. Below are some example problems where the queue acts as a "sliding window."
Prev
Exercise: Bracket Problems on LeetCode
Next
Monotonic Stack Code Template