https://h30306.github.io/blog/tags/queue/Recent content in Queue onHugo -- gohugo.ioenhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungTue, 20 Oct 2026 00:00:00 +0000https://h30306.github.io/blog/algorithm/queue-and-design/Tue, 20 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/algorithm/queue-and-design/Circular queues, zigzag iterators, FIFO matching with cancellation, and the data structure combinations that design problems keep usinghttps://h30306.github.io/blog/leetcode/leetcode-622/Mon, 14 Sep 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-622/LeetCode 622 note: a fixed array plus head and count, every position taken modulo the capacity, and count deciding empty versus fullhttps://h30306.github.io/blog/leetcode/leetcode-1425/Thu, 10 Sep 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1425/LeetCode 1425 note: dp[i] = nums[i] + max(0, max of the previous k dp values); that max is a sliding window maximum, available in O(1) from a monotonic dequehttps://h30306.github.io/blog/leetcode/leetcode-281/Wed, 29 Apr 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-281/LeetCode 281 note: a queue of unfinished sources, take one value in turn and put the source back if anything remains; it generalizes to k sourceshttps://h30306.github.io/blog/leetcode/leetcode-3835/Sun, 08 Feb 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-3835/LeetCode 3835 note: cost = (max - min) × length only grows as the window grows, so a sliding window counts subarrays; two monotonic deques keep the window’s max and minhttps://h30306.github.io/blog/leetcode/leetcode-3829/Sun, 01 Feb 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-3829/LeetCode 3829 note: one queue each for riders and drivers; cancellations only update a set, and canceled riders at the front are dropped before matchinghttps://h30306.github.io/blog/leetcode/leetcode-1696/Sun, 10 Aug 2025 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1696/LeetCode 1696 note: dp[i] = nums[i] + max of the previous k dp values, with that max kept by a monotonic deque in O(n)https://h30306.github.io/blog/leetcode/leetcode-3508/Sun, 06 Apr 2025 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-3508/LeetCode 3508 note: a queue for FIFO, a set for duplicates, and an increasing time list per destination queried with bisecthttps://h30306.github.io/blog/leetcode/leetcode-387/Tue, 23 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-387/LeetCode 387 note: count first, then scan left to right for the first character with count 1https://h30306.github.io/blog/leetcode/leetcode-232/Mon, 22 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-232/LeetCode 232 note: two stacks, where in receives pushes and out is refilled from in only when empty, amortized O(1)https://h30306.github.io/blog/leetcode/leetcode-225/Sun, 21 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-225/LeetCode 225 note: one queue suffices: after a push, rotate all earlier elements to the back so the new element sits at the front