| 225 | Implement Stack using Queues | — | Easy | StackDesignQueue | 67% | |
| 232 | Implement Queue using Stacks | — | Easy | StackDesignQueue | 68% | |
| 239 | Sliding Window Maximum | — | Hard | ArrayQueueSliding Window | 47% | |
| 341 | Flatten Nested List Iteratorread | — | Medium | StackTreeDepth-First Search | 65% | |
| 387 | First Unique Character in a String | — | Easy | Hash TableStringQueue | 64% | |
| 622 | Design Circular Queue | — | Medium | ArrayLinked ListDesign | 52% | |
| 641 | Design Circular Deque | — | Medium | ArrayLinked ListDesign | 64% | |
| 649 | Dota2 Senate | — | Medium | StringGreedyQueue | 49% | |
| 862 | Shortest Subarray with Sum at Least K | — | Hard | ArrayBinary SearchQueue | 32% | |
| 918 | Maximum Sum Circular Subarray | — | Medium | ArrayDivide and ConquerDynamic Programming | 47% | |
| 933 | Number of Recent Calls | — | Easy | DesignQueueData Stream | 77% | |
| 936 | Stamping The Sequence | — | Hard | StringStackGreedy | 62% | |
| 950 | Reveal Cards In Increasing Order | — | Medium | ArrayQueueSorting | 83% | |
| 995 | Minimum Number of K Consecutive Bit Flips | — | Hard | ArrayBit ManipulationQueue | 62% | |
| 1425 | Constrained Subsequence Sumread | — | Hard | ArrayDynamic ProgrammingQueue | 56% | |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | — | Medium | ArrayQueueSliding Window | 57% | |
| 1499 | Max Value of Equation | — | Hard | ArrayQueueSliding Window | 44% | |
| 1670 | Design Front Middle Back Queue | — | Medium | ArrayLinked ListDesign | 56% | |
| 1687 | Delivering Boxes from Storage to Ports | — | Hard | ArrayDynamic ProgrammingSegment Tree | 39% | |
| 1696 | Jump Game VI | — | Medium | ArrayDynamic ProgrammingQueue | 46% | |
| 1700 | Number of Students Unable to Eat Lunch | — | Easy | ArrayStackQueue | 79% | |
| 1823 | Find the Winner of the Circular Gameread | — | Medium | ArrayMathRecursion | 82% | |
| 1825 | Finding MK Average | — | Hard | DesignQueueHeap (Priority Queue) | 38% | |
| 2071 | Maximum Number of Tasks You Can Assign | — | Hard | ArrayTwo PointersBinary Search | 51% | |
| 2073 | Time Needed to Buy Tickets | — | Easy | ArrayQueueSimulation | 71% | |
| 2327 | Number of People Aware of a Secret | — | Medium | Dynamic ProgrammingQueueSimulation | 46% | |
| 2398 | Maximum Number of Robots Within Budget | — | Hard | ArrayBinary SearchQueue | 37% | |
| 2407 | Longest Increasing Subsequence II | — | Hard | ArrayDivide and ConquerDynamic Programming | 25% | |
| 2444 | Count Subarrays With Fixed Bounds | — | Hard | ArrayQueueSliding Window | 69% | |
| 2526 | Find Consecutive Integers from a Data Stream | — | Medium | Hash TableDesignQueue | 49% | |
| 2528 | Maximize the Minimum Powered City | — | Hard | ArrayBinary SearchGreedy | 33% | |
| 2762 | Continuous Subarrays | — | Medium | ArrayQueueSliding Window | 58% | |
| 2944 | Minimum Number of Coins for Fruits | — | Medium | ArrayDynamic ProgrammingQueue | 46% | |
| 2945 | Find Maximum Non-decreasing Array Length | — | Hard | ArrayBinary SearchDynamic Programming | 17% | |
| 3117 | Minimum Sum of Values by Dividing Arrayread | — | Hard | ArrayBinary SearchDynamic Programming | 27% | |
| 3191 | Minimum Operations to Make Binary Array Elements Equal to One I | — | Medium | ArrayBit ManipulationQueue | 81% | |
| 3420 | Count Non-Decreasing Subarrays After K Operations | — | Hard | ArrayStackSegment Tree | 20% | |
| 3508 | Implement Router | — | Medium | ArrayHash TableBinary Search | 21% | |