| 2045 | Second Minimum Time to Reach Destination | Breadth-First SearchGraphShortest Path | Hard |
| 2047 | Number of Valid Words in a Sentence | String | Easy |
| 2048 | Next Greater Numerically Balanced Number | Hash TableMathBacktracking+2 | Medium |
| 2049 | Count Nodes With the Highest Score | ArrayTreeDepth-First Search+1 | Medium |
| 2050 | Parallel Courses III | ArrayDynamic ProgrammingGraph+1 | Hard |
| 2053 | Kth Distinct String in an Array | ArrayHash TableString+1 | Easy |
| 2054 | Two Best Non-Overlapping Events | ArrayBinary SearchDynamic Programming+2 | Medium |
| 2055 | Plates Between Candles | ArrayStringBinary Search+1 | Medium |
| 2056 | Number of Valid Move Combinations On Chessboard | ArrayStringBacktracking+1 | Hard |
| 2057 | Smallest Index With Equal Value | Array | Easy |
| 2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points | Linked List | Medium |
| 2059 | Minimum Operations to Convert Number | ArrayBreadth-First Search | Medium |
| 2060 | Check if an Original String Exists Given Two Encoded Strings | StringDynamic Programming | Hard |
| 2062 | Count Vowel Substrings of a String | Hash TableString | Easy |
| 2063 | Vowels of All Substrings | MathStringDynamic Programming+1 | Medium |
| 2064 | Minimized Maximum of Products Distributed to Any Store | ArrayBinary SearchGreedy | Medium |
| 2065 | Maximum Path Quality of a Graph | ArrayBacktrackingGraph | Hard |
| 2068 | Check Whether Two Strings are Almost Equivalent | Hash TableStringCounting | Easy |
| 2069 | Walking Robot Simulation II | DesignSimulation | Medium |
| 2070 | Most Beautiful Item for Each Query | ArrayBinary SearchSorting | Medium |
| 2071 | Maximum Number of Tasks You Can Assign | ArrayTwo PointersBinary Search+4 | Hard |
| 2073 | Time Needed to Buy Tickets | ArrayQueueSimulation | Easy |
| 2074 | Reverse Nodes in Even Length Groups | Linked List | Medium |
| 2075 | Decode the Slanted Ciphertext | StringSimulation | Medium |
| 2076 | Process Restricted Friend Requests | Union FindGraph | Hard |
| 2078 | Two Furthest Houses With Different Colors | ArrayGreedy | Easy |
| 2079 | Watering Plants | ArraySimulation | Medium |
| 2080 | Range Frequency Queries | ArrayHash TableBinary Search+2 | Medium |
| 2081 | Sum of k-Mirror Numbers | MathEnumeration | Hard |
| 2085 | Count Common Words With One Occurrence | ArrayHash TableString+1 | Easy |
| 2086 | Minimum Number of Food Buckets to Feed the Hamsters | StringDynamic ProgrammingGreedy | Medium |
| 2087 | Minimum Cost Homecoming of a Robot in a Grid | ArrayGreedy | Medium |
| 2088 | Count Fertile Pyramids in a Land | ArrayDynamic ProgrammingMatrix | Hard |
| 2089 | Find Target Indices After Sorting Array | ArrayBinary SearchSorting | Easy |
| 2090 | K Radius Subarray Averages | ArraySliding Window | Medium |
| 2091 | Removing Minimum and Maximum From Array | ArrayGreedy | Medium |
| 2092 | Find All People With Secret | Depth-First SearchBreadth-First SearchUnion Find+2 | Hard |
| 2094 | Finding 3-Digit Even Numbers | ArrayHash TableSorting+1 | Easy |
| 2095 | Delete the Middle Node of a Linked List | Linked ListTwo Pointers | Medium |
| 2096 | Step-By-Step Directions From a Binary Tree Node to Another | StringTreeDepth-First Search+1 | Medium |
| 2097 | Valid Arrangement of Pairs | Depth-First SearchGraphEulerian Circuit | Hard |
| 2099 | Find Subsequence of Length K With the Largest Sum | ArrayHash TableSorting+1 | Easy |
| 2100 | Find Good Days to Rob the Bank | ArrayDynamic ProgrammingPrefix Sum | Medium |
| 2101 | Detonate the Maximum Bombs | ArrayMathDepth-First Search+3 | Medium |
| 2102 | Sequentially Ordinal Rank Tracker | DesignHeap (Priority Queue)Data Stream+1 | Hard |
| 2103 | Rings and Rods | Hash TableString | Easy |
| 2104 | Sum of Subarray Ranges | ArrayStackMonotonic Stack | Medium |
| 2105 | Watering Plants II | ArrayTwo PointersSimulation | Medium |
| 2106 | Maximum Fruits Harvested After at Most K Steps | ArrayBinary SearchSliding Window+1 | Hard |
| 2108 | Find First Palindromic String in the Array | ArrayTwo PointersString | Easy |