CaffeCode
題庫
學習清單
登入
Queue & Deque Patterns — CaffeCode
← 所有清單
Queue & Deque Patterns
Queue, deque, and monotonic queue pattern problems.
30 道題目
#
題目
難度
Rating
1
341. Flatten Nested List Iterator
Medium
—
2
387. First Unique Character in a String
Easy
—
3
641. Design Circular Deque
Medium
—
4
862. Shortest Subarray with Sum at Least K
Hard
2307
5
950. Reveal Cards In Increasing Order
Medium
1686
6
1425. Constrained Subsequence Sum
Hard
2032
7
1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
Medium
1672
8
1499. Max Value of Equation
Hard
2456
9
1670. Design Front Middle Back Queue
Medium
1610
10
1687. Delivering Boxes from Storage to Ports
Hard
2610
11
1696. Jump Game VI
Medium
1954
12
1700. Number of Students Unable to Eat Lunch
Easy
1404
13
1823. Find the Winner of the Circular Game
Medium
1412
14
1825. Finding MK Average
Hard
2396
15
2071. Maximum Number of Tasks You Can Assign
Hard
2648
16
2073. Time Needed to Buy Tickets
Easy
1325
17
2327. Number of People Aware of a Secret
Medium
1894
18
2407. Longest Increasing Subsequence II
Hard
2280
19
2526. Find Consecutive Integers from a Data Stream
Medium
1444
20
2762. Continuous Subarrays
Medium
1940
21
2944. Minimum Number of Coins for Fruits
Medium
1709
22
2945. Find Maximum Non-decreasing Array Length
Hard
2943
23
3420. Count Non-Decreasing Subarrays After K Operations
Hard
2855
24
3508. Implement Router
Medium
1851
25
3578. Count Partitions With Max-Min Difference at Most K
Medium
2033
26
3589. Count Prime-Gap Balanced Subarrays
Medium
2235
27
3826. Minimum Partition Score
Hard
2345
28
3829. Design Ride Sharing System
Medium
1594
29
3835. Count Subarrays With Cost Less Than or Equal to K
Medium
1759
30
3845. Maximum Subarray XOR with Bounded Range
Hard
2347