| 4 | Median of Two Sorted Arrays | Hard |
| 11 | Container With Most Water | Medium |
| 12 | Integer to Roman | Medium |
| 13 | Roman to Integer | Easy |
| 14 | Longest Common Prefix | Easy |
| 15 | 3Sum | Medium |
| 16 | 3Sum Closest | Medium |
| 19 | Remove Nth Node From End of List | Medium |
| 22 | Generate Parentheses | Medium |
| 25 | Reverse Nodes in k-Group | Hard |
| 26 | Remove Duplicates from Sorted Array | Easy |
| 27 | Remove Element | Easy |
| 29 | Divide Two Integers | Medium |
| 30 | Substring with Concatenation of All Words | Hard |
| 32 | Longest Valid Parentheses | Hard |
| 33 | Search in Rotated Sorted Array | Medium |
| 36 | Valid Sudoku | Medium |
| 37 | Sudoku Solver | Hard |
| 38 | Count and Say | Medium |
| 40 | Combination Sum II | Medium |
| 44 | Wildcard Matching | Hard |
| 51 | N-Queens | Hard |
| 52 | N-Queens II | Hard |
| 56 | Merge Intervals | Medium |
| 58 | Length of Last Word | Easy |
| 63 | Unique Paths II | Medium |
| 66 | Plus One | Easy |
| 67 | Add Binary | Easy |
| 68 | Text Justification | Hard |
| 70 | Climbing Stairs | Easy |
| 73 | Set Matrix Zeroes | Medium |
| 75 | Sort Colors | Medium |
| 76 | Minimum Window Substring | Hard |
| 85 | Maximal Rectangle | Hard |
| 86 | Partition List | Medium |
| 87 | Scramble String | Hard |
| 92 | Reverse Linked List II | Medium |
| 95 | Unique Binary Search Trees II | Medium |
| 99 | Recover Binary Search Tree | Medium |
| 100 | Same Tree | Easy |
| 102 | Binary Tree Level Order Traversal | Medium |
| 106 | Construct Binary Tree from Inorder and Postorder Traversal | Medium |
| 107 | Binary Tree Level Order Traversal II | Medium |
| 108 | Convert Sorted Array to Binary Search Tree | Easy |
| 110 | Balanced Binary Tree | Easy |
| 111 | Minimum Depth of Binary Tree | Easy |
| 112 | Path Sum | Easy |
| 113 | Path Sum II | Medium |
| 114 | Flatten Binary Tree to Linked List | Medium |
| 118 | Pascal's Triangle | Easy |
| 120 | Triangle | Medium |
| 122 | Best Time to Buy and Sell Stock II | Medium |
| 126 | Word Ladder II | Hard |
| 135 | Candy | Hard |
| 137 | Single Number II | Medium |
| 144 | Binary Tree Preorder Traversal | Easy |
| 145 | Binary Tree Postorder Traversal | Easy |
| 146 | LRU Cache | Medium |
| 160 | Intersection of Two Linked Lists | Easy |
| 162 | Find Peak Element | Medium |
| 165 | Compare Version Numbers | Medium |
| 166 | Fraction to Recurring Decimal | Medium |
| 171 | Excel Sheet Column Number | Easy |
| 172 | Factorial Trailing Zeroes | Medium |
| 174 | Dungeon Game | Hard |
| 179 | Largest Number | Medium |
| 189 | Rotate Array | Medium |
| 190 | Reverse Bits | Easy |
| 198 | House Robber | Medium |
| 202 | Happy Number | Easy |
| 210 | Course Schedule II | Medium |
| 212 | Word Search II | Hard |
| 213 | House Robber II | Medium |
| 214 | Shortest Palindrome | Hard |
| 218 | The Skyline Problem | Hard |
| 219 | Contains Duplicate II | Easy |
| 220 | Contains Duplicate III | Hard |
| 221 | Maximal Square | Medium |
| 222 | Count Complete Tree Nodes | Medium |
| 230 | Kth Smallest Element in a BST | Medium |
| 231 | Power of Two | Easy |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium |
| 237 | Delete Node in a Linked List | Easy |
| 239 | Sliding Window Maximum | Hard |
| 241 | Different Ways to Add Parentheses | Medium |
| 257 | Binary Tree Paths | Easy |
| 263 | Ugly Number | Easy |
| 264 | Ugly Number II | Medium |
| 273 | Integer to English Words | Hard |
| 278 | First Bad Version | Easy |
| 299 | Bulls and Cows | Unknown |
| 303 | Range Sum Query - Immutable | Easy |
| 304 | Range Sum Query 2D - Immutable | Medium |
| 309 | Best Time to Buy and Sell Stock with Cooldown | Medium |
| 310 | Minimum Height Trees | Unknown |
| 316 | Remove Duplicate Letters | Medium |
| 319 | Bulb Switcher | Medium |
| 321 | Create Maximum Number | Unknown |
| 324 | Wiggle Sort II | Medium |
| 326 | Power of Three | Easy |
| 329 | Longest Increasing Path in a Matrix | Hard |
| 330 | Patching Array | Hard |
| 331 | Verify Preorder Serialization of a Binary Tree | Unknown |
| 342 | Power of Four | Easy |
| 344 | Reverse String | Easy |
| 350 | Intersection of Two Arrays II | Easy |
| 352 | Data Stream as Disjoint Intervals | Unknown |
| 367 | Valid Perfect Square | Unknown |
| 368 | Largest Divisible Subset | Medium |
| 386 | Lexicographical Numbers | Medium |
| 400 | Nth Digit | Medium |
| 401 | Binary Watch | Easy |
| 405 | Convert a Number to Hexadecimal | Easy |
| 407 | Trapping Rain Water II | Hard |
| 416 | Partition Equal Subset Sum | Medium |
| 417 | Pacific Atlantic Water Flow | Medium |
| 429 | N-ary Tree Level Order Traversal | Medium |
| 432 | All O`one Data Structure | Unknown |
| 440 | K-th Smallest in Lexicographical Order | Hard |
| 460 | LFU Cache | Hard |
| 467 | Unique Substrings in Wraparound String | Medium |
| 474 | Ones and Zeroes | Medium |
| 476 | Number Complement | Easy |
| 477 | Total Hamming Distance | Medium |
| 479 | Largest Palindrome Product | Unknown |
| 494 | Target Sum | Medium |
| 498 | Diagonal Traverse | Medium |
| 500 | Keyboard Row | Easy |
| 502 | IPO | Unknown |
| 508 | Most Frequent Subtree Sum | Medium |
| 513 | Find Bottom Left Tree Value | Medium |
| 515 | Find Largest Value in Each Tree Row | Medium |
| 539 | Minimum Time Difference | Medium |
| 554 | Brick Wall | Medium |
| 558 | Logical OR of Two Binary Grids Represented as Quad-Trees | Unknown |
| 564 | Find the Closest Palindrome | Hard |
| 567 | Permutation in String | Medium |
| 590 | N-ary Tree Postorder Traversal | Easy |
| 592 | Fraction Addition and Subtraction | Unknown |
| 593 | Valid Square | Medium |
| 594 | Longest Harmonious Subsequence | Easy |
| 600 | Non-negative Integers without Consecutive Ones | Hard |
| 605 | Can Place Flowers | Easy |
| 611 | Valid Triangle Number | Medium |
| 623 | Add One Row to Tree | Medium |
| 624 | Maximum Distance in Arrays | Unknown |
| 632 | Smallest Range Covering Elements from K Lists | Hard |
| 633 | Sum of Square Numbers | Medium |
| 641 | Design Circular Deque | Unknown |
| 646 | Maximum Length of Pair Chain | Medium |
| 650 | 2 Keys Keyboard | Medium |
| 657 | Robot Return to Origin | Unknown |
| 658 | Find K Closest Elements | Medium |
| 664 | Strange Printer | Hard |
| 670 | Maximum Swap | Medium |
| 678 | Valid Parenthesis String | Medium |
| 679 | 24 Game | Hard |
| 684 | Redundant Connection | Medium |
| 689 | Maximum Sum of 3 Non-Overlapping Subarrays | Unknown |
| 693 | Binary Number with Alternating Bits | Easy |
| 696 | Count Binary Substrings | Easy |
| 699 | Falling Squares | Hard |
| 700 | Search in a Binary Search Tree | Easy |
| 703 | Kth Largest Element in a Stream | Easy |
| 706 | Design HashMap | Unknown |
| 707 | Design Linked List | Medium |
| 709 | To Lower Case | Easy |
| 712 | Minimum ASCII Delete Sum for Two Strings | Medium |
| 717 | 1-bit and 2-bit Characters | Easy |
| 719 | Find K-th Smallest Pair Distance | Hard |
| 725 | Split Linked List in Parts | Medium |
| 729 | My Calendar I | Medium |
| 731 | My Calendar II | Unknown |
| 744 | Find Smallest Letter Greater Than Target | Easy |
| 752 | Open the Lock | Medium |
| 756 | Pyramid Transition Matrix | Unknown |
| 757 | Set Intersection Size At Least Two | Unknown |
| 761 | Special Binary String | Unknown |
| 762 | Prime Number of Set Bits in Binary Representation | Medium |
| 763 | Partition Labels | Medium |
| 769 | Max Chunks To Make Sorted | Medium |
| 773 | Sliding Puzzle | Hard |
| 778 | Swim in Rising Water | Hard |
| 781 | Rabbits in Forest | Medium |
| 784 | Letter Case Permutation | Medium |
| 788 | Rotated Digits | Medium |
| 790 | Domino and Tromino Tiling | Medium |
| 796 | Rotate String | Easy |
| 799 | Champagne Tower | Medium |
| 802 | Find Eventual Safe States | Medium |
| 807 | Max Increase to Keep City Skyline | Medium |
| 808 | Soup Servings | Unknown |
| 812 | Largest Triangle Area | Hard |
| 818 | Race Car | Unknown |
| 820 | Short Encoding of Words | Medium |
| 821 | Shortest Distance to a Character | Easy |
| 822 | Card Flipping Game | Unknown |
| 825 | Friends Of Appropriate Ages | Medium |
| 826 | Most Profit Assigning Work | Medium |
| 827 | Making A Large Island | Hard |
| 829 | Consecutive Numbers Sum | Hard |
| 832 | Flipping an Image | Easy |
| 834 | Sum of Distances in Tree | Unknown |
| 837 | New 21 Game | Medium |
| 838 | Push Dominoes | Medium |
| 839 | Similar String Groups | Hard |
| 840 | Magic Squares In Grid | Medium |
| 851 | Loud and Rich | Medium |
| 855 | Exam Room | Unknown |
| 856 | Score of Parentheses | Medium |
| 857 | Minimum Cost to Hire K Workers | Hard |
| 860 | Lemonade Change | Easy |
| 862 | Shortest Subarray with Sum at Least K | Hard |
| 865 | Smallest Subtree with all the Deepest Nodes | Medium |
| 866 | Prime Palindrome | Medium |
| 868 | Binary Gap | Unknown |
| 869 | Reordered Power of 2 | Medium |
| 873 | Length of Longest Fibonacci Subsequence | Medium |
| 874 | Walking Robot Simulation | Medium |
| 878 | Nth Magical Number | Hard |
| 884 | Uncommon Words from Two Sentences | Easy |
| 885 | Spiral Matrix III | Medium |
| 889 | Construct Binary Tree from Preorder and Postorder Traversal | Medium |
| 890 | Find and Replace Pattern | Medium |
| 892 | Surface Area of 3D Shapes | Medium |
| 898 | Bitwise ORs of Subarrays | Medium |
| 902 | Numbers At Most N Given Digit Set | Hard |
| 904 | Fruit Into Baskets | Medium |
| 905 | Sort Array By Parity | Easy |
| 908 | Smallest Range I | Easy |
| 909 | Snakes and Ladders | Medium |
| 912 | Sort an Array | Medium |
| 916 | Word Subsets | Medium |
| 917 | Reverse Only Letters | Easy |
| 921 | Minimum Add to Make Parentheses Valid | Medium |
| 928 | Minimize Malware Spread II | Unknown |
| 944 | Delete Columns to Make Sorted | Easy |
| 947 | Most Stones Removed with Same Row or Column | Medium |
| 951 | Flip Equivalent Binary Trees | Medium |
| 955 | Delete Columns to Make Sorted II | Medium |
| 959 | Regions Cut By Slashes | Unknown |
| 960 | Delete Columns to Make Sorted III | Hard |
| 961 | N-Repeated Element in Size 2N Array | Unknown |
| 962 | Maximum Width Ramp | Medium |
| 965 | Univalued Binary Tree | Easy |
| 966 | Vowel Spellchecker | Medium |
| 973 | K Closest Points to Origin | Medium |
| 976 | Largest Perimeter Triangle | Medium |
| 981 | Time Based Key-Value Store | Medium |
| 983 | Minimum Cost For Tickets | Medium |
| 995 | Minimum Number of K Consecutive Bit Flips | Unknown |
| 998 | Maximum Binary Tree II | Medium |
| 1000 | Minimum Cost to Merge Stones | Hard |
| 1006 | Clumsy Factorial | Medium |
| 1007 | Minimum Domino Rotations For Equal Row | Medium |
| 1009 | Complement of Base 10 Integer | Easy |
| 1011 | Capacity To Ship Packages Within D Days | Medium |
| 1014 | Best Sightseeing Pair | Medium |
| 1015 | Smallest Integer Divisible by K | Medium |
| 1018 | Binary Prefix Divisible By 5 | Easy |
| 1022 | Sum of Root To Leaf Binary Numbers | Easy |
| 1028 | Recover a Tree From Preorder Traversal | Hard |
| 1038 | Binary Search Tree to Greater Sum Tree | Medium |
| 1039 | Minimum Score Triangulation of Polygon | Medium |
| 1052 | Grumpy Bookstore Owner | Medium |
| 1061 | Lexicographically Smallest Equivalent String | Medium |
| 1072 | Flip Columns For Maximum Number of Equal Rows | Medium |
| 1079 | Letter Tile Possibilities | Medium |
| 1080 | Insufficient Nodes in Root to Leaf Paths | Medium |
| 1081 | Smallest Subsequence of Distinct Characters | Medium |
| 1092 | Shortest Common Supersequence | Hard |
| 1105 | Filling Bookcase Shelves | Medium |
| 1106 | Parsing A Boolean Expression | Hard |
| 1110 | Delete Nodes And Return Forest | Medium |
| 1123 | Lowest Common Ancestor of Deepest Leaves | Medium |
| 1128 | Number of Equivalent Domino Pairs | Easy |
| 1140 | Stone Game II | Medium |
| 1161 | Maximum Level Sum of a Binary Tree | Medium |
| 1190 | Reverse Substrings Between Each Pair of Parentheses | Medium |
| 1200 | Minimum Absolute Difference | Easy |
| 1233 | Remove Sub-Folders from the Filesystem | Medium |
| 1248 | Count Number of Nice Subarrays | Medium |
| 1261 | Find Elements in a Contaminated Binary Tree | Medium |
| 1262 | Greatest Sum Divisible by Three | Medium |
| 1266 | Minimum Time Visiting All Points | Easy |
| 1267 | Count Servers that Communicate | Medium |
| 1277 | Count Square Submatrices with All Ones | Medium |
| 1287 | Element Appearing More Than 25% In Sorted Array | Easy |
| 1290 | Convert Binary Number in a Linked List to Integer | Easy |
| 1295 | Find Numbers with Even Number of Digits | Easy |
| 1298 | Maximum Candies You Can Get from Boxes | Unknown |
| 1304 | Find N Unique Integers Sum up to Zero | Unknown |
| 1305 | All Elements in Two Binary Search Trees | Unknown |
| 1310 | XOR Queries of a Subarray | Medium |
| 1317 | Convert Integer to the Sum of Two No-Zero Integers | Unknown |
| 1319 | Number of Operations to Make Network Connected | Medium |
| 1323 | Maximum 69 Number | Easy |
| 1331 | Rank Transform of an Array | Unknown |
| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium |
| 1339 | Maximum Product of Splitted Binary Tree | Medium |
| 1346 | Check If N and Its Double Exist | Unknown |
| 1352 | Product of the Last K Numbers | Medium |
| 1353 | Maximum Number of Events That Can Be Attended | Medium |
| 1358 | Number of Substrings Containing All Three Characters | Medium |
| 1367 | Linked List in Binary Tree | Medium |
| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | Hard |
| 1371 | Find the Longest Substring Containing Vowels in Even Counts | Medium |
| 1380 | Lucky Numbers in a Matrix | Easy |
| 1381 | Design a Stack With Increment Operation | Unknown |
| 1382 | Balance a Binary Search Tree | Medium |
| 1390 | Four Divisors | Unknown |
| 1392 | Longest Happy Prefix | Unknown |
| 1394 | Find Lucky Integer in an Array | Unknown |
| 1395 | Count Number of Teams | Unknown |
| 1399 | Count Largest Group | Unknown |
| 1400 | Construct K Palindrome Strings | Unknown |
| 1405 | Longest Happy String | Unknown |
| 1408 | String Matching in an Array | Unknown |
| 1410 | HTML Entity Parser | Unknown |
| 1411 | Number of Ways to Paint N × 3 Grid | Unknown |
| 1415 | The k-th Lexicographical String of All Happy Strings of Length n | Unknown |
| 1422 | Maximum Score After Splitting a String | Unknown |
| 1432 | Max Difference You Can Get From Changing an Integer | Unknown |
| 1437 | Check If All 1's Are at Least Length K Places Away | Medium |
| 1450 | Number of Students Doing Homework at a Given Time | Easy |
| 1455 | Check If a Word Occurs As a Prefix of Any Word in a Sentence | Unknown |
| 1458 | Max Dot Product of Two Subsequences | Medium |
| 1460 | Make Two Arrays Equal by Reversing Subarrays | Unknown |
| 1461 | Check If a String Contains All Binary Codes of Size K | Medium |
| 1462 | Course Schedule IV | Medium |
| 1465 | Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | Unknown |
| 1475 | Final Prices With a Special Discount in a Shop | Easy |
| 1482 | Minimum Number of Days to Make m Bouquets | Medium |
| 1486 | XOR Operation in an Array | Easy |
| 1487 | Making File Names Unique | Unknown |
| 1488 | Avoid Flood in The City | Unknown |
| 1493 | Longest Subarray of 1's After Deleting One Element | Medium |
| 1497 | Check If Array Pairs Are Divisible by k | Medium |
| 1498 | Number of Subsequences That Satisfy the Given Sum Condition | Medium |
| 1503 | Last Moment Before All Ants Fall Out of a Plank | Unknown |
| 1504 | Count Submatrices With All Ones | Unknown |
| 1508 | Range Sum of Sorted Subarray Sums | Medium |
| 1509 | Minimum Difference Between Largest and Smallest Value in Three Moves | Medium |
| 1513 | Number of Substrings With Only 1s | Unknown |
| 1514 | Path with Maximum Probability | Medium |
| 1518 | Water Bottles | Unknown |
| 1523 | Count Odd Numbers in an Interval Range | Easy |
| 1524 | Number of Sub-arrays With Odd Sum | Medium |
| 1526 | Minimum Number of Increments on Subarrays to Form a Target Array | Unknown |
| 1529 | Minimum Suffix Flips | Unknown |
| 1530 | Number of Good Leaf Nodes Pairs | Medium |
| 1534 | Count Good Triplets | Easy |
| 1536 | Minimum Swaps to Arrange a Binary Grid | Unknown |
| 1545 | Find Kth Bit in Nth Binary String | Easy |
| 1550 | Three Consecutive Odds | Unknown |
| 1552 | Magnetic Force Between Two Balls | Medium |
| 1568 | Minimum Number of Days to Disconnect Island | Unknown |
| 1573 | Number of Ways to Split a String | Unknown |
| 1574 | Shortest Subarray to be Removed to Make Array Sorted | Unknown |
| 1578 | Minimum Time to Make Rope Colorful | Medium |
| 1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | Unknown |
| 1582 | Special Positions in a Binary Matrix | Unknown |
| 1590 | Make Sum Divisible by P | Medium |
| 1593 | Split a String Into the Max Number of Unique Substrings | Medium |
| 1598 | Crawler Log Folder | Easy |
| 1605 | Find Valid Matrix Given Row and Column Sums | Unknown |
| 1611 | Minimum One Bit Operations to Make Integers Zero | Unknown |
| 1621 | Number of Sets of K Non-Overlapping Line Segments | Unknown |
| 1622 | Fancy Sequence | Unknown |
| 1625 | Lexicographically Smallest String After Applying Operations | Unknown |
| 1636 | Sort Array by Increasing Frequency | Unknown |
| 1639 | Number of Ways to Form a Target String Given a Dictionary | Hard |
| 1652 | Defuse the Bomb | Unknown |
| 1653 | Minimum Deletions to Make String Balanced | Medium |
| 1671 | Minimum Number of Removals to Make Mountain Array | Hard |
| 1678 | Goal Parser Interpretation | Unknown |
| 1680 | Concatenation of Consecutive Binary Numbers | Unknown |
| 1684 | Count the Number of Consistent Strings | Easy |
| 1689 | Partitioning Into Minimum Number Of Deci-Binary Numbers | Medium |
| 1695 | Maximum Erasure Value | Medium |
| 1700 | Number of Students Unable to Eat Lunch | Easy |
| 1701 | Average Waiting Time | Medium |
| 1716 | Calculate Money in Leetcode Bank | Easy |
| 1717 | Maximum Score From Removing Substrings | Unknown |
| 1718 | Construct the Lexicographically Largest Valid Sequence | Unknown |
| 1726 | Tuple with Same Product | Medium |
| 1727 | Largest Submatrix With Rearrangements | Unknown |
| 1733 | Minimum Number of People to Teach | Unknown |
| 1749 | Maximum Absolute Sum of Any Subarray | Medium |
| 1751 | Maximum Number of Events That Can Be Attended II | Unknown |
| 1752 | Check if Array Is Sorted and Rotated | Easy |
| 1758 | Minimum Changes To Make Alternating Binary String | Unknown |
| 1760 | Minimum Limit of Balls in a Bag | Medium |
| 1763 | Longest Nice Substring | Easy |
| 1765 | Map of Highest Peak | Medium |
| 1766 | Tree of Coprimes | Unknown |
| 1768 | Merge Strings Alternately | Easy |
| 1769 | Minimum Number of Operations to Move All Balls to Each Box | Medium |
| 1779 | Find Nearest Point That Has the Same X or Y Coordinate | Unknown |
| 1780 | Check if Number is a Sum of Powers of Three | Unknown |
| 1784 | Check if Binary String Has at Most One Segment of Ones | Unknown |
| 1790 | Check if One String Swap Can Make Strings Equal | Easy |
| 1791 | Find Center of Star Graph | Easy |
| 1792 | Maximum Average Pass Ratio | Medium |
| 1799 | Maximize Score After N Operations | Unknown |
| 1800 | Maximum Ascending Subarray Sum | Unknown |
| 1802 | Maximum Value at a Given Index in a Bounded Array | Hard |
| 1813 | Sentence Similarity III | Unknown |
| 1823 | Find the Winner of the Circular Game | Medium |
| 1829 | Maximum XOR for Each Query | Unknown |
| 1844 | Replace All Digits with Characters | Easy |
| 1857 | Largest Color Value in a Directed Graph | Hard |
| 1859 | Sorting the Sentence | Unknown |
| 1861 | Rotating the Box | Easy |
| 1862 | Sum of Floored Pairs | Unknown |
| 1863 | Sum of All Subset XOR Totals | Unknown |
| 1865 | Finding Pairs With a Certain Sum | Unknown |
| 1877 | Minimize Maximum Pair Sum in Array | Easy |
| 1878 | Get Biggest Three Rhombus Sums in a Grid | Unknown |
| 1886 | Determine Whether Matrix Can Be Obtained By Rotation | Unknown |
| 1888 | Minimum Number of Flips to Make the Binary String Alternating | Unknown |
| 1894 | Find the Student that Will Replace the Chalk | Unknown |
| 1895 | Largest Magic Square | Unknown |
| 1900 | The Earliest and Latest Rounds Where Players Compete | Unknown |
| 1905 | Count Sub Islands | Unknown |
| 1910 | Remove All Occurrences of a Substring | Unknown |
| 1911 | Maximum Alternating Subsequence Sum | Unknown |
| 1912 | Design Movie Rental System | Unknown |
| 1920 | Build Array from Permutation | Easy |
| 1922 | Count Good Numbers | Unknown |
| 1925 | Count Square Sum Triples | Unknown |
| 1930 | Unique Length-3 Palindromic Subsequences | Medium |
| 1931 | Painting a Grid With Three Different Colors | Unknown |
| 1935 | Maximum Number of Words You Can Type | Unknown |
| 1937 | Maximum Number of Points with Cost | Unknown |
| 1938 | Maximum Genetic Difference Query | Unknown |
| 1942 | The Number of the Smallest Unoccupied Chair | Unknown |
| 1945 | Sum of Digits of String After Convert | Unknown |
| 1948 | Delete Duplicate Folders in System | Unknown |
| 1957 | Delete Characters to Make Fancy String | Unknown |
| 1963 | Minimum Number of Swaps to Make the String Balanced | Unknown |
| 1967 | Number of Strings That Appear as Substrings in Word | Unknown |
| 1970 | Last Day Where You Can Still Cross | Unknown |
| 1971 | Find if Path Exists in Graph | Easy |
| 1975 | Maximum Matrix Sum | Unknown |
| 1976 | Number of Ways to Arrive at Destination | Medium |
| 1980 | Find Unique Binary String | Medium |
| 1994 | The Number of Good Subsets | Unknown |
| 1995 | Count Special Quadruplets | Unknown |
| 2007 | Find Original Array From Doubled Array | Unknown |
| 2008 | Maximum Earnings From Taxi | Unknown |
| 2009 | Minimum Number of Operations to Make Array Continuous | Unknown |
| 2011 | Final Value of Variable After Performing Operations | Unknown |
| 2014 | Longest Subsequence Repeated k Times | Unknown |
| 2016 | Maximum Difference Between Increasing Elements | Easy |
| 2017 | Grid Game | Unknown |
| 2022 | Convert 1D Array Into 2D Array | Medium |
| 2028 | Find Missing Observations | Unknown |
| 2033 | Minimum Operations to Make a Uni-Value Grid | Unknown |
| 2043 | Simple Bank System | Unknown |
| 2044 | Count Number of Maximum Bitwise-OR Subsets | Medium |
| 2045 | Second Minimum Time to Reach Destination | Unknown |
| 2048 | Next Greater Numerically Balanced Number | Medium |
| 2053 | Kth Distinct String in an Array | Unknown |
| 2054 | Two Best Non-Overlapping Events | Unknown |
| 2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points | Unknown |
| 2064 | Minimized Maximum of Products Distributed to Any Store | Unknown |
| 2070 | Most Beautiful Item for Each Query | Medium |
| 2090 | K Radius Subarray Averages | Medium |
| 2091 | Removing Minimum and Maximum From Array | Medium |
| 2092 | Find All People With Secret | Unknown |
| 2094 | Finding 3-Digit Even Numbers | Unknown |
| 2096 | Step-By-Step Directions From a Binary Tree Node to Another | Medium |
| 2097 | Valid Arrangement of Pairs | Unknown |
| 2099 | Find Subsequence of Length K With the Largest Sum | Easy |
| 2106 | Maximum Fruits Harvested After at Most K Steps | Unknown |
| 2109 | Adding Spaces to a String | Easy |
| 2110 | Number of Smooth Descent Periods of a Stock | Medium |
| 2115 | Find All Possible Recipes from Given Supplies | Unknown |
| 2116 | Check if a Parentheses String Can Be Valid | Medium |
| 2125 | Number of Laser Beams in a Bank | Medium |
| 2127 | Maximum Employees to Be Invited to a Meeting | Unknown |
| 2131 | Longest Palindrome by Concatenating Two Letter Words | Medium |
| 2134 | Minimum Swaps to Group All 1's Together II | Medium |
| 2138 | Divide a String Into Groups of Size k | Unknown |
| 2140 | Solving Questions With Brainpower | Medium |
| 2141 | Maximum Running Time of N Computers | Unknown |
| 2145 | Count the Hidden Sequences | Unknown |
| 2147 | Number of Ways to Divide a Long Corridor | Unknown |
| 2154 | Keep Multiplying Found Values by Two | Easy |
| 2161 | Partition Array According to Given Pivot | Medium |
| 2163 | Minimum Difference in Sums After Removal of Elements | Unknown |
| 2169 | Count Operations to Obtain Zero | Unknown |
| 2176 | Count Equal and Divisible Pairs in an Array | Unknown |
| 2179 | Count Good Triplets in an Array | Unknown |
| 2181 | Merge Nodes in Between Zeros | Medium |
| 2182 | Construct String With Repeat Limit | Medium |
| 2185 | Counting Words With a Given Prefix | Easy |
| 2191 | Sort the Jumbled Numbers | Unknown |
| 2192 | All Ancestors of a Node in a Directed Acyclic Graph | Medium |
| 2196 | Create Binary Tree From Descriptions | Medium |
| 2197 | Replace Non-Coprime Numbers in Array | Unknown |
| 2200 | Find All K-Distant Indices in an Array | Easy |
| 2206 | Divide Array Into Equal Pairs | Easy |
| 2210 | Count Hills and Valleys in an Array | Unknown |
| 2211 | Count Collisions on a Road | Unknown |
| 2220 | Minimum Bit Flips to Convert Number | Easy |
| 2221 | Find Triangular Sum of an Array | Medium |
| 2225 | Find Players With Zero or One Losses | Medium |
| 2226 | Maximum Candies Allocated to K Children | Medium |
| 2236 | Root Equals Sum of Children | Easy |
| 2257 | Count Unguarded Cells in the Grid | Unknown |
| 2264 | Largest 3-Same-Digit Number in String | Easy |
| 2270 | Number of Ways to Split Array | Medium |
| 2271 | Maximum White Tiles Covered by a Carpet | Unknown |
| 2273 | Find Resultant Array After Removing Anagrams | Unknown |
| 2275 | Largest Combination With Bitwise AND Greater Than Zero | Medium |
| 2285 | Maximum Total Importance of Roads | Hard |
| 2290 | Minimum Obstacle Removal to Reach Corner | Hard |
| 2294 | Partition Array Such That Maximum Difference Is K | Hard |
| 2300 | Successful Pairs of Spells and Potions | Medium |
| 2302 | Count Subarrays With Score Less Than K | Hard |
| 2311 | Longest Binary Subsequence Less Than or Equal to K | Medium |
| 2322 | Minimum Score After Removals on a Tree | Unknown |
| 2326 | Spiral Matrix IV | Hard |
| 2327 | Number of People Aware of a Secret | Unknown |
| 2331 | Evaluate Boolean Binary Tree | Easy |
| 2337 | Move Pieces to Obtain a String | Medium |
| 2338 | Count the Number of Ideal Arrays | Medium |
| 2342 | Max Sum of a Pair With Equal Sum of Digits | Medium |
| 2344 | Minimum Deletions to Make Array Divisible | Hard |
| 2348 | Number of Zero-Filled Subarrays | Medium |
| 2349 | Design a Number Container System | Medium |
| 2353 | Design a Food Rating System | Medium |
| 2359 | Find Closest Node to Given Two Nodes | Unknown |
| 2364 | Count Number of Bad Pairs | Hard |
| 2369 | Check if There is a Valid Partition For The Array | Medium |
| 2370 | Longest Ideal Subsequence | Medium |
| 2375 | Construct Smallest Number From DI String | Medium |
| 2379 | Minimum Recolors to Get K Consecutive Black Blocks | Easy |
| 2381 | Shifting Letters II | Medium |
| 2389 | Longest Subsequence With Limited Sum | Easy |
| 2392 | Build a Matrix With Conditions | Hard |
| 2400 | Number of Ways to Reach a Position After Exactly k Steps | Medium |
| 2401 | Longest Nice Subarray | Medium |
| 2402 | Meeting Rooms III | Hard |
| 2406 | Divide Intervals Into Minimum Number of Groups | Medium |
| 2409 | Count Days Spent Together | Easy |
| 2410 | Maximum Matching of Players With Trainers | Medium |
| 2411 | Smallest Subarrays With Maximum Bitwise OR | Medium |
| 2415 | Reverse Odd Levels of Binary Tree | Medium |
| 2416 | Sum of Prefix Scores of Strings | Hard |
| 2418 | Sort the People | Easy |
| 2419 | Longest Subarray With Maximum Bitwise AND | Medium |
| 2425 | Bitwise XOR of All Pairings | Medium |
| 2429 | Minimize XOR | Hard |
| 2434 | Using a Robot to Print the Lexicographically Smallest String | Medium |
| 2435 | Paths in Matrix Whose Sum Is Divisible by K | Hard |
| 2438 | Range Product Queries of Powers | Unknown |
| 2440 | Create Components With Same Value | Medium |
| 2444 | Count Subarrays With Fixed Bounds | Hard |
| 2458 | Height of Binary Tree After Subtree Removal Queries | Unknown |
| 2460 | Apply Operations to an Array | Easy |
| 2461 | Maximum Sum of Distinct Subarrays With Length K | Medium |
| 2463 | Minimum Total Distance Traveled | Hard |
| 2466 | Count Ways To Build Good Strings | Medium |
| 2467 | Most Profitable Path in a Tree | Medium |
| 2490 | Circular Sentence | Easy |
| 2491 | Divide Players Into Teams of Equal Skill | Medium |
| 2493 | Divide Nodes Into the Maximum Number of Groups | Hard |
| 2501 | Longest Square Streak in an Array | Medium |
| 2503 | Maximum Number of Points From Grid Queries | Hard |
| 2508 | Add Edges to Make Degrees of All Nodes Even | Hard |
| 2509 | Cycle Length Queries in a Tree | Medium |
| 2516 | Take K of Each Character From Left and Right | Medium |
| 2523 | Closest Prime Numbers in Range | Medium |
| 2528 | Maximize the Minimum Powered City | Hard |
| 2529 | Maximum Count of Positive Integer and Negative Integer | Easy |
| 2530 | Maximal Score After Applying K Operations | Medium |
| 2536 | Increment Submatrices by One | Medium |
| 2537 | Count the Number of Good Subarrays | Medium |
| 2551 | Put Marbles in Bags | Hard |
| 2553 | Separate the Digits in an Array | Medium |
| 2554 | Maximum Number of Integers to Choose From a Range I | Medium |
| 2558 | Take Gifts From the Richest Pile | Easy |
| 2559 | Count Vowel Strings in Ranges | Medium |
| 2560 | House Robber IV | Medium |
| 2561 | Rearranging Fruits | Hard |
| 2563 | Count the Number of Fair Pairs | Medium |
| 2566 | Maximum Difference by Remapping a Digit | Easy |
| 2570 | Merge Two 2D Arrays by Summing Values | Medium |
| 2572 | Count the Number of Square-Free Subsets | Unknown |
| 2577 | Minimum Time to Visit a Cell In a Grid | Hard |
| 2579 | Count Total Number of Colored Cells | Medium |
| 2582 | Pass the Pillow | Unknown |
| 2583 | Kth Largest Sum in a Binary Tree | Medium |
| 2593 | Find Score of an Array After Marking All Elements | Medium |
| 2594 | Minimum Time to Repair Cars | Unknown |
| 2598 | Smallest Missing Non-negative Integer After Operations | Unknown |
| 2601 | Prime Subtraction Operation | Hard |
| 2609 | Find the Longest Balanced Substring of a Binary String | Easy |
| 2616 | Minimize the Maximum Difference of Pairs | Hard |
| 2639 | Find the Width of Columns of a Grid | Unknown |
| 2640 | Find the Score of All Prefixes of an Array | Medium |
| 2641 | Cousins in Binary Tree II | Medium |
| 2645 | Minimum Additions to Make Valid String | Medium |
| 2654 | Minimum Number of Operations to Make All Array Elements Equal to 1 | Unknown |
| 2657 | Find the Prefix Common Array of Two Arrays | Medium |
| 2658 | Maximum Number of Fish in a Grid | Medium |
| 2661 | First Completely Painted Row or Column | Medium |
| 2678 | Number of Senior Citizens | Easy |
| 2683 | Neighboring Bitwise XOR | Medium |
| 2684 | Maximum Number of Moves in a Grid | Medium |
| 2685 | Count the Number of Complete Components | Medium |
| 2696 | Minimum String Length After Removing Substrings | Easy |
| 2698 | Find the Punishment Number of an Integer | Unknown |
| 2699 | Modify Graph Edge Weights | Unknown |
| 2707 | Extra Characters in a String | Medium |
| 2718 | Sum of Matrix After Queries | Unknown |
| 2749 | Minimum Operations to Make the Integer Zero | Unknown |
| 2751 | Robot Collisions | Unknown |
| 2762 | Continuous Subarrays | Medium |
| 2765 | Longest Alternating Subarray | Easy |
| 2779 | Maximum Beauty of an Array After Applying Operation | Unknown |
| 2780 | Minimum Index of a Valid Split | Medium |
| 2785 | Sort Vowels in a String | Medium |
| 2787 | Ways to Express an Integer as Sum of Powers | Unknown |
| 2799 | Count Complete Subarrays in an Array | Medium |
| 2807 | Insert Greatest Common Divisors in Linked List | Medium |
| 2818 | Apply Operations to Maximize Score | Unknown |
| 2825 | Make String a Subsequence Using Cyclic Increments | Medium |
| 2843 | Count Symmetric Integers | Medium |
| 2845 | Count of Interesting Subarrays | Medium |
| 2872 | Maximum Number of K-Divisible Components | Unknown |
| 2873 | Maximum Value of an Ordered Triplet I | Easy |
| 2874 | Maximum Value of an Ordered Triplet II | Medium |
| 2894 | Divisible and Non-divisible Sums Difference | Easy |
| 2900 | Longest Unequal Adjacent Groups Subsequence I | Easy |
| 2901 | Longest Unequal Adjacent Groups Subsequence II | Unknown |
| 2906 | Construct Product Matrix | Easy |
| 2909 | Minimum Sum of Mountain Triplets II | Medium |
| 2914 | Minimum Number of Changes to Make Binary String Beautiful | Easy |
| 2916 | Subarrays Distinct Element Sum of Squares II | Unknown |
| 2924 | Find Champion II | Medium |
| 2929 | Distribute Candies Among Children II | Medium |
| 2930 | Number of Strings Which Can Be Rearranged to Contain Substring | Medium |
| 2938 | Separate Black and White Balls | Medium |
| 2940 | Find Building Where Alice and Bob Can Meet | Unknown |
| 2942 | Find Words Containing Character | Easy |
| 2943 | Maximize Area of Square Hole in Grid | Medium |
| 2948 | Make Lexicographically Smallest Array by Swapping Elements | Unknown |
| 2962 | Count Subarrays Where Max Element Appears at Least K Times | Medium |
| 2965 | Find Missing and Repeated Values | Unknown |
| 2966 | Divide Array Into Arrays With Max Difference | Medium |
| 2975 | Maximum Square Area by Removing Fences From a Field | Unknown |
| 2976 | Minimum Cost to Convert String I | Medium |
| 2977 | Minimum Cost to Convert String II | Unknown |
| 2980 | Check if Bitwise OR Has Trailing Zeros | Easy |
| 2981 | Find Longest Special Substring That Occurs Thrice I | Medium |
| 2999 | Count the Number of Powerful Integers | Unknown |
| 3000 | Maximum Area of Longest Diagonal Rectangle | Medium |
| 3001 | Minimum Moves to Capture The Queen | Unknown |
| 3003 | Maximize the Number of Partitions After Operations | Unknown |
| 3005 | Count Elements With Maximum Frequency | Easy |
| 3010 | Divide an Array Into Subarrays With Minimum Cost I | Easy |
| 3011 | Find if Array Can Be Sorted | Unknown |
| 3013 | Divide an Array Into Subarrays With Minimum Cost II | Unknown |
| 3016 | Minimum Number of Pushes to Type Word II | Medium |
| 3021 | Alice and Bob Playing Flower Game | Unknown |
| 3024 | Type of Triangle | Easy |
| 3025 | Find the Number of Ways to Place People I | Unknown |
| 3027 | Find the Number of Ways to Place People II | Unknown |
| 3042 | Count Prefix and Suffix Pairs I | Easy |
| 3043 | Find the Length of the Longest Common Prefix | Easy |
| 3047 | Find the Largest Area of Square Inside Two Rectangles | Easy |
| 3066 | Minimum Operations to Exceed Threshold Value II | Medium |
| 3068 | Find the Maximum Sum of Node Values | Hard |
| 3070 | Count Submatrices with Top-Left Element and Sum Less Than k | Easy |
| 3074 | Apple Redistribution into Boxes | Unknown |
| 3085 | Minimum Deletions to Make String K-Special | Easy |
| 3097 | Shortest Subarray With OR at Least K II | Medium |
| 3100 | Water Bottles II | Easy |
| 3105 | Longest Strictly Increasing or Strictly Decreasing Subarray | Easy |
| 3108 | Minimum Cost Walk in Weighted Graph | Unknown |
| 3116 | Kth Smallest Amount With Single Denomination Combination | Medium |
| 3122 | Minimum Number of Operations to Satisfy Conditions | Unknown |
| 3129 | Find All Possible Stable Binary Arrays I | Unknown |
| 3130 | Find All Possible Stable Binary Arrays II | Unknown |
| 3133 | Minimum Array End | Medium |
| 3136 | Valid Word | Easy |
| 3147 | Taking Maximum Energy From the Mystic Dungeon | Unknown |
| 3149 | Find the Minimum Cost Array Permutation | Medium |
| 3151 | Special Array I | Unknown |
| 3152 | Special Array II | Medium |
| 3160 | Find the Number of Distinct Colors Among the Balls | Medium |
| 3163 | String Compression III | Unknown |
| 3169 | Count Days Without Meetings | Medium |
| 3170 | Lexicographically Minimum String After Removing Stars | Unknown |
| 3174 | Clear Digits | Easy |
| 3186 | Maximum Total Damage With Spell Casting | Medium |
| 3190 | Find Minimum Operations to Make All Elements Divisible by Three | Easy |
| 3191 | Minimum Operations to Make Binary Array Elements Equal to One I | Medium |
| 3192 | Minimum Operations to Make Binary Array Elements Equal to One II | Easy |
| 3195 | Find the Minimum Area to Cover All Ones I | Unknown |
| 3197 | Find the Minimum Area to Cover All Ones II | Unknown |
| 3201 | Find the Maximum Length of Valid Subsequence I | Easy |
| 3202 | Find the Maximum Length of Valid Subsequence II | Unknown |
| 3203 | Find Minimum Diameter After Merging Two Trees | Medium |
| 3208 | Alternating Groups II | Unknown |
| 3212 | Count Submatrices With Equal Frequency of X and Y | Unknown |
| 3217 | Delete Nodes From Linked List Present in Array | Medium |
| 3223 | Minimum Length of String After Operations | Unknown |
| 3227 | Vowels Game in a String | Unknown |
| 3228 | Maximum Number of Operations to Move Ones to the End | Unknown |
| 3234 | Count the Number of Substrings With Dominant Ones | Easy |
| 3243 | Shortest Distance After Road Addition Queries I | Unknown |
| 3254 | Find the Power of K-Size Subarrays I | Medium |
| 3264 | Final Array State After K Multiplication Operations I | Easy |
| 3272 | Find the Count of Good Integers | Unknown |
| 3289 | The Two Sneaky Numbers of Digitville | Medium |
| 3296 | Minimum Number of Seconds to Make Mountain Height Zero | Medium |
| 3304 | Find the K-th Character in String Game I | Unknown |
| 3306 | Count of Substrings Containing Every Vowel and K Consonants II | Medium |
| 3307 | Find the K-th Character in String Game II | Unknown |
| 3310 | Remove Methods From Project | Unknown |
| 3315 | Construct the Minimum Bitwise Array II | Unknown |
| 3318 | Find X-Sum of All K-Long Subarrays I | Easy |
| 3321 | Find X-Sum of All K-Long Subarrays II | Unknown |
| 3330 | Find the Original Typed String I | Easy |
| 3335 | Total Characters in String After Transformations I | Medium |
| 3337 | Total Characters in String After Transformations II | Unknown |
| 3343 | Count Number of Balanced Permutations | Unknown |
| 3346 | Maximum Frequency of an Element After Performing Operations I | Medium |
| 3347 | Maximum Frequency of an Element After Performing Operations II | Unknown |
| 3349 | Adjacent Increasing Subarrays Detection I | Unknown |
| 3350 | Adjacent Increasing Subarrays Detection II | Medium |
| 3354 | Make Array Elements Equal to Zero | Unknown |
| 3355 | Zero Array Transformation I | Unknown |
| 3356 | Zero Array Transformation II | Unknown |
| 3363 | Find the Maximum Number of Fruits Collected | Unknown |
| 3370 | Smallest Number With All Set Bits | Easy |
| 3372 | Maximize the Number of Target Nodes After Connecting Trees I | Medium |
| 3373 | Maximize the Number of Target Nodes After Connecting Trees II | Unknown |
| 3375 | Minimum Operations to Make Array Values Equal to K | Medium |
| 3379 | Transformed Array | Medium |
| 3381 | Maximum Subarray Sum With Length Divisible by K | Medium |
| 3392 | Count Subarrays of Length Three With a Condition | Medium |
| 3394 | Check if Grid can be Cut into Sections | Unknown |
| 3396 | Minimum Number of Operations to Make Elements in Array Distinct | Medium |
| 3397 | Maximum Number of Distinct Elements After Operations | Unknown |
| 3403 | Find the Lexicographically Largest String From the Box I | Unknown |
| 3405 | Count the Number of Arrays with K Matching Adjacent Elements | Unknown |
| 3408 | Design Task Manager | Unknown |
| 3423 | Maximum Difference Between Adjacent Elements in a Circular Array | Unknown |
| 3432 | Count Partitions with Even Sum Difference | Easy |
| 3433 | Count Mentions Per User | Medium |
| 3439 | Reschedule Meetings for Maximum Free Time I | Easy |
| 3440 | Reschedule Meetings for Maximum Free Time II | Unknown |
| 3442 | Maximum Difference Between Even and Odd Frequency I | Medium |
| 3443 | Maximum Manhattan Distance After K Changes | Unknown |
| 3445 | Maximum Difference Between Even and Odd Frequency II | Medium |
| 3446 | Sort Matrix by Diagonals | Medium |
| 3453 | Separate Squares I | Unknown |
| 3454 | Separate Squares II | Unknown |
| 3459 | Length of Longest V-Shaped Diagonal Segment | Easy |
| 3461 | Check If Digits Are Equal in String After Operations I | Easy |
| 3477 | Fruits Into Baskets II | Medium |
| 3480 | Maximize Subarrays After Removing One Conflicting Pair | Easy |
| 3484 | Design Spreadsheet | Medium |
| 3487 | Maximum Unique Subarray Sum After Deletion | Medium |
| 3494 | Find the Minimum Amount of Time to Brew Potions | Unknown |
| 3495 | Minimum Operations to Make Array Elements Zero | Easy |
| 3507 | Minimum Pair Removal to Sort Array I | Unknown |
| 3508 | Implement Router | Unknown |
| 3510 | Minimum Pair Removal to Sort Array II | Unknown |
| 3512 | Minimum Operations to Make Array Sum Divisible by K | Unknown |
| 3516 | Find Closest Person | Unknown |
| 3531 | Count Covered Buildings+ | Unknown |
| 3539 | Find Sum of Array Product of Magical Sequences | Unknown |
| 3541 | Find Most Frequent Vowel and Consonant | Unknown |
| 3542 | Minimum Operations to Convert All Elements to Zero | Unknown |
| 3562 | Maximum Profit from Trading Stocks with Discounts | Unknown |
| 3567 | Minimum Absolute Difference in Sliding Submatrix | Unknown |
| 3573 | Best Time to Buy and Sell Stock V | Unknown |
| 3577 | Count the Number of Computer Unlocking Permutations | Unknown |
| 3578 | Count Partitions With Max-Min Difference at Most K | Unknown |
| 3583 | Count Special Triplets | Unknown |
| 3600 | Maximize Spanning Tree Stability with Upgrades | Unknown |
| 3606 | Coupon Code Validator | Unknown |
| 3607 | Power Grid Maintenance | Unknown |
| 3623 | Count Number of Trapezoids I | Unknown |
| 3625 | Count Number of Trapezoids II | Unknown |
| 3634 | Minimum Removals to Balance Array | Unknown |
| 3637 | Trionic Array I | Unknown |
| 3640 | Trionic Array II | Unknown |
| 3643 | Flip Square Submatrix Vertically | Unknown |
| 3651 | Minimum Cost Path with Teleportations | Unknown |
| 3652 | Best Time to Buy and Sell Stock using Strategy | Unknown |
| 3713 | Longest Balanced Substring I | Unknown |
| 3714 | Longest Balanced Substring II | Unknown |
| 3719 | Longest Balanced Subarray I | Unknown |
| 3721 | Longest Balanced Subarray II | Unknown |