| 2318 | Number of Distinct Roll Sequences | Hard | | 254 | 91.67 |
| 2317 | Maximum XOR After Operations | Medium | | 1 | 100.00 |
| 2316 | Count Unreachable Pairs of Nodes in an Undirected Graph | Medium | | 32 | 100.00 |
| 2315 | Count Asterisks | Easy | | 1 | 100.00 |
| 2312 | Selling Pieces of Wood | Hard | Backtracking | 78 | 63.64 |
| 2311 | Longest Binary Subsequence Less Than or Equal to K | Medium | String, Dynamic_Programming, Greedy, Memoization | 1 | 100.00 |
| 2310 | Sum of Numbers With Units Digit K | Medium | Math | 1 | 66.67 |
| 2309 | Greatest English Letter in Upper and Lower Case | Easy | Array | 5 | 75.00 |
| 2306 | Naming a Company | Hard | Array, String, Hash_Table, Bit_Manipulation, Enumeration | 486 | 74.14 |
| 2305 | Fair Distribution of Cookies | Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 14 | 84.35 |
| 2304 | Minimum Path Cost in a Grid | Medium | Array, Dynamic_Programming, Matrix | 6 | 99.18 |
| 2303 | Calculate Amount Paid in Taxes | Easy | Array, Simulation | 1 | 92.41 |
| 2302 | Count Subarrays With Score Less Than K | Hard | Array, Binary_Search, Prefix_Sum, Sliding_Window | 4 | 88.77 |
| 2301 | Match Substring After Replacement | Hard | Array, String, Hash_Table, String_Matching | 205 | 94.20 |
| 2300 | Successful Pairs of Spells and Potions | Medium | Array, Sorting, Binary_Search, Two_Pointers | 85 | 71.70 |
| 2299 | Strong Password Checker II | Easy | String | 1 | 97.32 |
| 2296 | Design a Text Editor | Hard | String, Stack, Design, Simulation, Linked_List, Doubly_Linked_List | 238 | 87.02 |
| 2295 | Replace Elements in an Array | Medium | Array, Hash_Table, Simulation | 89 | 65.26 |
| 2294 | Partition Array Such That Maximum Difference Is K | Medium | Array, Sorting, Greedy | 35 | 94.09 |
| 2293 | Min Max Game | Easy | Array, Simulation | 1 | 90.39 |
| 2290 | Minimum Obstacle Removal to Reach Corner | Hard | Array, Breadth_First_Search, Matrix, Heap_Priority_Queue, Graph, Shortest_Path | 172 | 82.27 |
| 2289 | Steps to Make Array Non-decreasing | Medium | Array, Stack, Linked_List, Monotonic_Stack | 11 | 92.82 |
| 2288 | Apply Discount to Prices | Medium | String | 82 | 97.98 |
| 2287 | Rearrange Characters to Make Target String | Easy | String, Hash_Table, Counting | 1 | 87.39 |
| 2286 | Booking Concert Tickets in Groups | Hard | Binary_Search, Design, Segment_Tree, Binary_Indexed_Tree | 283 | 67.08 |
| 2285 | Maximum Total Importance of Roads | Medium | Sorting, Greedy, Heap_Priority_Queue, Graph | 54 | 41.07 |
| 2284 | Sender With Largest Word Count | Medium | Array, String, Hash_Table, Counting | 42 | 95.64 |
| 2283 | Check if Number Has Equal Digit Count and Digit Value | Easy | String, Hash_Table, Counting | 1 | 99.36 |
| 2281 | Sum of Total Strength of Wizards | Hard | Array, Stack, Prefix_Sum, Monotonic_Stack | 142 | 68.92 |
| 2280 | Minimum Lines to Represent a Line Chart | Medium | Array, Math, Sorting, Geometry, Number_Theory | 40 | 96.09 |
| 2279 | Maximum Bags With Full Capacity of Rocks | Medium | Array, Sorting, Greedy | 17 | 91.12 |
| 2278 | Percentage of Letter in String | Easy | String | 0 | 100.00 |
| 2276 | Count Integers in Intervals | Hard | Design, Ordered_Set, Segment_Tree | 137 | 64.87 |
| 2275 | Largest Combination With Bitwise AND Greater Than Zero | Medium | Array, Hash_Table, Bit_Manipulation, Counting | 19 | 96.92 |
| 2274 | Maximum Consecutive Floors Without Special Floors | Medium | Array, Sorting | 33 | 99.36 |
| 2273 | Find Resultant Array After Removing Anagrams | Easy | Array, String, Hash_Table, Sorting | 2 | 99.10 |
| 2272 | Substring With Largest Variance | Hard | Array, Dynamic_Programming | 469 | 23.66 |
| 2271 | Maximum White Tiles Covered by a Carpet | Medium | Array, Sorting, Greedy, Binary_Search, Prefix_Sum | 74 | 71.51 |
| 2270 | Number of Ways to Split Array | Medium | Array, Prefix_Sum | 4 | 77.55 |
| 2269 | Find the K-Beauty of a Number | Easy | String, Math, Sliding_Window | 2 | 38.88 |
| 2267 | Check if There Is a Valid Parentheses String Path | Hard | Array, Dynamic_Programming, Matrix | 93 | 77.48 |
| 2266 | Count Number of Texts | Medium | String, Hash_Table, Dynamic_Programming, Math | 38 | 81.43 |
| 2265 | Count Nodes Equal to Average of Subtree | Medium | Depth_First_Search, Tree, Binary_Tree | 1 | 99.12 |
| 2264 | Largest 3-Same-Digit Number in String | Easy | String | 3 | 74.57 |
| 2262 | Total Appeal of A String | Hard | String, Hash_Table, Dynamic_Programming | 6 | 97.92 |
| 2261 | K Divisible Elements Subarrays | Medium | Array, Hash_Table, Trie, Enumeration, Hash_Function, Rolling_Hash | 73 | 92.32 |
| 2260 | Minimum Consecutive Cards to Pick Up | Medium | Array, Hash_Table, Sliding_Window | 50 | 97.04 |
| 2259 | Remove Digit From Number to Maximize Result | Easy | String, Greedy, Enumeration | 1 | 97.73 |
| 2258 | Escape the Spreading Fire | Hard | Array, Breadth_First_Search, Binary_Search, Matrix | 33 | 77.40 |
| 2257 | Count Unguarded Cells in the Grid | Medium | Array, Matrix, Simulation | 32 | 70.28 |
| 2256 | Minimum Average Difference | Medium | Array, Prefix_Sum | 15 | 97.85 |
| 2255 | Count Prefixes of a Given String | Easy | Array, String | 1 | 94.82 |
| 2251 | Number of Flowers in Full Bloom | Hard | Array, Hash_Table, Sorting, Binary_Search, Prefix_Sum, Ordered_Set | 113 | 69.23 |
| 2250 | Count Number of Rectangles Containing Each Point | Medium | Array, Sorting, Binary_Search, Binary_Indexed_Tree | 49 | 98.80 |
| 2249 | Count Lattice Points Inside a Circle | Medium | Array, Hash_Table, Math, Enumeration, Geometry | 54 | 92.07 |
| 2248 | Intersection of Multiple Arrays | Easy | Array, Hash_Table, Counting | 2 | 99.46 |
| 2246 | Longest Path With Different Adjacent Characters | Hard | Array, String, Depth_First_Search, Tree, Graph, Topological_Sort | 75 | 97.79 |
| 2245 | Maximum Trailing Zeros in a Cornered Path | Medium | Array, Matrix, Prefix_Sum | 96 | 88.49 |
| 2244 | Minimum Rounds to Complete All Tasks | Medium | Array, Hash_Table, Greedy, Counting | 13 | 94.26 |
| 2243 | Calculate Digit Sum of a String | Easy | String, Simulation | 1 | 91.46 |
| 2242 | Maximum Score of a Node Sequence | Hard | Array, Sorting, Graph, Enumeration | 28 | 97.57 |
| 2241 | Design an ATM Machine | Medium | Array, Greedy, Design | 192 | 24.16 |
| 2240 | Number of Ways to Buy Pens and Pencils | Medium | Math, Enumeration | 19 | 68.73 |
| 2239 | Find Closest Number to Zero | Easy | Array | 2 | 84.21 |
| 2236 | Root Equals Sum of Children | Easy | Tree, Binary_Tree | 0 | 100.00 |
| 2235 | Add Two Integers | Easy | Math | 1 | 48.94 |
| 2234 | Maximum Total Beauty of the Gardens | Hard | Array, Sorting, Greedy, Binary_Search, Two_Pointers | 63 | 73.03 |
| 2233 | Maximum Product After K Increments | Medium | Array, Greedy, Heap_Priority_Queue | 364 | 75.06 |
| 2232 | Minimize Result by Adding Parentheses to Expression | Medium | String, Enumeration | 1 | 99.60 |
| 2231 | Largest Number After Digit Swaps by Parity | Easy | Sorting, Heap_Priority_Queue | 1 | 98.32 |
| 2227 | Encrypt and Decrypt Strings | Hard | Array, String, Hash_Table, Design, Trie | 143 | 74.74 |
| 2226 | Maximum Candies Allocated to K Children | Medium | Array, Binary_Search | 46 | 78.19 |
| 2225 | Find Players With Zero or One Losses | Medium | Array, Hash_Table, Sorting, Counting | 96 | 87.03 |
| 2224 | Minimum Number of Operations to Convert Time | Easy | String, Greedy | 1 | 97.78 |
| 2223 | Sum of Scores of Built Strings | Hard | String, Binary_Search, Hash_Function, String_Matching, Rolling_Hash, Suffix_Array | 21 | 63.91 |
| 2222 | Number of Ways to Select Buildings | Medium | String, Dynamic_Programming, Prefix_Sum | 19 | 98.28 |
| 2221 | Find Triangular Sum of an Array | Medium | Array, Math, Simulation, Combinatorics | 78 | 83.64 |
| 2220 | Minimum Bit Flips to Convert Number | Easy | Bit_Manipulation | 1 | 67.86 |
| 2218 | Maximum Value of K Coins From Piles | Hard | Array, Dynamic_Programming, Prefix_Sum | 54 | 96.38 |
| 2217 | Find Palindrome With Fixed Length | Medium | Array, Math | 37 | 88.60 |
| 2216 | Minimum Deletions to Make Array Beautiful | Medium | Array, Greedy, Stack | 7 | 39.24 |
| 2215 | Find the Difference of Two Arrays | Easy | Array, Hash_Table | 11 | 87.39 |
| 2213 | Longest Substring of One Repeating Character | Hard | Array, String, Ordered_Set, Segment_Tree | 141 | 86.81 |
| 2212 | Maximum Points in an Archery Competition | Medium | Array, Bit_Manipulation, Recursion, Enumeration | 7 | 78.16 |
| 2211 | Count Collisions on a Road | Medium | String, Stack | 113 | 45.96 |
| 2210 | Count Hills and Valleys in an Array | Easy | Array | 0 | 100.00 |
| 2209 | Minimum White Tiles After Covering With Carpets | Hard | String, Dynamic_Programming, Prefix_Sum | 94 | 88.16 |
| 2208 | Minimum Operations to Halve Array Sum | Medium | Array, Greedy, Heap_Priority_Queue | 237 | 89.24 |
| 2207 | Maximize Number of Subsequences in a String | Medium | String, Greedy, Prefix_Sum | 8 | 100 |
| 2206 | Divide Array Into Equal Pairs | Easy | Array, Hash_Table, Bit_Manipulation, Counting | 1 | 100.00 |
| 2203 | Minimum Weighted Subgraph With the Required Paths | Hard | Graph, Shortest_Path | 92 | 97.26 |
| 2202 | Maximize the Topmost Element After K Moves | Medium | Array, Greedy | 1 | 100.00 |
| 2201 | Count Artifacts That Can Be Extracted | Medium | Array, Hash_Table, Simulation | 7 | 82.97 |
| 2200 | Find All K-Distant Indices in an Array | Easy | Array | 2 | 95.30 |
| 2197 | Replace Non-Coprime Numbers in Array | Hard | Array, Math, Stack, Number_Theory | 60 | 85.52 |
| 2196 | Create Binary Tree From Descriptions | Medium | Array, Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 85 | 76.70 |
| 2195 | Append K Integers With Minimal Sum | Medium | Array, Math, Sorting, Greedy | 19 | 96.88 |
| 2194 | Cells in a Range on an Excel Sheet | Easy | String | 1 | 99.92 |
| 2193 | Minimum Number of Moves to Make Palindrome | Hard | String, Greedy, Two_Pointers, Binary_Indexed_Tree | 8 | 98.76 |
| 2192 | All Ancestors of a Node in a Directed Acyclic Graph | Medium | Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 82 | 90.80 |
| 2191 | Sort the Jumbled Numbers | Medium | Array, Sorting | 117 | 96.53 |
| 2190 | Most Frequent Number Following Key In an Array | Easy | Array, Hash_Table, Counting | 1 | 100.00 |
| 2188 | Minimum Time to Finish the Race | Hard | Array, Dynamic_Programming | 15 | 93.69 |
| 2187 | Minimum Time to Complete Trips | Medium | Array, Binary_Search | 187 | 95.03 |
| 2186 | Minimum Number of Steps to Make Two Strings Anagram II | Medium | String, Hash_Table, Counting | 22 | 77.11 |
| 2185 | Counting Words With a Given Prefix | Easy | Array, String | 0 | 100.00 |
| 2183 | Count Array Pairs Divisible by K | Hard | Array, Math, Number_Theory | 849 | 44.54 |
| 2182 | Construct String With Repeat Limit | Medium | String, Greedy, Heap_Priority_Queue, Counting | 26 | 96.11 |
| 2181 | Merge Nodes in Between Zeros | Medium | Simulation, Linked_List | 6 | 96.26 |
| 2180 | Count Integers With Even Digit Sum | Easy | Math, Simulation | 0 | 100.00 |
| 2179 | Count Good Triplets in an Array | Hard | Array, Binary_Search, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Merge_Sort | 16 | 92.94 |
| 2178 | Maximum Split of Positive Even Integers | Medium | Math, Greedy | 16 | 78.96 |
| 2177 | Find Three Consecutive Integers That Sum to a Given Number | Medium | Math, Simulation | 1 | 78.46 |
| 2176 | Count Equal and Divisible Pairs in an Array | Easy | Array | 4 | 78.29 |
| 2172 | Maximum AND Sum of Array | Hard | Array, Dynamic_Programming, Bit_Manipulation, Bitmask | 21 | 87.50 |
| 2171 | Removing Minimum Number of Magic Beans | Medium | Array, Sorting, Prefix_Sum | 42 | 77.68 |
| 2170 | Minimum Operations to Make the Array Alternating | Medium | Array, Hash_Table, Greedy, Counting | 8 | 100.00 |
| 2169 | Count Operations to Obtain Zero | Easy | Math, Simulation | 0 | 100.00 |
| 2167 | Minimum Time to Remove All Cars Containing Illegal Goods | Hard | String, Dynamic_Programming | 46 | 61.00 |
| 2166 | Design Bitset | Medium | Array, Hash_Table, Design | 81 | 73.38 |
| 2165 | Smallest Value of the Rearranged Number | Medium | Math, Sorting | 1 | 100.00 |
| 2164 | Sort Even and Odd Indices Independently | Easy | Array, Sorting | 2 | 97.22 |
| 2163 | Minimum Difference in Sums After Removal of Elements | Hard | Array, Dynamic_Programming, Heap_Priority_Queue | 298 | 57.14 |
| 2162 | Minimum Cost to Set Cooking Time | Medium | Math, Enumeration | 1 | 95.82 |
| 2161 | Partition Array According to Given Pivot | Medium | Array, Two_Pointers, Simulation | 7 | 72.76 |
| 2160 | Minimum Sum of Four Digit Number After Splitting Digits | Easy | Math, Sorting, Greedy | 1 | 78.31 |
| 2157 | Groups of Strings | Hard | String, Bit_Manipulation, Union_Find | 451 | 93.86 |
| 2156 | Find Substring With Given Hash Value | Hard | String, Sliding_Window, Hash_Function, Rolling_Hash | 37 | 36.57 |
| 2155 | All Divisions With the Highest Score of a Binary Array | Medium | Array | 18 | 98.41 |
| 2154 | Keep Multiplying Found Values by Two | Easy | Array, Hash_Table, Sorting, Simulation | 1 | 93.21 |
| 2151 | Maximum Good People Based on Statements | Hard | Array, Bit_Manipulation, Backtracking, Enumeration | 76 | 47.57 |
| 2150 | Find All Lonely Numbers in the Array | Medium | Array, Hash_Table, Counting | 93 | 70.66 |
| 2149 | Rearrange Array Elements by Sign | Medium | Array, Two_Pointers, Simulation | 10 | 34.66 |
| 2148 | Count Elements With Strictly Smaller and Greater Elements | Easy | Array, Sorting | 0 | 100.00 |
| 2147 | Number of Ways to Divide a Long Corridor | Hard | String, Dynamic_Programming, Math | 54 | 62.96 |
| 2146 | K Highest Ranked Items Within a Price Range | Medium | Array, Sorting, Breadth_First_Search, Matrix, Heap_Priority_Queue | 81 | 88.84 |
| 2145 | Count the Hidden Sequences | Medium | Array, Prefix_Sum | 7 | 36.03 |
| 2144 | Minimum Cost of Buying Candies With Discount | Easy | Array, Sorting, Greedy | 2 | 97.50 |
| 2141 | Maximum Running Time of N Computers | Hard | Array, Sorting, Greedy, Binary_Search | 24 | 70.39 |
| 2140 | Solving Questions With Brainpower | Medium | Array, Dynamic_Programming | 5 | 98.77 |
| 2139 | Minimum Moves to Reach Target Score | Medium | Math, Greedy | 1 | 37.95 |
| 2138 | Divide a String Into Groups of Size k | Easy | String, Simulation | 2 | 70.97 |
| 2136 | Earliest Possible Day of Full Bloom | Hard | Array, Sorting, Greedy | 63 | 94.92 |
| 2135 | Count Words Obtained After Adding a Letter | Medium | Array, String, Hash_Table, Sorting, Bit_Manipulation | 67 | 93.08 |
| 2134 | Minimum Swaps to Group All 1's Together II | Medium | Array, Sliding_Window | 11 | 72.59 |
| 2133 | Check if Every Row and Column Contains All Numbers | Easy | Array, Hash_Table, Matrix | 32 | 64.12 |
| 2132 | Stamping the Grid | Hard | Array, Greedy, Matrix, Prefix_Sum | 7 | 100.00 |
| 2131 | Longest Palindrome by Concatenating Two Letter Words | Medium | Array, String, Hash_Table, Greedy, Counting | 73 | 76.60 |
| 2130 | Maximum Twin Sum of a Linked List | Medium | Two_Pointers, Stack, Linked_List | 9 | 57.92 |
| 2129 | Capitalize the Title | Easy | String | 2 | 94.22 |
| 2127 | Maximum Employees to Be Invited to a Meeting | Hard | Depth_First_Search, Graph, Topological_Sort | 37 | 85.71 |
| 2126 | Destroying Asteroids | Medium | Array, Sorting, Greedy | 6 | 99.27 |
| 2125 | Number of Laser Beams in a Bank | Medium | Array, String, Math, Matrix | 19 | 76.00 |
| 2124 | Check if All A's Appears Before All B's | Easy | String | 1 | 73.82 |
| 2122 | Recover the Original Array | Hard | Array, Hash_Table, Sorting, Enumeration | 19 | 89.04 |
| 2121 | Intervals Between Identical Elements | Medium | Array, Hash_Table, Prefix_Sum | 93 | 79.63 |
| 2120 | Execution of All Suffix Instructions Staying in a Grid | Medium | String, Simulation | 31 | 88.00 |
| 2119 | A Number After a Double Reversal | Easy | Math | 0 | 100.00 |
| 2117 | Abbreviating the Product of a Range | Hard | Math | 70 | 89.47 |
| 2116 | Check if a Parentheses String Can Be Valid | Medium | String, Greedy, Stack | 19 | 85.53 |
| 2115 | Find All Possible Recipes from Given Supplies | Medium | Array, String, Hash_Table, Graph, Topological_Sort | 43 | 85.86 |
| 2114 | Maximum Number of Words Found in Sentences | Easy | Array, String | 4 | 69.59 |
| 2111 | Minimum Operations to Make the Array K-Increasing | Hard | Array, Binary_Search | 97 | 22.90 |
| 2110 | Number of Smooth Descent Periods of a Stock | Medium | Array, Dynamic_Programming, Math | 3 | 77.27 |
| 2109 | Adding Spaces to a String | Medium | Array, String, Simulation | 24 | 89.33 |
| 2108 | Find First Palindromic String in the Array | Easy | Array, String, Two_Pointers | 3 | 84.92 |
| 2106 | Maximum Fruits Harvested After at Most K Steps | Hard | Array, Binary_Search, Prefix_Sum, Sliding_Window | 4 | 86.67 |
| 2105 | Watering Plants II | Medium | Array, Two_Pointers, Simulation | 5 | 78.24 |
| 2104 | Sum of Subarray Ranges | Medium | Array, Stack, Monotonic_Stack | 21 | 77.85 |
| 2103 | Rings and Rods | Easy | String, Hash_Table | 2 | 46.84 |
| 2102 | Sequentially Ordinal Rank Tracker | Hard | Design, Heap_Priority_Queue, Ordered_Set, Data_Stream | 194 | 79.48 |
| 2101 | Detonate the Maximum Bombs | Medium | Array, Math, Depth_First_Search, Breadth_First_Search, Graph, Geometry | 27 | 94.17 |
| 2100 | Find Good Days to Rob the Bank | Medium | Array, Dynamic_Programming, Prefix_Sum | 13 | 46.46 |
| 2099 | Find Subsequence of Length K With the Largest Sum | Easy | Array, Hash_Table, Sorting, Heap_Priority_Queue | 6 | 85.46 |
| 2097 | Valid Arrangement of Pairs | Hard | Depth_First_Search, Graph, Eulerian_Circuit | 158 | 100.00 |
| 2096 | Step-By-Step Directions From a Binary Tree Node to Another | Medium | String, Depth_First_Search, Tree, Binary_Tree | 30 | 76.29 |
| 2095 | Delete the Middle Node of a Linked List | Medium | Two_Pointers, Linked_List | 4 | 95.21 |
| 2094 | Finding 3-Digit Even Numbers | Easy | Array, Hash_Table, Sorting, Enumeration | 2 | 99.62 |
| 2092 | Find All People With Secret | Hard | Sorting, Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 95 | 84.86 |
| 2091 | Removing Minimum and Maximum From Array | Medium | Array, Greedy | 2 | 100.00 |
| 2090 | K Radius Subarray Averages | Medium | Array, Sliding_Window | 12 | 83.19 |
| 2089 | Find Target Indices After Sorting Array | Easy | Array, Sorting, Binary_Search | 1 | 97.90 |
| 2088 | Count Fertile Pyramids in a Land | Hard | Array, Dynamic_Programming, Matrix | 12 | 83.56 |
| 2087 | Minimum Cost Homecoming of a Robot in a Grid | Medium | Array, Greedy, Matrix | 2 | 79.89 |
| 2086 | Minimum Number of Buckets Required to Collect Rainwater from Houses | Medium | String, Dynamic_Programming, Greedy | 8 | 73.71 |
| 2085 | Count Common Words With One Occurrence | Easy | Array, String, Hash_Table, Counting | 6 | 77.66 |
| 2081 | Sum of k-Mirror Numbers | Hard | Math, Enumeration | 759 | 81.69 |
| 2080 | Range Frequency Queries | Medium | Array, Hash_Table, Binary_Search, Design, Segment_Tree | 140 | 97.86 |
| 2079 | Watering Plants | Medium | Array | 0 | 100.00 |
| 2078 | Two Furthest Houses With Different Colors | Easy | Array, Greedy | 0 | 100.00 |
| 2076 | Process Restricted Friend Requests | Hard | Graph, Union_Find | 102 | 55.25 |
| 2075 | Decode the Slanted Ciphertext | Medium | String, Simulation | 48 | 68.23 |
| 2074 | Reverse Nodes in Even Length Groups | Medium | Linked_List | 9 | 62.36 |
| 2073 | Time Needed to Buy Tickets | Easy | Array, Simulation, Queue | 0 | 100.00 |
| 2071 | Maximum Number of Tasks You Can Assign | Hard | Array, Sorting, Greedy, Binary_Search, Queue, Monotonic_Queue | 156 | 40.49 |
| 2070 | Most Beautiful Item for Each Query | Medium | Array, Sorting, Binary_Search | 53 | 96.04 |
| 2069 | Walking Robot Simulation II | Medium | Design, Simulation | 110 | 56.14 |
| 2068 | Check Whether Two Strings are Almost Equivalent | Easy | String, Hash_Table, Counting | 1 | 95.21 |
| 2065 | Maximum Path Quality of a Graph | Hard | Array, Graph, Backtracking | 94 | 95.34 |
| 2064 | Minimized Maximum of Products Distributed to Any Store | Medium | Array, Binary_Search | 65 | 70.18 |
| 2063 | Vowels of All Substrings | Medium | String, Dynamic_Programming, Math, Combinatorics | 21 | 34.49 |
| 2062 | Count Vowel Substrings of a String | Easy | String, Hash_Table | 34 | 23.83 |
| 2060 | Check if an Original String Exists Given Two Encoded Strings | Hard | String, Dynamic_Programming | 354 | 69.39 |
| 2059 | Minimum Operations to Convert Number | Medium | Array, Breadth_First_Search | 97 | 64.14 |
| 2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points | Medium | Linked_List | 4 | 100.00 |
| 2057 | Smallest Index With Equal Value | Easy | Array | 1 | 94.39 |
| 2056 | Number of Valid Move Combinations On Chessboard | Hard | Array, String, Simulation, Backtracking | 433 | 24.83 |
| 2055 | Plates Between Candles | Medium | Array, String, Binary_Search, Prefix_Sum | 10 | 92.49 |
| 2054 | Two Best Non-Overlapping Events | Medium | Array, Dynamic_Programming, Sorting, Binary_Search, Heap_Priority_Queue | 58 | 70.59 |
| 2053 | Kth Distinct String in an Array | Easy | Array, String, Hash_Table, Counting | 7 | 65.75 |
| 2050 | Parallel Courses III | Hard | Dynamic_Programming, Graph, Topological_Sort | 33 | 86.04 |
| 2049 | Count Nodes With the Highest Score | Medium | Array, Depth_First_Search, Tree, Binary_Tree | 40 | 93.75 |
| 2048 | Next Greater Numerically Balanced Number | Medium | Math, Backtracking, Enumeration | 2 | 95.19 |
| 2047 | Number of Valid Words in a Sentence | Easy | String | 19 | 42.57 |
| 2045 | Second Minimum Time to Reach Destination | Hard | Breadth_First_Search, Graph, Shortest_Path | 65 | 74.03 |
| 2044 | Count Number of Maximum Bitwise-OR Subsets | Medium | Array, Bit_Manipulation, Backtracking | 12 | 58.97 |
| 2043 | Simple Bank System | Medium | Array, Hash_Table, Design, Simulation | 128 | 72.30 |
| 2042 | Check if Numbers Are Ascending in a Sentence | Easy | String | 2 | 75.46 |
| 2040 | Kth Smallest Product of Two Sorted Arrays | Hard | Array, Binary_Search | 635 | 75.24 |
| 2039 | The Time When the Network Becomes Idle | Medium | Array, Breadth_First_Search, Graph | 134 | 72.29 |
| 2038 | Remove Colored Pieces if Both Neighbors are the Same Color | Medium | String, Math, Greedy, Game_Theory | 22 | 47.78 |
| 2037 | Minimum Number of Moves to Seat Everyone | Easy | Array, Sorting | 5 | 22.01 |
| 2035 | Partition Array Into Two Arrays to Minimize Sum Difference | Hard | Array, Dynamic_Programming, Binary_Search, Two_Pointers, Bit_Manipulation, Ordered_Set, Bitmask | 1336 | 39.36 |
| 2034 | Stock Price Fluctuation | Medium | Hash_Table, Design, Heap_Priority_Queue, Ordered_Set, Data_Stream | 163 | 65.51 |
| 2033 | Minimum Operations to Make a Uni-Value Grid | Medium | Array, Math, Sorting, Matrix | 41 | 87.53 |
| 2032 | Two Out of Three | Easy | Array, Hash_Table | 9 | 45.56 |
| 2030 | Smallest K-Length Subsequence With Occurrences of a Letter | Hard | String, Greedy, Stack, Monotonic_Stack | 131 | 64.46 |
| 2029 | Stone Game IX | Medium | Array, Math, Greedy, Counting, Game_Theory | 14 | 53.97 |
| 2028 | Find Missing Observations | Medium | Array, Math, Simulation | 10 | 31.40 |
| 2027 | Minimum Moves to Convert String | Easy | String, Greedy | 0 | 100.00 |
| 2025 | Maximum Number of Ways to Partition an Array | Hard | Array, Hash_Table, Prefix_Sum, Counting, Enumeration | 172 | 100.00 |
| 2024 | Maximize the Confusion of an Exam | Medium | String, Binary_Search, Prefix_Sum, Sliding_Window | 21 | 44.78 |
| 2023 | Number of Pairs of Strings With Concatenation Equal to Target | Medium | Array, String | 36 | 36.00 |
| 2022 | Convert 1D Array Into 2D Array | Easy | Array, Matrix, Simulation | 8 | 40.41 |
| 2019 | The Score of Students Solving Math Expression | Hard | Array, String, Dynamic_Programming, Math, Stack, Memoization | 435 | 89.93 |
| 2018 | Check if Word Can Be Placed In Crossword | Medium | Array, Matrix, Enumeration | 11 | 52.76 |
| 2017 | Grid Game | Medium | Array, Matrix, Prefix_Sum | 10 | 41.46 |
| 2016 | Maximum Difference Between Increasing Elements | Easy | Array | 0 | 100.00 |
| 2014 | Longest Subsequence Repeated k Times | Hard | String, Greedy, Backtracking, Counting, Enumeration | 169 | 98.59 |
| 2013 | Detect Squares | Medium | Array, Hash_Table, Design, Counting | 67 | 88.46 |
| 2012 | Sum of Beauty in the Array | Medium | Array | 10 | 44.69 |
| 2011 | Final Value of Variable After Performing Operations | Easy | Array, String, Simulation | 1 | 94.40 |
| 2009 | Minimum Number of Operations to Make Array Continuous | Hard | Array, Binary_Search | 57 | 72.43 |
| 2008 | Maximum Earnings From Taxi | Medium | Array, Dynamic_Programming, Sorting, Binary_Search | 116 | 55.59 |
| 2007 | Find Original Array From Doubled Array | Medium | Array, Hash_Table, Sorting, Greedy | 41 | 96.48 |
| 2006 | Count Number of Pairs With Absolute Difference K | Easy | Array, Hash_Table, Counting | 8 | 58.60 |
| 2003 | Smallest Missing Genetic Value in Each Subtree | Hard | Dynamic_Programming, Depth_First_Search, Tree, Union_Find | 126 | 85.18 |
| 2002 | Maximum Product of the Length of Two Palindromic Subsequences | Medium | String, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 69 | 89.94 |
| 2001 | Number of Pairs of Interchangeable Rectangles | Medium | Array, Hash_Table, Math, Counting, Number_Theory | 34 | 99.02 |
| 2000 | Reverse Prefix of Word | Easy | String, Two_Pointers | 0 | 100.00 |
| 1998 | GCD Sort of an Array | Hard | Array, Math, Sorting, Union_Find | 51 | 100.00 |
| 1997 | First Day Where You Have Been in All the Rooms | Medium | Array, Dynamic_Programming | 14 | 83.10 |
| 1996 | The Number of Weak Characters in the Game | Medium | Array, Sorting, Greedy, Stack, Monotonic_Stack | 121 | 81.46 |
| 1995 | Count Special Quadruplets | Easy | Array, Enumeration | 2 | 99.20 |
| 1994 | The Number of Good Subsets | Hard | Array, Dynamic_Programming, Math, Bit_Manipulation, Bitmask | 15 | 94.29 |
| 1993 | Operations on Tree | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Design | 394 | 23.03 |
| 1992 | Find All Groups of Farmland | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 7 | 89.08 |
| 1991 | Find the Middle Index in Array | Easy | Array, Prefix_Sum | 0 | 100.00 |
| 1987 | Number of Unique Good Subsequences | Hard | String, Dynamic_Programming | 19 | 53.78 |
| 1986 | Minimum Number of Work Sessions to Finish the Tasks | Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 2 | 90.18 |
| 1985 | Find the Kth Largest Integer in the Array | Medium | Array, String, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect | 34 | 77.42 |
| 1984 | Minimum Difference Between Highest and Lowest of K Scores | Easy | Array, Sorting, Sliding_Window | 4 | 95.43 |
| 1982 | Find Array Given Subset Sums | Hard | Array, Divide_and_Conquer | 70 | 64.91 |
| 1981 | Minimize the Difference Between Target and Chosen Elements | Medium | Array, Dynamic_Programming, Matrix | 480 | 90.78 |
| 1980 | Find Unique Binary String | Medium | Array, String, Backtracking | 7 | 31.88 |
| 1979 | Find Greatest Common Divisor of Array | Easy | Array, Math, Number_Theory | 1 | 87.75 |
| 1977 | Number of Ways to Separate Numbers | Hard | String, Dynamic_Programming, Suffix_Array | 604 | 59.21 |
| 1976 | Number of Ways to Arrive at Destination | Medium | Dynamic_Programming, Graph, Topological_Sort, Shortest_Path | 14 | 77.59 |
| 1975 | Maximum Matrix Sum | Medium | Array, Greedy, Matrix | 4 | 100.00 |
| 1974 | Minimum Time to Type Word Using Special Typewriter | Easy | String, Greedy | 1 | 74.90 |
| 1971 | Find if Path Exists in Graph | Easy | Depth_First_Search, Breadth_First_Search, Graph | 4 | 99.57 |
| 1970 | Last Day Where You Can Still Cross | Hard | Array, Depth_First_Search, Breadth_First_Search, Binary_Search, Matrix, Union_Find | 14 | 95.24 |
| 1969 | Minimum Non-Zero Product of the Array Elements | Medium | Math, Greedy, Recursion | 0 | 100.00 |
| 1968 | Array With Elements Not Equal to Average of Neighbors | Medium | Array, Sorting, Greedy | 6 | 92.86 |
| 1967 | Number of Strings That Appear as Substrings in Word | Easy | String | 1 | 82.02 |
| 1965 | Employees With Missing Information | Easy | Database, SQL_I_Day_4_Union_and_Select | 617 | 30.40 |
| 1964 | Find the Longest Valid Obstacle Course at Each Position | Hard | Array, Binary_Search, Binary_Indexed_Tree | 79 | 85.00 |
| 1963 | Minimum Number of Swaps to Make the String Balanced | Medium | String, Greedy, Two_Pointers, Stack | 17 | 93.71 |
| 1962 | Remove Stones to Minimize the Total | Medium | Array, Heap_Priority_Queue | 761 | 48.67 |
| 1961 | Check If String Is a Prefix of Array | Easy | Array, String | 2 | 60.87 |
| 1960 | Maximum Product of the Length of Two Palindromic Substrings | Hard | String, Hash_Function, Rolling_Hash | 32 | 75.00 |
| 1959 | Minimum Total Space Wasted With K Resizing Operations | Medium | Array, Dynamic_Programming | 42 | 95.45 |
| 1958 | Check if Move is Legal | Medium | Array, Matrix, Enumeration | 0 | 100.00 |
| 1957 | Delete Characters to Make Fancy String | Easy | String | 54 | 52.94 |
| 1955 | Count Number of Special Subsequences | Hard | Array, Dynamic_Programming | 22 | 80.65 |
| 1954 | Minimum Garden Perimeter to Collect Enough Apples | Medium | Math, Binary_Search | 2 | 59.57 |
| 1953 | Maximum Number of Weeks for Which You Can Work | Medium | Array, Greedy | 4 | 40.93 |
| 1952 | Three Divisors | Easy | Math | 1 | 84.91 |
| 1948 | Delete Duplicate Folders in System | Hard | Array, String, Hash_Table, Trie, Hash_Function | 92 | 97.82 |
| 1947 | Maximum Compatibility Score Sum | Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 2 | 95.90 |
| 1946 | Largest Number After Mutating Substring | Medium | Array, String, Greedy | 18 | 70.91 |
| 1945 | Sum of Digits of String After Convert | Easy | String, Simulation | 2 | 72.10 |
| 1944 | Number of Visible People in a Queue | Hard | Array, Stack, Monotonic_Stack | 9 | 99.65 |
| 1943 | Describe the Painting | Medium | Array, Prefix_Sum | 29 | 93.92 |
| 1942 | The Number of the Smallest Unoccupied Chair | Medium | Array, Heap_Priority_Queue, Ordered_Set | 73 | 49.69 |
| 1941 | Check if All Characters Have Equal Number of Occurrences | Easy | String, Hash_Table, Counting | 2 | 86.25 |
| 1938 | Maximum Genetic Difference Query | Hard | Array, Bit_Manipulation, Trie | 174 | 100.00 |
| 1937 | Maximum Number of Points with Cost | Medium | Array, Dynamic_Programming | 18 | 44.04 |
| 1936 | Add Minimum Number of Rungs | Medium | Array, Greedy | 1 | 100.00 |
| 1935 | Maximum Number of Words You Can Type | Easy | String, Hash_Table | 2 | 95.06 |
| 1932 | Merge BSTs to Create Single BST | Hard | Hash_Table, Depth_First_Search, Tree, Binary_Search, Binary_Tree | 87 | 48.43 |
| 1931 | Painting a Grid With Three Different Colors | Hard | Dynamic_Programming | 7 | 99.32 |
| 1930 | Unique Length-3 Palindromic Subsequences | Medium | String, Hash_Table, Prefix_Sum | 31 | 93.44 |
| 1929 | Concatenation of Array | Easy | Array | 1 | 92.52 |
| 1928 | Minimum Cost to Reach Destination in Time | Hard | Dynamic_Programming, Graph | 52 | 87.97 |
| 1927 | Sum Game | Medium | Math, Greedy, Game_Theory | 13 | 34.41 |
| 1926 | Nearest Exit from Entrance in Maze | Medium | Array, Breadth_First_Search, Matrix, Graph_Theory_I_Day_6_Matrix_Related_Problems | 12 | 40.55 |
| 1925 | Count Square Sum Triples | Easy | Math, Enumeration | 25 | 48.78 |
| 1923 | Longest Common Subpath | Hard | Array, Binary_Search, Hash_Function, Rolling_Hash, Suffix_Array | 517 | 73.88 |
| 1922 | Count Good Numbers | Medium | Math, Recursion | 1 | 87.11 |
| 1921 | Eliminate Maximum Number of Monsters | Medium | Array, Sorting, Greedy | 19 | 90.78 |
| 1920 | Build Array from Permutation | Easy | Array, Simulation | 1 | 94.23 |
| 1916 | Count Ways to Build Rooms in an Ant Colony | Hard | Dynamic_Programming, Math, Tree, Graph, Topological_Sort, Combinatorics | 1527 | 34.38 |
| 1915 | Number of Wonderful Substrings | Medium | String, Hash_Table, Bit_Manipulation, Prefix_Sum | 31 | 82.46 |
| 1914 | Cyclically Rotating a Grid | Medium | Array, Matrix, Simulation | 2 | 91.30 |
| 1913 | Maximum Product Difference Between Two Pairs | Easy | Array, Sorting | 7 | 70.01 |
| 1912 | Design Movie Rental System | Hard | Array, Hash_Table, Design, Heap_Priority_Queue, Ordered_Set | 562 | 74.14 |
| 1911 | Maximum Alternating Subsequence Sum | Medium | Array, Dynamic_Programming | 12 | 51.75 |
| 1910 | Remove All Occurrences of a Substring | Medium | String | 11 | 39.18 |
| 1909 | Remove One Element to Make the Array Strictly Increasing | Easy | Array | 0 | 100.00 |
| 1906 | Minimum Absolute Difference Queries | Medium | Array, Hash_Table | 176 | 71.61 |
| 1905 | Count Sub Islands | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Graph_Theory_I_Day_3_Matrix_Related_Problems | 24 | 85.54 |
| 1904 | The Number of Full Rounds You Have Played | Medium | String, Math | 0 | 100.00 |
| 1903 | Largest Odd Number in String | Easy | String, Math, Greedy | 6 | 23.18 |
| 1901 | Find a Peak Element II | Medium | Array, Binary_Search, Matrix, Divide_and_Conquer, Binary_Search_II_Day_17 | 0 | 100.00 |
| 1900 | The Earliest and Latest Rounds Where Players Compete | Hard | Dynamic_Programming, Memoization | 1 | 92.68 |
| 1899 | Merge Triplets to Form Target Triplet | Medium | Array, Greedy | 1 | 98.96 |
| 1898 | Maximum Number of Removable Characters | Medium | Array, String, Binary_Search, Binary_Search_II_Day_6 | 121 | 72.51 |
| 1897 | Redistribute Characters to Make All Strings Equal | Easy | String, Hash_Table, Counting | 2 | 100.00 |
| 1896 | Minimum Cost to Change the Final Value of Expression | Hard | String, Dynamic_Programming, Math, Stack | 29 | 95.24 |
| 1895 | Largest Magic Square | Medium | Array, Matrix, Prefix_Sum | 7 | 80.72 |
| 1894 | Find the Student that Will Replace the Chalk | Medium | Array, Binary_Search, Simulation, Prefix_Sum, Binary_Search_II_Day_2 | 2 | 76.67 |
| 1893 | Check if All the Integers in a Range Are Covered | Easy | Array, Hash_Table, Prefix_Sum | 1 | 72.81 |
| 1890 | The Latest Login in 2020 | Easy | Database, SQL_I_Day_8_Function | 571 | 73.59 |
| 1889 | Minimum Space Wasted From Packaging | Hard | Array, Sorting, Binary_Search, Prefix_Sum | 98 | 45.92 |
| 1888 | Minimum Number of Flips to Make the Binary String Alternating | Medium | String, Greedy | 30 | 75.70 |
| 1887 | Reduction Operations to Make the Array Elements Equal | Medium | Array, Sorting | 26 | 94.56 |
| 1886 | Determine Whether Matrix Can Be Obtained By Rotation | Easy | Array, Matrix, Programming_Skills_II_Day_7 | 1 | 78.38 |
| 1884 | Egg Drop With 2 Eggs and N Floors | Medium | Dynamic_Programming, Math | 0 | 100.00 |
| 1883 | Minimum Skips to Arrive at Meeting On Time | Hard | Array, Dynamic_Programming | 70 | 73.08 |
| 1882 | Process Tasks Using Servers | Medium | Array, Heap_Priority_Queue | 290 | 77.45 |
| 1881 | Maximum Value after Insertion | Medium | String, Greedy | 12 | 85.08 |
| 1880 | Check if Word Equals Summation of Two Words | Easy | String | 2 | 31.97 |
| 1879 | Minimum XOR Sum of Two Arrays | Hard | Array, Dynamic_Programming, Bit_Manipulation, Bitmask | 15 | 63.49 |
| 1878 | Get Biggest Three Rhombus Sums in a Grid | Medium | Array, Math, Sorting, Matrix, Heap_Priority_Queue, Prefix_Sum | 41 | 82.03 |
| 1877 | Minimize Maximum Pair Sum in Array | Medium | Array, Sorting, Greedy, Two_Pointers | 62 | 82.87 |
| 1876 | Substrings of Size Three with Distinct Characters | Easy | String, Hash_Table, Counting, Sliding_Window | 2 | 60.62 |
| 1873 | Calculate Special Bonus | Easy | Database, SQL_I_Day_2_Select_and_Order | 543 | 71.60 |
| 1872 | Stone Game VIII | Hard | Array, Dynamic_Programming, Math, Prefix_Sum, Game_Theory | 3 | 98.18 |
| 1871 | Jump Game VII | Medium | String, Two_Pointers, Prefix_Sum | 14 | 76.25 |
| 1870 | Minimum Speed to Arrive on Time | Medium | Array, Binary_Search, Binary_Search_II_Day_6 | 86 | 88.58 |
| 1869 | Longer Contiguous Segments of Ones than Zeros | Easy | String | 1 | 88.10 |
| 1866 | Number of Ways to Rearrange Sticks With K Sticks Visible | Hard | Dynamic_Programming, Math, Combinatorics | 67 | 96.33 |
| 1865 | Finding Pairs With a Certain Sum | Medium | Array, Hash_Table, Design | 195 | 83.97 |
| 1864 | Minimum Number of Swaps to Make the Binary String Alternating | Medium | String, Greedy | 3 | 43.20 |
| 1863 | Sum of All Subset XOR Totals | Easy | Array, Math, Bit_Manipulation, Backtracking, Combinatorics | 0 | 100.00 |
| 1862 | Sum of Floored Pairs | Hard | Array, Math, Binary_Search, Prefix_Sum | 115 | 70.91 |
| 1861 | Rotating the Box | Medium | Array, Matrix, Two_Pointers | 8 | 92.84 |
| 1860 | Incremental Memory Leak | Medium | Simulation | 5 | 78.57 |
| 1859 | Sorting the Sentence | Easy | String, Sorting | 2 | 50.32 |
| 1857 | Largest Color Value in a Directed Graph | Hard | Hash_Table, Dynamic_Programming, Graph, Counting, Memoization, Topological_Sort | 110 | 73.53 |
| 1856 | Maximum Subarray Min-Product | Medium | Array, Stack, Prefix_Sum, Monotonic_Stack | 28 | 92.10 |
| 1855 | Maximum Distance Between a Pair of Values | Medium | Array, Greedy, Binary_Search, Two_Pointers, Binary_Search_I_Day_11 | 4 | 62.20 |
| 1854 | Maximum Population Year | Easy | Array, Counting | 0 | 100.00 |
| 1851 | Minimum Interval to Include Each Query | Hard | Array, Sorting, Binary_Search, Heap_Priority_Queue, Line_Sweep | 140 | 84.24 |
| 1850 | Minimum Adjacent Swaps to Reach the Kth Smallest Number | Medium | String, Greedy, Two_Pointers | 24 | 72.99 |
| 1849 | Splitting a String Into Descending Consecutive Values | Medium | String, Backtracking | 1 | 87.61 |
| 1848 | Minimum Distance to the Target Element | Easy | Array | 1 | 58.33 |
| 1847 | Closest Room | Hard | Array, Sorting, Binary_Search | 95 | 81.67 |
| 1846 | Maximum Element After Decreasing and Rearranging | Medium | Array, Sorting, Greedy | 4 | 93.59 |
| 1845 | Seat Reservation Manager | Medium | Design, Heap_Priority_Queue, Programming_Skills_II_Day_17 | 47 | 87.63 |
| 1844 | Replace All Digits with Characters | Easy | String | 1 | 70.12 |
| 1840 | Maximum Building Height | Hard | Array, Math | 59 | 94.64 |
| 1839 | Longest Substring Of All Vowels in Order | Medium | String, Sliding_Window | 24 | 86.13 |
| 1838 | Frequency of the Most Frequent Element | Medium | Array, Sorting, Greedy, Binary_Search, Prefix_Sum, Sliding_Window, Binary_Search_II_Day_9 | 11 | 100.00 |
| 1837 | Sum of Digits in Base K | Easy | Math | 1 | 10.42 |
| 1835 | Find XOR Sum of All Pairs Bitwise AND | Hard | Array, Math, Bit_Manipulation | 1 | 100.00 |
| 1834 | Single-Threaded CPU | Medium | Array, Sorting, Heap_Priority_Queue | 134 | 83.22 |
| 1833 | Maximum Ice Cream Bars | Medium | Array, Sorting, Greedy | 39 | 84.49 |
| 1832 | Check if the Sentence Is Pangram | Easy | String, Hash_Table | 3 | 41.29 |
| 1830 | Minimum Number of Operations to Make String Sorted | Hard | String, Math, Combinatorics | 125 | 94.12 |
| 1829 | Maximum XOR for Each Query | Medium | Array, Bit_Manipulation, Prefix_Sum | 7 | 20.94 |
| 1828 | Queries on Number of Points Inside a Circle | Medium | Array, Math, Geometry | 23 | 75.03 |
| 1827 | Minimum Operations to Make the Array Increasing | Easy | Array, Greedy | 4 | 35.67 |
| 1825 | Finding MK Average | Hard | Design, Heap_Priority_Queue, Ordered_Set, Queue | 83 | 60.59 |
| 1824 | Minimum Sideway Jumps | Medium | Array, Dynamic_Programming, Greedy | 17 | 96.34 |
| 1823 | Find the Winner of the Circular Game | Medium | Array, Math, Simulation, Recursion, Queue, Data_Structure_II_Day_14_Stack_Queue | 3 | 64.85 |
| 1822 | Sign of the Product of an Array | Easy | Array, Math, Programming_Skills_I_Day_4_Loop | 1 | 58.05 |
| 1819 | Number of Different Subsequences GCDs | Hard | Array, Math, Counting, Number_Theory | 116 | 96.43 |
| 1818 | Minimum Absolute Sum Difference | Medium | Array, Sorting, Binary_Search, Ordered_Set, Binary_Search_II_Day_7 | 13 | 99.44 |
| 1817 | Finding the Users Active Minutes | Medium | Array, Hash_Table | 16 | 91.64 |
| 1816 | Truncate Sentence | Easy | Array, String | 2 | 65.71 |
| 1815 | Maximum Number of Groups Getting Fresh Donuts | Hard | Array, Dynamic_Programming, Bit_Manipulation, Bitmask, Memoization | 7 | 86.67 |
| 1814 | Count Nice Pairs in an Array | Medium | Array, Hash_Table, Math, Counting | 47 | 83.12 |
| 1813 | Sentence Similarity III | Medium | Array, String, Two_Pointers | 3 | 41.38 |
| 1812 | Determine Color of a Chessboard Square | Easy | String, Math | 1 | 49.36 |
| 1808 | Maximize Number of Nice Divisors | Hard | Math, Recursion | 1 | 80.77 |
| 1807 | Evaluate the Bracket Pairs of a String | Medium | Array, String, Hash_Table | 40 | 80.47 |
| 1806 | Minimum Number of Operations to Reinitialize a Permutation | Medium | Array, Math, Simulation | 0 | 100.00 |
| 1805 | Number of Different Integers in a String | Easy | String, Hash_Table | 3 | 79.55 |
| 1803 | Count Pairs With XOR in a Range | Hard | Array, Bit_Manipulation, Trie | 77 | 100.00 |
| 1802 | Maximum Value at a Given Index in a Bounded Array | Medium | Greedy, Binary_Search, Binary_Search_II_Day_17 | 2 | 58.44 |
| 1801 | Number of Orders in the Backlog | Medium | Array, Heap_Priority_Queue, Simulation | 39 | 78.46 |
| 1800 | Maximum Ascending Subarray Sum | Easy | Array | 0 | 100.00 |
| 1799 | Maximize Score After N Operations | Hard | Array, Dynamic_Programming, Math, Bit_Manipulation, Backtracking, Bitmask, Number_Theory | 164 | 78.22 |
| 1798 | Maximum Number of Consecutive Values You Can Make | Medium | Array, Greedy | 11 | 96.30 |
| 1797 | Design Authentication Manager | Medium | Hash_Table, Design, Programming_Skills_II_Day_19 | 41 | 92.67 |
| 1796 | Second Largest Digit in a String | Easy | String, Hash_Table | 2 | 87.67 |
| 1795 | Rearrange Products Table | Easy | Database, SQL_I_Day_4_Union_and_Select | 497 | 64.83 |
| 1793 | Maximum Score of a Good Subarray | Hard | Array, Binary_Search, Two_Pointers, Stack, Monotonic_Stack | 3 | 97.56 |
| 1792 | Maximum Average Pass Ratio | Medium | Array, Greedy, Heap_Priority_Queue | 456 | 89.78 |
| 1791 | Find Center of Star Graph | Easy | Graph | 0 | 100.00 |
| 1790 | Check if One String Swap Can Make Strings Equal | Easy | String, Hash_Table, Counting, Programming_Skills_I_Day_4_Loop | 0 | 100.00 |
| 1787 | Make the XOR of All Segments Equal to Zero | Hard | Array, Dynamic_Programming, Bit_Manipulation | 102 | 89.47 |
| 1786 | Number of Restricted Paths From First to Last Node | Medium | Dynamic_Programming, Heap_Priority_Queue, Graph, Topological_Sort, Shortest_Path | 86 | 88.56 |
| 1785 | Minimum Elements to Add to Form a Given Sum | Medium | Array, Greedy | 2 | 70.75 |
| 1784 | Check if Binary String Has at Most One Segment of Ones | Easy | String | 1 | 65.60 |
| 1782 | Count Pairs Of Nodes | Hard | Binary_Search, Two_Pointers, Graph | 128 | 86.96 |
| 1781 | Sum of Beauty of All Substrings | Medium | String, Hash_Table, Counting | 38 | 100.00 |
| 1780 | Check if Number is a Sum of Powers of Three | Medium | Math | 2 | 19.71 |
| 1779 | Find Nearest Point That Has the Same X or Y Coordinate | Easy | Array, Programming_Skills_I_Day_3_Conditional_Statements | 1 | 100.00 |
| 1776 | Car Fleet II | Hard | Array, Math, Stack, Heap_Priority_Queue, Monotonic_Stack | 19 | 93.81 |
| 1775 | Equal Sum Arrays With Minimum Number of Operations | Medium | Array, Hash_Table, Greedy, Counting | 16 | 70.88 |
| 1774 | Closest Dessert Cost | Medium | Array, Dynamic_Programming, Backtracking | 5 | 82.32 |
| 1773 | Count Items Matching a Rule | Easy | Array, String | 3 | 98.33 |
| 1771 | Maximize Palindrome Length From Subsequences | Hard | String, Dynamic_Programming | 58 | 87.88 |
| 1770 | Maximum Score from Performing Multiplication Operations | Medium | Array, Dynamic_Programming | 31 | 92.41 |
| 1769 | Minimum Number of Operations to Move All Balls to Each Box | Medium | Array, String | 3 | 91.66 |
| 1768 | Merge Strings Alternately | Easy | String, Two_Pointers, Programming_Skills_I_Day_8_String | 1 | 86.26 |
| 1766 | Tree of Coprimes | Hard | Math, Depth_First_Search, Breadth_First_Search, Tree | 111 | 94.07 |
| 1765 | Map of Highest Peak | Medium | Array, Breadth_First_Search, Matrix | 64 | 85.40 |
| 1764 | Form Array by Concatenating Subarrays of Another Array | Medium | Array, Greedy, String_Matching | 7 | 16.90 |
| 1763 | Longest Nice Substring | Easy | String, Hash_Table, Bit_Manipulation, Sliding_Window | 5 | 61.88 |
| 1761 | Minimum Degree of a Connected Trio in a Graph | Hard | Graph | 33 | 89.17 |
| 1760 | Minimum Limit of Balls in a Bag | Medium | Array, Binary_Search, Binary_Search_II_Day_3 | 44 | 78.49 |
| 1759 | Count Number of Homogenous Substrings | Medium | String, Math | 19 | 42.40 |
| 1758 | Minimum Changes To Make Alternating Binary String | Easy | String | 2 | 98.92 |
| 1757 | Recyclable and Low Fat Products | Easy | Database, SQL_I_Day_1_Select | 475 | 71.54 |
| 1755 | Closest Subsequence Sum | Hard | Array, Dynamic_Programming, Two_Pointers, Bit_Manipulation, Bitmask | 383 | 87.60 |
| 1754 | Largest Merge Of Two Strings | Medium | String, Greedy, Two_Pointers | 37 | 89.23 |
| 1753 | Maximum Score From Removing Stones | Medium | Math, Greedy, Heap_Priority_Queue | 0 | 100.00 |
| 1752 | Check if Array Is Sorted and Rotated | Easy | Array | 0 | 100.00 |
| 1751 | Maximum Number of Events That Can Be Attended II | Hard | Array, Dynamic_Programming, Binary_Search | 12 | 98.33 |
| 1750 | Minimum Length of String After Deleting Similar Ends | Medium | String, Two_Pointers | 5 | 68.68 |
| 1749 | Maximum Absolute Sum of Any Subarray | Medium | Array, Dynamic_Programming | 3 | 90.60 |
| 1748 | Sum of Unique Elements | Easy | Array, Hash_Table, Counting | 2 | 54.08 |
| 1745 | Palindrome Partitioning IV | Hard | String, Dynamic_Programming | 10 | 100.00 |
| 1744 | Can You Eat Your Favorite Candy on Your Favorite Day? | Medium | Array, Prefix_Sum | 5 | 100.00 |
| 1743 | Restore the Array From Adjacent Pairs | Medium | Array, Hash_Table | 95 | 99.08 |
| 1742 | Maximum Number of Balls in a Box | Easy | Hash_Table, Math, Counting | 7 | 98.87 |
| 1741 | Find Total Time Spent by Each Employee | Easy | Database, SQL_I_Day_8_Function | 414 | 93.27 |
| 1739 | Building Boxes | Hard | Math, Greedy, Binary_Search | 1 | 84.38 |
| 1738 | Find Kth Largest XOR Coordinate Value | Medium | Array, Matrix, Bit_Manipulation, Heap_Priority_Queue, Prefix_Sum, Divide_and_Conquer, Quickselect | 40 | 97.08 |
| 1737 | Change Minimum Characters to Satisfy One of Three Conditions | Medium | String, Hash_Table, Prefix_Sum, Counting | 8 | 87.70 |
| 1736 | Latest Time by Replacing Hidden Digits | Easy | String, Greedy | 3 | 35.96 |
| 1735 | Count Ways to Make Array With Product | Hard | Array, Dynamic_Programming, Math | 189 | 43.75 |
| 1734 | Decode XORed Permutation | Medium | Array, Bit_Manipulation | 6 | 34.52 |
| 1733 | Minimum Number of People to Teach | Medium | Array, Greedy | 11 | 98.57 |
| 1732 | Find the Highest Altitude | Easy | Array, Prefix_Sum | 0 | 100.00 |
| 1729 | Find Followers Count | Easy | Database, SQL_I_Day_7_Function | 456 | 88.39 |
| 1728 | Cat and Mouse II | Hard | Array, Dynamic_Programming, Math, Matrix, Graph, Memoization, Topological_Sort, Game_Theory | 12 | 99.12 |
| 1727 | Largest Submatrix With Rearrangements | Medium | Array, Sorting, Greedy, Matrix | 9 | 90.48 |
| 1726 | Tuple with Same Product | Medium | Array, Hash_Table | 235 | 90.73 |
| 1725 | Number Of Rectangles That Can Form The Largest Square | Easy | Array | 1 | 100.00 |
| 1723 | Find Minimum Time to Finish All Jobs | Hard | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 3 | 76.73 |
| 1722 | Minimize Hamming Distance After Swap Operations | Medium | Array, Depth_First_Search, Union_Find | 51 | 94.82 |
| 1721 | Swapping Nodes in a Linked List | Medium | Two_Pointers, Linked_List | 2 | 100.00 |
| 1720 | Decode XORed Array | Easy | Array, Bit_Manipulation | 1 | 100.00 |
| 1719 | Number Of Ways To Reconstruct A Tree | Hard | Tree, Graph, Topological_Sort | 91 | 67.57 |
| 1718 | Construct the Lexicographically Largest Valid Sequence | Medium | Array, Backtracking | 0 | 100.00 |
| 1717 | Maximum Score From Removing Substrings | Medium | String, Greedy, Stack | 19 | 99.25 |
| 1716 | Calculate Money in Leetcode Bank | Easy | Math | 1 | 65.33 |
| 1713 | Minimum Operations to Make a Subsequence | Hard | Array, Hash_Table, Greedy, Binary_Search | 81 | 95.39 |
| 1712 | Ways to Split Array Into Three Subarrays | Medium | Array, Binary_Search, Two_Pointers, Prefix_Sum, Binary_Search_II_Day_10 | 16 | 84.24 |
| 1711 | Count Good Meals | Medium | Array, Hash_Table | 75 | 93.77 |
| 1710 | Maximum Units on a Truck | Easy | Array, Sorting, Greedy | 9 | 78.69 |
| 1707 | Maximum XOR With an Element From Array | Hard | Array, Bit_Manipulation, Trie | 150 | 97.24 |
| 1706 | Where Will the Ball Fall | Medium | Array, Dynamic_Programming, Depth_First_Search, Matrix, Simulation | 2 | 64.55 |
| 1705 | Maximum Number of Eaten Apples | Medium | Array, Greedy, Heap_Priority_Queue | 53 | 77.63 |
| 1704 | Determine if String Halves Are Alike | Easy | String, Counting | 1 | 100.00 |
| 1703 | Minimum Adjacent Swaps for K Consecutive Ones | Hard | Array, Greedy, Prefix_Sum, Sliding_Window | 10 | 96.25 |
| 1702 | Maximum Binary String After Change | Medium | String, Greedy | 42 | 82.86 |
| 1701 | Average Waiting Time | Medium | Array, Simulation | 2 | 100.00 |
| 1700 | Number of Students Unable to Eat Lunch | Easy | Array, Stack, Simulation, Queue | 2 | 63.14 |
| 1697 | Checking Existence of Edge Length Limited Paths | Hard | Array, Sorting, Graph, Union_Find | 94 | 90.48 |
| 1696 | Jump Game VI | Medium | Array, Dynamic_Programming, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue | 23 | 86.05 |
| 1695 | Maximum Erasure Value | Medium | Array, Hash_Table, Sliding_Window | 5 | 99.82 |
| 1694 | Reformat Phone Number | Easy | String | 1 | 99.67 |
| 1693 | Daily Leads and Partners | Easy | Database, SQL_I_Day_7_Function | 463 | 78.98 |
| 1691 | Maximum Height by Stacking Cuboids | Hard | Array, Dynamic_Programming, Sorting | 6 | 83.07 |
| 1690 | Stone Game VII | Medium | Array, Dynamic_Programming, Math, Game_Theory | 18 | 96.71 |
| 1689 | Partitioning Into Minimum Number Of Deci-Binary Numbers | Medium | String, Greedy | 5 | 93.98 |
| 1688 | Count of Matches in Tournament | Easy | Math, Simulation | 0 | 100.00 |
| 1687 | Delivering Boxes from Storage to Ports | Hard | Array, Dynamic_Programming, Heap_Priority_Queue, Queue, Segment_Tree, Monotonic_Queue | 9 | 91.09 |
| 1686 | Stone Game VI | Medium | Array, Math, Sorting, Greedy, Heap_Priority_Queue, Game_Theory | 139 | 62.50 |
| 1685 | Sum of Absolute Differences in a Sorted Array | Medium | Array, Math, Prefix_Sum | 4 | 80.17 |
| 1684 | Count the Number of Consistent Strings | Easy | Array, String, Hash_Table, Bit_Manipulation | 6 | 97.04 |
| 1681 | Minimum Incompatibility | Hard | Array, Dynamic_Programming, Bit_Manipulation, Bitmask | 1 | 100.00 |
| 1680 | Concatenation of Consecutive Binary Numbers | Medium | Math, Bit_Manipulation, Simulation | 70 | 95.05 |
| 1679 | Max Number of K-Sum Pairs | Medium | Array, Hash_Table, Sorting, Two_Pointers | 20 | 91.22 |
| 1678 | Goal Parser Interpretation | Easy | String, Programming_Skills_I_Day_8_String | 0 | 100.00 |
| 1675 | Minimize Deviation in Array | Hard | Array, Greedy, Heap_Priority_Queue, Ordered_Set | 104 | 88.83 |
| 1674 | Minimum Moves to Make Array Complementary | Medium | Array, Hash_Table, Prefix_Sum | 29 | 22.22 |
| 1673 | Find the Most Competitive Subsequence | Medium | Array, Greedy, Stack, Monotonic_Stack | 7 | 96.82 |
| 1672 | Richest Customer Wealth | Easy | Array, Matrix, Programming_Skills_I_Day_6_Array | 0 | 100.00 |
| 1671 | Minimum Number of Removals to Make Mountain Array | Hard | Array, Dynamic_Programming, Greedy, Binary_Search | 19 | 81.23 |
| 1670 | Design Front Middle Back Queue | Medium | Array, Design, Linked_List, Queue, Data_Stream | 5 | 100.00 |
| 1669 | Merge In Between Linked Lists | Medium | Linked_List | 2 | 76.51 |
| 1668 | Maximum Repeating Substring | Easy | String, String_Matching | 1 | 93.15 |
| 1667 | Fix Names in a Table | Easy | Database, SQL_I_Day_3_String_Processing_Functions | 559 | 80.29 |
| 1665 | Minimum Initial Energy to Finish Tasks | Hard | Array, Sorting, Greedy | 30 | 81.16 |
| 1664 | Ways to Make a Fair Array | Medium | Array, Dynamic_Programming | 11 | 71.76 |
| 1663 | Smallest String With A Given Numeric Value | Medium | String, Greedy | 22 | 75.05 |
| 1662 | Check If Two String Arrays are Equivalent | Easy | Array, String | 0 | 100.00 |
| 1659 | Maximize Grid Happiness | Hard | Dynamic_Programming, Bit_Manipulation, Bitmask, Memoization | 95 | 75.00 |
| 1658 | Minimum Operations to Reduce X to Zero | Medium | Array, Hash_Table, Binary_Search, Prefix_Sum, Sliding_Window | 4 | 98.95 |
| 1657 | Determine if Two Strings Are Close | Medium | String, Hash_Table, Sorting | 12 | 97.58 |
| 1656 | Design an Ordered Stream | Easy | Array, Hash_Table, Design, Data_Stream | 95 | 74.07 |
| 1655 | Distribute Repeating Integers | Hard | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 7 | 94.23 |
| 1654 | Minimum Jumps to Reach Home | Medium | Array, Dynamic_Programming, Breadth_First_Search, Graph_Theory_I_Day_11_Breadth_First_Search | 6 | 99.87 |
| 1653 | Minimum Deletions to Make String Balanced | Medium | String, Dynamic_Programming, Stack | 26 | 90.44 |
| 1652 | Defuse the Bomb | Easy | Array | 0 | 100.00 |
| 1649 | Create Sorted Array through Instructions | Hard | Array, Binary_Search, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Merge_Sort | 35 | 100.00 |
| 1648 | Sell Diminishing-Valued Colored Balls | Medium | Array, Math, Sorting, Greedy, Binary_Search, Heap_Priority_Queue, Binary_Search_II_Day_19 | 27 | 80.64 |
| 1647 | Minimum Deletions to Make Character Frequencies Unique | Medium | String, Sorting, Greedy | 8 | 100.00 |
| 1646 | Get Maximum in Generated Array | Easy | Array, Dynamic_Programming, Simulation | 0 | 100.00 |
| 1643 | Kth Smallest Instructions | Hard | Array, Dynamic_Programming, Math, Combinatorics | 1 | 100.00 |
| 1642 | Furthest Building You Can Reach | Medium | Array, Greedy, Heap_Priority_Queue | 13 | 98.96 |
| 1641 | Count Sorted Vowel Strings | Medium | Dynamic_Programming | 0 | 100.00 |
| 1640 | Check Array Formation Through Concatenation | Easy | Array, Hash_Table | 1 | 87.62 |
| 1639 | Number of Ways to Form a Target String Given a Dictionary | Hard | Array, String, Dynamic_Programming | 50 | 95.33 |
| 1638 | Count Substrings That Differ by One Character | Medium | String, Hash_Table, Dynamic_Programming | 5 | 76.39 |
| 1637 | Widest Vertical Area Between Two Points Containing No Points | Medium | Array, Sorting | 17 | 74.19 |
| 1636 | Sort Array by Increasing Frequency | Easy | Array, Hash_Table, Sorting | 7 | 75.30 |
| 1632 | Rank Transform of a Matrix | Hard | Array, Greedy, Matrix, Graph, Union_Find, Topological_Sort | 65 | 100.00 |
| 1631 | Path With Minimum Effort | Medium | Array, Depth_First_Search, Breadth_First_Search, Binary_Search, Matrix, Heap_Priority_Queue, Union_Find | 75 | 60.52 |
| 1630 | Arithmetic Subarrays | Medium | Array, Sorting, Programming_Skills_II_Day_9 | 8 | 93.62 |
| 1629 | Slowest Key | Easy | Array, String | 4 | 14.60 |
| 1627 | Graph Connectivity With Threshold | Hard | Array, Math, Union_Find | 7 | 98.45 |
| 1626 | Best Team With No Conflicts | Medium | Array, Dynamic_Programming, Sorting | 38 | 92.31 |
| 1625 | Lexicographically Smallest String After Applying Operations | Medium | String, Breadth_First_Search | 91 | 91.80 |
| 1624 | Largest Substring Between Two Equal Characters | Easy | String, Hash_Table | 1 | 85.13 |
| 1622 | Fancy Sequence | Hard | Math, Design, Segment_Tree | 40 | 96.55 |
| 1621 | Number of Sets of K Non-Overlapping Line Segments | Medium | Dynamic_Programming, Math | 16 | 94.74 |
| 1620 | Coordinate With Maximum Network Quality | Medium | Array, Enumeration | 58 | 68.75 |
| 1619 | Mean of Array After Removing Some Elements | Easy | Array, Sorting | 2 | 99.81 |
| 1617 | Count Subtrees With Max Distance Between Cities | Hard | Dynamic_Programming, Tree, Bit_Manipulation, Bitmask, Enumeration | 52 | 78.95 |
| 1616 | Split Two Strings to Make Palindrome | Medium | String, Greedy, Two_Pointers | 4 | 89.77 |
| 1615 | Maximal Network Rank | Medium | Graph, Graph_Theory_I_Day_14_Graph_Theory | 3 | 97.34 |
| 1614 | Maximum Nesting Depth of the Parentheses | Easy | String, Stack | 1 | 80.44 |
| 1611 | Minimum One Bit Operations to Make Integers Zero | Hard | Dynamic_Programming, Bit_Manipulation, Memoization | 1 | 88.24 |
| 1610 | Maximum Number of Visible Points | Hard | Array, Math, Sorting, Sliding_Window, Geometry | 122 | 97.44 |
| 1609 | Even Odd Tree | Medium | Breadth_First_Search, Tree, Binary_Tree | 8 | 98.81 |
| 1608 | Special Array With X Elements Greater Than or Equal X | Easy | Array, Sorting, Binary_Search, Binary_Search_I_Day_7 | 2 | 61.14 |
| 1606 | Find Servers That Handled Most Number of Requests | Hard | Array, Greedy, Heap_Priority_Queue, Ordered_Set | 118 | 98.21 |
| 1605 | Find Valid Matrix Given Row and Column Sums | Medium | Array, Greedy, Matrix | 2 | 98.45 |
| 1604 | Alert Using Same Key-Card Three or More Times in a One Hour Period | Medium | Array, String, Hash_Table, Sorting | 77 | 95.79 |
| 1603 | Design Parking System | Easy | Design, Simulation, Counting, Programming_Skills_I_Day_12_Class_and_Object | 8 | 76.16 |
| 1601 | Maximum Number of Achievable Transfer Requests | Hard | Array, Bit_Manipulation, Backtracking, Enumeration | 26 | 84.02 |
| 1600 | Throne Inheritance | Medium | Hash_Table, Depth_First_Search, Tree, Design | 267 | 90.38 |
| 1599 | Maximum Profit of Operating a Centennial Wheel | Medium | Array, Simulation | 4 | 95.65 |
| 1598 | Crawler Log Folder | Easy | Array, String, Stack | 0 | 100.00 |
| 1595 | Minimum Cost to Connect Two Groups of Points | Hard | Array, Dynamic_Programming, Matrix, Bit_Manipulation, Bitmask | 74 | 64.83 |
| 1594 | Maximum Non Negative Product in a Matrix | Medium | Array, Dynamic_Programming, Matrix | 1 | 100.00 |
| 1593 | Split a String Into the Max Number of Unique Substrings | Medium | String, Hash_Table, Backtracking | 8 | 95.81 |
| 1592 | Rearrange Spaces Between Words | Easy | String | 3 | 67.74 |
| 1591 | Strange Printer II | Hard | Array, Matrix, Graph, Topological_Sort | 12 | 90.00 |
| 1590 | Make Sum Divisible by P | Medium | Array, Hash_Table, Prefix_Sum | 56 | 62.20 |
| 1589 | Maximum Sum Obtained of Any Permutation | Medium | Array, Sorting, Greedy, Prefix_Sum | 25 | 92.45 |
| 1588 | Sum of All Odd Length Subarrays | Easy | Array, Math, Prefix_Sum, Programming_Skills_I_Day_6_Array | 0 | 100.00 |
| 1587 | Bank Account Summary II | Easy | Database, SQL_I_Day_10_Where | 630 | 60.32 |
| 1585 | Check If String Is Transformable With Substring Sort Operations | Hard | String, Sorting, Greedy | 20 | 97.22 |
| 1584 | Min Cost to Connect All Points | Medium | Array, Union_Find, Minimum_Spanning_Tree | 134 | 87.37 |
| 1583 | Count Unhappy Friends | Medium | Array, Simulation | 3 | 93.13 |
| 1582 | Special Positions in a Binary Matrix | Easy | Array, Matrix | 2 | 82.12 |
| 1581 | Customer Who Visited but Did Not Make Any Transactions | Easy | Database, SQL_I_Day_5_Union | 1039 | 76.99 |
| 1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | Graph, Union_Find | 30 | 66.23 |
| 1578 | Minimum Time to Make Rope Colorful | Medium | Array, String, Dynamic_Programming, Greedy | 4 | 100.00 |
| 1577 | Number of Ways Where Square of Number Is Equal to Product of Two Numbers | Medium | Array, Hash_Table, Math, Two_Pointers | 20 | 86.27 |
| 1576 | Replace All ?'s to Avoid Consecutive Repeating Characters | Easy | String | 2 | 82.74 |
| 1575 | Count All Possible Routes | Hard | Array, Dynamic_Programming, Memoization | 111 | 72.26 |
| 1574 | Shortest Subarray to be Removed to Make Array Sorted | Medium | Array, Binary_Search, Two_Pointers, Stack, Monotonic_Stack, Binary_Search_II_Day_14 | 2 | 84.97 |
| 1573 | Number of Ways to Split a String | Medium | String, Math | 9 | 82.09 |
| 1572 | Matrix Diagonal Sum | Easy | Array, Matrix, Programming_Skills_I_Day_7_Array | 3 | 10.25 |
| 1569 | Number of Ways to Reorder Array to Get Same BST | Hard | Array, Dynamic_Programming, Math, Tree, Binary_Tree, Union_Find, Binary_Search_Tree, Divide_and_Conquer, Memoization, Combinatorics | 21 | 97.44 |
| 1568 | Minimum Number of Days to Disconnect Island | Hard | Array, Depth_First_Search, Breadth_First_Search, Matrix, Strongly_Connected_Component | 1 | 100.00 |
| 1567 | Maximum Length of Subarray With Positive Product | Medium | Array, Dynamic_Programming, Greedy, Dynamic_Programming_I_Day_6 | 4 | 80.86 |
| 1566 | Detect Pattern of Length M Repeated K or More Times | Easy | Array, Enumeration | 1 | 49.25 |
| 1563 | Stone Game V | Hard | Array, Dynamic_Programming, Math, Game_Theory | 36 | 95.56 |
| 1562 | Find Latest Group of Size M | Medium | Array, Binary_Search, Simulation, Binary_Search_II_Day_19 | 8 | 90.00 |
| 1561 | Maximum Number of Coins You Can Get | Medium | Array, Math, Sorting, Greedy, Game_Theory | 34 | 69.29 |
| 1560 | Most Visited Sector in a Circular Track | Easy | Array, Simulation | 1 | 88.89 |
| 1559 | Detect Cycles in 2D Grid | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 22 | 82.51 |
| 1558 | Minimum Numbers of Function Calls to Make Target Array | Medium | Array, Greedy | 42 | 69.17 |
| 1557 | Minimum Number of Vertices to Reach All Nodes | Medium | Graph, Data_Structure_II_Day_19_Graph, Graph_Theory_I_Day_13_Graph_Theory | 8 | 99.94 |
| 1556 | Thousand Separator | Easy | String | 1 | 57.92 |
| 1553 | Minimum Number of Days to Eat N Oranges | Hard | Dynamic_Programming, Memoization | 5 | 91.90 |
| 1552 | Magnetic Force Between Two Balls | Medium | Array, Sorting, Binary_Search, Binary_Search_II_Day_4 | 39 | 99.65 |
| 1551 | Minimum Operations to Make Array Equal | Medium | Math | 0 | 100.00 |
| 1550 | Three Consecutive Odds | Easy | Array | 0 | 100.00 |
| 1547 | Minimum Cost to Cut a Stick | Hard | Array, Dynamic_Programming | 6 | 100.00 |
| 1546 | Maximum Number of Non-Overlapping Subarrays With Sum Equals Target | Medium | Array, Hash_Table, Greedy, Prefix_Sum | 56 | 71.58 |
| 1545 | Find Kth Bit in Nth Binary String | Medium | String, Recursion | 0 | 100.00 |
| 1544 | Make The String Great | Easy | String, Stack | 6 | 50.00 |
| 1542 | Find Longest Awesome Substring | Hard | String, Hash_Table, Bit_Manipulation | 12 | 84.16 |
| 1541 | Minimum Insertions to Balance a Parentheses String | Medium | String, Greedy, Stack | 12 | 85.50 |
| 1540 | Can Convert String in K Moves | Medium | String, Hash_Table | 10 | 100.00 |
| 1539 | Kth Missing Positive Number | Easy | Array, Binary_Search, Binary_Search_I_Day_6 | 0 | 100.00 |
| 1537 | Get the Maximum Score | Hard | Array, Dynamic_Programming, Greedy, Two_Pointers | 6 | 58.14 |
| 1536 | Minimum Swaps to Arrange a Binary Grid | Medium | Array, Greedy, Matrix | 1 | 100.00 |
| 1535 | Find the Winner of an Array Game | Medium | Array, Simulation | 1 | 86.99 |
| 1534 | Count Good Triplets | Easy | Array, Enumeration | 14 | 82.96 |
| 1531 | String Compression II | Hard | String, Dynamic_Programming | 34 | 83.91 |
| 1530 | Number of Good Leaf Nodes Pairs | Medium | Depth_First_Search, Tree, Binary_Tree | 3 | 94.18 |
| 1529 | Minimum Suffix Flips | Medium | String, Greedy | 6 | 89.67 |
| 1528 | Shuffle String | Easy | Array, String | 2 | 54.77 |
| 1527 | Patients With a Condition | Easy | Database, SQL_I_Day_3_String_Processing_Functions | 308 | 66.93 |
| 1526 | Minimum Number of Increments on Subarrays to Form a Target Array | Hard | Array, Dynamic_Programming, Greedy, Stack, Monotonic_Stack | 4 | 70.36 |
| 1525 | Number of Good Ways to Split a String | Medium | String, Dynamic_Programming, Bit_Manipulation | 19 | 69.66 |
| 1524 | Number of Sub-arrays With Odd Sum | Medium | Array, Dynamic_Programming, Math, Prefix_Sum | 9 | 90.24 |
| 1523 | Count Odd Numbers in an Interval Range | Easy | Math, Programming_Skills_I_Day_1_Basic_Data_Type | 0 | 100.00 |
| 1521 | Find a Value of a Mysterious Function Closest to Target | Hard | Array, Binary_Search, Bit_Manipulation, Segment_Tree | 9 | 100.00 |
| 1520 | Maximum Number of Non-Overlapping Substrings | Hard | String, Greedy | 15 | 92.93 |
| 1519 | Number of Nodes in the Sub-Tree With the Same Label | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Counting | 60 | 98.13 |
| 1518 | Water Bottles | Easy | Math, Simulation | 0 | 100.00 |
| 1515 | Best Position for a Service Centre | Hard | Math, Geometry, Randomized | 6 | 87.14 |
| 1514 | Path with Maximum Probability | Medium | Heap_Priority_Queue, Graph, Shortest_Path | 31 | 93.10 |
| 1513 | Number of Substrings With Only 1s | Medium | String, Math | 3 | 97.83 |
| 1512 | Number of Good Pairs | Easy | Array, Hash_Table, Math, Counting | 1 | 84.97 |
| 1510 | Stone Game IV | Hard | Dynamic_Programming, Math, Game_Theory | 12 | 85.75 |
| 1509 | Minimum Difference Between Largest and Smallest Value in Three Moves | Medium | Array, Sorting, Greedy | 19 | 76.94 |
| 1508 | Range Sum of Sorted Subarray Sums | Medium | Array, Sorting, Binary_Search, Two_Pointers, Binary_Search_II_Day_14 | 60 | 93.84 |
| 1507 | Reformat Date | Easy | String | 1 | 98.73 |
| 1505 | Minimum Possible Integer After at Most K Adjacent Swaps On Digits | Hard | String, Greedy, Segment_Tree, Binary_Indexed_Tree | 12 | 96.77 |
| 1504 | Count Submatrices With All Ones | Medium | Array, Dynamic_Programming, Matrix, Stack, Monotonic_Stack | 9 | 85.86 |
| 1503 | Last Moment Before All Ants Fall Out of a Plank | Medium | Array, Simulation, Brainteaser | 1 | 81.72 |
| 1502 | Can Make Arithmetic Progression From Sequence | Easy | Array, Sorting, Programming_Skills_I_Day_4_Loop | 4 | 14.13 |
| 1499 | Max Value of Equation | Hard | Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue | 7 | 98.61 |
| 1498 | Number of Subsequences That Satisfy the Given Sum Condition | Medium | Array, Sorting, Binary_Search, Two_Pointers, Binary_Search_II_Day_15 | 27 | 99.13 |
| 1497 | Check If Array Pairs Are Divisible by k | Medium | Array, Hash_Table, Counting | 7 | 97.44 |
| 1496 | Path Crossing | Easy | String, Hash_Table | 1 | 97.41 |
| 1494 | Parallel Courses II | Hard | Dynamic_Programming, Bit_Manipulation, Graph, Bitmask | 325 | 42.24 |
| 1493 | Longest Subarray of 1's After Deleting One Element | Medium | Dynamic_Programming, Math, Sliding_Window | 2 | 87.25 |
| 1492 | The kth Factor of n | Medium | Math | 1 | 83.94 |
| 1491 | Average Salary Excluding the Minimum and Maximum Salary | Easy | Array, Sorting, Programming_Skills_I_Day_1_Basic_Data_Type | 0 | 100.00 |
| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard | Sorting, Graph, Union_Find, Minimum_Spanning_Tree, Strongly_Connected_Component | 17 | 100.00 |
| 1488 | Avoid Flood in The City | Medium | Array, Hash_Table, Greedy, Binary_Search, Heap_Priority_Queue, Binary_Search_II_Day_18 | 82 | 75.08 |
| 1487 | Making File Names Unique | Medium | Array, String, Hash_Table | 36 | 98.46 |
| 1486 | XOR Operation in an Array | Easy | Math, Bit_Manipulation | 0 | 100.00 |
| 1484 | Group Sold Products By The Date | Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_3_String_Processing_Functions | 395 | 77.20 |
| 1483 | Kth Ancestor of a Tree Node | Hard | Dynamic_Programming, Depth_First_Search, Breadth_First_Search, Tree, Binary_Search, Design | 60 | 93.28 |
| 1482 | Minimum Number of Days to Make m Bouquets | Medium | Array, Binary_Search, Binary_Search_II_Day_7 | 25 | 69.18 |
| 1481 | Least Number of Unique Integers after K Removals | Medium | Array, Hash_Table, Sorting, Greedy, Counting | 62 | 85.33 |
| 1480 | Running Sum of 1d Array | Easy | Array, Prefix_Sum, Level_1_Day_1_Prefix_Sum | 0 | 100.00 |
| 1478 | Allocate Mailboxes | Hard | Array, Dynamic_Programming, Math, Sorting | 12 | 78.87 |
| 1477 | Find Two Non-overlapping Sub-arrays Each With Target Sum | Medium | Array, Hash_Table, Dynamic_Programming, Binary_Search, Sliding_Window | 8 | 89.43 |
| 1476 | Subrectangle Queries | Medium | Array, Matrix, Design | 20 | 97.61 |
| 1475 | Final Prices With a Special Discount in a Shop | Easy | Array, Stack, Monotonic_Stack | 2 | 80.33 |
| 1473 | Paint House III | Hard | Array, Dynamic_Programming | 26 | 89.13 |
| 1472 | Design Browser History | Medium | Array, Stack, Design, Linked_List, Data_Stream, Doubly_Linked_List | 76 | 82.33 |
| 1471 | The k Strongest Values in an Array | Medium | Array, Sorting, Two_Pointers | 37 | 88.20 |
| 1470 | Shuffle the Array | Easy | Array | 1 | 51.62 |
| 1467 | Probability of a Two Boxes Having The Same Number of Distinct Balls | Hard | Dynamic_Programming, Math, Backtracking, Combinatorics, Probability_and_Statistics | 1 | 100.00 |
| 1466 | Reorder Routes to Make All Paths Lead to the City Zero | Medium | Depth_First_Search, Breadth_First_Search, Graph, Graph_Theory_I_Day_10_Standard_Traversal | 39 | 97.71 |
| 1465 | Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | Medium | Array, Sorting, Greedy | 21 | 35.40 |
| 1464 | Maximum Product of Two Elements in an Array | Easy | Array, Sorting, Heap_Priority_Queue | 1 | 90.39 |
| 1463 | Cherry Pickup II | Hard | Array, Dynamic_Programming, Matrix | 10 | 99.58 |
| 1462 | Course Schedule IV | Medium | Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 10 | 100.00 |
| 1461 | Check If a String Contains All Binary Codes of Size K | Medium | String, Hash_Table, Bit_Manipulation, Hash_Function, Rolling_Hash | 169 | 52.07 |
| 1460 | Make Two Arrays Equal by Reversing Sub-arrays | Easy | Array, Hash_Table, Sorting | 4 | 74.61 |
| 1458 | Max Dot Product of Two Subsequences | Hard | Array, Dynamic_Programming | 6 | 98.36 |
| 1457 | Pseudo-Palindromic Paths in a Binary Tree | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Bit_Manipulation | 35 | 43.73 |
| 1456 | Maximum Number of Vowels in a Substring of Given Length | Medium | String, Sliding_Window | 19 | 53.73 |
| 1455 | Check If a Word Occurs As a Prefix of Any Word in a Sentence | Easy | String, String_Matching | 1 | 32.08 |
| 1453 | Maximum Number of Darts Inside of a Circular Dartboard | Hard | Array, Math, Geometry | 22 | 100.00 |
| 1452 | People Whose List of Favorite Companies Is Not a Subset of Another List | Medium | Array, String, Hash_Table | 117 | 78.71 |
| 1451 | Rearrange Words in a Sentence | Medium | String, Sorting | 21 | 89.94 |
| 1450 | Number of Students Doing Homework at a Given Time | Easy | Array | 0 | 100.00 |
| 1449 | Form Largest Integer With Digits That Add up to Target | Hard | Array, Dynamic_Programming | 8 | 77.46 |
| 1448 | Count Good Nodes in Binary Tree | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 2 | 99.63 |
| 1447 | Simplified Fractions | Medium | String, Math, Number_Theory | 33 | 69.60 |
| 1446 | Consecutive Characters | Easy | String | 3 | 30.50 |
| 1444 | Number of Ways of Cutting a Pizza | Hard | Array, Dynamic_Programming, Matrix, Memoization | 14 | 46.03 |
| 1443 | Minimum Time to Collect All Apples in a Tree | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree | 75 | 57.75 |
| 1442 | Count Triplets That Can Form Two Arrays of Equal XOR | Medium | Array, Hash_Table, Math, Bit_Manipulation, Prefix_Sum | 2 | 79.80 |
| 1441 | Build an Array With Stack Operations | Easy | Array, Stack, Simulation | 1 | 38.47 |
| 1439 | Find the Kth Smallest Sum of a Matrix With Sorted Rows | Hard | Array, Binary_Search, Matrix, Heap_Priority_Queue | 40 | 75.79 |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | Array, Heap_Priority_Queue, Sliding_Window, Ordered_Set, Queue, Monotonic_Queue | 38 | 81.86 |
| 1437 | Check If All 1's Are at Least Length K Places Away | Easy | Array | 2 | 73.75 |
| 1436 | Destination City | Easy | String, Hash_Table | 3 | 81.47 |
| 1434 | Number of Ways to Wear Different Hats to Each Other | Hard | Array, Dynamic_Programming, Bit_Manipulation, Bitmask | 31 | 77.92 |
| 1433 | Check If a String Can Break Another String | Medium | String, Sorting, Greedy | 9 | 77.89 |
| 1432 | Max Difference You Can Get From Changing an Integer | Medium | Math, Greedy | 1 | 97.22 |
| 1431 | Kids With the Greatest Number of Candies | Easy | Array | 1 | 84.43 |
| 1425 | Constrained Subsequence Sum | Hard | Array, Dynamic_Programming, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue | 69 | 30.52 |
| 1424 | Diagonal Traverse II | Medium | Array, Sorting, Heap_Priority_Queue | 39 | 85.56 |
| 1423 | Maximum Points You Can Obtain from Cards | Medium | Array, Prefix_Sum, Sliding_Window | 2 | 94.06 |
| 1422 | Maximum Score After Splitting a String | Easy | String | 1 | 96.45 |
| 1420 | Build Array Where You Can Find The Maximum Exactly K Comparisons | Hard | Dynamic_Programming | 22 | 86.32 |
| 1419 | Minimum Number of Frogs Croaking | Medium | String, Counting | 19 | 32.16 |
| 1418 | Display Table of Food Orders in a Restaurant | Medium | Array, String, Hash_Table, Sorting, Ordered_Set | 42 | 77.01 |
| 1417 | Reformat The String | Easy | String | 4 | 88.39 |
| 1416 | Restore The Array | Hard | String, Dynamic_Programming | 34 | 100.00 |
| 1415 | The k-th Lexicographical String of All Happy Strings of Length n | Medium | String, Backtracking | 2 | 90.55 |
| 1414 | Find the Minimum Number of Fibonacci Numbers Whose Sum Is K | Medium | Greedy | 2 | 67.22 |
| 1413 | Minimum Value to Get Positive Step by Step Sum | Easy | Array, Prefix_Sum | 0 | 100.00 |
| 1411 | Number of Ways to Paint N × 3 Grid | Hard | Dynamic_Programming | 14 | 34.91 |
| 1410 | HTML Entity Parser | Medium | String, Hash_Table | 19 | 98.92 |
| 1409 | Queries on a Permutation With Key | Medium | Array, Simulation, Binary_Indexed_Tree | 15 | 38.43 |
| 1408 | String Matching in an Array | Easy | String, String_Matching | 8 | 24.88 |
| 1407 | Top Travellers | Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_9_Control_of_Flow | 682 | 70.16 |
| 1406 | Stone Game III | Hard | Array, Dynamic_Programming, Math, Game_Theory | 14 | 82.02 |
| 1405 | Longest Happy String | Medium | String, Greedy, Heap_Priority_Queue | 0 | 100.00 |
| 1404 | Number of Steps to Reduce a Number in Binary Representation to One | Medium | String, Bit_Manipulation | 1 | 62.90 |
| 1403 | Minimum Subsequence in Non-Increasing Order | Easy | Array, Sorting, Greedy | 4 | 79.60 |
| 1402 | Reducing Dishes | Hard | Array, Dynamic_Programming, Sorting, Greedy | 3 | 66.20 |
| 1401 | Circle and Rectangle Overlapping | Medium | Math, Geometry | 0 | 100.00 |
| 1400 | Construct K Palindrome Strings | Medium | String, Hash_Table, Greedy, Counting | 5 | 94.62 |
| 1399 | Count Largest Group | Easy | Hash_Table, Math | 3 | 98.21 |
| 1397 | Find All Good Strings | Hard | String, Dynamic_Programming, String_Matching | 85 | 41.25 |
| 1396 | Design Underground System | Medium | String, Hash_Table, Design | 89 | 89.64 |
| 1395 | Count Number of Teams | Medium | Array, Dynamic_Programming, Binary_Indexed_Tree | 18 | 91.75 |
| 1394 | Find Lucky Integer in an Array | Easy | Array, Hash_Table, Counting | 2 | 82.56 |
| 1393 | Capital Gain/Loss | Medium | LeetCode_Curated_SQL_70, Database, SQL_I_Day_9_Control_of_Flow | 457 | 79.39 |
| 1392 | Longest Happy Prefix | Hard | String, Hash_Function, String_Matching, Rolling_Hash | 39 | 28.37 |
| 1391 | Check if There is a Valid Path in a Grid | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 14 | 85.37 |
| 1390 | Four Divisors | Medium | Array, Math | 13 | 97.25 |
| 1389 | Create Target Array in the Given Order | Easy | Array, Simulation | 0 | 100.00 |
| 1388 | Pizza With 3n Slices | Hard | Array, Dynamic_Programming, Greedy, Heap_Priority_Queue | 5 | 93.33 |
| 1387 | Sort Integers by The Power Value | Medium | Dynamic_Programming, Sorting, Memoization | 52 | 87.20 |
| 1386 | Cinema Seat Allocation | Medium | Array, Hash_Table, Greedy, Bit_Manipulation | 32 | 69.41 |
| 1385 | Find the Distance Value Between Two Arrays | Easy | Array, Sorting, Binary_Search, Two_Pointers, Binary_Search_I_Day_3 | 5 | 65.78 |
| 1383 | Maximum Performance of a Team | Hard | Array, Sorting, Greedy, Heap_Priority_Queue | 66 | 66.03 |
| 1382 | Balance a Binary Search Tree | Medium | Depth_First_Search, Greedy, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer | 5 | 65.24 |
| 1381 | Design a Stack With Increment Operation | Medium | Array, Stack, Design | 8 | 62.23 |
| 1380 | Lucky Numbers in a Matrix | Easy | Array, Matrix | 2 | 82.40 |
| 1379 | Find a Corresponding Node of a Binary Tree in a Clone of That Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 2 | 77.89 |
| 1377 | Frog Position After T Seconds | Hard | Depth_First_Search, Breadth_First_Search, Tree, Graph | 6 | 81.30 |
| 1376 | Time Needed to Inform All Employees | Medium | Depth_First_Search, Breadth_First_Search, Tree, Programming_Skills_II_Day_11, Graph_Theory_I_Day_9_Standard_Traversal | 225 | 22.36 |
| 1375 | Number of Times Binary String Is Prefix-Aligned | Medium | Array | 2 | 89.02 |
| 1374 | Generate a String With Characters That Have Odd Counts | Easy | String | 1 | 90.52 |
| 1373 | Maximum Sum BST in Binary Tree | Hard | Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 15 | 47.56 |
| 1372 | Longest ZigZag Path in a Binary Tree | Medium | Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree | 9 | 64.47 |
| 1371 | Find the Longest Substring Containing Vowels in Even Counts | Medium | String, Hash_Table, Bit_Manipulation, Prefix_Sum | 25 | 80.38 |
| 1370 | Increasing Decreasing String | Easy | String, Hash_Table, Counting | 4 | 80.41 |
| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | Hard | Array, Breadth_First_Search, Matrix, Heap_Priority_Queue, Graph, Shortest_Path | 8 | 99.38 |
| 1367 | Linked List in Binary Tree | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List, Programming_Skills_II_Day_4 | 2 | 61.23 |
| 1366 | Rank Teams by Votes | Medium | Array, String, Hash_Table, Sorting, Counting | 5 | 95.68 |
| 1365 | How Many Numbers Are Smaller Than the Current Number | Easy | Array, Hash_Table, Sorting, Counting | 1 | 99.78 |
| 1363 | Largest Multiple of Three | Hard | Array, Dynamic_Programming, Greedy | 5 | 84.67 |
| 1362 | Closest Divisors | Medium | Math | 8 | 84.91 |
| 1361 | Validate Binary Tree Nodes | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Graph, Union_Find | 8 | 69.78 |
| 1360 | Number of Days Between Two Dates | Easy | String, Math | 2 | 78.82 |
| 1359 | Count All Valid Pickup and Delivery Options | Hard | Dynamic_Programming, Math, Combinatorics | 0 | 100.00 |
| 1358 | Number of Substrings Containing All Three Characters | Medium | String, Hash_Table, Sliding_Window | 15 | 53.82 |
| 1357 | Apply Discount Every n Orders | Medium | Array, Hash_Table, Design | 174 | 58.82 |
| 1356 | Sort Integers by The Number of 1 Bits | Easy | Array, Sorting, Bit_Manipulation, Counting, Programming_Skills_I_Day_11_Containers_and_Libraries | 10 | 65.50 |
| 1354 | Construct Target Array With Multiple Sums | Hard | Array, Heap_Priority_Queue | 2 | 100.00 |
| 1353 | Maximum Number of Events That Can Be Attended | Medium | Array, Greedy, Heap_Priority_Queue | 70 | 21.66 |
| 1352 | Product of the Last K Numbers | Medium | Array, Math, Design, Queue, Data_Stream | 24 | 60.43 |
| 1351 | Count Negative Numbers in a Sorted Matrix | Easy | Array, Binary_Search, Matrix, Binary_Search_I_Day_8 | 1 | 49.66 |
| 1349 | Maximum Students Taking Exam | Hard | Array, Dynamic_Programming, Matrix, Bit_Manipulation, Bitmask | 4 | 76.98 |
| 1348 | Tweet Counts Per Frequency | Medium | Hash_Table, Sorting, Binary_Search, Design, Ordered_Set | 86 | 99.44 |
| 1347 | Minimum Number of Steps to Make Two Strings Anagram | Medium | String, Hash_Table, Counting | 13 | 76.34 |
| 1346 | Check If N and Its Double Exist | Easy | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers, Binary_Search_I_Day_9 | 1 | 99.64 |
| 1345 | Jump Game IV | Hard | Array, Hash_Table, Breadth_First_Search | 65 | 89.91 |
| 1344 | Angle Between Hands of a Clock | Medium | Math | 0 | 100.00 |
| 1343 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | Medium | Array, Sliding_Window | 5 | 46.57 |
| 1342 | Number of Steps to Reduce a Number to Zero | Easy | Math, Bit_Manipulation | 1 | 58.49 |
| 1340 | Jump Game V | Hard | Array, Dynamic_Programming, Sorting | 13 | 71.33 |
| 1339 | Maximum Product of Splitted Binary Tree | Medium | Depth_First_Search, Tree, Binary_Tree | 11 | 83.43 |
| 1338 | Reduce Array Size to The Half | Medium | Array, Hash_Table, Sorting, Greedy, Heap_Priority_Queue | 61 | 73.82 |
| 1337 | The K Weakest Rows in a Matrix | Easy | Array, Sorting, Binary_Search, Matrix, Heap_Priority_Queue, Binary_Search_I_Day_9 | 1 | 99.77 |
| 1335 | Minimum Difficulty of a Job Schedule | Hard | Array, Dynamic_Programming | 11 | 79.28 |
| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | Dynamic_Programming, Graph, Shortest_Path | 21 | 49.75 |
| 1333 | Filter Restaurants by Vegan-Friendly, Price and Distance | Medium | Array, Sorting | 10 | 55.43 |
| 1332 | Remove Palindromic Subsequences | Easy | String, Two_Pointers | 0 | 100.00 |
| 1331 | Rank Transform of an Array | Easy | Array, Hash_Table, Sorting | 22 | 98.50 |
| 1330 | Reverse Subarray To Maximize Array Value | Hard | Array, Math, Greedy | 9 | 88.00 |
| 1329 | Sort the Matrix Diagonally | Medium | Array, Sorting, Matrix | 15 | 26.03 |
| 1328 | Break a Palindrome | Medium | String, Greedy | 0 | 100.00 |
| 1326 | Minimum Number of Taps to Open to Water a Garden | Hard | Array, Dynamic_Programming, Greedy | 3 | 90.04 |
| 1325 | Delete Leaves With a Given Value | Medium | Depth_First_Search, Tree, Binary_Tree | 2 | 33.61 |
| 1324 | Print Words Vertically | Medium | Array, String, Simulation | 1 | 90.59 |
| 1323 | Maximum 69 Number | Easy | Math, Greedy | 3 | 32.03 |
| 1320 | Minimum Distance to Type a Word Using Two Fingers | Hard | String, Dynamic_Programming | 16 | 82.29 |
| 1319 | Number of Operations to Make Network Connected | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, Graph_Theory_I_Day_8_Standard_Traversal | 9 | 67.64 |
| 1318 | Minimum Flips to Make a OR b Equal to c | Medium | Bit_Manipulation | 0 | 100.00 |
| 1317 | Convert Integer to the Sum of Two No-Zero Integers | Easy | Math | 1 | 84.36 |
| 1316 | Distinct Echo Substrings | Hard | String, Dynamic_Programming, Sliding_Window, Trie, Hash_Function, Rolling_Hash | 165 | 93.15 |
| 1315 | Sum of Nodes with Even-Valued Grandparent | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 2 | 78.61 |
| 1314 | Matrix Block Sum | Medium | Array, Matrix, Prefix_Sum, Dynamic_Programming_I_Day_14 | 5 | 67.46 |
| 1313 | Decompress Run-Length Encoded List | Easy | Array | 1 | 98.11 |
| 1312 | Minimum Insertion Steps to Make a String Palindrome | Hard | String, Dynamic_Programming | 25 | 85.70 |
| 1311 | Get Watched Videos by Your Friends | Medium | Array, Hash_Table, Sorting, Breadth_First_Search | 39 | 73.81 |
| 1310 | XOR Queries of a Subarray | Medium | Array, Bit_Manipulation, Prefix_Sum | 3 | 68.91 |
| 1309 | Decrypt String from Alphabet to Integer Mapping | Easy | String, Programming_Skills_I_Day_9_String | 6 | 28.25 |
| 1307 | Verbal Arithmetic Puzzle | Hard | Array, String, Math, Backtracking | 6 | 95.74 |
| 1306 | Jump Game III | Medium | Array, Depth_First_Search, Breadth_First_Search, Graph_Theory_I_Day_11_Breadth_First_Search | 2 | 96.23 |
| 1305 | All Elements in Two Binary Search Trees | Medium | Sorting, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 25 | 63.82 |
| 1304 | Find N Unique Integers Sum up to Zero | Easy | Array, Math | 0 | 100.00 |
| 1302 | Deepest Leaves Sum | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 5 | 59.50 |
| 1301 | Number of Paths with Max Score | Hard | Array, Dynamic_Programming, Matrix | 14 | 72.31 |
| 1300 | Sum of Mutated Array Closest to Target | Medium | Array, Sorting, Binary_Search, Binary_Search_II_Day_16 | 7 | 33.33 |
| 1299 | Replace Elements with Greatest Element on Right Side | Easy | Array | 1 | 99.82 |
| 1298 | Maximum Candies You Can Get from Boxes | Hard | Array, Breadth_First_Search | 3 | 100.00 |
| 1297 | Maximum Number of Occurrences of a Substring | Medium | String, Hash_Table, Sliding_Window | 42 | 90.85 |
| 1296 | Divide Array in Sets of K Consecutive Numbers | Medium | Array, Hash_Table, Sorting, Greedy | 39 | 97.80 |
| 1295 | Find Numbers with Even Number of Digits | Easy | Array | 2 | 58.23 |
| 1293 | Shortest Path in a Grid with Obstacles Elimination | Hard | Array, Breadth_First_Search, Matrix | 35 | 63.17 |
| 1292 | Maximum Side Length of a Square with Sum Less than or Equal to Threshold | Medium | Array, Binary_Search, Matrix, Prefix_Sum, Binary_Search_II_Day_15 | 23 | 32.97 |
| 1291 | Sequential Digits | Medium | Enumeration | 0 | 100.00 |
| 1290 | Convert Binary Number in a Linked List to Integer | Easy | Math, Linked_List, Programming_Skills_I_Day_10_Linked_List_and_Tree | 0 | 100.00 |
| 1289 | Minimum Falling Path Sum II | Hard | Array, Dynamic_Programming, Matrix | 2 | 99.45 |
| 1288 | Remove Covered Intervals | Medium | Array, Sorting | 6 | 78.87 |
| 1287 | Element Appearing More Than 25% In Sorted Array | Easy | Array | 0 | 100.00 |
| 1286 | Iterator for Combination | Medium | String, Design, Backtracking, Iterator | 10 | 95.00 |
| 1284 | Minimum Number of Flips to Convert Binary Matrix to Zero Matrix | Hard | Array, Breadth_First_Search, Matrix, Bit_Manipulation | 2 | 89.29 |
| 1283 | Find the Smallest Divisor Given a Threshold | Medium | Array, Binary_Search, Binary_Search_II_Day_5 | 9 | 95.49 |
| 1282 | Group the People Given the Group Size They Belong To | Medium | Array, Hash_Table | 6 | 79.04 |
| 1281 | Subtract the Product and Sum of Digits of an Integer | Easy | Math, Programming_Skills_I_Day_2_Operator | 0 | 100.00 |
| 1278 | Palindrome Partitioning III | Hard | String, Dynamic_Programming | 4 | 89.93 |
| 1277 | Count Square Submatrices with All Ones | Medium | Array, Dynamic_Programming, Matrix | 5 | 95.33 |
| 1276 | Number of Burgers with No Waste of Ingredients | Medium | Math | 2 | 87.88 |
| 1275 | Find Winner on a Tic Tac Toe Game | Easy | Array, Hash_Table, Matrix, Simulation | 0 | 100.00 |
| 1269 | Number of Ways to Stay in the Same Place After Some Steps | Hard | Dynamic_Programming | 12 | 89.11 |
| 1268 | Search Suggestions System | Medium | Array, String | 28 | 78.06 |
| 1267 | Count Servers that Communicate | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Counting, Union_Find | 5 | 41.00 |
| 1266 | Minimum Time Visiting All Points | Easy | Array, Math, Geometry | 1 | 80.97 |
| 1263 | Minimum Moves to Move a Box to Their Target Location | Hard | Array, Breadth_First_Search, Matrix, Heap_Priority_Queue | 16 | 76.00 |
| 1262 | Greatest Sum Divisible by Three | Medium | Array, Dynamic_Programming, Greedy | 5 | 95.82 |
| 1261 | Find Elements in a Contaminated Binary Tree | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design | 24 | 84.00 |
| 1260 | Shift 2D Grid | Easy | Array, Matrix, Simulation | 17 | 14.82 |
| 1255 | Maximum Score Words Formed by Letters | Hard | Array, String, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 1 | 98.36 |
| 1254 | Number of Closed Islands | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Graph_Theory_I_Day_2_Matrix_Related_Problems | 3 | 55.59 |
| 1253 | Reconstruct a 2-Row Binary Matrix | Medium | Array, Greedy, Matrix | 18 | 57.27 |
| 1252 | Cells with Odd Values in a Matrix | Easy | Array, Math, Simulation | 1 | 87.47 |
| 1250 | Check If It Is a Good Array | Hard | Array, Math, Number_Theory | 4 | 58.82 |
| 1249 | Minimum Remove to Make Valid Parentheses | Medium | String, Stack, Data_Structure_II_Day_14_Stack_Queue | 13 | 94.62 |
| 1248 | Count Number of Nice Subarrays | Medium | Array, Hash_Table, Math, Sliding_Window | 14 | 69.78 |
| 1247 | Minimum Swaps to Make Strings Equal | Medium | String, Math, Greedy | 1 | 79.83 |
| 1240 | Tiling a Rectangle with the Fewest Squares | Hard | Dynamic_Programming, Backtracking | 3 | 62.18 |
| 1239 | Maximum Length of a Concatenated String with Unique Characters | Medium | Array, String, Bit_Manipulation, Backtracking | 9 | 88.28 |
| 1238 | Circular Permutation in Binary Representation | Medium | Math, Bit_Manipulation, Backtracking | 4 | 100.00 |
| 1237 | Find Positive Integer Solution for a Given Equation | Medium | Math, Binary_Search, Two_Pointers, Interactive | 2 | 79.60 |
| 1235 | Maximum Profit in Job Scheduling | Hard | Array, Dynamic_Programming, Sorting, Binary_Search | 27 | 89.19 |
| 1234 | Replace the Substring for Balanced String | Medium | String, Sliding_Window | 7 | 89.84 |
| 1233 | Remove Sub-Folders from the Filesystem | Medium | Array, String, Trie | 32 | 96.54 |
| 1232 | Check If It Is a Straight Line | Easy | Array, Math, Geometry, Programming_Skills_I_Day_5_Function | 0 | 100.00 |
| 1227 | Airplane Seat Assignment Probability | Medium | Dynamic_Programming, Math, Brainteaser, Probability_and_Statistics | 1 | 15.63 |
| 1226 | The Dining Philosophers | Medium | Concurrency | 10 | 83.56 |
| 1224 | Maximum Equal Frequency | Hard | Array, Hash_Table | 17 | 93.59 |
| 1223 | Dice Roll Simulation | Hard | Array, Dynamic_Programming | 9 | 90.98 |
| 1222 | Queens That Can Attack the King | Medium | Array, Matrix, Simulation | 1 | 89.88 |
| 1221 | Split a String in Balanced Strings | Easy | String, Greedy, Counting | 1 | 53.71 |
| 1220 | Count Vowels Permutation | Hard | Dynamic_Programming | 7 | 98.50 |
| 1219 | Path with Maximum Gold | Medium | Array, Matrix, Backtracking | 48 | 57.00 |
| 1218 | Longest Arithmetic Subsequence of Given Difference | Medium | Array, Hash_Table, Dynamic_Programming | 11 | 98.23 |
| 1217 | Minimum Cost to Move Chips to The Same Position | Easy | Array, Math, Greedy | 0 | 100.00 |
| 1210 | Minimum Moves to Reach Target with Rotations | Hard | Array, Breadth_First_Search, Matrix | 29 | 78.57 |
| 1209 | Remove All Adjacent Duplicates in String II | Medium | String, Stack | 15 | 88.34 |
| 1208 | Get Equal Substrings Within Budget | Medium | String, Binary_Search, Prefix_Sum, Sliding_Window | 7 | 73.41 |
| 1207 | Unique Number of Occurrences | Easy | Array, Hash_Table | 2 | 82.71 |
| 1206 | Design Skiplist | Hard | Design, Linked_List | 14 | 96.71 |
| 1203 | Sort Items by Groups Respecting Dependencies | Hard | Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 44 | 88.89 |
| 1202 | Smallest String With Swaps | Medium | String, Hash_Table, Depth_First_Search, Breadth_First_Search, Union_Find | 43 | 86.82 |
| 1201 | Ugly Number III | Medium | Math, Binary_Search, Number_Theory, Binary_Search_II_Day_20 | 0 | 100.00 |
| 1200 | Minimum Absolute Difference | Easy | Array, Sorting | 14 | 98.30 |
| 1195 | Fizz Buzz Multithreaded | Medium | Concurrency | 8 | 80.09 |
| 1192 | Critical Connections in a Network | Hard | Depth_First_Search, Graph, Biconnected_Component | 127 | 89.39 |
| 1191 | K-Concatenation Maximum Sum | Medium | Array, Dynamic_Programming | 6 | 73.85 |
| 1190 | Reverse Substrings Between Each Pair of Parentheses | Medium | String, Stack | 1 | 98.26 |
| 1189 | Maximum Number of Balloons | Easy | String, Hash_Table, Counting | 3 | 68.13 |
| 1187 | Make Array Strictly Increasing | Hard | Array, Dynamic_Programming, Binary_Search | 33 | 95.51 |
| 1186 | Maximum Subarray Sum with One Deletion | Medium | Array, Dynamic_Programming | 3 | 94.48 |
| 1185 | Day of the Week | Easy | Math | 0 | 100.00 |
| 1184 | Distance Between Bus Stops | Easy | Array | 0 | 100.00 |
| 1179 | Reformat Department Table | Easy | Database | 493 | 64.80 |
| 1178 | Number of Valid Words for Each Puzzle | Hard | Array, String, Hash_Table, Bit_Manipulation, Trie | 139 | 48.41 |
| 1177 | Can Make Palindrome from Substring | Medium | String, Hash_Table, Bit_Manipulation, Prefix_Sum | 13 | 93.08 |
| 1175 | Prime Arrangements | Easy | Math | 0 | 100.00 |
| 1172 | Dinner Plate Stacks | Hard | Hash_Table, Stack, Design, Heap_Priority_Queue | 63 | 96.74 |
| 1171 | Remove Zero Sum Consecutive Nodes from Linked List | Medium | Hash_Table, Linked_List | 2 | 90.39 |
| 1170 | Compare Strings by Frequency of the Smallest Character | Medium | Array, String, Hash_Table, Sorting, Binary_Search | 7 | 57.89 |
| 1169 | Invalid Transactions | Medium | Array, String, Hash_Table, Sorting | 11 | 89.89 |
| 1163 | Last Substring in Lexicographical Order | Hard | String, Two_Pointers | 12 | 96.43 |
| 1162 | As Far from Land as Possible | Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix, Graph_Theory_I_Day_4_Matrix_Related_Problems | 12 | 89.17 |
| 1161 | Maximum Level Sum of a Binary Tree | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 9 | 78.65 |
| 1160 | Find Words That Can Be Formed by Characters | Easy | Array, String, Hash_Table | 53 | 30.13 |
| 1158 | Market Analysis I | Medium | Database, SQL_I_Day_9_Control_of_Flow | 1039 | 77.70 |
| 1157 | Online Majority Element In Subarray | Hard | Array, Binary_Search, Design, Segment_Tree, Binary_Indexed_Tree | 56 | 100.00 |
| 1156 | Swap For Longest Repeated Character Substring | Medium | String, Sliding_Window | 12 | 47.37 |
| 1155 | Number of Dice Rolls With Target Sum | Medium | Dynamic_Programming | 17 | 78.89 |
| 1154 | Day of the Year | Easy | String, Math | 9 | 95.40 |
| 1148 | Article Views I | Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_5_Union | 459 | 44.85 |
| 1147 | Longest Chunked Palindrome Decomposition | Hard | String, Dynamic_Programming, Greedy, Two_Pointers, Hash_Function, Rolling_Hash | 11 | 44.95 |
| 1146 | Snapshot Array | Medium | Array, Hash_Table, Binary_Search, Design, Binary_Search_II_Day_18 | 37 | 87.93 |
| 1145 | Binary Tree Coloring Game | Medium | Depth_First_Search, Tree, Binary_Tree | 0 | 100.00 |
| 1144 | Decrease Elements To Make Array Zigzag | Medium | Array, Greedy | 0 | 100.00 |
| 1143 | Longest Common Subsequence | Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Algorithm_II_Day_17_Dynamic_Programming, Dynamic_Programming_I_Day_19 | 9 | 93.92 |
| 1141 | User Activity for the Past 30 Days I | Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_7_Function | 543 | 29.24 |
| 1140 | Stone Game II | Medium | Array, Dynamic_Programming, Math, Game_Theory | 12 | 44.22 |
| 1139 | Largest 1-Bordered Square | Medium | Array, Dynamic_Programming, Matrix | 8 | 53.28 |
| 1138 | Alphabet Board Path | Medium | String, Hash_Table | 1 | 76.10 |
| 1137 | N-th Tribonacci Number | Easy | Dynamic_Programming, Math, Memoization, Dynamic_Programming_I_Day_1 | 0 | 100.00 |
| 1131 | Maximum of Absolute Value Expression | Medium | Array, Math | 8 | 60.95 |
| 1130 | Minimum Cost Tree From Leaf Values | Medium | Dynamic_Programming, Greedy, Stack, Monotonic_Stack | 2 | 82.90 |
| 1129 | Shortest Path with Alternating Colors | Medium | Breadth_First_Search, Graph, Graph_Theory_I_Day_10_Standard_Traversal | 5 | 90.28 |
| 1128 | Number of Equivalent Domino Pairs | Easy | Array, Hash_Table, Counting | 10 | 69.88 |
| 1125 | Smallest Sufficient Team | Hard | Array, Dynamic_Programming, Bit_Manipulation, Bitmask | 3 | 98.82 |
| 1124 | Longest Well-Performing Interval | Medium | Array, Hash_Table, Stack, Prefix_Sum, Monotonic_Stack | 13 | 71.38 |
| 1123 | Lowest Common Ancestor of Deepest Leaves | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 76.02 |
| 1122 | Relative Sort Array | Easy | Array, Hash_Table, Sorting, Counting_Sort | 0 | 100.00 |
| 1117 | Building H2O | Medium | Concurrency | 12 | 93.81 |
| 1116 | Print Zero Even Odd | Medium | Concurrency | 5 | 99.83 |
| 1115 | Print FooBar Alternately | Medium | Concurrency | 16 | 90.05 |
| 1114 | Print in Order | Easy | Concurrency | 16 | 77.21 |
| 1111 | Maximum Nesting Depth of Two Valid Parentheses Strings | Medium | String, Stack | 1 | 99.73 |
| 1110 | Delete Nodes And Return Forest | Medium | Depth_First_Search, Tree, Binary_Tree | 5 | 15.90 |
| 1109 | Corporate Flight Bookings | Medium | Array, Prefix_Sum | 3 | 87.75 |
| 1108 | Defanging an IP Address | Easy | String | 0 | 100.00 |
| 1106 | Parsing A Boolean Expression | Hard | String, Stack, Recursion | 3 | 93.78 |
| 1105 | Filling Bookcase Shelves | Medium | Array, Dynamic_Programming | 4 | 23.85 |
| 1104 | Path In Zigzag Labelled Binary Tree | Medium | Math, Tree, Binary_Tree | 1 | 58.50 |
| 1103 | Distribute Candies to People | Easy | Math, Simulation | 2 | 49.07 |
| 1096 | Brace Expansion II | Hard | String, Breadth_First_Search, Stack, Backtracking | 23 | 60.36 |
| 1095 | Find in Mountain Array | Hard | Array, Binary_Search, Interactive | 0 | 100.00 |
| 1094 | Car Pooling | Medium | Array, Sorting, Heap_Priority_Queue, Simulation, Prefix_Sum | 1 | 99.38 |
| 1093 | Statistics from a Large Sample | Medium | Math, Two_Pointers, Probability_and_Statistics | 1 | 86.00 |
| 1092 | Shortest Common Supersequence | Hard | String, Dynamic_Programming | 10 | 96.12 |
| 1091 | Shortest Path in Binary Matrix | Medium | Array, Breadth_First_Search, Matrix, Algorithm_II_Day_8_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_5_Matrix_Related_Problems | 22 | 69.99 |
| 1090 | Largest Values From Labels | Medium | Array, Hash_Table, Sorting, Greedy, Counting | 14 | 95.96 |
| 1089 | Duplicate Zeros | Easy | Array, Two_Pointers | 2 | 67.91 |
| 1084 | Sales Analysis III | Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_10_Where | 1066 | 69.71 |
| 1081 | Smallest Subsequence of Distinct Characters | Medium | String, Greedy, Stack, Monotonic_Stack | 2 | 97.16 |
| 1080 | Insufficient Nodes in Root to Leaf Paths | Medium | Depth_First_Search, Tree, Binary_Tree | 1 | 76.12 |
| 1079 | Letter Tile Possibilities | Medium | String, Backtracking | 3 | 86.86 |
| 1078 | Occurrences After Bigram | Easy | String | 0 | 100.00 |
| 1074 | Number of Submatrices That Sum to Target | Hard | Array, Hash_Table, Matrix, Prefix_Sum | 171 | 68.35 |
| 1073 | Adding Two Negabinary Numbers | Medium | Array, Math | 1 | 100.00 |
| 1072 | Flip Columns For Maximum Number of Equal Rows | Medium | Array, Hash_Table, Matrix | 26 | 95.71 |
| 1071 | Greatest Common Divisor of Strings | Easy | String, Math | 1 | 82.09 |
| 1054 | Distant Barcodes | Medium | Array, Hash_Table, Sorting, Greedy, Heap_Priority_Queue, Counting | 45 | 64.21 |
| 1053 | Previous Permutation With One Swap | Medium | Array, Greedy | 0 | 100.00 |
| 1052 | Grumpy Bookstore Owner | Medium | Array, Sliding_Window | 4 | 70.26 |
| 1051 | Height Checker | Easy | Array, Sorting, Counting_Sort | 1 | 94.01 |
| 1050 | Actors and Directors Who Cooperated At Least Three Times | Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_10_Where | 344 | 76.48 |
| 1049 | Last Stone Weight II | Medium | Array, Dynamic_Programming | 2 | 95.98 |
| 1048 | Longest String Chain | Medium | Array, String, Hash_Table, Dynamic_Programming, Two_Pointers | 23 | 97.92 |
| 1047 | Remove All Adjacent Duplicates In String | Easy | String, Stack | 3 | 99.99 |
| 1046 | Last Stone Weight | Easy | Array, Heap_Priority_Queue, Level_1_Day_15_Heap | 2 | 73.81 |
| 1044 | Longest Duplicate Substring | Hard | String, Binary_Search, Sliding_Window, Hash_Function, Rolling_Hash, Suffix_Array | 447 | 62.53 |
| 1043 | Partition Array for Maximum Sum | Medium | Array, Dynamic_Programming | 5 | 90.43 |
| 1042 | Flower Planting With No Adjacent | Medium | Depth_First_Search, Breadth_First_Search, Graph | 19 | 89.02 |
| 1041 | Robot Bounded In Circle | Medium | String, Math, Simulation | 0 | 100.00 |
| 1040 | Moving Stones Until Consecutive II | Medium | Array, Math, Sorting, Two_Pointers | 8 | 55.00 |
| 1039 | Minimum Score Triangulation of Polygon | Medium | Array, Dynamic_Programming | 6 | 38.60 |
| 1038 | Binary Search Tree to Greater Sum Tree | Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 0 | 100.00 |
| 1037 | Valid Boomerang | Easy | Array, Math, Geometry | 0 | 100.00 |
| 1036 | Escape a Large Maze | Hard | Array, Hash_Table, Depth_First_Search, Breadth_First_Search | 115 | 73.46 |
| 1035 | Uncrossed Lines | Medium | Array, Dynamic_Programming | 5 | 85.32 |
| 1034 | Coloring A Border | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 1 | 93.85 |
| 1033 | Moving Stones Until Consecutive | Medium | Math, Brainteaser | 1 | 86.36 |
| 1032 | Stream of Characters | Hard | Array, String, Design, Trie, Data_Stream | 137 | 81.54 |
| 1031 | Maximum Sum of Two Non-Overlapping Subarrays | Medium | Array, Dynamic_Programming, Sliding_Window | 3 | 46.04 |
| 1030 | Matrix Cells in Distance Order | Easy | Array, Math, Sorting, Matrix, Geometry | 15 | 69.74 |
| 1029 | Two City Scheduling | Medium | Array, Sorting, Greedy | 1 | 97.54 |
| 1028 | Recover a Tree From Preorder Traversal | Hard | String, Depth_First_Search, Tree, Binary_Tree | 5 | 77.57 |
| 1027 | Longest Arithmetic Subsequence | Medium | Array, Hash_Table, Dynamic_Programming, Binary_Search | 47 | 98.28 |
| 1026 | Maximum Difference Between Node and Ancestor | Medium | Depth_First_Search, Tree, Binary_Tree | 1 | 65.84 |
| 1025 | Divisor Game | Easy | Dynamic_Programming, Math, Game_Theory, Brainteaser | 0 | 100.00 |
| 1024 | Video Stitching | Medium | Array, Dynamic_Programming, Greedy | 1 | 88.78 |
| 1023 | Camelcase Matching | Medium | String, Two_Pointers, Trie, String_Matching | 1 | 73.86 |
| 1022 | Sum of Root To Leaf Binary Numbers | Easy | Depth_First_Search, Tree, Binary_Tree | 3 | 28.58 |
| 1021 | Remove Outermost Parentheses | Easy | String, Stack | 4 | 75.39 |
| 1020 | Number of Enclaves | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Graph_Theory_I_Day_3_Matrix_Related_Problems | 6 | 68.24 |
| 1019 | Next Greater Node In Linked List | Medium | Array, Stack, Linked_List, Monotonic_Stack | 11 | 96.35 |
| 1018 | Binary Prefix Divisible By 5 | Easy | Array | 3 | 84.58 |
| 1017 | Convert to Base -2 | Medium | Math | 1 | 89.45 |
| 1016 | Binary String With Substrings Representing 1 To N | Medium | String | 0 | 100.00 |
| 1015 | Smallest Integer Divisible by K | Medium | Hash_Table, Math | 2 | 90.67 |
| 1014 | Best Sightseeing Pair | Medium | Array, Dynamic_Programming, Dynamic_Programming_I_Day_7 | 2 | 99.86 |
| 1013 | Partition Array Into Three Parts With Equal Sum | Easy | Array, Greedy | 1 | 100.00 |
| 1012 | Numbers With Repeated Digits | Hard | Dynamic_Programming, Math | 3 | 28.17 |
| 1011 | Capacity To Ship Packages Within D Days | Medium | Array, Binary_Search | 10 | 75.31 |
| 1010 | Pairs of Songs With Total Durations Divisible by 60 | Medium | Array, Hash_Table, Counting | 4 | 64.39 |
| 1009 | Complement of Base 10 Integer | Easy | Bit_Manipulation | 1 | 41.56 |
| 1008 | Construct Binary Search Tree from Preorder Traversal | Medium | Array, Tree, Binary_Tree, Stack, Monotonic_Stack, Binary_Search_Tree | 0 | 100.00 |
| 1007 | Minimum Domino Rotations For Equal Row | Medium | Array, Greedy | 5 | 79.64 |
| 1006 | Clumsy Factorial | Medium | Math, Stack, Simulation | 1 | 87.97 |
| 1005 | Maximize Sum Of Array After K Negations | Easy | Array, Sorting, Greedy | 3 | 81.75 |
| 1004 | Max Consecutive Ones III | Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 3 | 79.01 |
| 1003 | Check If Word Is Valid After Substitutions | Medium | String, Stack | 5 | 98.54 |
| 1002 | Find Common Characters | Easy | Array, String, Hash_Table | 4 | 83.51 |
| 1001 | Grid Illumination | Hard | Array, Hash_Table | 75 | 90.57 |
| 1000 | Minimum Cost to Merge Stones | Hard | Array, Dynamic_Programming | 1 | 99.65 |
| 0999 | Available Captures for Rook | Easy | Array, Matrix, Simulation | 0 | 100.00 |
| 0998 | Maximum Binary Tree II | Medium | Tree, Binary_Tree | 0 | 100.00 |
| 0997 | Find the Town Judge | Easy | Array, Hash_Table, Graph, Data_Structure_II_Day_19_Graph, Graph_Theory_I_Day_13_Graph_Theory | 3 | 80.64 |
| 0996 | Number of Squareful Arrays | Hard | Array, Dynamic_Programming, Math, Bit_Manipulation, Backtracking, Bitmask | 2 | 72.32 |
| 0995 | Minimum Number of K Consecutive Bit Flips | Hard | Array, Bit_Manipulation, Prefix_Sum, Sliding_Window | 6 | 93.95 |
| 0994 | Rotting Oranges | Medium | Array, Breadth_First_Search, Matrix, Algorithm_I_Day_9_Breadth_First_Search_Depth_First_Search | 3 | 74.27 |
| 0993 | Cousins in Binary Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 60.08 |
| 0992 | Subarrays with K Different Integers | Hard | Array, Hash_Table, Counting, Sliding_Window | 4 | 99.36 |
| 0991 | Broken Calculator | Medium | Math, Greedy | 0 | 100.00 |
| 0990 | Satisfiability of Equality Equations | Medium | Array, String, Graph, Union_Find | 5 | 24.79 |
| 0989 | Add to Array-Form of Integer | Easy | Array, Math, Programming_Skills_II_Day_5 | 7 | 65.92 |
| 0988 | Smallest String Starting From Leaf | Medium | String, Depth_First_Search, Tree, Binary_Tree | 4 | 58.47 |
| 0987 | Vertical Order Traversal of a Binary Tree | Hard | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 4 | 71.48 |
| 0986 | Interval List Intersections | Medium | Array, Two_Pointers, Algorithm_II_Day_4_Two_Pointers | 2 | 99.95 |
| 0985 | Sum of Even Numbers After Queries | Medium | Array, Simulation | 6 | 71.11 |
| 0984 | String Without AAA or BBB | Medium | String, Greedy | 0 | 100.00 |
| 0983 | Minimum Cost For Tickets | Medium | Array, Dynamic_Programming | 1 | 93.95 |
| 0982 | Triples with Bitwise AND Equal To Zero | Hard | Array, Hash_Table, Bit_Manipulation | 120 | 79.59 |
| 0981 | Time Based Key-Value Store | Medium | String, Hash_Table, Binary_Search, Design, Binary_Search_II_Day_16 | 239 | 72.78 |
| 0980 | Unique Paths III | Hard | Array, Matrix, Bit_Manipulation, Backtracking | 0 | 100.00 |
| 0979 | Distribute Coins in Binary Tree | Medium | Depth_First_Search, Tree, Binary_Tree | 0 | 100.00 |
| 0978 | Longest Turbulent Subarray | Medium | Array, Dynamic_Programming, Sliding_Window | 7 | 48.10 |
| 0977 | Squares of a Sorted Array | Easy | Array, Sorting, Two_Pointers, Algorithm_I_Day_2_Two_Pointers | 1 | 100.00 |
| 0976 | Largest Perimeter Triangle | Easy | Array, Math, Sorting, Greedy, Programming_Skills_I_Day_3_Conditional_Statements | 12 | 26.01 |
| 0975 | Odd Even Jump | Hard | Array, Dynamic_Programming, Stack, Ordered_Set, Monotonic_Stack | 49 | 98.38 |
| 0974 | Subarray Sums Divisible by K | Medium | Array, Hash_Table, Prefix_Sum | 3 | 99.95 |
| 0973 | K Closest Points to Origin | Medium | Array, Math, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Geometry, Quickselect, Data_Structure_II_Day_21_Heap_Priority_Queue, Programming_Skills_II_Day_8 | 4 | 98.26 |
| 0972 | Equal Rational Numbers | Hard | String, Math | 4 | 56.67 |
| 0971 | Flip Binary Tree To Match Preorder Traversal | Medium | Depth_First_Search, Tree, Binary_Tree | 0 | 100.00 |
| 0970 | Powerful Integers | Medium | Hash_Table, Math | 1 | 100.00 |
| 0969 | Pancake Sorting | Medium | Array, Sorting, Greedy, Two_Pointers | 1 | 100.00 |
| 0968 | Binary Tree Cameras | Hard | Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree | 0 | 100.00 |
| 0967 | Numbers With Same Consecutive Differences | Medium | Breadth_First_Search, Backtracking | 1 | 100.00 |
| 0966 | Vowel Spellchecker | Medium | Array, String, Hash_Table | 17 | 98.95 |
| 0965 | Univalued Binary Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 17.57 |
| 0964 | Least Operators to Express Number | Hard | Dynamic_Programming, Math | 16 | 37.78 |
| 0963 | Minimum Area Rectangle II | Medium | Array, Math, Geometry | 12 | 92.95 |
| 0962 | Maximum Width Ramp | Medium | Array, Stack, Monotonic_Stack | 6 | 90.69 |
| 0961 | N-Repeated Element in Size 2N Array | Easy | Array, Hash_Table | 1 | 87.33 |
| 0960 | Delete Columns to Make Sorted III | Hard | Array, String, Dynamic_Programming | 13 | 43.86 |
| 0959 | Regions Cut By Slashes | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 9 | 39.29 |
| 0958 | Check Completeness of a Binary Tree | Medium | Breadth_First_Search, Tree, Binary_Tree | 2 | 43.56 |
| 0957 | Prison Cells After N Days | Medium | Array, Hash_Table, Math, Bit_Manipulation | 1 | 97.82 |
| 0956 | Tallest Billboard | Hard | Array, Dynamic_Programming | 18 | 92.68 |
| 0955 | Delete Columns to Make Sorted II | Medium | Array, String, Greedy | 2 | 68.84 |
| 0954 | Array of Doubled Pairs | Medium | Array, Hash_Table, Sorting, Greedy | 18 | 97.19 |
| 0953 | Verifying an Alien Dictionary | Easy | Array, String, Hash_Table, Programming_Skills_I_Day_9_String | 0 | 100.00 |
| 0952 | Largest Component Size by Common Factor | Hard | Array, Math, Union_Find | 225 | 76.99 |
| 0951 | Flip Equivalent Binary Trees | Medium | Depth_First_Search, Tree, Binary_Tree | 0 | 100.00 |
| 0950 | Reveal Cards In Increasing Order | Medium | Array, Sorting, Simulation, Queue | 1 | 100.00 |
| 0949 | Largest Time for Given Digits | Medium | String, Enumeration | 3 | 91.21 |
| 0948 | Bag of Tokens | Medium | Array, Sorting, Greedy, Two_Pointers | 4 | 32.05 |
| 0947 | Most Stones Removed with Same Row or Column | Medium | Depth_First_Search, Graph, Union_Find | 5 | 98.95 |
| 0946 | Validate Stack Sequences | Medium | Array, Stack, Simulation | 6 | 20.54 |
| 0945 | Minimum Increment to Make Array Unique | Medium | Array, Sorting, Greedy, Counting | 9 | 95.25 |
| 0944 | Delete Columns to Make Sorted | Easy | Array, String | 11 | 59.39 |
| 0943 | Find the Shortest Superstring | Hard | Array, String, Dynamic_Programming, Bit_Manipulation, Bitmask | 16 | 100.00 |
| 0942 | DI String Match | Easy | Array, String, Math, Greedy, Two_Pointers | 4 | 33.74 |
| 0941 | Valid Mountain Array | Easy | Array | 1 | 100.00 |
| 0940 | Distinct Subsequences II | Hard | String, Dynamic_Programming | 2 | 99.41 |
| 0939 | Minimum Area Rectangle | Medium | Array, Hash_Table, Math, Sorting, Geometry | 63 | 94.31 |
| 0938 | Range Sum of BST | Easy | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 0 | 100.00 |
| 0937 | Reorder Data in Log Files | Easy | Array, String, Sorting | 4 | 92.15 |
| 0936 | Stamping The Sequence | Hard | String, Greedy, Stack, Queue | 6 | 78.43 |
| 0935 | Knight Dialer | Medium | Dynamic_Programming | 4 | 99.08 |
| 0934 | Shortest Bridge | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Graph_Theory_I_Day_6_Matrix_Related_Problems | 6 | 97.87 |
| 0933 | Number of Recent Calls | Easy | Design, Queue, Data_Stream | 16 | 97.58 |
| 0932 | Beautiful Array | Medium | Array, Math, Divide_and_Conquer | 1 | 89.66 |
| 0931 | Minimum Falling Path Sum | Medium | Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_13 | 4 | 72.19 |
| 0930 | Binary Subarrays With Sum | Medium | Array, Hash_Table, Prefix_Sum, Sliding_Window | 3 | 84.84 |
| 0929 | Unique Email Addresses | Easy | Array, String, Hash_Table | 10 | 92.59 |
| 0928 | Minimize Malware Spread II | Hard | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 41 | 31.01 |
| 0927 | Three Equal Parts | Hard | Array, Math | 2 | 90.20 |
| 0926 | Flip String to Monotone Increasing | Medium | String, Dynamic_Programming | 12 | 63.41 |
| 0925 | Long Pressed Name | Easy | String, Two_Pointers | 1 | 84.87 |
| 0924 | Minimize Malware Spread | Hard | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 10 | 47.21 |
| 0923 | 3Sum With Multiplicity | Medium | Array, Hash_Table, Sorting, Two_Pointers, Counting | 14 | 69.20 |
| 0922 | Sort Array By Parity II | Easy | Array, Sorting, Two_Pointers | 4 | 52.95 |
| 0921 | Minimum Add to Make Parentheses Valid | Medium | String, Greedy, Stack | 2 | 33.69 |
| 0920 | Number of Music Playlists | Hard | Dynamic_Programming, Math, Combinatorics | 2 | 96.55 |
| 0919 | Complete Binary Tree Inserter | Medium | Breadth_First_Search, Tree, Binary_Tree, Design | 11 | 96.06 |
| 0918 | Maximum Sum Circular Subarray | Medium | Array, Dynamic_Programming, Divide_and_Conquer, Queue, Monotonic_Queue, Dynamic_Programming_I_Day_5 | 3 | 92.86 |
| 0917 | Reverse Only Letters | Easy | String, Two_Pointers | 0 | 100.00 |
| 0916 | Word Subsets | Medium | Array, String, Hash_Table | 30 | 57.30 |
| 0915 | Partition Array into Disjoint Intervals | Medium | Array | 2 | 99.81 |
| 0914 | X of a Kind in a Deck of Cards | Easy | Array, Hash_Table, Math, Counting, Number_Theory | 16 | 19.29 |
| 0913 | Cat and Mouse | Hard | Dynamic_Programming, Math, Graph, Memoization, Topological_Sort, Game_Theory | 16 | 97.20 |
| 0912 | Sort an Array | Medium | Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Merge_Sort, Bucket_Sort, Counting_Sort, Radix_Sort | 25 | 38.15 |
| 0911 | Online Election | Medium | Array, Hash_Table, Binary_Search, Design, Binary_Search_II_Day_20 | 63 | 98.81 |
| 0910 | Smallest Range II | Medium | Array, Math, Sorting, Greedy, Programming_Skills_II_Day_13 | 10 | 73.16 |
| 0909 | Snakes and Ladders | Medium | Array, Breadth_First_Search, Matrix | 7 | 79.52 |
| 0908 | Smallest Range I | Easy | Array, Math | 2 | 88.84 |
| 0907 | Sum of Subarray Minimums | Medium | Array, Dynamic_Programming, Stack, Monotonic_Stack | 20 | 95.88 |
| 0906 | Super Palindromes | Hard | Math, Enumeration | 229 | 91.38 |
| 0905 | Sort Array By Parity | Easy | Array, Sorting, Two_Pointers | 1 | 95.51 |
| 0904 | Fruit Into Baskets | Medium | Array, Hash_Table, Sliding_Window | 6 | 95.60 |
| 0903 | Valid Permutations for DI Sequence | Hard | Dynamic_Programming | 3 | 74.00 |
| 0902 | Numbers At Most N Given Digit Set | Hard | Array, Dynamic_Programming, Math, Binary_Search | 2 | 18.29 |
| 0901 | Online Stock Span | Medium | Stack, Design, Monotonic_Stack, Data_Stream | 47 | 76.17 |
| 0900 | RLE Iterator | Medium | Array, Design, Counting, Iterator | 3 | 100.00 |
| 0899 | Orderly Queue | Hard | String, Math, Sorting | 1 | 100.00 |
| 0898 | Bitwise ORs of Subarrays | Medium | Array, Dynamic_Programming, Bit_Manipulation | 151 | 97.74 |
| 0897 | Increasing Order Search Tree | Easy | Depth_First_Search, Tree, Binary_Tree, Stack, Binary_Search_Tree | 0 | 100.00 |
| 0896 | Monotonic Array | Easy | Array, Programming_Skills_II_Day_1 | 2 | 86.21 |
| 0895 | Maximum Frequency Stack | Hard | Hash_Table, Stack, Design, Ordered_Set | 43 | 65.81 |
| 0894 | All Possible Full Binary Trees | Medium | Dynamic_Programming, Tree, Binary_Tree, Recursion, Memoization | 3 | 68.56 |
| 0893 | Groups of Special-Equivalent Strings | Medium | Array, String, Hash_Table | 3 | 99.09 |
| 0892 | Surface Area of 3D Shapes | Easy | Array, Math, Matrix, Geometry | 2 | 98.73 |
| 0891 | Sum of Subsequence Widths | Hard | Array, Math, Sorting | 56 | 30.61 |
| 0890 | Find and Replace Pattern | Medium | Array, String, Hash_Table | 1 | 97.13 |
| 0889 | Construct Binary Tree from Preorder and Postorder Traversal | Medium | Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer | 1 | 91.04 |
| 0888 | Fair Candy Swap | Easy | Array, Hash_Table, Sorting, Binary_Search | 18 | 68.20 |
| 0887 | Super Egg Drop | Hard | Dynamic_Programming, Math, Binary_Search | 0 | 100.00 |
| 0886 | Possible Bipartition | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, Graph_Theory_I_Day_14_Graph_Theory | 20 | 80.12 |
| 0885 | Spiral Matrix III | Medium | Array, Matrix, Simulation | 3 | 95.45 |
| 0884 | Uncommon Words from Two Sentences | Easy | String, Hash_Table | 1 | 100.00 |
| 0883 | Projection Area of 3D Shapes | Easy | Array, Math, Matrix, Geometry | 1 | 100.00 |
| 0882 | Reachable Nodes In Subdivided Graph | Hard | Heap_Priority_Queue, Graph, Shortest_Path | 28 | 95.85 |
| 0881 | Boats to Save People | Medium | Array, Sorting, Greedy, Two_Pointers | 20 | 61.11 |
| 0880 | Decoded String at Index | Medium | String, Stack | 0 | 100.00 |
| 0879 | Profitable Schemes | Hard | Array, Dynamic_Programming | 80 | 43.42 |
| 0878 | Nth Magical Number | Hard | Math, Binary_Search | 0 | 100.00 |
| 0877 | Stone Game | Medium | Array, Dynamic_Programming, Math, Game_Theory | 0 | 100.00 |
| 0876 | Middle of the Linked List | Easy | Two_Pointers, Linked_List, Algorithm_I_Day_5_Two_Pointers, Programming_Skills_I_Day_10_Linked_List_and_Tree, Level_1_Day_4_Linked_List | 0 | 100.00 |
| 0875 | Koko Eating Bananas | Medium | Array, Binary_Search, Binary_Search_II_Day_4 | 15 | 91.32 |
| 0874 | Walking Robot Simulation | Medium | Array, Simulation | 16 | 93.75 |
| 0873 | Length of Longest Fibonacci Subsequence | Medium | Array, Hash_Table, Dynamic_Programming | 120 | 92.64 |
| 0872 | Leaf-Similar Trees | Easy | Depth_First_Search, Tree, Binary_Tree | 0 | 100.00 |
| 0871 | Minimum Number of Refueling Stops | Hard | Array, Dynamic_Programming, Greedy, Heap_Priority_Queue | 3 | 88.52 |
| 0870 | Advantage Shuffle | Medium | Array, Sorting, Greedy | 188 | 28.01 |
| 0869 | Reordered Power of 2 | Medium | Math, Sorting, Counting, Enumeration | 9 | 25.97 |
| 0868 | Binary Gap | Easy | Bit_Manipulation | 1 | 82.94 |
| 0867 | Transpose Matrix | Easy | Array, Matrix, Simulation | 1 | 60.83 |
| 0866 | Prime Palindrome | Medium | Math | 2 | 84.68 |
| 0865 | Smallest Subtree with all the Deepest Nodes | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00 |
| 0864 | Shortest Path to Get All Keys | Hard | Breadth_First_Search, Bit_Manipulation | 12 | 100.00 |
| 0863 | All Nodes Distance K in Binary Tree | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 12 | 80.25 |
| 0862 | Shortest Subarray with Sum at Least K | Hard | Array, Binary_Search, Heap_Priority_Queue, Prefix_Sum, Sliding_Window, Queue, Monotonic_Queue | 53 | 74.73 |
| 0861 | Score After Flipping Matrix | Medium | Array, Greedy, Matrix, Bit_Manipulation | 1 | 70.04 |
| 0860 | Lemonade Change | Easy | Array, Greedy, Programming_Skills_II_Day_17 | 2 | 90.84 |
| 0859 | Buddy Strings | Easy | String, Hash_Table | 2 | 85.33 |
| 0858 | Mirror Reflection | Medium | Math, Geometry | 0 | 100.00 |
| 0857 | Minimum Cost to Hire K Workers | Hard | Array, Sorting, Greedy, Heap_Priority_Queue | 26 | 85.40 |
| 0856 | Score of Parentheses | Medium | String, Stack | 1 | 67.71 |
| 0855 | Exam Room | Medium | Design, Ordered_Set | 19 | 74.01 |
| 0854 | K-Similar Strings | Hard | String, Breadth_First_Search | 2 | 99.58 |
| 0853 | Car Fleet | Medium | Array, Sorting, Stack, Monotonic_Stack | 118 | 74.11 |
| 0852 | Peak Index in a Mountain Array | Easy | Array, Binary_Search, Binary_Search_I_Day_2 | 0 | 100.00 |
| 0851 | Loud and Rich | Medium | Array, Depth_First_Search, Graph, Topological_Sort | 3 | 99.67 |
| 0850 | Rectangle Area II | Hard | Array, Ordered_Set, Segment_Tree, Line_Sweep | 4 | 97.00 |
| 0849 | Maximize Distance to Closest Person | Medium | Array | 1 | 100.00 |
| 0848 | Shifting Letters | Medium | Array, String | 11 | 88.11 |
| 0847 | Shortest Path Visiting All Nodes | Hard | Dynamic_Programming, Breadth_First_Search, Bit_Manipulation, Graph, Bitmask, Graph_Theory_I_Day_10_Standard_Traversal | 14 | 78.72 |
| 0846 | Hand of Straights | Medium | Array, Hash_Table, Sorting, Greedy | 19 | 96.16 |
| 0845 | Longest Mountain in Array | Medium | Array, Dynamic_Programming, Two_Pointers, Enumeration | 2 | 94.37 |
| 0844 | Backspace String Compare | Easy | String, Two_Pointers, Stack, Simulation, Algorithm_II_Day_4_Two_Pointers, Level_1_Day_14_Stack | 0 | 100.00 |
| 0843 | Guess the Word | Hard | Array, String, Math, Game_Theory, Interactive | 2 | 68.01 |
| 0842 | Split Array into Fibonacci Sequence | Medium | String, Backtracking | 4 | 62.81 |
| 0841 | Keys and Rooms | Medium | Depth_First_Search, Breadth_First_Search, Graph, Data_Structure_II_Day_19_Graph, Graph_Theory_I_Day_7_Standard_Traversal | 3 | 51.54 |
| 0840 | Magic Squares In Grid | Medium | Array, Math, Matrix | 0 | 100.00 |
| 0839 | Similar String Groups | Hard | Array, String, Depth_First_Search, Breadth_First_Search, Union_Find | 15 | 80.39 |
| 0838 | Push Dominoes | Medium | String, Dynamic_Programming, Two_Pointers | 21 | 73.78 |
| 0837 | New 21 Game | Medium | Dynamic_Programming, Math, Sliding_Window, Probability_and_Statistics | 5 | 77.70 |
| 0836 | Rectangle Overlap | Easy | Math, Geometry | 0 | 100.00 |
| 0835 | Image Overlap | Medium | Array, Matrix | 6 | 98.73 |
| 0834 | Sum of Distances in Tree | Hard | Dynamic_Programming, Depth_First_Search, Tree, Graph | 52 | 91.09 |
| 0833 | Find And Replace in String | Medium | Array, String, Sorting | 3 | 70.10 |
| 0832 | Flipping an Image | Easy | Array, Matrix, Two_Pointers, Simulation | 1 | 68.54 |
| 0831 | Masking Personal Information | Medium | String | 1 | 84.30 |
| 0830 | Positions of Large Groups | Easy | String | 2 | 80.94 |
| 0829 | Consecutive Numbers Sum | Hard | Math, Enumeration | 3 | 93.37 |
| 0828 | Count Unique Characters of All Substrings of a Given String | Hard | String, Hash_Table, Dynamic_Programming | 101 | 18.42 |
| 0827 | Making A Large Island | Hard | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 147 | 74.37 |
| 0826 | Most Profit Assigning Work | Medium | Array, Sorting, Greedy, Binary_Search, Two_Pointers, Binary_Search_II_Day_11 | 21 | 83.83 |
| 0825 | Friends Of Appropriate Ages | Medium | Array, Sorting, Binary_Search, Two_Pointers | 3 | 87.71 |
| 0824 | Goat Latin | Easy | String | 2 | 94.82 |
| 0823 | Binary Trees With Factors | Medium | Array, Hash_Table, Dynamic_Programming | 28 | 80.54 |
| 0822 | Card Flipping Game | Medium | Array, Hash_Table | 2 | 96.55 |
| 0821 | Shortest Distance to a Character | Easy | Array, String, Two_Pointers | 3 | 42.73 |
| 0820 | Short Encoding of Words | Medium | Array, String, Hash_Table, Trie | 35 | 49.44 |
| 0819 | Most Common Word | Easy | String, Hash_Table, Counting | 10 | 88.85 |
| 0818 | Race Car | Hard | Dynamic_Programming | 9 | 82.90 |
| 0817 | Linked List Components | Medium | Hash_Table, Linked_List | 7 | 76.10 |
| 0816 | Ambiguous Coordinates | Medium | String, Backtracking | 4 | 98.95 |
| 0815 | Bus Routes | Hard | Array, Hash_Table, Breadth_First_Search | 49 | 89.11 |
| 0814 | Binary Tree Pruning | Medium | Depth_First_Search, Tree, Binary_Tree | 0 | 100.00 |
| 0813 | Largest Sum of Averages | Medium | Array, Dynamic_Programming | 4 | 97.01 |
| 0812 | Largest Triangle Area | Easy | Array, Math, Geometry | 5 | 92.04 |
| 0811 | Subdomain Visit Count | Medium | Array, String, Hash_Table, Counting | 5 | 100.00 |
| 0810 | Chalkboard XOR Game | Hard | Array, Math, Bit_Manipulation, Game_Theory, Brainteaser | 0 | 100.00 |
| 0809 | Expressive Words | Medium | Array, String, Two_Pointers | 2 | 86.09 |
| 0808 | Soup Servings | Medium | Dynamic_Programming, Math, Probability_and_Statistics | 1 | 96.04 |
| 0807 | Max Increase to Keep City Skyline | Medium | Array, Greedy, Matrix | 2 | 23.49 |
| 0806 | Number of Lines To Write String | Easy | Array, String | 1 | 65.23 |
| 0805 | Split Array With Same Average | Hard | Array, Dynamic_Programming, Math, Bit_Manipulation, Bitmask | 1323 | 22.41 |
| 0804 | Unique Morse Code Words | Easy | Array, String, Hash_Table | 2 | 89.27 |
| 0803 | Bricks Falling When Hit | Hard | Array, Matrix, Union_Find | 12 | 94.92 |
| 0802 | Find Eventual Safe States | Medium | Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Graph_Theory_I_Day_9_Standard_Traversal | 7 | 74.93 |
| 0801 | Minimum Swaps To Make Sequences Increasing | Hard | Array, Dynamic_Programming | 6 | 71.94 |
| 0799 | Champagne Tower | Medium | Dynamic_Programming | 4 | 92.45 |
| 0798 | Smallest Rotation with Highest Score | Hard | Array, Prefix_Sum | 9 | 78.22 |
| 0797 | All Paths From Source to Target | Medium | Depth_First_Search, Breadth_First_Search, Graph, Backtracking, Algorithm_II_Day_8_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_7_Standard_Traversal | 2 | 90.53 |
| 0796 | Rotate String | Easy | String, String_Matching | 0 | 100.00 |
| 0795 | Number of Subarrays with Bounded Maximum | Medium | Array, Two_Pointers | 2 | 100.00 |
| 0794 | Valid Tic-Tac-Toe State | Medium | Array, String | 0 | 100.00 |
| 0793 | Preimage Size of Factorial Zeroes Function | Hard | Math, Binary_Search | 0 | 100.00 |
| 0792 | Number of Matching Subsequences | Medium | String, Hash_Table, Sorting, Trie | 92 | 84.26 |
| 0791 | Custom Sort String | Medium | String, Hash_Table, Sorting | 1 | 78.82 |
| 0790 | Domino and Tromino Tiling | Medium | Dynamic_Programming | 0 | 100.00 |
| 0789 | Escape The Ghosts | Medium | Array, Math | 0 | 100.00 |
| 0788 | Rotated Digits | Medium | Dynamic_Programming, Math | 2 | 98.95 |
| 0787 | Cheapest Flights Within K Stops | Medium | Dynamic_Programming, Depth_First_Search, Breadth_First_Search, Heap_Priority_Queue, Graph, Shortest_Path | 9 | 53.93 |
| 0786 | K-th Smallest Prime Fraction | Medium | Array, Binary_Search, Heap_Priority_Queue | 2 | 96.60 |
| 0785 | Is Graph Bipartite? | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, Graph_Theory_I_Day_14_Graph_Theory | 0 | 100.00 |
| 0784 | Letter Case Permutation | Medium | String, Bit_Manipulation, Backtracking, Algorithm_I_Day_11_Recursion_Backtracking | 10 | 40.38 |
| 0783 | Minimum Distance Between BST Nodes | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 0 | 100.00 |
| 0782 | Transform to Chessboard | Hard | Array, Math, Matrix, Bit_Manipulation | 2 | 53.57 |
| 0781 | Rabbits in Forest | Medium | Array, Hash_Table, Math, Greedy | 1 | 99.15 |
| 0780 | Reaching Points | Hard | Math | 0 | 100.00 |
| 0779 | K-th Symbol in Grammar | Medium | Math, Bit_Manipulation, Recursion | 0 | 100.00 |
| 0778 | Swim in Rising Water | Hard | Array, Depth_First_Search, Breadth_First_Search, Binary_Search, Matrix, Heap_Priority_Queue, Union_Find | 13 | 69.75 |
| 0777 | Swap Adjacent in LR String | Medium | String, Two_Pointers | 4 | 85.13 |
| 0775 | Global and Local Inversions | Medium | Array, Math | 1 | 99.74 |
| 0773 | Sliding Puzzle | Hard | Array, Breadth_First_Search, Matrix | 9 | 81.80 |
| 0771 | Jewels and Stones | Easy | String, Hash_Table | 1 | 91.74 |
| 0770 | Basic Calculator IV | Hard | String, Hash_Table, Math, Stack, Recursion | 8 | 96.92 |
| 0769 | Max Chunks To Make Sorted | Medium | Array, Sorting, Greedy, Stack, Monotonic_Stack | 0 | 100.00 |
| 0768 | Max Chunks To Make Sorted II | Hard | Array, Sorting, Greedy, Stack, Monotonic_Stack | 1 | 87.58 |
| 0767 | Reorganize String | Medium | String, Hash_Table, Sorting, Greedy, Heap_Priority_Queue, Counting | 1 | 94.60 |
| 0766 | Toeplitz Matrix | Easy | Array, Matrix | 1 | 83.45 |
| 0765 | Couples Holding Hands | Hard | Depth_First_Search, Greedy, Breadth_First_Search, Graph, Union_Find | 0 | 100.00 |
| 0764 | Largest Plus Sign | Medium | Array, Dynamic_Programming | 39 | 87.23 |
| 0763 | Partition Labels | Medium | Top_100_Liked_Questions, String, Hash_Table, Greedy, Two_Pointers, Data_Structure_II_Day_7_String | 1 | 100.00 |
| 0762 | Prime Number of Set Bits in Binary Representation | Easy | Math, Bit_Manipulation | 4 | 98.39 |
| 0761 | Special Binary String | Hard | String, Recursion | 1 | 100.00 |
| 0757 | Set Intersection Size At Least Two | Hard | Array, Sorting, Greedy | 4 | 100.00 |
| 0756 | Pyramid Transition Matrix | Medium | Depth_First_Search, Breadth_First_Search, Bit_Manipulation | 129 | 82.94 |
| 0754 | Reach a Number | Medium | Math, Binary_Search | 0 | 100.00 |
| 0753 | Cracking the Safe | Hard | Depth_First_Search, Graph, Eulerian_Circuit | 4 | 96.44 |
| 0752 | Open the Lock | Medium | Array, String, Hash_Table, Breadth_First_Search, Graph_Theory_I_Day_12_Breadth_First_Search | 72 | 91.06 |
| 0749 | Contain Virus | Hard | Array, Depth_First_Search, Breadth_First_Search, Matrix, Simulation | 23 | 37.62 |
| 0748 | Shortest Completing Word | Easy | Array, String, Hash_Table | 3 | 93.75 |
| 0747 | Largest Number At Least Twice of Others | Easy | Array, Sorting | 0 | 100.00 |
| 0746 | Min Cost Climbing Stairs | Easy | Array, Dynamic_Programming, Dynamic_Programming_I_Day_2, Level_1_Day_11_Dynamic_Programming | 1 | 86.38 |
| 0745 | Prefix and Suffix Search | Hard | String, Design, Trie | 366 | 76.15 |
| 0744 | Find Smallest Letter Greater Than Target | Easy | Array, Binary_Search, Binary_Search_I_Day_4 | 0 | 100.00 |
| 0743 | Network Delay Time | Medium | Depth_First_Search, Breadth_First_Search, Heap_Priority_Queue, Graph, Shortest_Path | 3 | 99.87 |
| 0741 | Cherry Pickup | Hard | Array, Dynamic_Programming, Matrix | 11 | 99.40 |
| 0740 | Delete and Earn | Medium | Array, Hash_Table, Dynamic_Programming, Dynamic_Programming_I_Day_3 | 4 | 77.68 |
| 0739 | Daily Temperatures | Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, Programming_Skills_II_Day_6 | 10 | 94.99 |
| 0738 | Monotone Increasing Digits | Medium | Math, Greedy | 0 | 100.00 |
| 0736 | Parse Lisp Expression | Hard | String, Hash_Table, Stack, Recursion | 4 | 95.58 |
| 0735 | Asteroid Collision | Medium | Array, Stack | 2 | 99.59 |
| 0733 | Flood Fill | Easy | Array, Depth_First_Search, Breadth_First_Search, Matrix, Algorithm_I_Day_7_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_1_Matrix_Related_Problems, Level_1_Day_9_Graph/BFS/DFS | 1 | 85.36 |
| 0732 | My Calendar III | Hard | Binary_Search, Design, Ordered_Set, Segment_Tree | 40 | 95.37 |
| 0731 | My Calendar II | Medium | Binary_Search, Design, Ordered_Set, Segment_Tree | 27 | 97.74 |
| 0730 | Count Different Palindromic Subsequences | Hard | String, Dynamic_Programming | 45 | 92.84 |
| 0729 | My Calendar I | Medium | Binary_Search, Design, Ordered_Set, Segment_Tree, Programming_Skills_II_Day_20 | 17 | 97.23 |
| 0728 | Self Dividing Numbers | Easy | Math | 1 | 100.00 |
| 0726 | Number of Atoms | Hard | String, Hash_Table, Sorting, Stack | 4 | 87.22 |
| 0725 | Split Linked List in Parts | Medium | Linked_List | 1 | 30.85 |
| 0724 | Find Pivot Index | Easy | Array, Prefix_Sum, Level_1_Day_1_Prefix_Sum | 2 | 69.67 |
| 0722 | Remove Comments | Medium | Array, String | 1 | 80.24 |
| 0721 | Accounts Merge | Medium | Array, String, Depth_First_Search, Breadth_First_Search, Union_Find | 71 | 31.21 |
| 0720 | Longest Word in Dictionary | Medium | Array, String, Hash_Table, Sorting, Trie | 13 | 84.66 |
| 0719 | Find K-th Smallest Pair Distance | Hard | Array, Sorting, Binary_Search, Two_Pointers | 8 | 81.40 |
| 0718 | Maximum Length of Repeated Subarray | Medium | Array, Dynamic_Programming, Binary_Search, Sliding_Window, Hash_Function, Rolling_Hash | 58 | 77.21 |
| 0717 | 1-bit and 2-bit Characters | Easy | Array | 0 | 100.00 |
| 0715 | Range Module | Hard | Design, Ordered_Set, Segment_Tree | 35 | 98.62 |
| 0714 | Best Time to Buy and Sell Stock with Transaction Fee | Medium | Array, Dynamic_Programming, Greedy, Dynamic_Programming_I_Day_8 | 4 | 78.57 |
| 0713 | Subarray Product Less Than K | Medium | Array, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Programming_Skills_II_Day_12 | 8 | 39.00 |
| 0712 | Minimum ASCII Delete Sum for Two Strings | Medium | String, Dynamic_Programming | 18 | 91.28 |
| 0710 | Random Pick with Blacklist | Hard | Hash_Table, Math, Sorting, Binary_Search, Randomized | 56 | 74.41 |
| 0709 | To Lower Case | Easy | String, Programming_Skills_I_Day_9_String | 1 | 71.74 |
| 0707 | Design Linked List | Medium | Design, Linked_List, Data_Structure_II_Day_12_Linked_List, Programming_Skills_II_Day_19 | 10 | 70.60 |
| 0706 | Design HashMap | Easy | Array, Hash_Table, Design, Linked_List, Hash_Function, Data_Structure_II_Day_2_Array | 13 | 95.71 |
| 0705 | Design HashSet | Easy | Array, Hash_Table, Design, Linked_List, Hash_Function | 29 | 57.06 |
| 0704 | Binary Search | Easy | Array, Binary_Search, Algorithm_I_Day_1_Binary_Search, Binary_Search_I_Day_1, Level_1_Day_7_Binary_Search | 0 | 100.00 |
| 0703 | Kth Largest Element in a Stream | Easy | Tree, Binary_Tree, Design, Heap_Priority_Queue, Binary_Search_Tree, Data_Stream | 22 | 52.43 |
| 0701 | Insert into a Binary Search Tree | Medium | Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_I_Day_13_Tree | 0 | 100.00 |
| 0700 | Search in a Binary Search Tree | Easy | Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_I_Day_13_Tree | 0 | 100.00 |
| 0699 | Falling Squares | Hard | Array, Ordered_Set, Segment_Tree | 8 | 91.03 |
| 0698 | Partition to K Equal Sum Subsets | Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask, Memoization | 24 | 85.43 |
| 0697 | Degree of an Array | Easy | Array, Hash_Table | 14 | 93.19 |
| 0696 | Count Binary Substrings | Easy | String, Two_Pointers | 5 | 100.00 |
| 0695 | Max Area of Island | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_I_Day_7_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_2_Matrix_Related_Problems | 3 | 76.79 |
| 0693 | Binary Number with Alternating Bits | Easy | Bit_Manipulation | 0 | 100.00 |
| 0692 | Top K Frequent Words | Medium | String, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Trie, Bucket_Sort, Level_1_Day_15_Heap | 11 | 38.54 |
| 0691 | Stickers to Spell Word | Hard | Array, String, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 34 | 70.23 |
| 0690 | Employee Importance | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search | 7 | 77.84 |
| 0689 | Maximum Sum of 3 Non-Overlapping Subarrays | Hard | Array, Dynamic_Programming | 5 | 64.24 |
| 0688 | Knight Probability in Chessboard | Medium | Dynamic_Programming | 7 | 85.13 |
| 0687 | Longest Univalue Path | Medium | Depth_First_Search, Tree, Binary_Tree | 3 | 79.43 |
| 0686 | Repeated String Match | Medium | String, String_Matching | 7 | 94.56 |
| 0685 | Redundant Connection II | Hard | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 1 | 96.65 |
| 0684 | Redundant Connection | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 0 | 100.00 |
| 0682 | Baseball Game | Easy | Array, Stack, Simulation | 4 | 57.60 |
| 0680 | Valid Palindrome II | Easy | String, Greedy, Two_Pointers | 10 | 61.31 |
| 0679 | 24 Game | Hard | Array, Math, Backtracking | 3 | 87.01 |
| 0678 | Valid Parenthesis String | Medium | String, Dynamic_Programming, Greedy, Stack | 0 | 100.00 |
| 0677 | Map Sum Pairs | Medium | String, Hash_Table, Design, Trie | 17 | 70.10 |
| 0676 | Implement Magic Dictionary | Medium | String, Hash_Table, Design, Trie | 38 | 86.83 |
| 0675 | Cut Off Trees for Golf Event | Hard | Array, Breadth_First_Search, Matrix, Heap_Priority_Queue | 417 | 73.86 |
| 0674 | Longest Continuous Increasing Subsequence | Easy | Array | 2 | 40.35 |
| 0673 | Number of Longest Increasing Subsequence | Medium | Array, Dynamic_Programming, Segment_Tree, Binary_Indexed_Tree, Algorithm_II_Day_16_Dynamic_Programming | 25 | 68.75 |
| 0672 | Bulb Switcher II | Medium | Math, Depth_First_Search, Breadth_First_Search, Bit_Manipulation | 0 | 100.00 |
| 0671 | Second Minimum Node In a Binary Tree | Easy | Depth_First_Search, Tree, Binary_Tree | 0 | 100.00 |
| 0670 | Maximum Swap | Medium | Math, Greedy | 1 | 80.14 |
| 0669 | Trim a Binary Search Tree | Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 0 | 100.00 |
| 0668 | Kth Smallest Number in Multiplication Table | Hard | Math, Binary_Search | 12 | 97.84 |
| 0667 | Beautiful Arrangement II | Medium | Array, Math | 1 | 84.62 |
| 0665 | Non-decreasing Array | Medium | Array | 1 | 86.75 |
| 0664 | Strange Printer | Hard | String, Dynamic_Programming | 24 | 76.35 |
| 0662 | Maximum Width of Binary Tree | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 2 | 78.93 |
| 0661 | Image Smoother | Easy | Array, Matrix | 2 | 100.00 |
| 0659 | Split Array into Consecutive Subsequences | Medium | Array, Hash_Table, Greedy, Heap_Priority_Queue | 4 | 95.88 |
| 0658 | Find K Closest Elements | Medium | Array, Sorting, Binary_Search, Two_Pointers, Heap_Priority_Queue, Binary_Search_II_Day_2 | 3 | 99.20 |
| 0657 | Robot Return to Origin | Easy | String, Simulation | 3 | 99.87 |
| 0655 | Print Binary Tree | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 98.04 |
| 0654 | Maximum Binary Tree | Medium | Array, Tree, Binary_Tree, Stack, Monotonic_Stack, Divide_and_Conquer | 3 | 84.36 |
| 0653 | Two Sum IV - Input is a BST | Easy | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Two_Pointers, Binary_Search_Tree, Data_Structure_I_Day_14_Tree | 5 | 74.23 |
| 0652 | Find Duplicate Subtrees | Medium | Hash_Table, Depth_First_Search, Tree, Binary_Tree | 32 | 60.16 |
| 0650 | 2 Keys Keyboard | Medium | Dynamic_Programming, Math | 0 | 100.00 |
| 0649 | Dota2 Senate | Medium | String, Greedy, Queue | 4 | 95.00 |
| 0648 | Replace Words | Medium | Array, String, Hash_Table, Trie | 14 | 87.12 |
| 0647 | Palindromic Substrings | Medium | Top_100_Liked_Questions, String, Dynamic_Programming | 2 | 98.77 |
| 0646 | Maximum Length of Pair Chain | Medium | Array, Dynamic_Programming, Sorting, Greedy | 11 | 88.84 |
| 0645 | Set Mismatch | Easy | Array, Hash_Table, Sorting, Bit_Manipulation | 2 | 97.45 |
| 0643 | Maximum Average Subarray I | Easy | Array, Sliding_Window | 5 | 74.81 |
| 0641 | Design Circular Deque | Medium | Array, Design, Linked_List, Queue | 3 | 100.00 |
| 0640 | Solve the Equation | Medium | String, Math, Simulation | 5 | 69.29 |
| 0639 | Decode Ways II | Hard | String, Dynamic_Programming | 22 | 93.12 |
| 0638 | Shopping Offers | Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask, Memoization | 6 | 71.06 |
| 0637 | Average of Levels in Binary Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 2 | 89.32 |
| 0636 | Exclusive Time of Functions | Medium | Array, Stack | 17 | 76.73 |
| 0633 | Sum of Square Numbers | Medium | Math, Binary_Search, Two_Pointers, Binary_Search_I_Day_10 | 4 | 82.92 |
| 0632 | Smallest Range Covering Elements from K Lists | Hard | Array, Hash_Table, Sorting, Greedy, Heap_Priority_Queue, Sliding_Window | 31 | 87.39 |
| 0630 | Course Schedule III | Hard | Array, Greedy, Heap_Priority_Queue | 53 | 58.83 |
| 0629 | K Inverse Pairs Array | Hard | Dynamic_Programming | 19 | 94.44 |
| 0628 | Maximum Product of Three Numbers | Easy | Array, Math, Sorting | 2 | 99.90 |
| 0627 | Swap Salary | Easy | Database, SQL_I_Day_2_Select_and_Order | 191 | 96.89 |
| 0626 | Exchange Seats | Medium | Database | 274 | 65.75 |
| 0623 | Add One Row to Tree | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00 |
| 0622 | Design Circular Queue | Medium | Array, Design, Linked_List, Queue, Programming_Skills_II_Day_20 | 3 | 100.00 |
| 0621 | Task Scheduler | Medium | Array, Hash_Table, Sorting, Greedy, Heap_Priority_Queue, Counting | 3 | 84.32 |
| 0620 | Not Boring Movies | Easy | Database | 258 | 28.33 |
| 0617 | Merge Two Binary Trees | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Algorithm_I_Day_8_Breadth_First_Search_Depth_First_Search | 1 | 72.47 |
| 0611 | Valid Triangle Number | Medium | Array, Sorting, Greedy, Binary_Search, Two_Pointers, Binary_Search_II_Day_1 | 10 | 100.00 |
| 0609 | Find Duplicate File in System | Medium | Array, String, Hash_Table | 20 | 97.68 |
| 0608 | Tree Node | Medium | LeetCode_Curated_SQL_70, Database, SQL_I_Day_4_Union_and_Select | 347 | 95.17 |
| 0607 | Sales Person | Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_6_Union | 1046 | 86.04 |
| 0606 | Construct String from Binary Tree | Easy | String, Depth_First_Search, Tree, Binary_Tree | 1 | 100.00 |
| 0605 | Can Place Flowers | Easy | Array, Greedy | 1 | 96.77 |
| 0601 | Human Traffic of Stadium | Hard | Database | 328 | 62.41 |
| 0600 | Non-negative Integers without Consecutive Ones | Hard | Dynamic_Programming | 2 | 74.62 |
| 0599 | Minimum Index Sum of Two Lists | Easy | Array, String, Hash_Table | 7 | 93.97 |
| 0598 | Range Addition II | Easy | Array, Math | 0 | 100.00 |
| 0596 | Classes More Than 5 Students | Easy | Database | 243 | 92.65 |
| 0595 | Big Countries | Easy | Database, SQL_I_Day_1_Select | 241 | 92.61 |
| 0594 | Longest Harmonious Subsequence | Easy | Array, Hash_Table, Sorting | 11 | 99.77 |
| 0593 | Valid Square | Medium | Math, Geometry | 1 | 97.14 |
| 0592 | Fraction Addition and Subtraction | Medium | String, Math, Simulation | 4 | 98.58 |
| 0591 | Tag Validator | Hard | String, Stack | 3 | 70.89 |
| 0590 | N-ary Tree Postorder Traversal | Easy | Depth_First_Search, Tree, Stack | 0 | 100.00 |
| 0589 | N-ary Tree Preorder Traversal | Easy | Depth_First_Search, Tree, Stack, Programming_Skills_I_Day_5_Function, Level_1_Day_6_Tree | 2 | 54.35 |
| 0587 | Erect the Fence | Hard | Array, Math, Geometry | 10 | 87.50 |
| 0586 | Customer Placing the Largest Number of Orders | Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_8_Function | 392 | 90.54 |
| 0584 | Find Customer Referee | Easy | Database, SQL_I_Day_1_Select | 505 | 43.87 |
| 0583 | Delete Operation for Two Strings | Medium | String, Dynamic_Programming, Algorithm_II_Day_17_Dynamic_Programming | 12 | 73.04 |
| 0581 | Shortest Unsorted Continuous Subarray | Medium | Array, Sorting, Greedy, Two_Pointers, Stack, Monotonic_Stack | 1 | 98.19 |
| 0576 | Out of Boundary Paths | Medium | Dynamic_Programming | 7 | 74.13 |
| 0575 | Distribute Candies | Easy | Array, Hash_Table | 64 | 40.90 |
| 0572 | Subtree of Another Tree | Easy | Depth_First_Search, Tree, Binary_Tree, Hash_Function, String_Matching, Algorithm_II_Day_7_Breadth_First_Search_Depth_First_Search | 0 | 100.00 |
| 0567 | Permutation in String | Medium | String, Hash_Table, Two_Pointers, Sliding_Window, Algorithm_I_Day_6_Sliding_Window | 4 | 95.23 |
| 0566 | Reshape the Matrix | Easy | Array, Matrix, Simulation, Data_Structure_I_Day_4_Array, Programming_Skills_I_Day_7_Array | 1 | 84.34 |
| 0565 | Array Nesting | Medium | Array, Depth_First_Search | 4 | 98.54 |
| 0564 | Find the Closest Palindrome | Hard | String, Math | 1 | 100.00 |
| 0563 | Binary Tree Tilt | Easy | Depth_First_Search, Tree, Binary_Tree | 0 | 100.00 |
| 0561 | Array Partition I | Easy | Array, Sorting, Greedy, Counting_Sort | 18 | 31.77 |
| 0560 | Subarray Sum Equals K | Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Data_Structure_II_Day_5_Array | 18 | 89.51 |
| 0559 | Maximum Depth of N-ary Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree | 1 | 78.18 |
| 0558 | Logical OR of Two Binary Grids Represented as Quad-Trees | Medium | Tree, Divide_and_Conquer | 0 | 100.00 |
| 0557 | Reverse Words in a String III | Easy | String, Two_Pointers, Algorithm_I_Day_4_Two_Pointers | 5 | 88.09 |
| 0556 | Next Greater Element III | Medium | String, Math, Two_Pointers, Programming_Skills_II_Day_10 | 0 | 100.00 |
| 0554 | Brick Wall | Medium | Array, Hash_Table | 13 | 75.64 |
| 0553 | Optimal Division | Medium | Array, Dynamic_Programming, Math | 1 | 96.63 |
| 0552 | Student Attendance Record II | Hard | Dynamic_Programming | 8 | 99.21 |
| 0551 | Student Attendance Record I | Easy | String | 1 | 68.22 |
| 0547 | Number of Provinces | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_8_Standard_Traversal | 1 | 94.56 |
| 0546 | Remove Boxes | Hard | Array, Dynamic_Programming, Memoization | 86 | 60.93 |
| 0543 | Diameter of Binary Tree | Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree | 1 | 55.16 |
| 0542 | 01 Matrix | Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix, Algorithm_I_Day_9_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_5_Matrix_Related_Problems | 6 | 96.78 |
| 0541 | Reverse String II | Easy | String, Two_Pointers | 1 | 93.18 |
| 0540 | Single Element in a Sorted Array | Medium | Array, Binary_Search, Binary_Search_II_Day_9 | 0 | 100.00 |
| 0539 | Minimum Time Difference | Medium | Array, String, Math, Sorting | 3 | 93.52 |
| 0538 | Convert BST to Greater Tree | Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 1 | 83.78 |
| 0537 | Complex Number Multiplication | Medium | String, Math, Simulation | 7 | 62.22 |
| 0535 | Encode and Decode TinyURL | Medium | String, Hash_Table, Design, Hash_Function | 4 | 65.42 |
| 0532 | K-diff Pairs in an Array | Medium | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 14 | 49.69 |
| 0530 | Minimum Absolute Difference in BST | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 0 | 100.00 |
| 0529 | Minesweeper | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 0 | 100.00 |
| 0528 | Random Pick with Weight | Medium | Math, Binary_Search, Prefix_Sum, Randomized, Binary_Search_II_Day_13 | 29 | 83.26 |
| 0526 | Beautiful Arrangement | Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 3 | 98.99 |
| 0525 | Contiguous Array | Medium | Array, Hash_Table, Prefix_Sum | 17 | 92.02 |
| 0524 | Longest Word in Dictionary through Deleting | Medium | Array, String, Sorting, Two_Pointers | 10 | 97.43 |
| 0523 | Continuous Subarray Sum | Medium | Array, Hash_Table, Math, Prefix_Sum | 25 | 78.40 |
| 0522 | Longest Uncommon Subsequence II | Medium | Array, String, Hash_Table, Sorting, Two_Pointers | 1 | 100.00 |
| 0521 | Longest Uncommon Subsequence I | Easy | String | 0 | 100.00 |
| 0520 | Detect Capital | Easy | String | 2 | 72.44 |
| 0519 | Random Flip Matrix | Medium | Hash_Table, Math, Randomized, Reservoir_Sampling | 39 | 68.47 |
| 0518 | Coin Change 2 | Medium | Array, Dynamic_Programming, Dynamic_Programming_I_Day_20 | 3 | 91.32 |
| 0517 | Super Washing Machines | Hard | Array, Greedy | 0 | 100.00 |
| 0516 | Longest Palindromic Subsequence | Medium | String, Dynamic_Programming, Dynamic_Programming_I_Day_17 | 31 | 96.10 |
| 0515 | Find Largest Value in Each Tree Row | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 96.84 |
| 0514 | Freedom Trail | Hard | String, Dynamic_Programming, Depth_First_Search, Breadth_First_Search | 17 | 75.84 |
| 0513 | Find Bottom Left Tree Value | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 80.06 |
| 0511 | Game Play Analysis I | Easy | LeetCode_Curated_SQL_70, Database, SQL_I_Day_8_Function | 620 | 35.70 |
| 0509 | Fibonacci Number | Easy | Dynamic_Programming, Math, Recursion, Memoization, Dynamic_Programming_I_Day_1, Level_1_Day_10_Dynamic_Programming | 0 | 100.00 |
| 0508 | Most Frequent Subtree Sum | Medium | Hash_Table, Depth_First_Search, Tree, Binary_Tree | 6 | 77.55 |
| 0507 | Perfect Number | Easy | Math | 2 | 73.73 |
| 0506 | Relative Ranks | Easy | Array, Sorting, Heap_Priority_Queue | 4 | 99.79 |
| 0504 | Base 7 | Easy | Math | 1 | 94.93 |
| 0503 | Next Greater Element II | Medium | Array, Stack, Monotonic_Stack, Programming_Skills_II_Day_10 | 7 | 95.85 |
| 0502 | IPO | Hard | Array, Sorting, Greedy, Heap_Priority_Queue | 43 | 92.06 |
| 0501 | Find Mode in Binary Search Tree | Easy | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 1 | 91.60 |
| 0500 | Keyboard Row | Easy | Array, String, Hash_Table | 0 | 100.00 |
| 0498 | Diagonal Traverse | Medium | Array, Matrix, Simulation | 2 | 96.07 |
| 0497 | Random Point in Non-overlapping Rectangles | Medium | Math, Binary_Search, Prefix_Sum, Ordered_Set, Randomized, Reservoir_Sampling | 44 | 97.50 |
| 0496 | Next Greater Element I | Easy | Array, Hash_Table, Stack, Monotonic_Stack, Programming_Skills_I_Day_5_Function | 3 | 84.97 |
| 0495 | Teemo Attacking | Easy | Array, Simulation | 4 | 26.85 |
| 0494 | Target Sum | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Backtracking | 10 | 82.41 |
| 0493 | Reverse Pairs | Hard | Array, Binary_Search, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Merge_Sort | 121 | 31.13 |
| 0492 | Construct the Rectangle | Easy | Math | 1 | 74.25 |
| 0491 | Increasing Subsequences | Medium | Array, Hash_Table, Bit_Manipulation, Backtracking | 22 | 46.38 |
| 0488 | Zuma Game | Hard | String, Dynamic_Programming, Breadth_First_Search, Memoization | 2077 | 7.41 |
| 0486 | Predict the Winner | Medium | Array, Dynamic_Programming, Math, Recursion, Game_Theory | 0 | 100.00 |
| 0485 | Max Consecutive Ones | Easy | Array | 1 | 100.00 |
| 0483 | Smallest Good Base | Hard | Math, Binary_Search | 3 | 87.88 |
| 0482 | License Key Formatting | Easy | String | 7 | 98.60 |
| 0481 | Magical String | Medium | String, Two_Pointers | 5 | 88.46 |
| 0480 | Sliding Window Median | Hard | Array, Hash_Table, Heap_Priority_Queue, Sliding_Window | 46 | 80.65 |
| 0479 | Largest Palindrome Product | Hard | Math | 6 | 97.54 |
| 0478 | Generate Random Point in a Circle | Medium | Math, Geometry, Randomized, Rejection_Sampling | 196 | 98.10 |
| 0477 | Total Hamming Distance | Medium | Array, Math, Bit_Manipulation | 5 | 90.97 |
| 0476 | Number Complement | Easy | Bit_Manipulation | 0 | 100.00 |
| 0475 | Heaters | Medium | Array, Sorting, Binary_Search, Two_Pointers | 8 | 99.30 |
| 0474 | Ones and Zeroes | Medium | Array, String, Dynamic_Programming | 41 | 68.79 |
| 0473 | Matchsticks to Square | Medium | Array, Dynamic_Programming, Bit_Manipulation, Backtracking, Bitmask | 241 | 18.95 |
| 0472 | Concatenated Words | Hard | Array, String, Dynamic_Programming, Depth_First_Search, Trie | 84 | 79.03 |
| 0470 | Implement Rand10() Using Rand7() | Medium | Math, Randomized, Probability_and_Statistics, Rejection_Sampling | 10 | 51.04 |
| 0468 | Validate IP Address | Medium | String | 1 | 98.15 |
| 0467 | Unique Substrings in Wraparound String | Medium | String, Dynamic_Programming | 5 | 88.61 |
| 0466 | Count The Repetitions | Hard | String, Dynamic_Programming | 1 | 100.00 |
| 0464 | Can I Win | Medium | Dynamic_Programming, Math, Bit_Manipulation, Bitmask, Memoization, Game_Theory | 159 | 84.80 |
| 0463 | Island Perimeter | Easy | Array, Depth_First_Search, Breadth_First_Search, Matrix | 9 | 74.15 |
| 0462 | Minimum Moves to Equal Array Elements II | Medium | Array, Math, Sorting | 3 | 94.38 |
| 0461 | Hamming Distance | Easy | Bit_Manipulation | 1 | 39.19 |
| 0460 | LFU Cache | Hard | Hash_Table, Design, Linked_List, Doubly_Linked_List | 45 | 99.66 |
| 0459 | Repeated Substring Pattern | Easy | String, String_Matching, Programming_Skills_II_Day_2 | 9 | 90.15 |
| 0458 | Poor Pigs | Hard | Dynamic_Programming, Math, Combinatorics | 0 | 100.00 |
| 0457 | Circular Array Loop | Medium | Array, Hash_Table, Two_Pointers | 2 | 73.72 |
| 0456 | 132 Pattern | Medium | Array, Binary_Search, Stack, Ordered_Set, Monotonic_Stack | 15 | 80.22 |
| 0455 | Assign Cookies | Easy | Array, Sorting, Greedy | 11 | 42.95 |
| 0454 | 4Sum II | Medium | Top_Interview_Questions, Array, Hash_Table | 157 | 74.79 |
| 0453 | Minimum Moves to Equal Array Elements | Medium | Array, Math | 1 | 100.00 |
| 0452 | Minimum Number of Arrows to Burst Balloons | Medium | Array, Sorting, Greedy | 80 | 76.91 |
| 0451 | Sort Characters By Frequency | Medium | String, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Bucket_Sort, Data_Structure_II_Day_21_Heap_Priority_Queue | 18 | 70.93 |
| 0450 | Delete Node in a BST | Medium | Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_II_Day_16_Tree | 0 | 100.00 |
| 0449 | Serialize and Deserialize BST | Medium | String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design, Binary_Search_Tree | 1 | 99.70 |
| 0448 | Find All Numbers Disappeared in an Array | Easy | Array, Hash_Table | 3 | 100.00 |
| 0447 | Number of Boomerangs | Medium | Array, Hash_Table, Math | 156 | 80.44 |
| 0446 | Arithmetic Slices II - Subsequence | Hard | Array, Dynamic_Programming | 67 | 95.78 |
| 0445 | Add Two Numbers II | Medium | Math, Stack, Linked_List, Programming_Skills_II_Day_15 | 3 | 81.96 |
| 0443 | String Compression | Medium | String, Two_Pointers | 2 | 60.36 |
| 0442 | Find All Duplicates in an Array | Medium | Array, Hash_Table | 5 | 94.88 |
| 0441 | Arranging Coins | Easy | Math, Binary_Search, Binary_Search_I_Day_6 | 2 | 87.99 |
| 0440 | K-th Smallest in Lexicographical Order | Hard | Trie | 0 | 100.00 |
| 0438 | Find All Anagrams in a String | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Programming_Skills_II_Day_12, Level_1_Day_12_Sliding_Window/Two_Pointer | 8 | 87.18 |
| 0437 | Path Sum III | Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree | 4 | 87.75 |
| 0436 | Find Right Interval | Medium | Array, Sorting, Binary_Search, Binary_Search_II_Day_11 | 17 | 87.90 |
| 0435 | Non-overlapping Intervals | Medium | Array, Dynamic_Programming, Sorting, Greedy, Data_Structure_II_Day_4_Array | 109 | 26.80 |
| 0434 | Number of Segments in a String | Easy | String | 0 | 100.00 |
| 0433 | Minimum Genetic Mutation | Medium | String, Hash_Table, Breadth_First_Search, Graph_Theory_I_Day_12_Breadth_First_Search | 0 | 100.00 |
| 0432 | All O`one Data Structure | Hard | Hash_Table, Design, Linked_List, Doubly_Linked_List | 87 | 62.81 |
| 0430 | Flatten a Multilevel Doubly Linked List | Medium | Depth_First_Search, Linked_List, Doubly_Linked_List | 0 | 100.00 |
| 0429 | N-ary Tree Level Order Traversal | Medium | Breadth_First_Search, Tree, Programming_Skills_II_Day_9 | 4 | 57.07 |
| 0427 | Construct Quad Tree | Medium | Array, Tree, Matrix, Divide_and_Conquer | 1 | 85.16 |
| 0424 | Longest Repeating Character Replacement | Medium | String, Hash_Table, Sliding_Window, Level_1_Day_12_Sliding_Window/Two_Pointer | 5 | 92.61 |
| 0423 | Reconstruct Original Digits from English | Medium | String, Hash_Table, Math | 3 | 100.00 |
| 0421 | Maximum XOR of Two Numbers in an Array | Medium | Array, Hash_Table, Bit_Manipulation, Trie | 22 | 99.22 |
| 0420 | Strong Password Checker | Hard | String, Greedy, Heap_Priority_Queue | 0 | 100.00 |
| 0419 | Battleships in a Board | Medium | Array, Depth_First_Search, Matrix | 1 | 83.10 |
| 0417 | Pacific Atlantic Water Flow | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Graph_Theory_I_Day_4_Matrix_Related_Problems | 5 | 89.66 |
| 0416 | Partition Equal Subset Sum | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming | 1 | 99.87 |
| 0415 | Add Strings | Easy | String, Math, Simulation, Data_Structure_II_Day_6_String | 3 | 75.64 |
| 0414 | Third Maximum Number | Easy | Array, Sorting | 1 | 96.71 |
| 0413 | Arithmetic Slices | Medium | Array, Dynamic_Programming, Algorithm_II_Day_14_Dynamic_Programming, Dynamic_Programming_I_Day_10 | 0 | 100.00 |
| 0412 | Fizz Buzz | Easy | Top_Interview_Questions, String, Math, Simulation | 3 | 32.80 |
| 0410 | Split Array Largest Sum | Hard | Array, Dynamic_Programming, Greedy, Binary_Search | 1 | 84.88 |
| 0409 | Longest Palindrome | Easy | String, Hash_Table, Greedy, Data_Structure_II_Day_6_String, Level_1_Day_5_Greedy | 1 | 100.00 |
| 0407 | Trapping Rain Water II | Hard | Array, Breadth_First_Search, Matrix, Heap_Priority_Queue | 10 | 99.01 |
| 0406 | Queue Reconstruction by Height | Medium | Array, Sorting, Greedy, Segment_Tree, Binary_Indexed_Tree | 9 | 74.45 |
| 0405 | Convert a Number to Hexadecimal | Easy | Math, Bit_Manipulation | 0 | 100.00 |
| 0404 | Sum of Left Leaves | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Programming_Skills_I_Day_10_Linked_List_and_Tree | 0 | 100.00 |
| 0403 | Frog Jump | Hard | Array, Dynamic_Programming | 18 | 97.19 |
| 0402 | Remove K Digits | Medium | String, Greedy, Stack, Monotonic_Stack | 6 | 90.82 |
| 0401 | Binary Watch | Easy | Bit_Manipulation, Backtracking | 1 | 98.21 |
| 0400 | Nth Digit | Medium | Math, Binary_Search | 0 | 100.00 |
| 0399 | Evaluate Division | Medium | Array, Depth_First_Search, Breadth_First_Search, Graph, Union_Find, Shortest_Path | 1 | 97.67 |
| 0398 | Random Pick Index | Medium | Hash_Table, Math, Randomized, Reservoir_Sampling | 75 | 74.64 |
| 0397 | Integer Replacement | Medium | Dynamic_Programming, Greedy, Bit_Manipulation, Memoization | 0 | 100.00 |
| 0396 | Rotate Function | Medium | Array, Dynamic_Programming, Math | 3 | 98.51 |
| 0395 | Longest Substring with At Least K Repeating Characters | Medium | Top_Interview_Questions, String, Hash_Table, Sliding_Window, Divide_and_Conquer | 0 | 100.00 |
| 0394 | Decode String | Medium | Top_100_Liked_Questions, String, Stack, Recursion, Level_1_Day_14_Stack | 1 | 83.81 |
| 0393 | UTF-8 Validation | Medium | Array, Bit_Manipulation | 1 | 100.00 |
| 0392 | Is Subsequence | Easy | String, Dynamic_Programming, Two_Pointers, Dynamic_Programming_I_Day_19, Level_1_Day_2_String | 0 | 100.00 |
| 0391 | Perfect Rectangle | Hard | Array, Line_Sweep | 49 | 67.32 |
| 0390 | Elimination Game | Medium | Math, Recursion | 2 | 100.00 |
| 0389 | Find the Difference | Easy | String, Hash_Table, Sorting, Bit_Manipulation, Programming_Skills_I_Day_8_String | 1 | 99.83 |
| 0388 | Longest Absolute File Path | Medium | String, Depth_First_Search, Stack | 2 | 52.22 |
| 0387 | First Unique Character in a String | Easy | Top_Interview_Questions, String, Hash_Table, Counting, Queue, Data_Structure_I_Day_6_String | 2 | 99.53 |
| 0386 | Lexicographical Numbers | Medium | Depth_First_Search, Trie | 4 | 87.17 |
| 0385 | Mini Parser | Medium | String, Depth_First_Search, Stack | 3 | 97.44 |
| 0384 | Shuffle an Array | Medium | Top_Interview_Questions, Array, Math, Randomized, Algorithm_II_Day_20_Others | 65 | 94.59 |
| 0383 | Ransom Note | Easy | String, Hash_Table, Counting, Data_Structure_I_Day_6_String | 1 | 99.79 |
| 0382 | Linked List Random Node | Medium | Math, Linked_List, Randomized, Reservoir_Sampling | 7 | 100.00 |
| 0381 | Insert Delete GetRandom O(1) - Duplicates allowed | Hard | Array, Hash_Table, Math, Design, Randomized | 26 | 100.00 |
| 0380 | Insert Delete GetRandom O(1) | Medium | Top_Interview_Questions, Array, Hash_Table, Math, Design, Randomized, Programming_Skills_II_Day_20 | 20 | 99.24 |
| 0378 | Kth Smallest Element in a Sorted Matrix | Medium | Top_Interview_Questions, Array, Sorting, Binary_Search, Matrix, Heap_Priority_Queue | 0 | 100.00 |
| 0377 | Combination Sum IV | Medium | Array, Dynamic_Programming, Dynamic_Programming_I_Day_21 | 1 | 91.72 |
| 0376 | Wiggle Subsequence | Medium | Array, Dynamic_Programming, Greedy, Dynamic_Programming_I_Day_18 | 0 | 100.00 |
| 0375 | Guess Number Higher or Lower II | Medium | Dynamic_Programming, Math, Game_Theory | 1 | 100.00 |
| 0374 | Guess Number Higher or Lower | Easy | Binary_Search, Interactive, Binary_Search_I_Day_1 | 0 | 100.00 |
| 0373 | Find K Pairs with Smallest Sums | Medium | Array, Heap_Priority_Queue | 58 | 29.29 |
| 0372 | Super Pow | Medium | Math, Divide_and_Conquer | 2 | 91.10 |
| 0371 | Sum of Two Integers | Medium | Top_Interview_Questions, Math, Bit_Manipulation | 0 | 100.00 |
| 0368 | Largest Divisible Subset | Medium | Array, Dynamic_Programming, Math, Sorting | 20 | 87.61 |
| 0367 | Valid Perfect Square | Easy | Math, Binary_Search, Binary_Search_I_Day_3 | 0 | 100.00 |
| 0365 | Water and Jug Problem | Medium | Math, Depth_First_Search, Breadth_First_Search, Graph_Theory_I_Day_11_Breadth_First_Search | 0 | 100.00 |
| 0363 | Max Sum of Rectangle No Larger Than K | Hard | Array, Dynamic_Programming, Binary_Search, Matrix, Ordered_Set | 69 | 97.33 |
| 0357 | Count Numbers with Unique Digits | Medium | Dynamic_Programming, Math, Backtracking | 0 | 100.00 |
| 0355 | Design Twitter | Medium | Hash_Table, Design, Heap_Priority_Queue, Linked_List | 8 | 99.79 |
| 0354 | Russian Doll Envelopes | Hard | Array, Dynamic_Programming, Sorting, Binary_Search | 65 | 67.49 |
| 0352 | Data Stream as Disjoint Intervals | Hard | Binary_Search, Design, Ordered_Set | 94 | 76.26 |
| 0350 | Intersection of Two Arrays II | Easy | Top_Interview_Questions, Array, Hash_Table, Sorting, Binary_Search, Two_Pointers, Data_Structure_I_Day_3_Array, Binary_Search_I_Day_10 | 3 | 81.79 |
| 0349 | Intersection of Two Arrays | Easy | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 1 | 99.75 |
| 0347 | Top K Frequent Elements | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Divide_and_Conquer, Quickselect, Bucket_Sort, Data_Structure_II_Day_20_Heap_Priority_Queue | 7 | 99.54 |
| 0345 | Reverse Vowels of a String | Easy | String, Two_Pointers | 4 | 86.90 |
| 0344 | Reverse String | Easy | Top_Interview_Questions, String, Two_Pointers, Recursion, Algorithm_I_Day_4_Two_Pointers | 1 | 87.94 |
| 0343 | Integer Break | Medium | Dynamic_Programming, Math, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_21 | 0 | 100.00 |
| 0342 | Power of Four | Easy | Math, Bit_Manipulation, Recursion | 1 | 91.73 |
| 0341 | Flatten Nested List Iterator | Medium | Top_Interview_Questions, Depth_First_Search, Tree, Stack, Design, Queue, Iterator, Programming_Skills_II_Day_18 | 3 | 86.51 |
| 0338 | Counting Bits | Easy | Top_100_Liked_Questions, Dynamic_Programming, Bit_Manipulation | 1 | 99.97 |
| 0337 | House Robber III | Medium | Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree | 1 | 87.96 |
| 0336 | Palindrome Pairs | Hard | Array, String, Hash_Table, Trie | 1219 | 54.97 |
| 0335 | Self Crossing | Hard | Array, Math, Geometry | 6 | 44.12 |
| 0334 | Increasing Triplet Subsequence | Medium | Top_Interview_Questions, Array, Greedy, Data_Structure_II_Day_5_Array | 3 | 61.85 |
| 0332 | Reconstruct Itinerary | Hard | Depth_First_Search, Graph, Eulerian_Circuit | 11 | 47.68 |
| 0331 | Verify Preorder Serialization of a Binary Tree | Medium | String, Tree, Binary_Tree, Stack | 3 | 94.01 |
| 0330 | Patching Array | Hard | Array, Greedy | 0 | 100.00 |
| 0329 | Longest Increasing Path in a Matrix | Hard | Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Breadth_First_Search, Graph, Memoization, Topological_Sort | 8 | 91.02 |
| 0328 | Odd Even Linked List | Medium | Top_Interview_Questions, Linked_List | 0 | 100.00 |
| 0327 | Count of Range Sum | Hard | Array, Binary_Search, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Merge_Sort | 64 | 87.41 |
| 0326 | Power of Three | Easy | Top_Interview_Questions, Math, Recursion | 18 | 79.91 |
| 0324 | Wiggle Sort II | Medium | Top_Interview_Questions, Array, Sorting, Divide_and_Conquer, Quickselect | 6 | 69.23 |
| 0322 | Coin Change | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_20 | 22 | 72.14 |
| 0321 | Create Maximum Number | Hard | Greedy, Stack, Monotonic_Stack | 9 | 93.46 |
| 0319 | Bulb Switcher | Medium | Math, Brainteaser | 0 | 100.00 |
| 0318 | Maximum Product of Word Lengths | Medium | Array, String, Bit_Manipulation | 10 | 81.97 |
| 0316 | Remove Duplicate Letters | Medium | String, Greedy, Stack, Monotonic_Stack | 2 | 98.39 |
| 0315 | Count of Smaller Numbers After Self | Hard | Top_Interview_Questions, Array, Binary_Search, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Merge_Sort | 34 | 96.38 |
| 0313 | Super Ugly Number | Medium | Array, Dynamic_Programming, Math | 280 | 86.61 |
| 0312 | Burst Balloons | Hard | Array, Dynamic_Programming | 53 | 86.06 |
| 0310 | Minimum Height Trees | Medium | Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 22 | 94.43 |
| 0309 | Best Time to Buy and Sell Stock with Cooldown | Medium | Array, Dynamic_Programming, Dynamic_Programming_I_Day_8 | 0 | 100.00 |
| 0307 | Range Sum Query - Mutable | Medium | Array, Design, Segment_Tree, Binary_Indexed_Tree | 61 | 98.40 |
| 0306 | Additive Number | Medium | String, Backtracking | 1 | 87.31 |
| 0304 | Range Sum Query 2D - Immutable | Medium | Array, Matrix, Design, Prefix_Sum, Dynamic_Programming_I_Day_14, Programming_Skills_II_Day_13 | 103 | 98.60 |
| 0303 | Range Sum Query - Immutable | Easy | Array, Design, Prefix_Sum, Programming_Skills_I_Day_12_Class_and_Object | 6 | 100.00 |
| 0301 | Remove Invalid Parentheses | Hard | String, Breadth_First_Search, Backtracking | 4 | 86.17 |
| 0300 | Longest Increasing Subsequence | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Algorithm_II_Day_16_Dynamic_Programming, Binary_Search_II_Day_3, Dynamic_Programming_I_Day_18 | 3 | 96.86 |
| 0299 | Bulls and Cows | Medium | String, Hash_Table, Counting, Level_1_Day_13_Hashmap | 8 | 67.24 |
| 0297 | Serialize and Deserialize Binary Tree | Hard | Top_Interview_Questions, String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design, Data_Structure_II_Day_18_Tree | 9 | 91.82 |
| 0295 | Find Median from Data Stream | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Design, Heap_Priority_Queue, Data_Stream | 88 | 98.03 |
| 0292 | Nim Game | Easy | Math, Game_Theory, Brainteaser | 0 | 100.00 |
| 0290 | Word Pattern | Easy | String, Hash_Table, Data_Structure_II_Day_7_String | 1 | 91.62 |
| 0289 | Game of Life | Medium | Top_Interview_Questions, Array, Matrix, Simulation | 0 | 100.00 |
| 0287 | Find the Duplicate Number | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Binary_Search_II_Day_5 | 4 | 94.82 |
| 0284 | Peeking Iterator | Medium | Array, Design, Iterator | 5 | 78.72 |
| 0283 | Move Zeroes | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers, Algorithm_I_Day_3_Two_Pointers, Programming_Skills_I_Day_6_Array | 2 | 74.00 |
| 0282 | Expression Add Operators | Hard | String, Math, Backtracking | 7 | 99.73 |
| 0279 | Perfect Squares | Medium | Top_Interview_Questions, Dynamic_Programming, Math, Breadth_First_Search, Dynamic_Programming_I_Day_21 | 0 | 100.00 |
| 0278 | First Bad Version | Easy | Binary_Search, Interactive, Algorithm_I_Day_1_Binary_Search, Binary_Search_I_Day_5, Level_1_Day_7_Binary_Search | 12 | 99.50 |
| 0275 | H-Index II | Medium | Array, Binary_Search, Binary_Search_II_Day_8 | 0 | 100.00 |
| 0274 | H-Index | Medium | Array, Sorting, Counting_Sort | 2 | 51.85 |
| 0273 | Integer to English Words | Hard | String, Math, Recursion | 5 | 83.37 |
| 0268 | Missing Number | Easy | Top_Interview_Questions, Array, Hash_Table, Math, Sorting, Binary_Search, Bit_Manipulation | 0 | 100.00 |
| 0264 | Ugly Number II | Medium | Hash_Table, Dynamic_Programming, Math, Heap_Priority_Queue, Dynamic_Programming_I_Day_11 | 3 | 88.43 |
| 0263 | Ugly Number | Easy | Math | 1 | 95.93 |
| 0262 | Trips and Users | Hard | Database | 449 | 79.92 |
| 0260 | Single Number III | Medium | Array, Bit_Manipulation | 1 | 98.18 |
| 0258 | Add Digits | Easy | Math, Simulation, Number_Theory | 1 | 95.33 |
| 0257 | Binary Tree Paths | Easy | String, Depth_First_Search, Tree, Binary_Tree, Backtracking | 2 | 91.59 |
| 0242 | Valid Anagram | Easy | Top_Interview_Questions, String, Hash_Table, Sorting, Data_Structure_I_Day_6_String, Programming_Skills_I_Day_11_Containers_and_Libraries | 2 | 98.88 |
| 0241 | Different Ways to Add Parentheses | Medium | String, Dynamic_Programming, Math, Recursion, Memoization | 2 | 81.46 |
| 0240 | Search a 2D Matrix II | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Data_Structure_II_Day_4_Array, Binary_Search_II_Day_8 | 9 | 71.40 |
| 0239 | Sliding Window Maximum | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue | 25 | 95.01 |
| 0238 | Product of Array Except Self | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Prefix_Sum, Data_Structure_II_Day_5_Array | 1 | 100.00 |
| 0237 | Delete Node in a Linked List | Easy | Top_Interview_Questions, Linked_List | 0 | 100.00 |
| 0236 | Lowest Common Ancestor of a Binary Tree | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_18_Tree | 11 | 46.61 |
| 0235 | Lowest Common Ancestor of a Binary Search Tree | Easy | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_I_Day_14_Tree, Level_1_Day_8_Binary_Search_Tree | 7 | 52.79 |
| 0234 | Palindrome Linked List | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Stack, Linked_List, Recursion | 5 | 89.76 |
| 0233 | Number of Digit One | Hard | Dynamic_Programming, Math, Recursion | 0 | 100.00 |
| 0232 | Implement Queue using Stacks | Easy | Stack, Design, Queue, Data_Structure_I_Day_9_Stack_Queue, Programming_Skills_I_Day_11_Containers_and_Libraries | 1 | 56.63 |
| 0231 | Power of Two | Easy | Math, Bit_Manipulation, Recursion, Algorithm_I_Day_13_Bit_Manipulation | 1 | 95.76 |
| 0230 | Kth Smallest Element in a BST | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_II_Day_17_Tree | 0 | 100.00 |
| 0229 | Majority Element II | Medium | Array, Hash_Table, Sorting, Counting | 2 | 91.84 |
| 0228 | Summary Ranges | Easy | Array | 0 | 100.00 |
| 0227 | Basic Calculator II | Medium | Top_Interview_Questions, String, Math, Stack | 9 | 88.15 |
| 0226 | Invert Binary Tree | Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree | 0 | 100.00 |
| 0225 | Implement Stack using Queues | Easy | Stack, Design, Queue | 0 | 100.00 |
| 0224 | Basic Calculator | Hard | String, Math, Stack, Recursion | 3 | 98.82 |
| 0223 | Rectangle Area | Medium | Math, Geometry | 2 | 99.58 |
| 0222 | Count Complete Tree Nodes | Medium | Depth_First_Search, Tree, Binary_Search, Binary_Tree, Binary_Search_II_Day_10 | 0 | 100.00 |
| 0221 | Maximal Square | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16 | 6 | 80.89 |
| 0220 | Contains Duplicate III | Medium | Array, Sorting, Sliding_Window, Ordered_Set, Bucket_Sort | 46 | 62.24 |
| 0219 | Contains Duplicate II | Easy | Array, Hash_Table, Sliding_Window | 44 | 42.18 |
| 0218 | The Skyline Problem | Hard | Top_Interview_Questions, Array, Heap_Priority_Queue, Ordered_Set, Divide_and_Conquer, Segment_Tree, Binary_Indexed_Tree, Line_Sweep | 21 | 80.36 |
| 0217 | Contains Duplicate | Easy | Top_Interview_Questions, Array, Hash_Table, Sorting, Data_Structure_I_Day_1_Array, Programming_Skills_I_Day_11_Containers_and_Libraries | 10 | 67.20 |
| 0216 | Combination Sum III | Medium | Array, Backtracking | 1 | 78.74 |
| 0215 | Kth Largest Element in an Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Data_Structure_II_Day_20_Heap_Priority_Queue | 2 | 93.01 |
| 0214 | Shortest Palindrome | Hard | String, Hash_Function, String_Matching, Rolling_Hash | 3 | 94.71 |
| 0213 | House Robber II | Medium | Array, Dynamic_Programming, Algorithm_II_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3 | 1 | 31.05 |
| 0212 | Word Search II | Hard | Top_Interview_Questions, Array, String, Matrix, Backtracking, Trie | 20 | 96.11 |
| 0211 | Design Add and Search Words Data Structure | Medium | String, Depth_First_Search, Design, Trie | 403 | 18.89 |
| 0210 | Course Schedule II | Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 7 | 74.90 |
| 0209 | Minimum Size Subarray Sum | Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Binary_Search_II_Day_1 | 1 | 99.98 |
| 0208 | Implement Trie (Prefix Tree) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie | 63 | 55.40 |
| 0207 | Course Schedule | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 2 | 99.76 |
| 0206 | Reverse Linked List | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Data_Structure_I_Day_8_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List | 0 | 100.00 |
| 0205 | Isomorphic Strings | Easy | String, Hash_Table, Level_1_Day_2_String | 1 | 100.00 |
| 0204 | Count Primes | Medium | Top_Interview_Questions, Array, Math, Enumeration, Number_Theory | 146 | 72.74 |
| 0203 | Remove Linked List Elements | Easy | Linked_List, Recursion, Data_Structure_I_Day_7_Linked_List | 1 | 90.35 |
| 0202 | Happy Number | Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers, Algorithm_II_Day_21_Others, Programming_Skills_I_Day_4_Loop | 1 | 93.34 |
| 0201 | Bitwise AND of Numbers Range | Medium | Bit_Manipulation, Algorithm_II_Day_19_Bit_Manipulation | 10 | 40.99 |
| 0200 | Number of Islands | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_1_Matrix_Related_Problems, Level_1_Day_9_Graph/BFS/DFS | 4 | 73.02 |
| 0199 | Binary Tree Right Side View | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_16_Tree | 1 | 92.96 |
| 0198 | House Robber | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3 | 0 | 100.00 |
| 0197 | Rising Temperature | Easy | Database, SQL_I_Day_6_Union | 401 | 79.45 |
| 0196 | Delete Duplicate Emails | Easy | Database, SQL_I_Day_2_Select_and_Order | 541 | 81.09 |
| 0195 | Tenth Line | Easy | Shell | 4 | 93.33 |
| 0194 | Transpose File | Medium | Shell | 0 | 100.00 |
| 0193 | Valid Phone Numbers | Easy | Shell | 129 | 42.86 |
| 0192 | Word Frequency | Medium | Shell | 152 | 38.56 |
| 0191 | Number of 1 Bits | Easy | Top_Interview_Questions, Bit_Manipulation, Algorithm_I_Day_13_Bit_Manipulation, Programming_Skills_I_Day_2_Operator | 0 | 100.00 |
| 0190 | Reverse Bits | Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer, Algorithm_I_Day_14_Bit_Manipulation | 1 | 98.66 |
| 0189 | Rotate Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Algorithm_I_Day_2_Two_Pointers | 0 | 100.00 |
| 0188 | Best Time to Buy and Sell Stock IV | Hard | Array, Dynamic_Programming | 1 | 100.00 |
| 0187 | Repeated DNA Sequences | Medium | String, Hash_Table, Bit_Manipulation, Sliding_Window, Hash_Function, Rolling_Hash, Data_Structure_II_Day_9_String | 29 | 77.11 |
| 0185 | Department Top Three Salaries | Hard | Database | 643 | 95.52 |
| 0184 | Department Highest Salary | Medium | Database | 590 | 73.49 |
| 0183 | Customers Who Never Order | Easy | Database, SQL_I_Day_1_Select | 376 | 98.73 |
| 0182 | Duplicate Emails | Easy | Database, SQL_I_Day_10_Where | 303 | 92.08 |
| 0181 | Employees Earning More Than Their Managers | Easy | Database | 315 | 94.44 |
| 0180 | Consecutive Numbers | Medium | Database | 550 | 48.44 |
| 0179 | Largest Number | Medium | Top_Interview_Questions, String, Sorting, Greedy | 10 | 54.50 |
| 0178 | Rank Scores | Medium | Database | 290 | 66.73 |
| 0177 | Nth Highest Salary | Medium | Database | 342 | 71.87 |
| 0176 | Second Highest Salary | Medium | Database, SQL_I_Day_4_Union_and_Select | 405 | 13.88 |
| 0175 | Combine Two Tables | Easy | Database, SQL_I_Day_5_Union | 491 | 32.30 |
| 0174 | Dungeon Game | Hard | Array, Dynamic_Programming, Matrix | 0 | 100.00 |
| 0173 | Binary Search Tree Iterator | Medium | Tree, Binary_Tree, Stack, Design, Binary_Search_Tree, Iterator, Data_Structure_II_Day_17_Tree, Programming_Skills_II_Day_16 | 18 | 84.18 |
| 0172 | Factorial Trailing Zeroes | Medium | Top_Interview_Questions, Math | 1 | 85.61 |
| 0171 | Excel Sheet Column Number | Easy | Top_Interview_Questions, String, Math | 2 | 76.43 |
| 0169 | Majority Element | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Data_Structure_II_Day_1_Array | 1 | 100.00 |
| 0168 | Excel Sheet Column Title | Easy | String, Math | 0 | 100.00 |
| 0167 | Two Sum II - Input Array Is Sorted | Medium | Array, Binary_Search, Two_Pointers, Algorithm_I_Day_3_Two_Pointers, Binary_Search_I_Day_7 | 1 | 99.21 |
| 0166 | Fraction to Recurring Decimal | Medium | Top_Interview_Questions, String, Hash_Table, Math | 3 | 55.19 |
| 0165 | Compare Version Numbers | Medium | String, Two_Pointers | 1 | 88.88 |
| 0164 | Maximum Gap | Hard | Array, Sorting, Bucket_Sort, Radix_Sort | 48 | 53.59 |
| 0162 | Find Peak Element | Medium | Top_Interview_Questions, Array, Binary_Search, Algorithm_II_Day_2_Binary_Search, Binary_Search_II_Day_12 | 0 | 100.00 |
| 0160 | Intersection of Two Linked Lists | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_II_Day_11_Linked_List | 1 | 99.68 |
| 0155 | Min Stack | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Data_Structure_II_Day_14_Stack_Queue, Programming_Skills_II_Day_18 | 3 | 100.00 |
| 0154 | Find Minimum in Rotated Sorted Array II | Hard | Array, Binary_Search, Binary_Search_II_Day_13 | 1 | 77.09 |
| 0153 | Find Minimum in Rotated Sorted Array | Medium | Top_100_Liked_Questions, Array, Binary_Search, Algorithm_II_Day_2_Binary_Search, Binary_Search_I_Day_12 | 0 | 100.00 |
| 0152 | Maximum Product Subarray | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Dynamic_Programming_I_Day_6 | 0 | 100.00 |
| 0151 | Reverse Words in a String | Medium | String, Two_Pointers | 2 | 99.94 |
| 0150 | Evaluate Reverse Polish Notation | Medium | Top_Interview_Questions, Array, Math, Stack, Programming_Skills_II_Day_3 | 9 | 51.23 |
| 0149 | Max Points on a Line | Hard | Top_Interview_Questions, Array, Hash_Table, Math, Geometry, Algorithm_II_Day_21_Others | 11 | 99.21 |
| 0148 | Sort List | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort | 12 | 85.82 |
| 0147 | Insertion Sort List | Medium | Sorting, Linked_List | 4 | 90.34 |
| 0146 | LRU Cache | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List | 87 | 50.80 |
| 0145 | Binary Tree Postorder Traversal | Easy | Depth_First_Search, Tree, Binary_Tree, Stack, Data_Structure_I_Day_10_Tree | 1 | 49.11 |
| 0144 | Binary Tree Preorder Traversal | Easy | Depth_First_Search, Tree, Binary_Tree, Stack, Data_Structure_I_Day_10_Tree | 1 | 48.38 |
| 0143 | Reorder List | Medium | Two_Pointers, Stack, Linked_List, Recursion, Data_Structure_II_Day_13_Linked_List, Programming_Skills_II_Day_14 | 2 | 72.59 |
| 0142 | Linked List Cycle II | Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_II_Day_10_Linked_List, Level_1_Day_4_Linked_List | 0 | 100.00 |
| 0141 | Linked List Cycle | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_I_Day_7_Linked_List | 0 | 100.00 |
| 0140 | Word Break II | Hard | Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Backtracking, Trie, Memoization | 1 | 99.05 |
| 0139 | Word Break | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Algorithm_II_Day_15_Dynamic_Programming, Dynamic_Programming_I_Day_9 | 2 | 97.08 |
| 0138 | Copy List with Random Pointer | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Programming_Skills_II_Day_14 | 0 | 100.00 |
| 0137 | Single Number II | Medium | Array, Bit_Manipulation | 0 | 100.00 |
| 0136 | Single Number | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Data_Structure_II_Day_1_Array, Algorithm_I_Day_14_Bit_Manipulation | 1 | 99.97 |
| 0135 | Candy | Hard | Array, Greedy | 2 | 99.95 |
| 0134 | Gas Station | Medium | Top_Interview_Questions, Array, Greedy | 2 | 94.26 |
| 0133 | Clone Graph | Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Graph | 45 | 29.80 |
| 0132 | Palindrome Partitioning II | Hard | String, Dynamic_Programming | 2 | 99.89 |
| 0131 | Palindrome Partitioning | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking | 16 | 65.63 |
| 0130 | Surrounded Regions | Medium | Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_8_Breadth_First_Search_Depth_First_Search | 2 | 84.66 |
| 0129 | Sum Root to Leaf Numbers | Medium | Depth_First_Search, Tree, Binary_Tree | 0 | 100.00 |
| 0128 | Longest Consecutive Sequence | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Union_Find | 18 | 91.05 |
| 0127 | Word Ladder | Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search, Graph_Theory_I_Day_12_Breadth_First_Search | 37 | 94.58 |
| 0126 | Word Ladder II | Hard | String, Hash_Table, Breadth_First_Search, Backtracking | 4 | 99.18 |
| 0125 | Valid Palindrome | Easy | Top_Interview_Questions, String, Two_Pointers | 3 | 98.64 |
| 0124 | Binary Tree Maximum Path Sum | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree | 1 | 99.46 |
| 0123 | Best Time to Buy and Sell Stock III | Hard | Array, Dynamic_Programming | 4 | 87.18 |
| 0122 | Best Time to Buy and Sell Stock II | Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Dynamic_Programming_I_Day_7 | 1 | 96.82 |
| 0121 | Best Time to Buy and Sell Stock | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Data_Structure_I_Day_3_Array, Dynamic_Programming_I_Day_7, Level_1_Day_5_Greedy | 1 | 100.00 |
| 0120 | Triangle | Medium | Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_13 | 2 | 94.63 |
| 0119 | Pascal's Triangle II | Easy | Array, Dynamic_Programming, Data_Structure_II_Day_3_Array, Dynamic_Programming_I_Day_12 | 0 | 100.00 |
| 0118 | Pascal's Triangle | Easy | Top_Interview_Questions, Array, Dynamic_Programming, Data_Structure_I_Day_4_Array, Dynamic_Programming_I_Day_12 | 1 | 67.08 |
| 0117 | Populating Next Right Pointers in Each Node II | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List, Algorithm_II_Day_7_Breadth_First_Search_Depth_First_Search | 0 | 100.00 |
| 0116 | Populating Next Right Pointers in Each Node | Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List, Algorithm_I_Day_8_Breadth_First_Search_Depth_First_Search | 0 | 100.00 |
| 0115 | Distinct Subsequences | Hard | String, Dynamic_Programming | 2 | 100.00 |
| 0114 | Flatten Binary Tree to Linked List | Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List | 1 | 75.27 |
| 0113 | Path Sum II | Medium | Depth_First_Search, Tree, Binary_Tree, Backtracking, Data_Structure_II_Day_16_Tree | 1 | 100.00 |
| 0112 | Path Sum | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree | 0 | 100.00 |
| 0111 | Minimum Depth of Binary Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 97.49 |
| 0110 | Balanced Binary Tree | Easy | Depth_First_Search, Tree, Binary_Tree, Programming_Skills_II_Day_2 | 1 | 98.82 |
| 0109 | Convert Sorted List to Binary Search Tree | Medium | Tree, Binary_Tree, Linked_List, Binary_Search_Tree, Divide_and_Conquer | 1 | 87.04 |
| 0108 | Convert Sorted Array to Binary Search Tree | Easy | Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer, Data_Structure_II_Day_15_Tree | 0 | 100.00 |
| 0107 | Binary Tree Level Order Traversal II | Medium | Breadth_First_Search, Tree, Binary_Tree | 1 | 97.71 |
| 0106 | Construct Binary Tree from Inorder and Postorder Traversal | Medium | Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer | 1 | 100.00 |
| 0105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Data_Structure_II_Day_15_Tree | 3 | 86.35 |
| 0104 | Maximum Depth of Binary Tree | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Programming_Skills_I_Day_10_Linked_List_and_Tree | 0 | 100.00 |
| 0103 | Binary Tree Zigzag Level Order Traversal | Medium | Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_15_Tree | 1 | 95.00 |
| 0102 | Binary Tree Level Order Traversal | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_1_Day_6_Tree | 1 | 91.09 |
| 0101 | Symmetric Tree | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree | 0 | 100.00 |
| 0100 | Same Tree | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00 |
| 0099 | Recover Binary Search Tree | Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 3 | 76.33 |
| 0098 | Validate Binary Search Tree | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_I_Day_14_Tree, Level_1_Day_8_Binary_Search_Tree | 0 | 100.00 |
| 0097 | Interleaving String | Medium | String, Dynamic_Programming | 2 | 88.01 |
| 0096 | Unique Binary Search Trees | Medium | Top_100_Liked_Questions, Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Dynamic_Programming_I_Day_11 | 0 | 100.00 |
| 0095 | Unique Binary Search Trees II | Medium | Dynamic_Programming, Tree, Binary_Tree, Backtracking, Binary_Search_Tree | 1 | 99.82 |
| 0094 | Binary Tree Inorder Traversal | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Data_Structure_I_Day_10_Tree | 0 | 100.00 |
| 0093 | Restore IP Addresses | Medium | String, Backtracking | 13 | 24.23 |
| 0092 | Reverse Linked List II | Medium | Linked_List | 0 | 100.00 |
| 0091 | Decode Ways | Medium | Top_Interview_Questions, String, Dynamic_Programming, Algorithm_II_Day_15_Dynamic_Programming, Dynamic_Programming_I_Day_10 | 2 | 66.37 |
| 0090 | Subsets II | Medium | Array, Bit_Manipulation, Backtracking, Algorithm_II_Day_9_Recursion_Backtracking | 2 | 82.94 |
| 0089 | Gray Code | Medium | Math, Bit_Manipulation, Backtracking | 3 | 98.59 |
| 0088 | Merge Sorted Array | Easy | Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_I_Day_2_Array | 0 | 100.00 |
| 0087 | Scramble String | Hard | String, Dynamic_Programming | 16 | 70.62 |
| 0086 | Partition List | Medium | Two_Pointers, Linked_List | 1 | 62.66 |
| 0085 | Maximal Rectangle | Hard | Array, Dynamic_Programming, Matrix, Stack, Monotonic_Stack | 3 | 99.68 |
| 0084 | Largest Rectangle in Histogram | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Stack, Monotonic_Stack | 11 | 98.34 |
| 0083 | Remove Duplicates from Sorted List | Easy | Linked_List, Data_Structure_I_Day_8_Linked_List | 0 | 100.00 |
| 0082 | Remove Duplicates from Sorted List II | Medium | Two_Pointers, Linked_List, Data_Structure_II_Day_11_Linked_List, Algorithm_II_Day_3_Two_Pointers | 0 | 100.00 |
| 0081 | Search in Rotated Sorted Array II | Medium | Array, Binary_Search, Binary_Search_II_Day_12 | 1 | 82.83 |
| 0080 | Remove Duplicates from Sorted Array II | Medium | Array, Two_Pointers | 1 | 82.32 |
| 0079 | Word Search | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking | 135 | 70.56 |
| 0078 | Subsets | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Algorithm_II_Day_9_Recursion_Backtracking | 1 | 87.15 |
| 0077 | Combinations | Medium | Backtracking, Algorithm_I_Day_11_Recursion_Backtracking | 5 | 90.06 |
| 0076 | Minimum Window Substring | Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window | 3 | 98.22 |
| 0075 | Sort Colors | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_II_Day_2_Array | 0 | 100.00 |
| 0074 | Search a 2D Matrix | Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Data_Structure_I_Day_5_Array, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_8 | 0 | 100.00 |
| 0073 | Set Matrix Zeroes | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Matrix | 1 | 96.39 |
| 0072 | Edit Distance | Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_19 | 6 | 90.49 |
| 0071 | Simplify Path | Medium | String, Stack | 4 | 95.43 |
| 0070 | Climbing Stairs | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_2, Level_1_Day_10_Dynamic_Programming | 0 | 100.00 |
| 0069 | Sqrt(x) | Easy | Top_Interview_Questions, Math, Binary_Search, Binary_Search_I_Day_4 | 2 | 79.35 |
| 0068 | Text Justification | Hard | Array, String, Simulation | 0 | 100.00 |
| 0067 | Add Binary | Easy | String, Math, Bit_Manipulation, Simulation, Programming_Skills_II_Day_5 | 2 | 88.95 |
| 0066 | Plus One | Easy | Top_Interview_Questions, Array, Math, Programming_Skills_II_Day_3 | 0 | 100.00 |
| 0065 | Valid Number | Hard | String | 1 | 100.00 |
| 0064 | Minimum Path Sum | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16 | 1 | 99.94 |
| 0063 | Unique Paths II | Medium | Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_15 | 0 | 100.00 |
| 0062 | Unique Paths | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Algorithm_II_Day_13_Dynamic_Programming, Dynamic_Programming_I_Day_15, Level_1_Day_11_Dynamic_Programming | 1 | 46.91 |
| 0061 | Rotate List | Medium | Two_Pointers, Linked_List, Programming_Skills_II_Day_16 | 0 | 100.00 |
| 0060 | Permutation Sequence | Hard | Math, Recursion | 1 | 99.90 |
| 0059 | Spiral Matrix II | Medium | Array, Matrix, Simulation, Data_Structure_II_Day_3_Array | 0 | 100.00 |
| 0058 | Length of Last Word | Easy | String, Programming_Skills_II_Day_6 | 0 | 100.00 |
| 0057 | Insert Interval | Medium | Array | 2 | 76.42 |
| 0056 | Merge Intervals | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Data_Structure_II_Day_2_Array | 13 | 55.73 |
| 0055 | Jump Game | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Algorithm_II_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_4 | 2 | 89.91 |
| 0054 | Spiral Matrix | Medium | Top_Interview_Questions, Array, Matrix, Simulation, Programming_Skills_II_Day_8 | 0 | 100.00 |
| 0053 | Maximum Subarray | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Data_Structure_I_Day_1_Array, Dynamic_Programming_I_Day_5 | 2 | 63.61 |
| 0052 | N-Queens II | Hard | Backtracking | 1 | 97.55 |
| 0051 | N-Queens | Hard | Top_100_Liked_Questions, Array, Backtracking | 1 | 100.00 |
| 0050 | Pow(x, n) | Medium | Top_Interview_Questions, Math, Recursion | 1 | 82.34 |
| 0049 | Group Anagrams | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Data_Structure_II_Day_8_String, Programming_Skills_II_Day_11 | 11 | 71.16 |
| 0048 | Rotate Image | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Data_Structure_II_Day_3_Array, Programming_Skills_II_Day_7 | 0 | 100.00 |
| 0047 | Permutations II | Medium | Array, Backtracking, Algorithm_II_Day_10_Recursion_Backtracking | 2 | 93.29 |
| 0046 | Permutations | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Algorithm_I_Day_11_Recursion_Backtracking | 1 | 97.24 |
| 0045 | Jump Game II | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Algorithm_II_Day_13_Dynamic_Programming, Dynamic_Programming_I_Day_4 | 2 | 75.75 |
| 0044 | Wildcard Matching | Hard | Top_Interview_Questions, String, Dynamic_Programming, Greedy, Recursion | 4 | 90.87 |
| 0043 | Multiply Strings | Medium | String, Math, Simulation, Data_Structure_II_Day_8_String, Programming_Skills_II_Day_4 | 2 | 99.84 |
| 0042 | Trapping Rain Water | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Dynamic_Programming_I_Day_9 | 1 | 98.06 |
| 0041 | First Missing Positive | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table | 5 | 50.34 |
| 0040 | Combination Sum II | Medium | Array, Backtracking, Algorithm_II_Day_10_Recursion_Backtracking | 4 | 86.03 |
| 0039 | Combination Sum | Medium | Top_100_Liked_Questions, Array, Backtracking, Algorithm_II_Day_10_Recursion_Backtracking | 3 | 92.97 |
| 0038 | Count and Say | Medium | Top_Interview_Questions, String | 2 | 99.52 |
| 0037 | Sudoku Solver | Hard | Array, Matrix, Backtracking | 3 | 98.89 |
| 0036 | Valid Sudoku | Medium | Top_Interview_Questions, Array, Hash_Table, Matrix, Data_Structure_I_Day_5_Array | 2 | 95.85 |
| 0035 | Search Insert Position | Easy | Top_100_Liked_Questions, Array, Binary_Search, Algorithm_I_Day_1_Binary_Search, Binary_Search_I_Day_2 | 0 | 100.00 |
| 0034 | Find First and Last Position of Element in Sorted Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_5 | 0 | 100.00 |
| 0033 | Search in Rotated Sorted Array | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_11 | 0 | 100.00 |
| 0032 | Longest Valid Parentheses | Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Stack | 2 | 93.91 |
| 0031 | Next Permutation | Medium | Top_100_Liked_Questions, Array, Two_Pointers | 1 | 85.59 |
| 0030 | Substring with Concatenation of All Words | Hard | String, Hash_Table, Sliding_Window | 9 | 97.68 |
| 0029 | Divide Two Integers | Medium | Top_Interview_Questions, Math, Bit_Manipulation | 1 | 99.96 |
| 0028 | Implement strStr() | Easy | Top_Interview_Questions, String, Two_Pointers, String_Matching, Programming_Skills_II_Day_1 | 0 | 100.00 |
| 0027 | Remove Element | Easy | Array, Two_Pointers | 0 | 100.00 |
| 0026 | Remove Duplicates from Sorted Array | Easy | Top_Interview_Questions, Array, Two_Pointers | 1 | 99.47 |
| 0025 | Reverse Nodes in k-Group | Hard | Top_100_Liked_Questions, Linked_List, Recursion, Data_Structure_II_Day_13_Linked_List | 0 | 100.00 |
| 0024 | Swap Nodes in Pairs | Medium | Top_100_Liked_Questions, Linked_List, Recursion, Data_Structure_II_Day_12_Linked_List | 0 | 100.00 |
| 0023 | Merge k Sorted Lists | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Heap_Priority_Queue, Linked_List, Divide_and_Conquer, Merge_Sort | 2 | 97.31 |
| 0022 | Generate Parentheses | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking | 2 | 63.16 |
| 0021 | Merge Two Sorted Lists | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Data_Structure_I_Day_7_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List | 1 | 69.17 |
| 0020 | Valid Parentheses | Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Data_Structure_I_Day_9_Stack_Queue | 3 | 51.72 |
| 0019 | Remove Nth Node From End of List | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Algorithm_I_Day_5_Two_Pointers | 1 | 59.72 |
| 0018 | 4Sum | Medium | Array, Sorting, Two_Pointers | 23 | 63.00 |
| 0017 | Letter Combinations of a Phone Number | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking | 0 | 100.00 |
| 0016 | 3Sum Closest | Medium | Array, Sorting, Two_Pointers | 3 | 99.98 |
| 0015 | 3Sum | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_II_Day_1_Array, Algorithm_II_Day_3_Two_Pointers | 28 | 71.04 |
| 0014 | Longest Common Prefix | Easy | Top_Interview_Questions, String | 1 | 84.75 |
| 0013 | Roman to Integer | Easy | Top_Interview_Questions, String, Hash_Table, Math | 6 | 79.00 |
| 0012 | Integer to Roman | Medium | String, Hash_Table, Math | 7 | 75.71 |
| 0011 | Container With Most Water | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Algorithm_II_Day_4_Two_Pointers | 2 | 99.81 |
| 0010 | Regular Expression Matching | Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Recursion | 3 | 80.22 |
| 0009 | Palindrome Number | Easy | Math | 13 | 58.99 |
| 0008 | String to Integer (atoi) | Medium | Top_Interview_Questions, String | 3 | 57.89 |
| 0007 | Reverse Integer | Medium | Top_Interview_Questions, Math | 2 | 66.74 |
| 0006 | Zigzag Conversion | Medium | String | 3 | 98.64 |
| 0005 | Longest Palindromic Substring | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Data_Structure_II_Day_9_String, Algorithm_II_Day_14_Dynamic_Programming, Dynamic_Programming_I_Day_17 | 10 | 98.57 |
| 0004 | Median of Two Sorted Arrays | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Divide_and_Conquer | 3 | 81.72 |
| 0003 | Longest Substring Without Repeating Characters | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Algorithm_I_Day_6_Sliding_Window | 5 | 91.03 |
| 0002 | Add Two Numbers | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Data_Structure_II_Day_10_Linked_List, Programming_Skills_II_Day_15 | 2 | 98.23 |
| 0001 | Two Sum | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Data_Structure_I_Day_2_Array, Level_1_Day_13_Hashmap | 4 | 69.91 |
