| Find the Winner of the Circular Game | Medium | 82.2% |
| First Unique Character in a String | Easy | 65.1% |
| Flatten Nested List Iterator | Medium | 65.6% |
| Sliding Window Maximum | Hard | 48.5% |
| Design Hit Counter | Medium | 69.6% |
| Constrained Subsequence Sum | Hard | 56.4% |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 57.4% |
| Number of Students Unable to Eat Lunch | Easy | 79.4% |
| Number of Recent Calls | Easy | 78.2% |
| Implement Queue using Stacks | Easy | 69.4% |
| First Unique Number | Medium | 57.0% |
| Design Circular Queue | Medium | 54.0% |
| Implement Stack using Queues | Easy | 69.4% |
| Lexicographically Maximum MEX Array | Hard | |
| Count Subarrays With Fixed Bounds | Hard | 69.2% |
| Maximum Sum Circular Subarray | Medium | 49.5% |
| Shortest Subarray with Sum at Least K | Hard | 32.6% |
| Design an Array Statistics Tracker | Hard | 35.7% |
| Moving Average from Data Stream | Easy | 80.2% |
| Reveal Cards In Increasing Order | Medium | 83.5% |
| Maximum Number of Robots Within Budget | Hard | 38.0% |
| Continuous Subarrays | Medium | 57.9% |
| Maximum Number of Tasks You Can Assign | Hard | 50.2% |
| Dota2 Senate | Medium | 49.6% |
| Minimum Operations to Make Binary Array Elements Equal to One I | Medium | 80.4% |
| Design Snake Game | Medium | 40.0% |
| Number of People Aware of a Secret | Medium | 60.9% |
| Find Maximum Non-decreasing Array Length | Hard | 18.5% |
| Zigzag Iterator | Medium | 66.5% |
| Count Partitions With Max-Min Difference at Most K | Medium | 58.8% |
| Time Taken to Cross the Door | Hard | 50.1% |
| Maximize the Minimum Powered City | Hard | 61.8% |
| Time Needed to Buy Tickets | Easy | 72.2% |
| Design Front Middle Back Queue | Medium | 56.9% |
| Design Circular Deque | Medium | 64.4% |
| Implement Router | Medium | 39.1% |
| Minimum Number of K Consecutive Bit Flips | Hard | 62.2% |
| Jump Game VI | Medium | 46.4% |
| Finding MK Average | Hard | 38.7% |
| Count Non-Decreasing Subarrays After K Operations | Hard | 23.8% |
| Longest Increasing Subsequence II | Hard | 26.0% |
| Max Value of Equation | Hard | 45.0% |
| Design Phone Directory | Medium | 52.7% |
| K Empty Slots | Hard | 37.9% |
| Minimum Sum of Values by Dividing Array | Hard | 27.9% |
| Count Prime-Gap Balanced Subarrays | Medium | 22.5% |
| Find Consecutive Integers from a Data Stream | Medium | 50.8% |
| Stamping The Sequence | Hard | 62.2% |
| Delivering Boxes from Storage to Ports | Hard | 40.1% |