Apart from the LeetCode solutions, this repo also contains some pretty useful features that I developed to help improve my Daily LeetCoding workflow.
- Scraper function which ensures that all links are valid
- Automated new pset which creates a new file (depending on which language I choose), updates the following README table
| # | Title | Lang |
|---|---|---|
| 1 | Two Sum |   |
| 2 | Add Two Numbers | |
| 3 | Longest Substring without Repeating Characters | |
| 4 | Median of Two Sorted Arrays | |
| 5 | Longest Palindromic Substring | |
| 6 | Zigzag Conversion | |
| 7 | Reverse Integer | |
| 8 | String to Integer (atoi) | |
| 9 | Palindrome Number | |
| 10 | Regular Expression Matching | |
| 11 | Container With Most Water | |
| 13 | Roman to Integer | |
| 14 | Longest Common Prefix | |
| 15 | 3Sum | |
| 16 | 3Sum Closest | |
| 17 | Letter Combinations of a Phone Number | |
| 19 | Remove Nth Node from End of List | |
| 20 | Valid Parentheses | |
| 21 | Merge Two Sorted Lists | |
| 22 | Generate Parentheses | |
| 23 | Merge k Sorted Lists | |
| 24 | Swap Nodes in Pairs | |
| 25 | Reverse Nodes in k-Group | |
| 26 | Remove Duplicates from Sorted Array | |
| 27 | Remove Element | |
| 29 | Divide Two Integers | |
| 31 | Next Permutation | |
| 33 | Search in Rotated Sorted Array | |
| 34 | Find First and Last Position of Element in Sorted Array | |
| 35 | Search Insert Position | |
| 36 | Valid Sudoku | |
| 38 | Count and Say | |
| 39 | Combination Sum | |
| 40 | Combination Sum II | |
| 42 | Trapping Rain Water | |
| 45 | Jump Game II | |
| 46 | Permutations | |
| 48 | Rotate Image | |
| 49 | Group Anagrams | |
| 51 | N-Queens | |
| 52 | N-Queens II | |
| 53 | Maximum Subarray | |
| 54 | Spiral Matrix | |
| 55 | Jump Game | |
| 56 | Merge Intervals | |
| 57 | Insert Interval | |
| 58 | Length of Last Word |  |
| 59 | Spiral Matrix II | |
| 61 | Rotate List | |
| 62 | Unique Paths | |
| 66 | Plus One | |
| 69 | Sqrt(x) | |
| 70 | Design HashSet | |
| 72 | Edit Distance | |
| 73 | Set Matrix Zeroes | |
| 74 | Search a 2D Matrix | |
| 75 | Sort Colours | |
| 76 | Minimum Window Substring | |
| 78 | Subsets | |
| 79 | Word Search | |
| 80 | Remove Duplicates from Sorted Array II | |
| 83 | Remove Duplicates from Sorted List | |
| 84 | Largest Rectangle in Histogram | |
| 85 | Maximal Rectangle | |
| 88 | Merge Sorted Array | |
| 90 | Subsets II | |
| 91 | Decode Ways | |
| 94 | Binary Tree Inorder Traversal | |
| 97 | Interleaving String | |
| 98 | Validate Binary Search Tree | |
| 100 | Same Tree | |
| 101 | Symmetric Treep | |
| 102 | Binary Tree Level Order Traversal | |
| 104 | Maximum Depth of Binary Tree | |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | |
| 106 | Construct Binary Tree from Postorder and Inorder Traversal | |
| 109 | Convert Sorted List to Binary Search Tree | |
| 110 | Balanced Binary Tree | |
| 112 | Path Sum | |
| 113 | Path Sum II | |
| 114 | Flatten Binary Tree to Linked List | |
| 115 | Distinct Subsequences | |
| 118 | Pascal's Triangle | |
| 120 | Triangle | |
| 121 | Best Time to Buy and Sell Stock | |
| 122 | Best Time to Buy and Sell Stock II | |
| 123 | Best Time to Buy and Sell Stock III | |
| 124 | Binary Tree Maximum Path Sum | |
| 125 | Valid Palindrome | |
| 127 | Word Ladder | |
| 128 | Longest Consecutive Sequence | |
| 130 | Surrounded Regions | |
| 131 | Palindrome Partitioning | |
| 133 | Clone Graph | |
| 134 | Gas Station | |
| 135 | Candy | |
| 136 | Single Number | |
| 138 | Copy List with Random Pointer | |
| 139 | Word Break | |
| 141 | Linked List Cycle | |
| 143 | Reorder List | |
| 144 | Binary Tree Preorder Traversal | |
| 145 | Binary Tree Postorder Traversal | |
| 146 | LRU Cache | |
| 150 | Evaluate Reverse Polish Notation | |
| 152 | Maximum Product Subarray | |
| 153 | Find Minimum in Rotated Sorted Array | |
| 155 | Min Stack | |
| 162 | Find Peak Element | |
| 165 | Compare Version Numbers | |
| 167 | Two Sum II (Input Array is Sorted) | |
| 169 | Majority Element | |
| 175 | Combine Two Tables | |
| 179 | Largest Number | |
| 181 | Employees Earning More Than Their Managers | |
| 188 | Best Time to Buy and Sell Stock IV | |
| 190 | Reverse Bits | |
| 191 | Number of 1 Bits | |
| 197 | Rising Temperature | |
| 198 | House Robber | |
| 199 | Binary Tree Right Side View | |
| 200 | Number of Islands | |
| 202 | Happy Number | |
| 206 | Reverse Linked List | |
| 207 | Course Schedule | |
| 208 | Implement Trie (Prefix Tree) | |
| 210 | Course Schedule II | |
| 211 | Design Add and Search Words Data Structure | |
| 212 | Word Search II | |
| 213 | House Robber II | |
| 215 | Kth Largest Element in an Array | |
| 217 | Contains Duplicate | |
| 219 | Contains Duplicate II | |
| 221 | Maximal Square | |
| 224 | Basic Calculator | |
| 224 | Basic Calculator II | |
| 227 | Invert Binary Tree | |
| 229 | Majority Element II | |
| 230 | Kth Smallest Element in a BST | |
| 231 | Power of Two | |
| 235 | Lowest Common Ancestor of a Binary Search Tree | |
| 235 | Lowest Common Ancestor of a Binary Tree | |
| 238 | Product of Array Except Self | |
| 239 | Sliding Window Maximum | |
| 241 | Different Ways to Add Parentheses | |
| 242 | Valid Anagram | |
| 252 | Meeting Rooms | |
| 253 | Meeting Rooms II | |
| 255 | Verify Preorder Sequence in Binary Search Tree | |
| 257 | Binary Tree Paths | |
| 259 | 3Sum Smaller | |
| 261 | Graph Valid Tree | |
| 264 | Ugly Number II | |
| 266 | Palindrome Permutation | |
| 268 | Missing Number | |
| 271 | Encode and Decode Strings | |
| 273 | Integer to English Words | |
| 277 | Find the Celebrity | |
| 283 | Move Zeroes | |
| 285 | Inorder Successor in BST | |
| 286 | Walls and Gates | |
| 287 | Find the Duplicate Number | |
| 289 | Game of Life | |
| 297 | Serialize and Deserialize Binary Tree | |
| 300 | Longest Increasing Subsequence | |
| 302 | Smallest Rectangle Enclosing Black Pixels | |
| 304 | Range Sum Query 2D - Immutable | |
| 309 | Best Time to Buy and Sell Stock with Cooldown | |
| 312 | Burst Balloons | |
| 322 | Coin Change | |
| 323 | Number of Connected Components In An Undirected Graph | |
| 326 | Power of Three | |
| 329 | Longest Increasing Path in a Matrix | |
| 330 | Patching Array | |
| 333 | Largest BST Subtree | |
| 338 | Counting Bits | |
| 347 | Top K Frequent Elements | |
| 349 | Intersection of Two Arrays | |
| 350 | Intersection of Two Arrays II | |
| 355 | Design Twitter | |
| 357 | Count Numbers with Unique Digits | |
| 362 | Design Hit Counter | |
| 364 | Nested List Weight Sum II | |
| 368 | Largest Divisible Subset | |
| 370 | Range Addition | |
| 371 | Sum of Two Integers | |
| 386 | Lexicographical Numbers | |
| 394 | Decode String | |
| 416 | Partition Equal Subset Sum | |
| 417 | Pacific Atlantic Water Flow | |
| 422 | Valid Word Square | |
| 424 | Longest Repeating Character Replacement | |
| 429 | N-ary Tree Level Order Traversal | |
| 432 | All O`one Data Structure | |
| 435 | Non-Overlapping Intervals | |
| 438 | Find All Anagrams in a String | |
| 452 | Minimum Number of Arrows to Burst Balloons | |
| 474 | Ones and Zeroes | |
| 476 | Number Complement | |
| 485 | Max Consecutive Ones I | |
| 487 | Max Consecutive Ones II | |
| 494 | Target Sum | |
| 498 | Diagonal Traverse | |
| 502 | IPO | |
| 515 | Find Largest Value in Each Tree Row | |
| 518 | Coin Change II | |
| 523 | Continuous Subarray Sum | |
| 528 | Random Pick with Weight | |
| 535 | Encode & Decode TinyURL | |
| 538 | Convert BST to Greater Tree | |
| 539 | Minimum Time Difference | |
| 543 | Diameter of Binary Tree | |
| 547 | Number of Provinces | |
| 549 | Binary Tree Longest Consecutive Sequence II | |
| 560 | Subarray Sum Equals K | |
| 564 | Find the Closest Palindrome | |
| 567 | Permutation in String | |
| 570 | Managers with at Least 5 Direct Reports | |
| 572 | Subtree of Another Tree | |
| 575 | Distribute Candies | |
| 577 | Employee Bonus | |
| 589 | N-ary Tree Preorder Traversal | |
| 590 | N-ary Tree Postorder Traversal | |
| 592 | Fraction Addition and Subtraction | |
| 594 | Longest Harmonious Subsequence | |
| 595 | Big Countries | |
| 611 | Valid Triangle Number | |
| 621 | Task Scheduler | |
| 624 | Maximum Distance in Arrays | |
| 632 | Smallest Range Covering Elements from K Lists | |
| 633 | Sum of Square Numbers | |
| 646 | Maximum Length of Pair Chain | |
| 647 | Palindromic Substrings | |
| 650 | 2 Keys Keyboard | |
| 651 | 4 Keys Keyboard | |
| 653 | Two Sum IV - Input is a BST | |
| 658 | Find K Closest Elements | |
| 663 | Equal Tree Partition | |
| 664 | Strange Printer | |
| 672 | Bulb Switcher II | |
| 673 | Maximum Swap | |
| 678 | Valid Parenthesis String | |
| 679 | 24 Game | |
| 680 | Valid Palindrome II | |
| 683 | K Empty Slots | |
| 684 | Redundant Connection | |
| 685 | Redundant Connection II | |
| 693 | Binary Number with Alternating Bits | |
| 695 | Max Area of Island | |
| 696 | Count Binary Substrings | |
| 705 | Design HashSet | |
| 706 | Design HashMap | |
| 713 | Subarray Product Less Than K | |
| 717 | 1-bit and 2-bit Characters | |
| 719 | Find K-th Smallest Pair Distance | |
| 721 | Accounts Merge | |
| 725 | Split Linked List in Parts | |
| 726 | Number of Atoms | |
| 729 | My Calendar I | |
| 731 | My Calendar II | |
| 739 | Daily Temperature | |
| 743 | Network Delay Time | |
| 746 | Min Cost Climbing Stairs | |
| 763 | Partition Labels | |
| 769 | Max Chunks To Make Sorted | |
| 772 | Basic Calculator III | |
| 781 | Rabbits in Forest | |
| 787 | Cheapest Flights Within K Stops | |
| 790 | Domino and Tromino Tiling | |
| 796 | Rotate String | |
| 799 | Champagne Tower | |
| 802 | Find Eventual Safe States | |
| 808 | Soup Servings | |
| 812 | Largest Triangle Area | |
| 826 | Most Profit Assigning Work | |
| 827 | Making A Large Island | |
| 840 | Magic Squares In Grid | |
| 846 | Hand of Straights | |
| 853 | Car Fleet | |
| 860 | Lemonade Change | |
| 862 | Shortest Subarray with Sum at Least K | |
| 868 | Binary Gap | |
| 873 | Length of Longest Fibonacci Subsequence | |
| 874 | Walking Robot Simulation | |
| 875 | Koko Eating Bananas | |
| 876 | Middle of the Linked List | |
| 884 | Uncommon Words from Two Sentences | |
| 885 | Spiral Matrix III | |
| 889 | Construct Binary Tree from Preorder and Postorder Traversal | |
| 904 | Fruit Into Baskets | |
| 909 | Snakes and Ladders | |
| 912 | Sort an Array | |
| 916 | Word Subsets | |
| 921 | Minimum Add to Make Parentheses Valid | |
| 922 | Sort Array By Parity II | |
| 932 | Beautiful Array | |
| 939 | Minimum Area Rectangle | |
| 944 | Delete Columns to Make Sorted | |
| 945 | Minimum Increment to Make Array Unique | |
| 947 | Most Stones Removed with Same Row or Column | |
| 951 | Flip Equivalent Binary Trees | |
| 959 | Regions Cut by Slashes | |
| 962 | Maximum Width Ramp | |
| 966 | Vowel Spellchecker | |
| 973 | K Closest Points to Origin | |
| 974 | Subarray Sums Divisible by K | |
| 976 | Largest Perimeter Triangle | |
| 981 | Time Based Key-Value Store | |
| 983 | Minimum Cost For Tickets | |
| 994 | Rotting Oranges | |
| 995 | Minimum Number of K Consecutive Bit Flips | |
| 1004 | Max Consecutive Ones III | |
| 1007 | Minimum Domino Rotations For Equal Row | |
| 1009 | Complement of Base 10 Integer | |
| 1018 | Binary Prefix Divisible By 5 | |
| 1022 | Sum of Root To Leaf Binary Numbers | |
| 1028 | Recover a Tree From Preorder Traversal | |
| 1038 | Binary Search Tree to Greater Sum Tree | |
| 1046 | Last Stone Weight | |
| 1052 | Grumpy Bookstore Owner | |
| 1068 | Product Sales Analysis I | |
| 1072 | Flip Columns For Maximum Number of Equal Rows | |
| 1079 | Letter Tile Possibilities | |
| 1094 | Car Pooling | |
| 1100 | Find K-Length Substrings With No Repeated Characters | |
| 1101 | The Earliest Moment When Everyone Become Friends | |
| 1105 | Filling Bookcase Shelves | |
| 1106 | Parsing A Boolean Expression | |
| 1110 | Delete Nodes And Return Forest | |
| 1122 | Relative Sort Array | |
| 1123 | Lowest Common Ancestor of Deepest Leaves | |
| 1128 | Number of Equivalent Domino Pairs | |
| 1133 | Largest Unique Number | |
| 1140 | Stone Game II | |
| 1143 | Longest Common Subsequence | |
| 1148 | Article Views I | |
| 1151 | Minimum Swaps to Group All 1's Together | |
| 1161 | Maximum Level Sum of a Binary Tree | |
| 1176 | Diet Plan Performance | |
| 1186 | Maximum Subarray Sum After One Deletion | |
| 1190 | Reverse Substrings Between Each Pair of Parentheses | |
| 1200 | Minimum Absolute Difference | |
| 1213 | Intersection of Three Sorted Arrays | |
| 1229 | Meeting Scheduler | |
| 1233 | Remove Sub-Folders from the Filesystem | |
| 1244 | Design A Leaderboard | |
| 1248 | Count Number of Nice Subarrays | |
| 1257 | Smallest Common Region | |
| 1261 | Find Elements in a Contaminated Binary Tree | |
| 1267 | Count Servers that Communicate | |
| 1268 | Search Suggestions System | |
| 1272 | Remove Interval | |
| 1277 | Count Square Submatrices with All Ones | |
| 1280 | Students and Examinations | |
| 1290 | Convert Binary Number in a Linked List to Integer | |
| 1293 | Shortest Path in a Grid with Obstacles Elimination | |
| 1295 | Find Numbers with Even Number of Digits | |
| 1298 | Maximum Candies You Can Get from Boxes | |
| 1304 | Find N Unique Integers Sum up to Zero | |
| 1310 | XOR Queries of a Subarray | |
| 1312 | Minimum Insertion Steps to Make a String Palindrome | |
| 1317 | Convert Integer to the Sum of Two No-Zero Integers | |
| 1323 | Maximum 69 Number | |
| 1331 | Rank Transform of an Array | |
| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | |
| 1342 | Number of Steps to Reduce a Number to Zero | |
| 1346 | Check If N and Its Double Exist | |
| 1351 | Count Negative Numbers in a Sorted Matrix | |
| 1352 | Product of the Last K Numbers | |
| 1353 | Maximum Number of Events That Can Be Attended | |
| 1356 | Sort Integers by The Number of 1 Bits | |
| 1367 | Linked List in Binary Tree | |
| 1371 | Find the Longest Substring Containing Vowels in Even Counts | |
| 1378 | Replace Employee ID with the Unique Identifier | |
| 1380 | Lucky Numbers in a Matrix | |
| 1381 | Design a Stack With Increment Operation | |
| 1382 | Balance a Binary Search Tree | |
| 1394 | Find Lucky Integer in an Array | |
| 1395 | Count Number of Teams | |
| 1399 | Count Largest Group | |
| 1400 | Construct K Palindrome Strings | |
| 1404 | Number of Steps to Reduce a Number in Binary Representation to One | |
| 1405 | Longest Happy String | |
| 1408 | String Matching in an Array | |
| 1415 | The k-th Lexicographical String of All Happy Strings of Length n | |
| 1427 | Perform String Shifts | |
| 1429 | First Unique Number | |
| 1437 | Check If All 1s Are at Least Length K Places Away | |
| 1438 | Longest Continuous Subarray with Limit | |
| 1448 | Count Good Nodes in Binary Tree | |
| 1455 | Check If a Word Occurs As a Prefix of Any Word in a Sentence | |
| 1460 | Make Two Arrays Equal by Reversing Subarrays | |
| 1461 | Check If a String Contains All Binary Codes of Size K | |
| 1462 | Course Schedule IV | |
| 1474 | Delete N Nodes After M Nodes of a Linked List | |
| 1475 | Final Prices With a Special Discount in a Shop | |
| 1480 | Running Sum of 1d Array | |
| 1482 | Minimum Number of Days to Make m Bouquets | |
| 1493 | Longest Subarray of 1s After Deleting One Element | |
| 1497 | Check If Array Pairs Are Divisible by k | |
| 1504 | Count Submatrices With All Ones | |
| 1508 | Range Sum of Sorted Subarray Sums | |
| 1509 | Minimum Difference Between Largest and Smallest Value in Three Moves | |
| 1513 | Number of Substrings With Only 1s | |
| 1514 | Path with Maximum Probability | |
| 1518 | Water Bottles | |
| 1523 | Count Odd Numbers in an Interval Range | |
| 1524 | Number of Sub-arrays With Odd Sum | |
| 1530 | Number of Good Leaf Nodes Pairs | |
| 1534 | Count Good Triplets | |
| 1545 | Find Kth Bit in Nth Binary String | |
| 1550 | Three Consecutive Odds | |
| 1552 | Magnetic Force Between Two Balls | |
| 1568 | Minimum Number of Days to Disconnect Island | |
| 1574 | Shortest Subarray to be Removed to Make Array Sorted | |
| 1578 | Minimum Time to Make Rope Colorful | |
| 1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | |
| 1581 | Customer Who Visited but Did Not Make Any Transactions | |
| 1582 | Special Positions in a Binary Matrix | |
| 1584 | Min Cost to Connect All Points | |
| 1590 | Make Sum Divisible by P | |
| 1593 | Split a String Into the Max Number of Unique Substrings | |
| 1598 | Crawler Log Folder | |
| 1605 | Find Valid Matrix Given Row and Column Sums | |
| 1636 | Sort Array by Increasing Frequency | |
| 1642 | Furthest Building You Can Reach | |
| 1653 | Minimum Deletions to Make String Balanced | |
| 1661 | Average Time of Process Per Machine | |
| 1671 | Minimum Number of Removals to Make Mountain Array | |
| 1680 | Concatenation of Consecutive Binary Numbers | |
| 1683 | Invalid Tweets | |
| 1684 | Count the Number of Consistent Strings |  |
| 1695 | Maximum Erasure Value | |
| 1701 | Average Waiting Time | |
| 1716 | Calculate Money in Leetcode Bank | |
| 1717 | Maximum Score From Removing Substrings | |
| 1726 | Tuple with Same Product | |
| 1730 | Shortest Path to Get Food | |
| 1733 | Minimum Number of People to Teach | |
| 1746 | Maximum Subarray Sum After One Operation | |
| 1749 | Maximum Absolute Sum of Any Subarray | |
| 1752 | Check if Array Is Sorted and Rotated | |
| 1757 | Recyclable and Low Fat Products | |
| 1758 | Minimum Changes To Make Alternating Binary String | |
| 1760 | Minimum Limit of Balls in a Bag | |
| 1765 | Map of Highest Peak | |
| 1768 | Merge Strings Alternately | |
| 1769 | Minimum Number of Operations to Move All Balls to Each Box | |
| 1780 | Check if Number is a Sum of Powers of Three | |
| 1784 | Check if Binary String Has at Most One Segment of Ones | |
| 1790 | Check if One String Swap Can Make Strings Equal | |
| 1791 | Find Center of Star Graph | |
| 1792 | Maximum Average Pass Ratio | |
| 1800 | Maximum Ascending Subarray Sum | |
| 1813 | Sentence Similarity III | |
| 1823 | Find the Winner of the Circular Game | |
| 1829 | Maximum XOR for Each Query | |
| 1851 | Minimum Interval to Include Each Query | |
| 1852 | Distinct Numbers in Each Subarray | |
| 1861 | Rotating the Box | |
| 1863 | Sum of All Subset XOR Totals | |
| 1865 | Finding Pairs With a Certain Sum | |
| 1877 | Minimize Maximum Pair Sum in Array | |
| 1891 | Cutting Ribbons | |
| 1893 | Check if All the Integers in a Range Are Covered | |
| 1894 | Find the Student that Will Replace the Chalk | |
| 1899 | Merge Triplets to Form Target Triplet | |
| 1905 | Count Sub Islands | |
| 1910 | Remove All Occurrences of a Substring | |
| 1912 | Design Movie Rental System | |
| 1920 | Build Array from Permutation | |
| 1922 | Count Good Numbers | |
| 1929 | Concatenation of Array | |
| 1930 | Unique Length-3 Palindromic Subsequences | |
| 1934 | Confirmation Rate | |
| 1935 | Maximum Number of Words You Can Type | |
| 1937 | Maximum Number of Points with Cost | |
| 1942 | The Number of the Smallest Unoccupied Chair | |
| 1945 | Sum of Digits of String After Convert | |
| 1957 | Delete Characters to Make Fancy String | |
| 1963 | Minimum Number of Swaps to Make the String Balanced | |
| 1975 | Maximum Matrix Sum | |
| 1976 | Number of Ways to Arrive at Destination | |
| 1980 | Find Unique Binary String | |
| 2011 | Final Value of Variable After Performing Operations | |
| 2016 | Maximum Difference Between Increasing Elements | |
| 2017 | Grid Game | |
| 2022 | Convert 1D Array Into 2D Array | |
| 2028 | Find Missing Observations | |
| 2033 | Minimum Operations to Make a Uni-Value Grid | |
| 2037 | Minimum Number of Moves to Seat Everyone | |
| 2043 | Simple Bank System | |
| 2045 | Second Minimum Time to Reach Destination | |
| 2048 | Next Greater Numerically Balanced Number | |
| 2053 | Kth Distinct String in an Array | |
| 2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points | |
| 2064 | Minimized Maximum of Products Distributed to Any Store | |
| 2070 | Most Beautiful Item for Each Query | |
| 2092 | Find All People With Secret | |
| 2096 | Step-By-Step Directions From a Binary Tree Node to Another | |
| 2097 | Valid Arrangement of Pairs | |
| 2099 | Find Subsequence of Length K With the Largest Sum | |
| 2106 | Maximum Fruits Harvested After at Most K Steps | |
| 2107 | Number of Unique Flavors After Sharing K Candies | |
| 2109 | Adding Spaces to a String | |
| 2110 | Number of Smooth Descent Periods of a Stock | |
| 2115 | Find All Possible Recipes from Given Supplies | |
| 2116 | Check if a Parentheses String Can Be Valid | |
| 2125 | Number of Laser Beams in a Bank | |
| 2127 | Maximum Employees to Be Invited to a Meeting | |
| 2134 | Minimum Swaps to Group All 1's Together II | |
| 2138 | Divide a String Into Groups of Size k | |
| 2140 | Solving Questions With Brainpower | |
| 2141 | Maximum Running Time of N Computers | |
| 2145 | Count the Hidden Sequences | |
| 2154 | Keep Multiplying Found Values by Two | |
| 2161 | Partition Array According to Given Pivot | |
| 2168 | Unique Substrings With Equal Digit Frequency | |
| 2176 | Count Equal and Divisible Pairs in an Array | |
| 2181 | Merge Nodes in Between Zeros | |
| 2182 | Construct String With Repeat Limit | |
| 2185 | Counting Words With a Given Prefix | |
| 2191 | Sort the Jumbled Numbers | |
| 2192 | All Ancestors of a Node in a Directed Acyclic Graph | |
| 2196 | Create Binary Tree From Descriptions | |
| 2197 | Replace Non-Coprime Numbers in Array | |
| 2200 | Find All K-Distant Indices in an Array | |
| 2206 | Divide Array Into Equal Pairs | |
| 2211 | Count Collisions on a Road | |
| 2220 | Minimum Bit Flips to Convert Number | |
| 2221 | Find Triangular Sum of an Array | |
| 2226 | Maximum Candies Allocated to K Children | |
| 2237 | Count Positions on Street With Required Brightness | |
| 2248 | Intersection of Multiple Arrays | |
| 2257 | Count Unguarded Cells in the Grid | |
| 2264 | Largest 3-Same-Digit Number in String | |
| 2275 | Largest Combination With Bitwise AND Greater Than Zero | |
| 2285 | Maximum Total Importance of Roads | |
| 2294 | Partition Array Such That Maximum Difference Is K | |
| 2300 | Successful Pairs of Spells and Potions | |
| 2302 | Count Subarrays With Score Less Than K | |
| 2326 | Spiral Matrix IV | |
| 2337 | Move Pieces to Obtain a String | |
| 2342 | Max Sum of a Pair With Equal Sum of Digits | |
| 2348 | Number of Zero-Filled Subarrays | |
| 2359 | Find Closest Node to Given Two Nodes | |
| 2364 | Count Number of Bad Pairs | |
| 2375 | Construct Smallest Number From DI String | |
| 2379 | Minimum Recolors to Get K Consecutive Black Blocks | |
| 2381 | Shifting Letters II | |
| 2392 | Build a Matrix With Conditions | |
| 2401 | Longest Nice Subarray | |
| 2402 | Meeting Rooms III | |
| 2406 | Divide Intervals Into Minimum Number of Groups | |
| 2415 | Reverse Odd Levels of Binary Tree | |
| 2416 | Sum of Prefix Scores of Strings | |
| 2418 | Sort the People | |
| 2419 | Longest Subarray With Maximum Bitwise AND | |
| 2425 | Bitwise XOR of All Pairings | |
| 2439 | Minimize Maximum of Array | |
| 2458 | Height of Binary Tree After Subtree Removal Queries | |
| 2461 | Maximum Sum of Distinct Subarrays With Length K | |
| 2463 | Minimum Total Distance Traveled | |
| 2471 | Minimum Number of Operations to Sort a Binary Tree by Level | |
| 2483 | Minimum Penalty for a Shop | |
| 2490 | Circular Sentence | |
| 2491 | Divide Players Into Teams of Equal Skill | |
| 2501 | Longest Square Streak in an Array | |
| 2503 | Maximum Number of Points From Grid Queries | |
| 2516 | Take K of Each Character From Left and Right | |
| 2523 | Closest Prime Numbers in Range | |
| 2528 | Maximize the Minimum Powered City | |
| 2529 | Maximum Count of Positive Integer and Negative Integer | |
| 2530 | Maximal Score After Applying K Operations | |
| 2537 | Count the Number of Good Subarrays | |
| 2551 | Put Marbles in Bags | |
| 2554 | Maximum Number of Integers to Choose From a Range I | |
| 2558 | Take Gifts From the Richest Pile | |
| 2560 | House Robber IV | |
| 2561 | Rearranging Fruits | |
| 2563 | Count the Number of Fair Pairs | |
| 2566 | Maximum Difference by Remapping a Digit | |
| 2570 | Merge Two 2D Arrays by Summing Values | |
| 2577 | Minimum Time to Visit a Cell In a Grid | |
| 2579 | Count Total Number of Colored Cells | |
| 2582 | Pass the Pillow | |
| 2583 | Kth Largest Sum in a Binary Tree | |
| 2593 | Find Score of an Array After Marking All Elements | |
| 2594 | Minimum Time to Repair Cars | |
| 2598 | Smallest Missing Non-negative Integer After Operations | |
| 2599 | Make the Prefix Sum Non-negative | |
| 2601 | Prime Subtraction Operation | |
| 2616 | Minimize the Maximum Difference of Pairs | |
| 2641 | Cousins in Binary Tree II | |
| 2654 | Minimum Number of Operations to Make All Array Elements Equal to 1 | |
| 2657 | Find the Prefix Common Array of Two Arrays | |
| 2658 | Maximum Number of Fish in a Grid | |
| 2661 | First Completely Painted Row or Column | |
| 2667 | Create Hello World Function |  |
| 2678 | Number of Senior Citizens | |
| 2683 | Neighboring Bitwise XOR | |
| 2684 | Maximum Number of Moves in a Grid | |
| 2685 | Count the Number of Complete Components | |
| 2699 | Modify Graph Edge Weights | |
| 2707 | Extra Characters in a String | |
| 2751 | Robot Collisions | |
| 2780 | Minimum Index of a Valid Split | |
| 2785 | Sort Vowels in a String | |
| 2799 | Count Complete Subarrays in an Array | |
| 2807 | Insert Greatest Common Divisors in Linked List | |
| 2825 | Make String a Subsequence Using Cyclic Increments | |
| 2848 | Points That Intersect With Cars | |
| 2872 | Maximum Number of K-Divisible Components | |
| 2873 | Maximum Value of an Ordered Triplet I | |
| 2873 | Maximum Value of an Ordered Triplet II | |
| 2894 | Divisible and Non-divisible Sums Difference | |
| 2900 | Longest Unequal Adjacent Groups Subsequence I | |
| 2901 | Longest Unequal Adjacent Groups Subsequence II | |
| 2914 | Minimum Number of Changes to Make Binary String Beautiful | |
| 2918 | Minimum Equal Sum of Two Arrays After Replacing Zeros | |
| 2924 | Find Champion II | |
| 2927 | Distribute Candies Among Children III | |
| 2929 | Distribute Candies Among Children II | |
| 2938 | Separate Black and White Balls | |
| 2940 | Find Building Where Alice and Bob Can Meet | |
| 2942 | Find Words Containing Character | |
| 2948 | Make Lexicographically Smallest Array by Swapping Elements | |
| 2962 | Count Subarrays Where Max Element Appears at Least K Times | |
| 2965 | Find Missing and Repeated Values | |
| 2966 | Divide Array Into Arrays With Max Difference | |
| 2969 | Minimum String Length After Removing Substrings | |
| 2976 | Minimum Cost to Convert String I | |
| 3000 | Maximum Area of Longest Diagonal Rectangle | |
| 3005 | Count Elements With Maximum Frequency | |
| 3010 | Divide an Array Into Subarrays With Minimum Cost I | |
| 3011 | Find if Array Can Be Sorted | |
| 3016 | Minimum Number of Pushes to Type Word II | |
| 3021 | Alice and Bob Playing Flower Game | |
| 3024 | Type of Triangle | |
| 3028 | Ant on the Boundary | |
| 3043 | Find the Length of the Longest Common Prefix | |
| 3066 | Minimum Operations to Exceed Threshold Value II | |
| 3074 | Apple Redistribution into Boxes | |
| 3075 | Maximize Happiness of Selected Children | |
| 3085 | Minimum Deletions to Make String K-Special | |
| 3097 | Shortest Subarray With OR at Least K II | |
| 3100 | Water Bottles II | |
| 3105 | Longest Strictly Increasing or Strictly Decreasing Subarray | |
| 3133 | Minimum Array End | |
| 3136 | Valid Word | |
| 3151 | Special Array I | |
| 3153 | Sum of Digit Differences of All Pairs | |
| 3160 | Find the Number of Distinct Colors Among the Balls | |
| 3163 | String Compression III | |
| 3169 | Count Days Without Meetings | |
| 3170 | Lexicographically Minimum String After Removing Stars | |
| 3174 | Clear Digits | |
| 3190 | Find Minimum Operations to Make All Elements Divisible by Three | |
| 3191 | Minimum Operations to Make Binary Array Elements Equal to One I | |
| 3195 | Find the Minimum Area to Cover All Ones I | |
| 3201 | Find the Maximum Length of Valid Subsequence I | |
| 3202 | Find the Maximum Length of Valid Subsequence II | |
| 3208 | Alternating Groups II | |
| 3217 | Delete Nodes From Linked List Present in Array | |
| 3223 | Minimum Length of String After Operations | |
| 3228 | Maximum Number of Operations to Move Ones to the End | |
| 3243 | Shortest Distance After Road Addition Queries I | |
| 3254 | Find the Power of K-Size Subarrays I | |
| 3289 | The Two Sneaky Numbers of Digitville | |
| 3304 | Find the K-th Character in String Game I | |
| 3316 | Find Maximum Removals From Source String | |
| 3318 | Find X-Sum of All K-Long Subarrays I | |
| 3335 | Total Characters in String After Transformations I | |
| 3341 | Find Minimum Time to Reach Last Room I | |
| 3342 | Find Minimum Time to Reach Last Room II | |
| 3346 | Maximum Frequency of an Element After Performing Operations I | |
| 3349 | Adjacent Increasing Subarrays Detection I | |
| 3350 | Adjacent Increasing Subarrays Detection II | |
| 3354 | Make Array Elements Equal to Zero | |
| 3355 | Zero Array Transformation I | |
| 3356 | Zero Array Transformation II | |
| 3362 | Zero Array Transformation III | |
| 3371 | Identify the Largest Outlier in an Array | |
| 3372 | Maximize the Number of Target Nodes After Connecting Trees I | |
| 3375 | Minimum Operations to Make Array Values Equal to K | |
| 3379 | Transformed Array | |
| 3392 | Count Subarrays of Length Three With a Condition | |
| 3394 | Check if Grid can be Cut into Sections | |
| 3396 | Minimum Number of Operations to Make Elements in Array Distinct | |
| 3397 | Maximum Number of Distinct Elements After Operations | |
| 3403 | Find the Lexicographically Largest String From the Box I | |
| 3408 | Design Task Manager | |
| 3422 | Maximum Difference Between Even and Odd Frequency I | |
| 3423 | Maximum Difference Between Adjacent Elements in a Circular Array | |
| 3432 | Count Partitions with Even Sum Difference | |
| 3439 | Reschedule Meetings for Maximum Free Time I | |
| 3440 | Reschedule Meetings for Maximum Free Time II | |
| 3443 | Maximum Manhattan Distance After K Changes | |
| 3446 | Sort Matrix by Diagonals | |
| 3459 | Length of Longest V-Shaped Diagonal Segment | |
| 3461 | Check If Digits Are Equal in String After Operations I | |
| 3477 | Fruits Into Baskets II | |
| 3484 | Design Spreadsheet | |
| 3487 | Maximum Unique Subarray Sum After Deletion | |
| 3494 | Find the Minimum Amount of Time to Brew Potions | |
| 3512 | Minimum Operations to Make Array Sum Divisible by K | |
| 3516 | Find Closest Person | |
| 3541 | Find Most Frequent Vowel and Consonant | |
| 3566 | Partition Array into Two Equal Product Subsets | |
| 3607 | Power Grid Maintenance | |
| 3634 | Minimum Removals to Balance Array | |
| 3637 | Trionic Array I | |
| 3713 | Longest Balanced Substring I | |