leetcode

Solution to some Leetcode problems written in C++
git clone git://git.dimitrijedobrota.com/leetcode.git
Log | Files | Refs | README | LICENSE

README.md (181094B)


      1 # Leetcode Solutions
      2 
      3 [![DimitrijeD's LeetCode stats](https://leetcard.jacoblin.cool/DimitrijeD?ext=heatmap)](https://leetcode.com/u/dimitrijed/)
      4 
      5 ## Motivation
      6 
      7 In this repo I want to share with you my solutions to some Leetcode problems
      8 written in C++ to practice my Algorithms and Data Structure skills.  I will
      9 update this list periodically as I do more problems. I hope it will be helpful
     10 to some of you if you get stuck on a specific problem. Feel free to contact me
     11 if you have any questions.
     12 
     13 ## Templates
     14 
     15 I have accumulated a list of most commonly used algorithms to serve as a
     16 reference and a base for solving problems.
     17 
     18 * [MST from edge priority queue](Templates/MST_pq.cpp): Reference implementation
     19 * [MST from edge vector](Templates/MST_vector.cpp): Reference implementation, edges need to be sorted ascending by len
     20 * [Matrix BFS/Flood fill Iterative](Templates/bfs_floodfill.cpp): Reference implementation
     21 * [Matrix BFS/Flood fill Recursive](Templates/bfs_floodfill_recursive.cpp): Reference implementation
     22 * [Union Find](Templates/Union_Find.cpp): Fast implementation, all optimization tricks used
     23 * [Segment Tree Iterative](Templates/segment_tree.cpp): Fast implementation, contains tricky bits
     24 * [Segment Tree Recursive](Templates/segment_tree_recursive.cpp): Reference implementation, easy to understand
     25 * [Dynamic Segment Tree Recursive](Templates/segment_tree_dynamic_recursive.cpp): Reference implementation, checks range coverage
     26 
     27 ## Problems
     28 
     29 | Number | Difficulty | Solution                                                                                           |
     30 |:------:|:----------:|----------------------------------------------------------------------------------------------------|
     31 |  0001  |    Easy    | [Two Sum](Problems/0001.cpp)                                                                       |
     32 |  0002  |   Medium   | [Add Two Numbers](Problems/0002.cpp)                                                               |
     33 |  0003  |   Medium   | [Longest Substring Without Repeating Characters](Problems/0003.cpp)                                |
     34 |  0004  |    Hard    | [Median of Two Sorted Arrays](Problems/0004.cpp)                                                   |
     35 |  0005  |   Medium   | [Longest Palindromic Substring](Problems/0005.cpp)                                                 |
     36 |  0006  |   Medium   | [Zigzag Conversion](Problems/0006.cpp)                                                             |
     37 |  0007  |   Medium   | [Reverse Integer](Problems/0007.cpp)                                                               |
     38 |  0008  |   Medium   | [String to Integer (atoi)](Problems/0008.cpp)                                                      |
     39 |  0009  |    Easy    | [Palindrome Number](Problems/0009.cpp)                                                             |
     40 |  0011  |   Medium   | [Container With Most Water](Problems/0011.cpp)                                                     |
     41 |  0012  |   Medium   | [Integer to Roman](Problems/0012.cpp)                                                              |
     42 |  0013  |    Easy    | [Roman to Integer](Problems/0013.cpp)                                                              |
     43 |  0014  |    Easy    | [Longest Common Prefix](Problems/0014.cpp)                                                         |
     44 |  0015  |   Medium   | [3Sum](Problems/0015.cpp)                                                                          |
     45 |  0016  |   Medium   | [3Sum Closest](Problems/0016.cpp)                                                                  |
     46 |  0017  |   Medium   | [Letter Combinations of a Phone Number](Problems/0017.cpp)                                         |
     47 |  0018  |   Medium   | [4Sum](Problems/0018.cpp)                                                                          |
     48 |  0019  |   Medium   | [Remove Nth Node From the End of List](Problems/0019.cpp)                                          |
     49 |  0020  |    Easy    | [Valid Parentheses](Problems/0020.cpp)                                                             |
     50 |  0021  |    Easy    | [Merge Two Sorted Lists](Problems/0021.cpp)                                                        |
     51 |  0022  |   Medium   | [Generate Parentheses](Problems/0022.cpp)                                                          |
     52 |  0023  |    Hard    | [Merge k Sorted Lists](Problems/0023.cpp)                                                          |
     53 |  0024  |   Medium   | [Swap Nodes in Pairs](Problems/0024.cpp)                                                           |
     54 |  0025  |    Hard    | [Reverse Nodes in k-Group](Problems/0025.cpp)                                                      |
     55 |  0026  |    Easy    | [Remove Duplicates from Sorted Array](Problems/0026.cpp)                                           |
     56 |  0027  |    Easy    | [Remove Element](Problems/0027.cpp)                                                                |
     57 |  0028  |   Medium   | [Find the Index of the First Occurrence in a String](Problems/0028.cpp)                            |
     58 |  0029  |   Medium   | [Divide Two Integers](Problems/0029.cpp)                                                           |
     59 |  0030  |    Hard    | [Substring with Concatenation of All Words](Problems/0030.cpp)                                     |
     60 |  0031  |   Medium   | [Next Permutation](Problems/0031.cpp)                                                              |
     61 |  0032  |    Hard    | [Longest Valid Parentheses](Problems/0032.cpp)                                                     |
     62 |  0033  |   Medium   | [Search in Rotated Sorted Array](Problems/0033.cpp)                                                |
     63 |  0034  |   Medium   | [Find First and Last Position of Element in Sorted Array](Problems/0034.cpp)                       |
     64 |  0035  |    Easy    | [Search Insert Position](Problems/0035.cpp)                                                        |
     65 |  0036  |   Medium   | [Valid Sudoku](Problems/0036.cpp)                                                                  |
     66 |  0037  |    Hard    | [Sudoku Solver](Problems/0037.cpp)                                                                 |
     67 |  0038  |   Medium   | [Count and Say](Problems/0038.cpp)                                                                 |
     68 |  0039  |   Medium   | [Combination Sum](Problems/0039.cpp)                                                               |
     69 |  0040  |   Medium   | [Combination Sum II](Problems/0040.cpp)                                                            |
     70 |  0041  |    Hard    | [First Missing Positive](Problems/0041.cpp)                                                        |
     71 |  0042  |   Medium   | [Trapping Rain Water](Problems/0011.cpp)                                                           |
     72 |  0043  |   Medium   | [Multiply Strings](Problems/0043.cpp)                                                              |
     73 |  0044  |    Hard    | [Wildcard Matching](Problems/0044.cpp)                                                             |
     74 |  0045  |   Medium   | [Jump Game II](Problems/0045.cpp)                                                                  |
     75 |  0046  |   Medium   | [Permutations](Problems/0046.cpp)                                                                  |
     76 |  0047  |   Medium   | [Permutations II ](Problems/0047.cpp)                                                              |
     77 |  0048  |   Medium   | [Rotate Image](Problems/0048.cpp)                                                                  |
     78 |  0049  |   Medium   | [Group Anagrams](Problems/0049.cpp)                                                                |
     79 |  0050  |   Medium   | [Pow(x, n)](Problems/0050.cpp)                                                                     |
     80 |  0051  |    Hard    | [N-Queens](Problems/0051.cpp)                                                                      |
     81 |  0052  |    Hard    | [N-Queens II](Problems/0052.cpp)                                                                   |
     82 |  0053  |   Medium   | [Maximum Subarray](Problems/0053.cpp)                                                              |
     83 |  0054  |   Medium   | [Spiral Matrix](Problems/0054.cpp)                                                                 |
     84 |  0055  |   Medium   | [Jump Game](Problems/0055.cpp)                                                                     |
     85 |  0056  |   Medium   | [Merge Intervals](Problems/0056.cpp)                                                               |
     86 |  0057  |   Medium   | [Insert Interval](Problems/0057.cpp)                                                               |
     87 |  0058  |    Easy    | [Length of Last Word](Problems/0058.cpp)                                                           |
     88 |  0059  |   Medium   | [Spiral Matrix II](Problems/0059.cpp)                                                              |
     89 |  0060  |    Hard    | [Permutation Sequence](Problems/0060.cpp)                                                          |
     90 |  0061  |   Medium   | [Rotate List](Problems/0061.cpp)                                                                   |
     91 |  0062  |   Medium   | [Unique Paths](Problems/0062.cpp)                                                                  |
     92 |  0063  |   Medium   | [Unique Paths II](Problems/0063.cpp)                                                               |
     93 |  0064  |   Medium   | [Minimum Path Sum](Problems/0064.cpp)                                                              |
     94 |  0065  |    Hard    | [Valid Number](Problems/0065.cpp)                                                                  |
     95 |  0066  |    Easy    | [Plus One](Problems/0066.cpp)                                                                      |
     96 |  0067  |    Easy    | [Add Binary](Problems/0067.cpp)                                                                    |
     97 |  0068  |    Hard    | [Text Justification](Problems/0068.cpp)                                                            |
     98 |  0069  |    Easy    | [Sqrt(x)](Problems/0069.cpp)                                                                       |
     99 |  0070  |    Easy    | [Climbing Stairs](Problems/0070.cpp)                                                               |
    100 |  0071  |   Medium   | [Simplify Path](Problems/0071.cpp)                                                                 |
    101 |  0072  |    Hard    | [Edit Distance](Problems/0072.cpp)                                                                 |
    102 |  0073  |   Medium   | [Set Matrix Zeroes](Problems/0073.cpp)                                                             |
    103 |  0074  |   Medium   | [Search a 2D Matrix](Problems/0074.cpp)                                                            |
    104 |  0075  |   Medium   | [Sort Colors](Problems/0075.cpp)                                                                   |
    105 |  0076  |    Hard    | [Minimum Window Substring](Problems/0076.cpp)                                                      |
    106 |  0077  |   Medium   | [Combinations](Problems/0077.cpp)                                                                  |
    107 |  0078  |   Medium   | [Subsets](Problems/0078.cpp)                                                                       |
    108 |  0079  |   Medium   | [Word Search](Problems/0079.cpp)                                                                   |
    109 |  0080  |   Medium   | [Remove Duplicates from Sorted Array II](Problems/0080.cpp)                                        |
    110 |  0081  |   Medium   | [Search in Rotated Sorted Array II](Problems/0081.cpp)                                             |
    111 |  0082  |   Medium   | [Remove Duplicates from Sorted List II](Problems/0082.cpp)                                         |
    112 |  0083  |    Easy    | [Remove Duplicates from Sorted List](Problems/0083.cpp)                                            |
    113 |  0084  |    Hard    | [Largest Rectangle in Histogram](Problems/0084.cpp)                                                |
    114 |  0085  |    Hard    | [Maximal Rectangle](Problems/0085.cpp)                                                             |
    115 |  0086  |   Medium   | [Partition List](Problems/0086.cpp)                                                                |
    116 |  0087  |    Hard    | [Scramble String](Problems/0087.cpp)                                                               |
    117 |  0088  |    Easy    | [Merge Sorted Array](Problems/0088.cpp)                                                            |
    118 |  0089  |   Medium   | [Gray Code](Problems/0089.cpp)                                                                     |
    119 |  0090  |   Medium   | [Subsets II](Problems/0090.cpp)                                                                    |
    120 |  0091  |   Medium   | [Decode Ways](Problems/0091.cpp)                                                                   |
    121 |  0092  |   Medium   | [Reverse Linked List II](Problems/0092.cpp)                                                        |
    122 |  0093  |   Medium   | [Restore IP Addresses](Problems/0093.cpp)                                                          |
    123 |  0094  |    Easy    | [Binary Tree Inorder Traversal](Problems/0094.cpp)                                                 |
    124 |  0095  |   Medium   | [Unique Binary Search Trees II](Problems/0095.cpp)                                                 |
    125 |  0096  |   Medium   | [Unique Binary Search Trees](Problems/0096.cpp)                                                    |
    126 |  0097  |   Medium   | [Interleaving String](Problems/0097.cpp)                                                           |
    127 |  0098  |   Medium   | [Validate Binary Search Tree](Problems/0098.cpp)                                                   |
    128 |  0099  |   Medium   | [Recover Binary Search Tree](Problems/0099.cpp)                                                    |
    129 |  0100  |    Easy    | [Same Tree](Problems/0100.cpp)                                                                     |
    130 |  0101  |    Easy    | [Symmetric Tree](Problems/0101.cpp)                                                                |
    131 |  0102  |   Medium   | [Binary Tree Level Order Traversal](Problems/0102.cpp)                                             |
    132 |  0103  |   Medium   | [Binary Tree Zigzag Level Order Traversal](Problems/0103.cpp)                                      |
    133 |  0104  |    Easy    | [Maximum Depth of Binary Tree](Problems/0104.cpp)                                                  |
    134 |  0105  |   Medium   | [Construct Binary Tree from Preorder and Inorder Traversal](Problems/0105.cpp)                     |
    135 |  0106  |   Medium   | [Construct Binary Tree from Inorder and Postorder Traversal](Problems/0106.cpp)                    |
    136 |  0107  |   Medium   | [Binary Tree Level Order Traversal II](Problems/0107.cpp)                                          |
    137 |  0108  |    Easy    | [Convert Sorted Array to Binary Search Tree](Problems/0108.cpp)                                    |
    138 |  0109  |   Medium   | [Convert Sorted List to Binary Search Tree](Problems/0109.cpp)                                     |
    139 |  0110  |    Easy    | [Balanced Binary Tree](Problems/0110.cpp)                                                          |
    140 |  0111  |    Easy    | [Minimum Depth of Binary Tree](Problems/0111.cpp)                                                  |
    141 |  0112  |    Easy    | [Path Sum](Problems/0112.cpp)                                                                      |
    142 |  0113  |   Medium   | [Path Sum II](Problems/0113.cpp)                                                                   |
    143 |  0114  |   Medium   | [Flatten Binary Tree to Linked List](Problems/0114.cpp)                                            |
    144 |  0115  |    Hard    | [Distinct Subsequences](Problems/0115.cpp)                                                         |
    145 |  0116  |   Medium   | [Populating Next Right Pointers in Each Node](Problems/0116.cpp)                                   |
    146 |  0117  |   Medium   | [Populating Next Right Pointers in Each Node II](Problems/0117.cpp)                                |
    147 |  0118  |    Easy    | [Pascal's Triangle](Problems/0118.cpp)                                                             |
    148 |  0119  |    Easy    | [Pascal's Triangle II](Problems/0119.cpp)                                                          |
    149 |  0120  |   Medium   | [Triangle](Problems/0120.cpp)                                                                      |
    150 |  0121  |    Easy    | [Best Time to Buy and Sell Stock](Problems/0121.cpp)                                               |
    151 |  0122  |   Medium   | [Best Time to Buy and Sell Stock II](Problems/0122.cpp)                                            |
    152 |  0123  |    Hard    | [Best Time to Buy and Sell Stock III](Problems/0123.cpp)                                           |
    153 |  0124  |    Hard    | [Binary Tree Maximum Path Sum](Problems/0124.cpp)                                                  |
    154 |  0125  |    Easy    | [Valid Palindrome](Problems/0125.cpp)                                                              |
    155 |  0126  |    Hard    | [Word Ladder II](Problems/0126.cpp)                                                                |
    156 |  0127  |    Hard    | [Word Ladder](Problems/0127.cpp)                                                                   |
    157 |  0128  |   Medium   | [Longest Consecutive Sequence](Problems/0128.cpp)                                                  |
    158 |  0129  |   Medium   | [Sum Root to Leaf Numbers](Problems/0129.cpp)                                                      |
    159 |  0130  |   Medium   | [Surrounded Regions](Problems/0130.cpp)                                                            |
    160 |  0131  |   Medium   | [Palindrome Partitioning](Problems/0131.cpp)                                                       |
    161 |  0132  |    Hard    | [Palindrome Partitioning II](Problems/0132.cpp)                                                    |
    162 |  0133  |   Medium   | [Clone Graph](Problems/0133.cpp)                                                                   |
    163 |  0134  |   Medium   | [Gas Station](Problems/0134.cpp)                                                                   |
    164 |  0135  |    Hard    | [Candy](Problems/0135.cpp)                                                                         |
    165 |  0136  |    Easy    | [Single Number](Problems/0136.cpp)                                                                 |
    166 |  0137  |   Medium   | [Single Number II](Problems/0137.cpp)                                                              |
    167 |  0138  |   Medium   | [Copy List with Random Pointer](Problems/0138.cpp)                                                 |
    168 |  0139  |   Medium   | [Word Break](Problems/0139.cpp)                                                                    |
    169 |  0140  |    Hard    | [Word Break II](Problems/0140.cpp)                                                                 |
    170 |  0141  |    Easy    | [Linked List Cycle](Problems/0141.cpp)                                                             |
    171 |  0142  |   Medium   | [Linked List Cycle II](Problems/0142.cpp)                                                          |
    172 |  0143  |   Medium   | [Reorder List](Problems/0143.cpp)                                                                  |
    173 |  0144  |   Medium   | [Binary Tree Preorder Traversal](Problems/0144.cpp)                                                |
    174 |  0145  |    Easy    | [Binary Tree Postorder Traversal](Problems/0145.cpp)                                               |
    175 |  0146  |   Medium   | [LRU Cache](Problems/0146.cpp)                                                                     |
    176 |  0147  |   Medium   | [Insertion Sort List](Problems/0147.cpp)                                                           |
    177 |  0148  |   Medium   | [Sort List](Problems/0148.cpp)                                                                     |
    178 |  0149  |    Hard    | [Max Points on a Line](Problems/0149.cpp)                                                          |
    179 |  0150  |   Medium   | [Evaluate Reverse Polish Notation](Problems/0150.cpp)                                              |
    180 |  0151  |   Medium   | [Reverse Words in a String](Problems/0151.cpp)                                                     |
    181 |  0152  |   Medium   | [Maximum Product Subarray](Problems/0152.cpp)                                                      |
    182 |  0153  |   Medium   | [Find Minimum in Rotated Sorted Array](Problems/0153.cpp)                                          |
    183 |  0154  |    Hard    | [Find Minimum in Rotated Sorted Array II](Problems/0154.cpp)                                       |
    184 |  0155  |   Medium   | [Min Stack](Problems/0155.cpp)                                                                     |
    185 |  0160  |    Easy    | [Intersection of Two Linked Lists](Problems/0160.cpp)                                              |
    186 |  0162  |   Medium   | [Find Peak Element](Problems/0162.cpp)                                                             |
    187 |  0164  |    Hard    | [Maximum Gap](Problems/0164.cpp)                                                                   |
    188 |  0165  |   Medium   | [Compare Version Numbers](Problems/0165.cpp)                                                       |
    189 |  0166  |   Medium   | [Fraction to Recurring Decimal](Problems/0166.cpp)                                                 |
    190 |  0167  |   Medium   | [Two Sum II - Input Array Is Sorted](Problems/0167.cpp)                                            |
    191 |  0168  |    Easy    | [Excel Sheet Column Title](Problems/0168.cpp)                                                      |
    192 |  0169  |    Easy    | [Majority Element](Problems/0169.cpp)                                                              |
    193 |  0171  |    Easy    | [Excel Sheet Column Number](Problems/0171.cpp)                                                     |
    194 |  0172  |   Medium   | [Factorial Trailing Zeroes](Problems/0172.cpp)                                                     |
    195 |  0173  |   Medium   | [Binary Search Tree Iterator](Problems/0173.cpp)                                                   |
    196 |  0174  |    Hard    | [Dungeon Game](Problems/0174.cpp)                                                                  |
    197 |  0175  |    Easy    | [Combine Two Tables](Problems/0175.cpp)                                                            |
    198 |  0176  |   Medium   | [Second Highest Salary](Problems/0176.cpp)                                                         |
    199 |  0177  |   Medium   | [Nth Highest Salary](Problems/0177.cpp)                                                            |
    200 |  0178  |   Medium   | [Rank Scores](Problems/0178.cpp)                                                                   |
    201 |  0179  |   Medium   | [Largest Number](Problems/0179.cpp)                                                                |
    202 |  0180  |   Medium   | [Consecutive Numbers](Problems/0180.cpp)                                                           |
    203 |  0181  |    Easy    | [Employees Earning More Than Their Managers](Problems/0181.cpp)                                    |
    204 |  0182  |    Easy    | [Duplicate Emails](Problems/0182.cpp)                                                              |
    205 |  0183  |    Easy    | [Customers Who Never Order](Problems/0183.cpp)                                                     |
    206 |  0184  |   Medium   | [Department Highest Salary](Problems/0184.cpp)                                                     |
    207 |  0185  |    Hard    | [Department Top Three Salaries](Problems/0185.cpp)                                                 |
    208 |  0187  |   Medium   | [Repeated DNA Sequences](Problems/0187.cpp)                                                        |
    209 |  0188  |    Hard    | [Best Time to Buy and Sell Stock IV](Problems/0188.cpp)                                            |
    210 |  0189  |   Medium   | [Rotate Array](Problems/0189.cpp)                                                                  |
    211 |  0190  |    Easy    | [Reverse Bits](Problems/0190.cpp)                                                                  |
    212 |  0191  |    Easy    | [Number of 1 Bits](Problems/0191.cpp)                                                              |
    213 |  0192  |   Medium   | [Word Frequency](Problems/0192.sh)                                                                 |
    214 |  0193  |    Easy    | [Valid Phone Numbers](Problems/0193.sh)                                                            |
    215 |  0194  |   Medium   | [Transpose File](Problems/0194.sh)                                                                 |
    216 |  0195  |    Easy    | [Tenth Line](Problems/0195.sh)                                                                     |
    217 |  0196  |    Easy    | [Delete Duplicate Emails](Problems/0196.cpp)                                                       |
    218 |  0197  |    Easy    | [Rising Temperature](Problems/0197.cpp)                                                            |
    219 |  0198  |   Medium   | [House Robber](Problems/0198.cpp)                                                                  |
    220 |  0199  |   Medium   | [Binary Tree Right Side View](Problems/0199.cpp)                                                   |
    221 |  0200  |   Medium   | [Number of Islands](Problems/0200.cpp)                                                             |
    222 |  0201  |   Medium   | [Bitwise AND of Numbers Range](Problems/0201.cpp)                                                  |
    223 |  0202  |    Easy    | [Happy Number](Problems/0202.cpp)                                                                  |
    224 |  0203  |    Easy    | [Remove Linked List Elements](Problems/0203.cpp)                                                   |
    225 |  0204  |   Medium   | [Count Primes](Problems/0204.cpp)                                                                  |
    226 |  0205  |    Easy    | [Isomorphic Strings](Problems/0205.cpp)                                                            |
    227 |  0206  |    Easy    | [Reverse Linked List](Problems/0206.cpp)                                                           |
    228 |  0207  |   Medium   | [Course Schedule](Problems/0207.cpp)                                                               |
    229 |  0208  |   Medium   | [Implement Trie (Prefix Tree)](Problems/0208.cpp)                                                  |
    230 |  0209  |   Medium   | [Minimum Size Subarray Sum](Problems/0209.cpp)                                                     |
    231 |  0210  |   Medium   | [Course Schedule II](Problems/0210.cpp)                                                            |
    232 |  0211  |   Medium   | [Design Add and Search Words Data Structure](Problems/0211.cpp)                                    |
    233 |  0212  |    Hard    | [Word Search II](Problems/0212.cpp)                                                                |
    234 |  0213  |   Medium   | [House Robber II](Problems/0213.cpp)                                                               |
    235 |  0214  |    Hard    | [Shortest Palindrome](Problems/0214.cpp)                                                           |
    236 |  0215  |   Medium   | [Kth Largest Element in an Array](Problems/0215.cpp)                                               |
    237 |  0216  |   Medium   | [Combination Sum III](Problems/0216.cpp)                                                           |
    238 |  0217  |    Easy    | [Contains Duplicate](Problems/0217.cpp)                                                            |
    239 |  0218  |    Hard    | [The Skyline Problem](Problems/0218.cpp)                                                           |
    240 |  0219  |    Easy    | [Contains Duplicate II](Problems/0219.cpp)                                                         |
    241 |  0220  |    Hard    | [Contains Duplicate III](Problems/0220.cpp)                                                        |
    242 |  0221  |   Medium   | [Maximal Square](Problems/0221.cpp)                                                                |
    243 |  0222  |   Medium   | [Count Complete Tree Nodes](Problems/0222.cpp)                                                     |
    244 |  0223  |   Medium   | [Rectangle Area](Problems/0223.cpp)                                                                |
    245 |  0224  |    Hard    | [Basic Calculator](Problems/0224.cpp)                                                              |
    246 |  0225  |    Easy    | [Implement Stack using Queues](Problems/0225.cpp)                                                  |
    247 |  0226  |    Easy    | [Invert Binary Tree](Problems/0226.cpp)                                                            |
    248 |  0227  |   Medium   | [Basic Calculator II](Problems/0227.cpp)                                                           |
    249 |  0228  |    Easy    | [Summary Ranges](Problems/0228.cpp)                                                                |
    250 |  0229  |   Medium   | [Majority Element II](Problems/0229.cpp)                                                           |
    251 |  0231  |    Easy    | [Power of Two](Problems/0231.cpp)                                                                  |
    252 |  0232  |    Easy    | [Implement Queue using Stacks](Problems/0232.cpp)                                                  |
    253 |  0233  |    Hard    | [Number of Digit One](Problems/0233.cpp)                                                           |
    254 |  0234  |    Easy    | [Palindrome Linked List](Problems/0234.cpp)                                                        |
    255 |  0235  |   Medium   | [Lowest Common Ancestor of a Binary Search Tree](Problems/0235.cpp)                                |
    256 |  0236  |   Medium   | [Lowest Common Ancestor of a Binary Tree](Problems/0236.cpp)                                       |
    257 |  0237  |   Medium   | [Delete Node in a Linked List](Problems/0237.cpp)                                                  |
    258 |  0238  |   Medium   | [Product of Array Except Self](Problems/0238.cpp)                                                  |
    259 |  0239  |    Hard    | [Sliding Window Maximum](Problems/0239.cpp)                                                        |
    260 |  0240  |   Medium   | [Search a 2D Matrix II](Problems/0240.cpp)                                                         |
    261 |  0241  |   Medium   | [Different Ways to Add Parentheses](Problems/0241.cpp)                                             |
    262 |  0242  |    Easy    | [Valid Anagram](Problems/0242.cpp)                                                                 |
    263 |  0257  |    Easy    | [Binary Tree Paths](Problems/0257.cpp)                                                             |
    264 |  0258  |    Easy    | [Add Digits](Problems/0258.cpp)                                                                    |
    265 |  0260  |   Medium   | [Single Number III](Problems/0260.cpp)                                                             |
    266 |  0262  |    Hard    | [Trips and Users](Problems/0262.cpp)                                                               |
    267 |  0263  |    Easy    | [Ugly Number](Problems/0263.cpp)                                                                   |
    268 |  0264  |   Medium   | [Ugly Number II](Problems/0264.cpp)                                                                |
    269 |  0268  |    Easy    | [Missing Number](Problems/0268.cpp)                                                                |
    270 |  0273  |    Hard    | [Integer to English Words](Problems/0273.cpp)                                                      |
    271 |  0274  |   Medium   | [H-Index](Problems/0274.cpp)                                                                       |
    272 |  0275  |   Medium   | [H-Index II](Problems/0275.cpp)                                                                    |
    273 |  0278  |    Easy    | [First Bad Version](Problems/0278.cpp)                                                             |
    274 |  0279  |   Medium   | [Perfect Squares](Problems/0279.cpp)                                                               |
    275 |  0282  |    Hard    | [Expression Add Operators](Problems/0282.cpp)                                                      |
    276 |  0283  |    Easy    | [Move Zeroes](Problems/0283.cpp)                                                                   |
    277 |  0284  |   Medium   | [Peeking Iterator](Problems/0284.cpp)                                                              |
    278 |  0287  |   Medium   | [Find the Duplicate Number](Problems/0287.cpp)                                                     |
    279 |  0289  |   Medium   | [Game of Life](Problems/0289.cpp)                                                                  |
    280 |  0290  |    Easy    | [Word Pattern](Problems/0290.cpp)                                                                  |
    281 |  0292  |    Easy    | [Nim Game](Problems/0292.cpp)                                                                      |
    282 |  0295  |    Hard    | [Find Median from Data Stream](Problems/0295.cpp)                                                  |
    283 |  0297  |    Hard    | [Serialize and Deserialize Binary Tree](Problems/0297.cpp)                                         |
    284 |  0299  |   Medium   | [Bulls and Cows](Problems/0299.cpp)                                                                |
    285 |  0300  |   Medium   | [Longest Increasing Subsequence](Problems/0300.cpp)                                                |
    286 |  0301  |    Hard    | [Remove Invalid Parentheses](Problems/0301.cpp)                                                    |
    287 |  0303  |    Easy    | [Range Sum Query - Immutable](Problems/0303.cpp)                                                   |
    288 |  0304  |   Medium   | [Range Sum Query 2D - Immutable](Problems/0304.cpp)                                                |
    289 |  0306  |   Medium   | [Additive Number](Problems/0306.cpp)                                                               |
    290 |  0307  |   Medium   | [Range Sum Query - Mutable](Problems/0307.cpp)                                                     |
    291 |  0309  |   Medium   | [Best Time to Buy and Sell Stock with Cooldown](Problems/0309.cpp)                                 |
    292 |  0310  |   Medium   | [Minimum Height Trees](Problems/0310.cpp)                                                          |
    293 |  0312  |    Hard    | [Burst Balloons](Problems/0312.cpp)                                                                |
    294 |  0313  |   Medium   | [Super Ugly Number ](Problems/0313.cpp)                                                            |
    295 |  0315  |    Hard    | [Count of Smaller Numbers After Self](Problems/0315.cpp)                                           |
    296 |  0316  |   Medium   | [Remove Duplicate Letters](Problems/0316.cpp)                                                      |
    297 |  0318  |   Medium   | [Maximum Product of Word Lengths](Problems/0318.cpp)                                               |
    298 |  0319  |   Medium   | [Bulb Switcher](Problems/0319.cpp)                                                                 |
    299 |  0321  |    Hard    | [Create Maximum Number](Problems/0321.cpp)                                                         |
    300 |  0322  |   Medium   | [Coin Change](Problems/0322.cpp)                                                                   |
    301 |  0324  |   Medium   | [Wiggle Sort II](Problems/0324.cpp)                                                                |
    302 |  0326  |    Easy    | [Power of Three](Problems/0326.cpp)                                                                |
    303 |  0327  |    Hard    | [Count of Range Sum](Problems/0327.cpp)                                                            |
    304 |  0328  |   Medium   | [Odd Even Linked List](Problems/0328.cpp)                                                          |
    305 |  0329  |    Hard    | [Longest Increasing Path in a Matrix](Problems/0329.cpp)                                           |
    306 |  0330  |    Hard    | [Patching Array](Problems/0330.cpp)                                                                |
    307 |  0331  |   Medium   | [Verify Preorder Serialization of a Binary Tree](Problems/0331.cpp)                                |
    308 |  0332  |    Hard    | [Reconstruct Itinerary](Problems/0332.cpp)                                                         |
    309 |  0334  |   Medium   | [Increasing Triplet Subsequence](Problems/0334.cpp)                                                |
    310 |  0336  |    Hard    | [Palindrome Pairs](Problems/0336.cpp)                                                              |
    311 |  0337  |   Medium   | [House Robber III](Problems/0337.cpp)                                                              |
    312 |  0338  |    Easy    | [Counting Bits](Problems/0338.cpp)                                                                 |
    313 |  0341  |   Medium   | [Flatten Nested List Iterator](Problems/0341.cpp)                                                  |
    314 |  0342  |    Easy    | [Power of Four](Problems/0342.cpp)                                                                 |
    315 |  0343  |   Medium   | [Integer Break](Problems/0343.cpp)                                                                 |
    316 |  0344  |    Easy    | [Reverse String](Problems/0344.cpp)                                                                |
    317 |  0345  |    Easy    | [Reverse Vowels of a String](Problems/0345.cpp)                                                    |
    318 |  0347  |   Medium   | [Top K Frequent Elements](Problems/0347.cpp)                                                       |
    319 |  0349  |    Easy    | [Intersection of Two Arrays](Problems/0349.cpp)                                                    |
    320 |  0350  |    Easy    | [Intersection of Two Arrays II](Problems/0350.cpp)                                                 |
    321 |  0352  |    Hard    | [Data Stream as Disjoint Intervals](Problems/0352.cpp)                                             |
    322 |  0354  |    Hard    | [Russian Doll Envelopes](Problems/0354.cpp)                                                        |
    323 |  0355  |   Medium   | [Design Twitter](Problems/0355.cpp)                                                                |
    324 |  0357  |   Medium   | [Count Numbers with Unique Digits](Problems/0357.cpp)                                              |
    325 |  0365  |   Medium   | [Water and Jug Problem](Problems/0365.cpp)                                                         |
    326 |  0367  |    Easy    | [Valid Perfect Square](Problems/0367.cpp)                                                          |
    327 |  0368  |   Medium   | [Largest Divisible Subset](Problems/0368.cpp)                                                      |
    328 |  0371  |   Medium   | [Sum of Two Integers](Problems/0371.cpp)                                                           |
    329 |  0373  |   Medium   | [Find K Pairs with Smallest Sums](Problems/0373.cpp)                                               |
    330 |  0374  |    Easy    | [Guess Number Higher or Lower](Problems/0374.cpp)                                                  |
    331 |  0375  |   Medium   | [Guess Number Higher or Lower II](Problems/0375.cpp)                                               |
    332 |  0376  |   Medium   | [Wiggle Subsequence](Problems/0376.cpp)                                                            |
    333 |  0377  |   Medium   | [Combination Sum IV](Problems/0377.cpp)                                                            |
    334 |  0378  |   Medium   | [Kth Smallest Element in a Sorted Matrix](Problems/0378.cpp)                                       |
    335 |  0380  |   Medium   | [Insert Delete GetRandom O(1)](Problems/0380.cpp)                                                  |
    336 |  0382  |   Medium   | [Linked List Random Node](Problems/0382.cpp)                                                       |
    337 |  0383  |    Easy    | [Ransom Note](Problems/0383.cpp)                                                                   |
    338 |  0384  |   Medium   | [Shuffle an Array](Problems/0384.cpp)                                                              |
    339 |  0385  |   Medium   | [Mini Parser](Problems/0385.cpp)                                                                   |
    340 |  0386  |   Medium   | [Lexicographical Numbers](Problems/0386.cpp)                                                       |
    341 |  0387  |    Easy    | [First Unique Character in a String](Problems/0387.cpp)                                            |
    342 |  0388  |   Medium   | [Longest Absolute File Path](Problems/0388.cpp)                                                    |
    343 |  0389  |    Easy    | [Find the Difference](Problems/0389.cpp)                                                           |
    344 |  0390  |   Medium   | [Elimination Game](Problems/0390.cpp)                                                              |
    345 |  0392  |    Easy    | [Is Subsequence](Problems/0392.cpp)                                                                |
    346 |  0393  |   Medium   | [UTF-8 Validation](Problems/0393.cpp)                                                              |
    347 |  0394  |   Medium   | [Decode String](Problems/0394.cpp)                                                                 |
    348 |  0395  |   Medium   | [Longest Substring with At Least K Repeating Characters](Problems/0395.cpp)                        |
    349 |  0396  |   Medium   | [Rotate Function](Problems/0396.cpp)                                                               |
    350 |  0397  |   Medium   | [Integer Replacement](Problems/0397.cpp)                                                           |
    351 |  0398  |   Medium   | [Random Pick Index](Problems/0398.cpp)                                                             |
    352 |  0399  |   Medium   | [Evaluate Division](Problems/0399.cpp)                                                             |
    353 |  0401  |    Easy    | [Binary Watch](Problems/0401.cpp)                                                                  |
    354 |  0402  |   Medium   | [Remove K Digits](Problems/0402.cpp)                                                               |
    355 |  0403  |    Hard    | [Frog Jump](Problems/0403.cpp)                                                                     |
    356 |  0404  |    Easy    | [Sum of Left Leaves](Problems/0404.cpp)                                                            |
    357 |  0405  |    Easy    | [Convert a Number to Hexadecimal](Problems/0405.cpp)                                               |
    358 |  0406  |   Medium   | [Queue Reconstruction by Height](Problems/0406.cpp)                                                |
    359 |  0409  |    Easy    | [Longest Palindrome](Problems/0409.cpp)                                                            |
    360 |  0410  |    Hard    | [Split Array Largest Sum](Problems/0410.cpp)                                                       |
    361 |  0412  |    Easy    | [Fizz Buzz](Problems/0412.cpp)                                                                     |
    362 |  0413  |   Medium   | [Arithmetic Slices](Problems/0413.cpp)                                                             |
    363 |  0414  |    Easy    | [Third Maximum Number](Problems/0414.cpp)                                                          |
    364 |  0415  |    Easy    | [Add Strings](Problems/0415.cpp)                                                                   |
    365 |  0416  |   Medium   | [Partition Equal Subset Sum](Problems/0416.cpp)                                                    |
    366 |  0417  |   Medium   | [Pacific Atlantic Water Flow](Problems/0417.cpp)                                                   |
    367 |  0419  |   Medium   | [Battleships in a Board](Problems/0419.cpp)                                                        |
    368 |  0421  |   Medium   | [Maximum XOR of Two Numbers in an Array](Problems/0421.cpp)                                        |
    369 |  0423  |   Medium   | [Reconstruct Original Digits from English](Problems/0423.cpp)                                      |
    370 |  0424  |   Medium   | [Longest Repeating Character Replacement](Problems/0424.cpp)                                       |
    371 |  0427  |   Medium   | [Construct Quad Tree](Problems/0427.cpp)                                                           |
    372 |  0429  |   Medium   | [N-ary Tree Level Order Traversal](Problems/0429.cpp)                                              |
    373 |  0430  |   Medium   | [Flatten a Multilevel Doubly Linked list](Problems/0430.cpp)                                       |
    374 |  0432  |    Hard    | [All O`one Data Structure](Problems/0432.cpp)                                                      |
    375 |  0433  |   Medium   | [Minimum Genetic Mutation](Problems/0433.cpp)                                                      |
    376 |  0434  |    Easy    | [Number of Segments in a String](Problems/0434.cpp)                                                |
    377 |  0435  |   Medium   | [Non-overlapping Intervals](Problems/0435.cpp)                                                     |
    378 |  0436  |   Medium   | [Find Right Interval](Problems/0436.cpp)                                                           |
    379 |  0437  |   Medium   | [Path Sum III](Problems/0437.cpp)                                                                  |
    380 |  0438  |   Medium   | [Find All Anagrams in a String](Problems/0438.cpp)                                                 |
    381 |  0440  |    Hard    | [K-th Smallest in Lexicographical Order](Problems/0440.cpp)                                        |
    382 |  0441  |    Easy    | [Arranging Coins](Problems/0441.cpp)                                                               |
    383 |  0442  |   Medium   | [Find All Duplicates in an Array](Problems/0442.cpp)                                               |
    384 |  0443  |   Medium   | [String Compression](Problems/0443.cpp)                                                            |
    385 |  0445  |   Medium   | [Add Two Numbers II](Problems/0445.cpp)                                                            |
    386 |  0446  |    Hard    | [Arithmetic Slices II - Subsequence](Problems/0446.cpp)                                            |
    387 |  0447  |   Medium   | [Number of Boomerangs](Problems/0447.cpp)                                                          |
    388 |  0448  |    Easy    | [Find All Numbers Disappeared in an Array](Problems/0448.cpp)                                      |
    389 |  0449  |   Medium   | [Serialize and Deserialize BST](Problems/0449.cpp)                                                 |
    390 |  0450  |   Medium   | [Delete Node in a BST](Problems/0450.cpp)                                                          |
    391 |  0451  |   Medium   | [Sort Characters By Frequency](Problems/0451.cpp)                                                  |
    392 |  0452  |   Medium   | [Minimum Number of Arrows to Burst Balloons](Problems/0452.cpp)                                    |
    393 |  0453  |   Medium   | [Minimum Moves to Equal Array Elements](Problems/0453.cpp)                                         |
    394 |  0454  |   Medium   | [4Sum II](Problems/0454.cpp)                                                                       |
    395 |  0455  |    Easy    | [Assign Cookies](Problems/0455.cpp)                                                                |
    396 |  0456  |   Medium   | [132 Pattern](Problems/0456.cpp)                                                                   |
    397 |  0457  |   Medium   | [Circular Array Loop](Problems/0457.cpp)                                                           |
    398 |  0458  |    Hard    | [Poor Pigs](Problems/0458.cpp)                                                                     |
    399 |  0459  |    Easy    | [Repeated Substring Pattern](Problems/0459.cpp)                                                    |
    400 |  0460  |    Hard    | [LFU Cache](Problems/0460.cpp)                                                                     |
    401 |  0461  |    Easy    | [Hamming Distance](Problems/0461.cpp)                                                              |
    402 |  0462  |   Medium   | [Minimum Moves to Equal Array Elements II](Problems/0462.cpp)                                      |
    403 |  0463  |    Easy    | [Island Perimeter](Problems/0463.cpp)                                                              |
    404 |  0464  |   Medium   | [Can I Win](Problems/0464.cpp)                                                                     |
    405 |  0467  |   Medium   | [Unique Substrings in Wraparound String](Problems/0467.cpp)                                        |
    406 |  0468  |   Medium   | [Validate IP Address](Problems/0468.cpp)                                                           |
    407 |  0472  |    Hard    | [Concatenated Words](Problems/0472.cpp)                                                            |
    408 |  0473  |   Medium   | [Matchsticks to Square](Problems/0473.cpp)                                                         |
    409 |  0474  |   Medium   | [Ones and Zeroes](Problems/0474.cpp)                                                               |
    410 |  0475  |   Medium   | [Heaters](Problems/0475.cpp)                                                                       |
    411 |  0476  |    Easy    | [Number Complement](Problems/0476.cpp)                                                             |
    412 |  0477  |   Medium   | [Total Hamming Distance](Problems/0477.cpp)                                                        |
    413 |  0481  |   Medium   | [Magical String](Problems/0481.cpp)                                                                |
    414 |  0482  |    Easy    | [License Key Formatting](Problems/0482.cpp)                                                        |
    415 |  0485  |    Easy    | [Max Consecutive Ones](Problems/0485.cpp)                                                          |
    416 |  0486  |   Medium   | [Reachable Nodes With Restrictions](Problems/0486.cpp)                                             |
    417 |  0491  |   Medium   | [Non-decreasing Subsequences](Problems/0491.cpp)                                                   |
    418 |  0493  |    Hard    | [Reverse Pairs](Problems/0493.cpp)                                                                 |
    419 |  0494  |   Medium   | [Target Sum](Problems/0494.cpp)                                                                    |
    420 |  0496  |   Medium   | [Next Greater Element I](Problems/0496.cpp)                                                        |
    421 |  0498  |   Medium   | [Diagonal Traverse](Problems/0498.cpp)                                                             |
    422 |  0501  |    Easy    | [Find Mode in Binary Search Tree](Problems/0501.cpp)                                               |
    423 |  0502  |    Hard    | [IPO](Problems/0502.cpp)                                                                           |
    424 |  0503  |   Medium   | [Next Greater Element II](Problems/0503.cpp)                                                       |
    425 |  0506  |    Easy    | [Relative Ranks](Problems/0506.cpp)                                                                |
    426 |  0508  |   Medium   | [Most Frequent Subtree Sum](Problems/0508.cpp)                                                     |
    427 |  0509  |    Easy    | [Fibonacci Number](Problems/0509.cpp)                                                              |
    428 |  0511  |    Easy    | [Game Play Analysis I](Problems/0511.cpp)                                                          |
    429 |  0513  |   Medium   | [Find Bottom Left Tree Value](Problems/0513.cpp)                                                   |
    430 |  0514  |    Hard    | [Freedom Trail](Problems/0514.cpp)                                                                 |
    431 |  0515  |   Medium   | [Find Largest Value in Each Tree Row](Problems/0515.cpp)                                           |
    432 |  0516  |   Medium   | [Longest Palindromic Subsequence](Problems/0516.cpp)                                               |
    433 |  0518  |   Medium   | [Coin Change II](Problems/0518.cpp)                                                                |
    434 |  0520  |    Easy    | [Detect Capital](Problems/0520.cpp)                                                                |
    435 |  0522  |   Medium   | [Longest Uncommon Subsequence II](Problems/0522.cpp)                                               |
    436 |  0523  |   Medium   | [Continuous Subarray Sum](Problems/0523.cpp)                                                       |
    437 |  0524  |   Medium   | [Longest Word in Dictionary through Deleting](Problems/0524.cpp)                                   |
    438 |  0525  |   Medium   | [Contiguous Array](Problems/0525.cpp)                                                              |
    439 |  0526  |   Medium   | [Beautiful Arrangement](Problems/0526.cpp)                                                         |
    440 |  0529  |   Medium   | [Minesweeper](Problems/0529.cpp)                                                                   |
    441 |  0530  |    Easy    | [Minimum Absolute Difference in BST](Problems/0530.cpp)                                            |
    442 |  0532  |   Medium   | [K-diff Pairs in an Array](Problems/0532.cpp)                                                      |
    443 |  0535  |   Medium   | [Encode and Decode TinyURL](Problems/0535.cpp)                                                     |
    444 |  0537  |   Medium   | [Complex Number Multiplication](Problems/0537.cpp)                                                 |
    445 |  0538  |   Medium   | [Convert BST to Greater Tree](Problems/0538.cpp)                                                   |
    446 |  0539  |   Medium   | [Minimum Time Difference](Problems/0539.cpp)                                                       |
    447 |  0540  |   Medium   | [Single Element in a Sorted Array](Problems/0540.cpp)                                              |
    448 |  0542  |   Medium   | [01 Matrix](Problems/0542.cpp)                                                                     |
    449 |  0543  |    Easy    | [Diameter of Binary Tree](Problems/0543.cpp)                                                       |
    450 |  0547  |   Medium   | [Number of Provinces](Problems/0547.cpp)                                                           |
    451 |  0550  |   Medium   | [Game Play Analysis IV](Problems/0550.cpp)                                                         |
    452 |  0552  |    Hard    | [Student Attendance Record II](Problems/0552.cpp)                                                  |
    453 |  0553  |   Medium   | [Optimal Division](Problems/0553.cpp)                                                              |
    454 |  0554  |   Medium   | [Brick Wall](Problems/0554.cpp)                                                                    |
    455 |  0556  |   Medium   | [Next Greater Element III](Problems/0556.cpp)                                                      |
    456 |  0557  |    Easy    | [Reverse Words in a String III](Problems/0557.cpp)                                                 |
    457 |  0559  |    Easy    | [Maximum Depth of N-ary Tree](Problems/0559.cpp)                                                   |
    458 |  0560  |   Medium   | [Subarray Sum Equals K](Problems/0560.cpp)                                                         |
    459 |  0561  |    Easy    | [Array Partition](Problems/0561.cpp)                                                               |
    460 |  0563  |    Easy    | [Binary Tree Tilt](Problems/0563.cpp)                                                              |
    461 |  0564  |    Hard    | [Find the Closest Palindrome](Problems/0564.cpp)                                                   |
    462 |  0565  |   Medium   | [Array Nesting](Problems/0565.cpp)                                                                 |
    463 |  0566  |    Easy    | [Reshape the Matrix](Problems/0566.cpp)                                                            |
    464 |  0567  |   Medium   | [Permutation in String](Problems/0567.cpp)                                                         |
    465 |  0570  |   Medium   | [Managers with at Least 5 Direct Reports](Problems/0570.cpp)                                       |
    466 |  0572  |    Easy    | [Subtree of Another Tree](Problems/0572.cpp)                                                       |
    467 |  0576  |   Medium   | [Out of Boundary Paths](Problems/0576.cpp)                                                         |
    468 |  0577  |    Easy    | [Employee Bonus](Problems/0577.cpp)                                                                |
    469 |  0581  |   Medium   | [Shortest Unsorted Continuous Subarray](Problems/0581.cpp)                                         |
    470 |  0583  |   Medium   | [Delete Operation for Two Strings](Problems/0583.cpp)                                              |
    471 |  0584  |    Easy    | [Find Customer Referee](Problems/0584.cpp)                                                         |
    472 |  0585  |   Medium   | [Investments in 2016](Problems/0585.cpp)                                                           |
    473 |  0586  |    Easy    | [Customer Placing the Largest Number of Orders](Problems/0586.cpp)                                 |
    474 |  0589  |    Easy    | [N-ary Tree Preorder Traversal](Problems/0589.cpp)                                                 |
    475 |  0590  |    Easy    | [N-ary Tree Postorder Traversal](Problems/0590.cpp)                                                |
    476 |  0592  |   Medium   | [Fraction Addition and Subtraction](Problems/0592.cpp)                                             |
    477 |  0593  |   Medium   | [Valid Square](Problems/0593.cpp)                                                                  |
    478 |  0595  |    Easy    | [Big Countries](Problems/0595.cpp)                                                                 |
    479 |  0596  |    Easy    | [Classes More Than 5 Students](Problems/0596.cpp)                                                  |
    480 |  0601  |    Hard    | [Human Traffic of Stadium](Problems/0601.cpp)                                                      |
    481 |  0602  |   Medium   | [Friend Requests II: Who Has the Most Friends](Problems/0602.cpp)                                  |
    482 |  0605  |    Easy    | [Can Place Flowers](Problems/0605.cpp)                                                             |
    483 |  0606  |    Easy    | [Construct String from Binary Tree](Problems/0606.cpp)                                             |
    484 |  0607  |    Easy    | [Sales Person](Problems/0607.cpp)                                                                  |
    485 |  0608  |   Medium   | [Tree Node](Problems/0608.cpp)                                                                     |
    486 |  0609  |   Medium   | [Find Duplicate File in System](Problems/0609.cpp)                                                 |
    487 |  0610  |    Easy    | [Triangle Judgement](Problems/0610.cpp)                                                            |
    488 |  0611  |   Medium   | [Valid Triangle Number](Problems/0611.cpp)                                                         |
    489 |  0617  |    Easy    | [Merge Two Binary Trees](Problems/0617.cpp)                                                        |
    490 |  0619  |    Easy    | [Biggest Single Number](Problems/0619.cpp)                                                         |
    491 |  0620  |    Easy    | [Not Boring Movies](Problems/0620.cpp)                                                             |
    492 |  0621  |   Medium   | [Task Scheduler](Problems/0621.cpp)                                                                |
    493 |  0622  |   Medium   | [Design Circular Queue](Problems/0622.cpp)                                                         |
    494 |  0623  |   Medium   | [Add One Row to Tree](Problems/0623.cpp)                                                           |
    495 |  0624  |   Medium   | [Maximum Distance in Arrays](Problems/0624.cpp)                                                    |
    496 |  0626  |   Medium   | [Exchange Seats](Problems/0626.cpp)                                                                |
    497 |  0627  |    Easy    | [Swap Salary](Problems/0627.cpp)                                                                   |
    498 |  0629  |    Hard    | [K Inverse Pairs Array](Problems/0629.cpp)                                                         |
    499 |  0632  |    Hard    | [Smallest Range Covering Elements from K Lists](Problems/0632.cpp)                                 |
    500 |  0633  |   Medium   | [Sum of Square Numbers](Problems/0633.cpp)                                                         |
    501 |  0636  |   Medium   | [Exclusive Time of Functions](Problems/0636.cpp)                                                   |
    502 |  0637  |    Easy    | [Average of Levels in Binary Tree](Problems/0637.cpp)                                              |
    503 |  0638  |   Medium   | [Shopping Offers](Problems/0638.cpp)                                                               |
    504 |  0640  |   Medium   | [Solve the Equation](Problems/0640.cpp)                                                            |
    505 |  0641  |   Medium   | [Design Circular Deque](Problems/0641.cpp)                                                         |
    506 |  0643  |    Easy    | [Maximum Average Subarray I](Problems/0643.cpp)                                                    |
    507 |  0645  |    Easy    | [Set Mismatch](Problems/0645.cpp)                                                                  |
    508 |  0646  |   Medium   | [Maximum Length of Pair Chain](Problems/0646.cpp)                                                  |
    509 |  0647  |   Medium   | [Palindromic Substrings](Problems/0647.cpp)                                                        |
    510 |  0648  |   Medium   | [Replace Words](Problems/0648.cpp)                                                                 |
    511 |  0649  |   Medium   | [Dota2 Senate](Problems/0649.cpp)                                                                  |
    512 |  0650  |   Medium   | [2 Keys Keyboard](Problems/0650.cpp)                                                               |
    513 |  0652  |   Medium   | [Find Duplicate Subtrees](Problems/0652.cpp)                                                       |
    514 |  0653  |    Easy    | [Two Sum IV - Input is a BST](Problems/0653.cpp)                                                   |
    515 |  0654  |   Medium   | [Maximum Binary Tree](Problems/0654.cpp)                                                           |
    516 |  0655  |   Medium   | [Print Binary Tree](Problems/0655.cpp)                                                             |
    517 |  0659  |   Medium   | [Split Array into Consecutive Subsequences](Problems/0659.cpp)                                     |
    518 |  0661  |    Easy    | [Image Smoother](Problems/0661.cpp)                                                                |
    519 |  0662  |   Medium   | [Maximum Width of Binary Tree](Problems/0662.cpp)                                                  |
    520 |  0664  |    Hard    | [Strange Printer](Problems/0664.cpp)                                                               |
    521 |  0667  |   Medium   | [Beautiful Arrangement II](Problems/0667.cpp)                                                      |
    522 |  0669  |   Medium   | [Trim a Binary Search Tree](Problems/0669.cpp)                                                     |
    523 |  0670  |   Medium   | [Maximum Swap](Problems/0670.cpp)                                                                  |
    524 |  0671  |    Easy    | [Second Minimum Node In a Binary Tree](Problems/0671.cpp)                                          |
    525 |  0672  |   Medium   | [Bulb Switcher II](Problems/0672.cpp)                                                              |
    526 |  0673  |   Medium   | [Number of Longest Increasing Subsequence](Problems/0673.cpp)                                      |
    527 |  0676  |   Medium   | [Implement Magic Dictionary](Problems/0676.cpp)                                                    |
    528 |  0677  |   Medium   | [Map Sum Pairs](Problems/0677.cpp)                                                                 |
    529 |  0678  |   Medium   | [Valid Parenthesis String](Problems/0678.cpp)                                                      |
    530 |  0684  |   Medium   | [Redundant Connection](Problems/0684.cpp)                                                          |
    531 |  0688  |   Medium   | [Knight Probability in Chessboard](Problems/0688.cpp)                                              |
    532 |  0690  |   Medium   | [Employee Importance](Problems/0690.cpp)                                                           |
    533 |  0692  |   Medium   | [Top K Frequent Words](Problems/0692.cpp)                                                          |
    534 |  0695  |   Medium   | [Max Area of Island](Problems/0695.cpp)                                                            |
    535 |  0699  |    Hard    | [Falling Squares](Problems/0699.cpp)                                                               |
    536 |  0700  |    Easy    | [Search in a Binary Search Tree](Problems/0700.cpp)                                                |
    537 |  0701  |   Medium   | [Insert into a Binary Search Tree](Problems/0701.cpp)                                              |
    538 |  0703  |    Easy    | [Kth Largest Element in a Stream](Problems/0703.cpp)                                               |
    539 |  0704  |    Easy    | [Binary Search](Problems/0704.cpp)                                                                 |
    540 |  0705  |    Easy    | [Design HashSet](Problems/0705.cpp)                                                                |
    541 |  0706  |    Easy    | [Design HashMap](Problems/0706.cpp)                                                                |
    542 |  0707  |   Medium   | [Design Linked List](Problems/0707.cpp)                                                            |
    543 |  0712  |   Medium   | [Minimum ASCII Delete Sum for Two Strings](Problems/0712.cpp)                                      |
    544 |  0713  |   Medium   | [Subarray Product Less Than K](Problems/0713.cpp)                                                  |
    545 |  0714  |   Medium   | [Best Time to Buy and Sell Stock with Transaction Fee](Problems/0714.cpp)                          |
    546 |  0715  |    Hard    | [Range Module](Problems/0715.cpp)                                                                  |
    547 |  0718  |   Medium   | [Maximum Length of Repeated Subarray](Problems/0718.cpp)                                           |
    548 |  0719  |    Hard    | [Find K-th Smallest Pair Distance](Problems/0719.cpp)                                              |
    549 |  0720  |   Medium   | [Longest Word in Dictionary](Problems/0720.cpp)                                                    |
    550 |  0724  |    Easy    | [Find Pivot Index](Problems/0724.cpp)                                                              |
    551 |  0725  |   Medium   | [Split Linked List in Parts](Problems/0725.cpp)                                                    |
    552 |  0726  |    Hard    | [Number of Atoms](Problems/0726.cpp)                                                               |
    553 |  0729  |   Medium   | [My Calendar I](Problems/0729.cpp)                                                                 |
    554 |  0731  |   Medium   | [My Calendar II](Problems/0731.cpp)                                                                |
    555 |  0733  |    Easy    | [Flood Fill](Problems/0733.cpp)                                                                    |
    556 |  0735  |   Medium   | [Asteroid Collision](Problems/0735.cpp)                                                            |
    557 |  0739  |   Medium   | [Daily Temperatures](Problems/0739.cpp)                                                            |
    558 |  0740  |   Medium   | [Delete and Earn](Problems/0740.cpp)                                                               |
    559 |  0743  |   Medium   | [Network Delay Time](Problems/0743.cpp)                                                            |
    560 |  0744  |    Easy    | [Find Smallest Letter Greater Than Target](Problems/0744.cpp)                                      |
    561 |  0746  |    Easy    | [Min Cost Climbing Stairs](Problems/0746.cpp)                                                      |
    562 |  0747  |    Easy    | [Largest Number At Least Twice of Others](Problems/0747.cpp)                                       |
    563 |  0752  |   Medium   | [Open the Lock](Problems/0752.cpp)                                                                 |
    564 |  0756  |   Medium   | [Pyramid Transition Matrix](Problems/0756.cpp)                                                     |
    565 |  0763  |   Medium   | [Partition Labels](Problems/0763.cpp)                                                              |
    566 |  0767  |   Medium   | [Reorganize String](Problems/0767.cpp)                                                             |
    567 |  0769  |   Medium   | [Max Chunks To Make Sorted](Problems/0769.cpp)                                                     |
    568 |  0779  |   Medium   | [K-th Symbol in Grammar](Problems/0779.cpp)                                                        |
    569 |  0781  |   Medium   | [Rabbits in Forest](Problems/0781.cpp)                                                             |
    570 |  0783  |    Easy    | [Minimum Distance Between BST Nodes](Problems/0783.cpp)                                            |
    571 |  0784  |   Medium   | [Letter Case Permutation](Problems/0784.cpp)                                                       |
    572 |  0785  |   Medium   | [Is Graph Bipartite?](Problems/0785.cpp)                                                           |
    573 |  0786  |   Medium   | [K-th Smallest Prime Fraction](Problems/0786.cpp)                                                  |
    574 |  0787  |   Medium   | [Cheapest Flights Within K Stops](Problems/0787.cpp)                                               |
    575 |  0788  |   Medium   | [Rotated Digits](Problems/0788.cpp)                                                                |
    576 |  0789  |   Medium   | [Escape The Ghosts](Problems/0789.cpp)                                                             |
    577 |  0790  |   Medium   | [Domino and Tromino Tiling](Problems/0790.cpp)                                                     |
    578 |  0791  |   Medium   | [Custom Sort String](Problems/0791.cpp)                                                            |
    579 |  0792  |   Medium   | [Number of Matching Subsequences](Problems/0792.cpp)                                               |
    580 |  0795  |   Medium   | [Number of Subarrays with Bounded Maximum](Problems/0795.cpp)                                      |
    581 |  0796  |    Easy    | [Rotate String](Problems/0796.cpp)                                                                 |
    582 |  0797  |   Medium   | [All Paths From Source to Target](Problems/0797.cpp)                                               |
    583 |  0799  |   Medium   | [Champagne Tower](Problems/0799.cpp)                                                               |
    584 |  0802  |   Medium   | [Find Eventual Safe States](Problems/0802.cpp)                                                     |
    585 |  0807  |   Medium   | [Max Increase to Keep City Skyline](Problems/0807.cpp)                                             |
    586 |  0808  |   Medium   | [Soup Servings](Problems/0808.cpp)                                                                 |
    587 |  0811  |   Medium   | [Subdomain Visit Count](Problems/0811.cpp)                                                         |
    588 |  0813  |   Medium   | [Largest Sum of Averages](Problems/0813.cpp)                                                       |
    589 |  0814  |   Medium   | [Binary Tree Pruning](Problems/0814.cpp)                                                           |
    590 |  0815  |    Hard    | [Bus Routes](Problems/0815.cpp)                                                                    |
    591 |  0816  |   Medium   | [Ambiguous Coordinates](Problems/0816.cpp)                                                         |
    592 |  0817  |   Medium   | [Linked List Components](Problems/0817.cpp)                                                        |
    593 |  0820  |   Medium   | [Short Encoding of Words](Problems/0820.cpp)                                                       |
    594 |  0823  |   Medium   | [Binary Trees With Factors](Problems/0823.cpp)                                                     |
    595 |  0826  |   Medium   | [Most Profit Assigning Work](Problems/0826.cpp)                                                    |
    596 |  0830  |   Medium   | [Kth Smallest Element in a BST](Problems/0230.cpp)                                                 |
    597 |  0831  |   Medium   | [Masking Personal Information](Problems/0831.cpp)                                                  |
    598 |  0833  |   Medium   | [Find And Replace in String](Problems/0833.cpp)                                                    |
    599 |  0834  |    Hard    | [Sum of Distances in Tree](Problems/0834.cpp)                                                      |
    600 |  0835  |   Medium   | [Image Overlap](Problems/0835.cpp)                                                                 |
    601 |  0837  |   Medium   | [New 21 Game](Problems/0837.cpp)                                                                   |
    602 |  0838  |   Medium   | [Push Dominoes](Problems/0838.cpp)                                                                 |
    603 |  0839  |    Hard    | [Similar String Groups](Problems/0839.cpp)                                                         |
    604 |  0840  |   Medium   | [Magic Squares In Grid](Problems/0840.cpp)                                                         |
    605 |  0841  |   Medium   | [Keys and Rooms](Problems/0841.cpp)                                                                |
    606 |  0844  |    Easy    | [Backspace String Compare](Problems/0844.cpp)                                                      |
    607 |  0846  |   Medium   | [Hand of Straights](Problems/0846.cpp)                                                             |
    608 |  0847  |    Hard    | [Shortest Path Visiting All Nodes](Problems/0847.cpp)                                              |
    609 |  0851  |   Medium   | [Loud and Rich](Problems/0851.cpp)                                                                 |
    610 |  0852  |   Medium   | [Peak Index in a Mountain Array](Problems/0852.cpp)                                                |
    611 |  0853  |   Medium   | [Car Fleet](Problems/0853.cpp)                                                                     |
    612 |  0856  |   Medium   | [Score of Parentheses](Problems/0856.cpp)                                                          |
    613 |  0857  |    Hard    | [Minimum Cost to Hire K Workers](Problems/0857.cpp)                                                |
    614 |  0858  |   Medium   | [Mirror Reflection](Problems/0858.cpp)                                                             |
    615 |  0859  |    Easy    | [Buddy Strings](Problems/0859.cpp)                                                                 |
    616 |  0860  |    Easy    | [Lemonade Change](Problems/0860.cpp)                                                               |
    617 |  0861  |   Medium   | [Score After Flipping Matrix](Problems/0861.cpp)                                                   |
    618 |  0862  |    Hard    | [Shortest Subarray with Sum at Least K](Problems/0862.cpp)                                         |
    619 |  0863  |   Medium   | [All Nodes Distance K in Binary Tree](Problems/0863.cpp)                                           |
    620 |  0864  |    Hard    | [Shortest Path to Get All Keys](Problems/0864.cpp)                                                 |
    621 |  0865  |   Medium   | [Smallest Subtree with all the Deepest Nodes](Problems/0865.cpp)                                   |
    622 |  0867  |    Easy    | [Transpose Matrix](Problems/0867.cpp)                                                              |
    623 |  0869  |   Medium   | [Reordered Power of 2](Problems/0869.cpp)                                                          |
    624 |  0870  |   Medium   | [Advantage Shuffle](Problems/0870.cpp)                                                             |
    625 |  0872  |    Easy    | [Leaf-Similar Trees](Problems/0872.cpp)                                                            |
    626 |  0874  |   Medium   | [Walking Robot Simulation](Problems/0874.cpp)                                                      |
    627 |  0875  |   Medium   | [Koko Eating Bananas](Problems/0875.cpp)                                                           |
    628 |  0876  |    Easy    | [Middle of the Linked List](Problems/0876.cpp)                                                     |
    629 |  0877  |   Medium   | [Stone Game](Problems/0877.cpp)                                                                    |
    630 |  0879  |    Hard    | [Profitable Schemes](Problems/0879.cpp)                                                            |
    631 |  0880  |   Medium   | [Decoded String at Index](Problems/0880.cpp)                                                       |
    632 |  0881  |   Medium   | [Boats to Save People](Problems/0881.cpp)                                                          |
    633 |  0884  |    Easy    | [Uncommon Words from Two Sentences](Problems/0884.cpp)                                             |
    634 |  0885  |   Medium   | [Spiral Matrix III](Problems/0885.cpp)                                                             |
    635 |  0886  |   Medium   | [Possible Bipartition](Problems/0886.cpp)                                                          |
    636 |  0889  |   Medium   | [Construct Binary Tree from Preorder and Postorder Traversal](Problems/0889.cpp)                   |
    637 |  0890  |   Medium   | [Find and Replace Pattern](Problems/0890.cpp)                                                      |
    638 |  0893  |   Medium   | [Groups of Special-Equivalent Strings](Problems/0893.cpp)                                          |
    639 |  0894  |   Medium   | [All Possible Full Binary Trees](Problems/0894.cpp)                                                |
    640 |  0896  |    Easy    | [Monotonic Array](Problems/0896.cpp)                                                               |
    641 |  0897  |    Easy    | [Increasing Order Search Tree](Problems/0897.cpp)                                                  |
    642 |  0900  |   Medium   | [RLE Iterator](Problems/0900.cpp)                                                                  |
    643 |  0901  |   Medium   | [Online Stock Span](Problems/0901.cpp)                                                             |
    644 |  0904  |   Medium   | [Fruit Into Baskets](Problems/0904.cpp)                                                            |
    645 |  0905  |    Easy    | [Sort Array By Parity](Problems/0905.cpp)                                                          |
    646 |  0907  |   Medium   | [Sum of Subarray Minimums](Problems/0907.cpp)                                                      |
    647 |  0909  |   Medium   | [Snakes and Ladders](Problems/0909.cpp)                                                            |
    648 |  0911  |   Medium   | [Online Election](Problems/0911.cpp)                                                               |
    649 |  0912  |   Medium   | [Sort an Array](Problems/0912.cpp)                                                                 |
    650 |  0915  |   Medium   | [Partition Array into Disjoint Intervals](Problems/0915.cpp)                                       |
    651 |  0916  |   Medium   | [Word Subsets](Problems/0916.cpp)                                                                  |
    652 |  0918  |   Medium   | [Maximum Sum Circular Subarray](Problems/0918.cpp)                                                 |
    653 |  0919  |   Medium   | [Complete Binary Tree Inserter](Problems/0919.cpp)                                                 |
    654 |  0920  |    Hard    | [Number of Music Playlists](Problems/0920.cpp)                                                     |
    655 |  0921  |   Medium   | [Minimum Add to Make Parentheses Valid](Problems/0921.cpp)                                         |
    656 |  0926  |   Medium   | [Flip String to Monotone Increasing](Problems/0926.cpp)                                            |
    657 |  0930  |   Medium   | [Binary Subarrays With Sum](Problems/0930.cpp)                                                     |
    658 |  0931  |   Medium   | [Minimum Falling Path Sum](Problems/0931.cpp)                                                      |
    659 |  0932  |   Medium   | [Beautiful Array](Problems/0932.cpp)                                                               |
    660 |  0933  |    Easy    | [Number of Recent Calls](Problems/0933.cpp)                                                        |
    661 |  0934  |   Medium   | [Shortest Bridge](Problems/0934.cpp)                                                               |
    662 |  0935  |   Medium   | [Knight Dialer](Problems/0935.cpp)                                                                 |
    663 |  0937  |   Medium   | [Reorder Data in Log Files](Problems/0937.cpp)                                                     |
    664 |  0938  |    Easy    | [Range Sum of BST](Problems/0938.cpp)                                                              |
    665 |  0939  |   Medium   | [Minimum Area Rectangle](Problems/0939.cpp)                                                        |
    666 |  0941  |    Easy    | [Valid Mountain Array](Problems/0941.cpp)                                                          |
    667 |  0944  |    Easy    | [Delete Columns to Make Sorted](Problems/0944.cpp)                                                 |
    668 |  0945  |   Medium   | [Minimum Increment to Make Array Unique](Problems/0945.cpp)                                        |
    669 |  0946  |   Medium   | [Validate Stack Sequences](Problems/0946.cpp)                                                      |
    670 |  0947  |   Medium   | [Most Stones Removed with Same Row or Column](Problems/0947.cpp)                                   |
    671 |  0948  |   Medium   | [Bag of Tokens](Problems/0948.cpp)                                                                 |
    672 |  0950  |   Medium   | [Reveal Cards In Increasing Order](Problems/0950.cpp)                                              |
    673 |  0951  |   Medium   | [Flip Equivalent Binary Trees](Problems/0951.cpp)                                                  |
    674 |  0953  |    Easy    | [Verifying an Alien Dictionary](Problems/0953.cpp)                                                 |
    675 |  0956  |   Medium   | [Tallest Billboard](Problems/0956.cpp)                                                             |
    676 |  0958  |   Medium   | [Check Completeness of a Binary Tree](Problems/0958.cpp)                                           |
    677 |  0959  |   Medium   | [Regions Cut By Slashes](Problems/0959.cpp)                                                        |
    678 |  0962  |   Medium   | [Maximum Width Ramp](Problems/0962.cpp)                                                            |
    679 |  0965  |    Easy    | [Univalued Binary Tree](Problems/0965.cpp)                                                         |
    680 |  0966  |   Medium   | [Vowel Spellchecker](Problems/0966.cpp)                                                            |
    681 |  0967  |   Medium   | [Numbers With Same Consecutive Differences](Problems/0967.cpp)                                     |
    682 |  0969  |   Medium   | [Pancake Sorting](Problems/0969.cpp)                                                               |
    683 |  0973  |   Medium   | [K Closest Points to Origin](Problems/0973.cpp)                                                    |
    684 |  0974  |   Medium   | [Subarray Sums Divisible by K](Problems/0974.cpp)                                                  |
    685 |  0977  |    Easy    | [Squares of a Sorted Array](Problems/0977.cpp)                                                     |
    686 |  0979  |   Medium   | [Distribute Coins in Binary Tree](Problems/0979.cpp)                                               |
    687 |  0980  |    Hard    | [Unique Paths III](Problems/0980.cpp)                                                              |
    688 |  0981  |   Medium   | [Time Based Key-Value Store](Problems/0981.cpp)                                                    |
    689 |  0983  |   Medium   | [Minimum Cost For Tickets](Problems/0983.cpp)                                                      |
    690 |  0985  |   Medium   | [Sum of Even Numbers After Queries](Problems/0985.cpp)                                             |
    691 |  0986  |   Medium   | [Interval List Intersections](Problems/0986.cpp)                                                   |
    692 |  0988  |   Medium   | [Smallest String Starting From Leaf](Problems/0988.cpp)                                            |
    693 |  0989  |    Easy    | [Add to Array-Form of Integer](Problems/0989.cpp)                                                  |
    694 |  0990  |   Medium   | [Satisfiability of Equality Equations](Problems/0990.cpp)                                          |
    695 |  0991  |   Medium   | [Broken Calculator](Problems/0991.cpp)                                                             |
    696 |  0992  |    Hard    | [Subarrays with K Different Integers](Problems/0992.cpp)                                           |
    697 |  0993  |    Easy    | [Cousins in Binary Tree](Problems/0993.cpp)                                                        |
    698 |  0994  |   Medium   | [Rotting Oranges](Problems/0994.cpp)                                                               |
    699 |  0995  |    Hard    | [Minimum Number of K Consecutive Bit Flips](Problems/0995.cpp)                                     |
    700 |  0997  |    Easy    | [Find the Town Judge](Problems/0997.cpp)                                                           |
    701 |  0998  |   Medium   | [Maximum Binary Tree II](Problems/0998.cpp)                                                        |
    702 |  1002  |    Easy    | [Find Common Characters](Problems/1002.cpp)                                                        |
    703 |  1003  |   Medium   | [Check If Word Is Valid After Substitutions](Problems/1003.cpp)                                    |
    704 |  1004  |   Medium   | [Max Consecutive Ones III](Problems/1004.cpp)                                                      |
    705 |  1006  |   Medium   | [Clumsy Factorial](Problems/1006.cpp)                                                              |
    706 |  1007  |   Medium   | [Minimum Domino Rotations For Equal Row](Problems/1007.cpp)                                        |
    707 |  1008  |   Medium   | [Construct Binary Search Tree from Preorder Traversal](Problems/1008.cpp)                          |
    708 |  1009  |    Easy    | [Complement of Base 10 Integer](Problems/1009.cpp)                                                 |
    709 |  1010  |   Medium   | [Pairs of Songs With Total Durations Divisible by 60](Problems/1010.cpp)                           |
    710 |  1011  |   Medium   | [Capacity To Ship Packages Within D Days](Problems/1011.cpp)                                       |
    711 |  1014  |   Medium   | [Best Sightseeing Pair](Problems/1014.cpp)                                                         |
    712 |  1016  |   Medium   | [Binary String With Substrings Representing 1 To N](Problems/1016.cpp)                             |
    713 |  1017  |   Medium   | [Convert to Base -2](Problems/1017.cpp)                                                            |
    714 |  1019  |   Medium   | [Next Greater Node In Linked List](Problems/1019.cpp)                                              |
    715 |  1020  |   Medium   | [Number of Enclaves](Problems/1020.cpp)                                                            |
    716 |  1022  |    Easy    | [Sum of Root To Leaf Binary Numbers](Problems/1022.cpp)                                            |
    717 |  1023  |   Medium   | [Camelcase Matching](Problems/1023.cpp)                                                            |
    718 |  1024  |   Medium   | [Video Stitching](Problems/1024.cpp)                                                               |
    719 |  1026  |   Medium   | [Maximum Difference Between Node and Ancestor](Problems/1026.cpp)                                  |
    720 |  1027  |   Medium   | [Longest Arithmetic Subsequence](Problems/1027.cpp)                                                |
    721 |  1029  |   Medium   | [Two City Scheduling](Problems/1029.cpp)                                                           |
    722 |  1031  |   Medium   | [Maximum Sum of Two Non-Overlapping Subarrays](Problems/1031.cpp)                                  |
    723 |  1033  |   Medium   | [Moving Stones Until Consecutive](Problems/1033.cpp)                                               |
    724 |  1035  |   Medium   | [Uncrossed Lines](Problems/1035.cpp)                                                               |
    725 |  1038  |   Medium   | [Binary Search Tree to Greater Sum Tree](Problems/1038.cpp)                                        |
    726 |  1039  |   Medium   | [Minimum Score Triangulation of Polygon](Problems/1039.cpp)                                        |
    727 |  1040  |   Medium   | [Moving Stones Until Consecutive II](Problems/1040.cpp)                                            |
    728 |  1041  |   Medium   | [Robot Bounded In Circle](Problems/1041.cpp)                                                       |
    729 |  1042  |   Medium   | [Flower Planting With No Adjacent](Problems/1042.cpp)                                              |
    730 |  1043  |   Medium   | [Partition Array for Maximum Sum](Problems/1043.cpp)                                               |
    731 |  1045  |   Medium   | [Customers Who Bought All Products](Problems/1045.cpp)                                             |
    732 |  1046  |    Easy    | [Last Stone Weight](Problems/1046.cpp)                                                             |
    733 |  1047  |    Easy    | [Remove All Adjacent Duplicates In String](Problems/1047.cpp)                                      |
    734 |  1048  |   Medium   | [Longest String Chain](Problems/1048.cpp)                                                          |
    735 |  1049  |   Medium   | [Last Stone Weight II](Problems/1049.cpp)                                                          |
    736 |  1050  |    Easy    | [Actors and Directors Who Cooperated At Least Three Times](Problems/1050.cpp)                      |
    737 |  1051  |    Easy    | [Height Checker](Problems/1051.cpp)                                                                |
    738 |  1052  |   Medium   | [Grumpy Bookstore Owner](Problems/1052.cpp)                                                        |
    739 |  1061  |   Medium   | [Lexicographically Smallest Equivalent String](Problems/1061.cpp)                                  |
    740 |  1068  |    Easy    | [Product Sales Analysis I](Problems/1068.cpp)                                                      |
    741 |  1070  |   Medium   | [Product Sales Analysis III](Problems/1070.cpp)                                                    |
    742 |  1071  |    Easy    | [Greatest Common Divisor of Strings](Problems/1071.cpp)                                            |
    743 |  1072  |   Medium   | [Flip Columns For Maximum Number of Equal Rows](Problems/1072.cpp)                                 |
    744 |  1074  |    Hard    | [Number of Submatrices That Sum to Target](Problems/1074.cpp)                                      |
    745 |  1075  |    Easy    | [Project Employees I](Problems/1075.cpp)                                                           |
    746 |  1079  |   Medium   | [Letter Tile Possibilities](Problems/1079.cpp)                                                     |
    747 |  1080  |   Medium   | [Insufficient Nodes in Root to Leaf Paths](Problems/1080.cpp)                                      |
    748 |  1081  |   Medium   | [Smallest Subsequence of Distinct Characters](Problems/1081.cpp)                                   |
    749 |  1084  |    Easy    | [Sales Analysis III](Problems/1084.cpp)                                                            |
    750 |  1089  |    Easy    | [Duplicate Zeros](Problems/1089.cpp)                                                               |
    751 |  1090  |   Medium   | [Largest Values From Labels](Problems/1090.cpp)                                                    |
    752 |  1091  |   Medium   | [Shortest Path in Binary Matrix](Problems/1091.cpp)                                                |
    753 |  1094  |   Medium   | [Car Pooling](Problems/1094.cpp)                                                                   |
    754 |  1095  |    Easy    | [Find Numbers with Even Number of Digits](Problems/1095.cpp)                                       |
    755 |  1095  |    Hard    | [Find in Mountain Array](Problems/1095.cpp)                                                        |
    756 |  1099  |    Easy    | [Replace Elements with Greatest Element on Right Side](Problems/1099.cpp)                          |
    757 |  1104  |   Medium   | [Path In Zigzag Labelled Binary Tree](Problems/1104.cpp)                                           |
    758 |  1105  |   Medium   | [Filling Bookcase Shelves](Problems/1105.cpp)                                                      |
    759 |  1106  |    Hard    | [Parsing A Boolean Expression](Problems/1106.cpp)                                                  |
    760 |  1109  |   Medium   | [Corporate Flight Bookings](Problems/1109.cpp)                                                     |
    761 |  1110  |   Medium   | [Delete Nodes And Return Forest](Problems/1110.cpp)                                                |
    762 |  1111  |   Medium   | [Maximum Nesting Depth of Two Valid Parentheses Strings](Problems/1111.cpp)                        |
    763 |  1122  |    Easy    | [Relative Sort Array](Problems/1122.cpp)                                                           |
    764 |  1123  |   Medium   | [Lowest Common Ancestor of Deepest Leaves](Problems/1123.cpp)                                      |
    765 |  1125  |    Hard    | [Smallest Sufficient Team](Problems/1125.cpp)                                                      |
    766 |  1129  |   Medium   | [Shortest Path with Alternating Colors](Problems/1129.cpp)                                         |
    767 |  1130  |   Medium   | [Minimum Cost Tree From Leaf Values](Problems/1130.cpp)                                            |
    768 |  1137  |    Easy    | [N-th Tribonacci Number](Problems/1137.cpp)                                                        |
    769 |  1138  |   Medium   | [Alphabet Board Path](Problems/1138.cpp)                                                           |
    770 |  1139  |   Medium   | [Largest 1-Bordered Square](Problems/1139.cpp)                                                     |
    771 |  1140  |   Medium   | [Stone Game II](Problems/1140.cpp)                                                                 |
    772 |  1141  |    Easy    | [User Activity for the Past 30 Days I](Problems/1141.cpp)                                          |
    773 |  1143  |   Medium   | [Longest Common Subsequence](Problems/1143.cpp)                                                    |
    774 |  1145  |   Medium   | [Binary Tree Coloring Game](Problems/1145.cpp)                                                     |
    775 |  1146  |   Medium   | [Snapshot Array](Problems/1146.cpp)                                                                |
    776 |  1148  |    Easy    | [Article Views I](Problems/1148.cpp)                                                               |
    777 |  1155  |   Medium   | [Number of Dice Rolls With Target Sum](Problems/1155.cpp)                                          |
    778 |  1158  |   Medium   | [Market Analysis I](Problems/1158.cpp)                                                             |
    779 |  1160  |    Easy    | [Find Words That Can Be Formed by Characters](Problems/1160.cpp)                                   |
    780 |  1161  |   Medium   | [Maximum Level Sum of a Binary Tree](Problems/1161.cpp)                                            |
    781 |  1162  |   Medium   | [As Far from Land as Possible](Problems/1162.cpp)                                                  |
    782 |  1164  |   Medium   | [Product Price at a Given Date](Problems/1164.cpp)                                                 |
    783 |  1170  |   Medium   | [Compare Strings by Frequency of the Smallest Character](Problems/1170.cpp)                        |
    784 |  1171  |   Medium   | [Remove Zero Sum Consecutive Nodes from Linked List](Problems/1171.cpp)                            |
    785 |  1174  |   Medium   | [Immediate Food Delivery II](Problems/1174.cpp)                                                    |
    786 |  1179  |    Easy    | [Reformat Department Table](Problems/1179.cpp)                                                     |
    787 |  1187  |    Hard    | [Make Array Strictly Increasing](Problems/1187.cpp)                                                |
    788 |  1190  |   Medium   | [Reverse Substrings Between Each Pair of Parentheses](Problems/1190.cpp)                           |
    789 |  1193  |   Medium   | [Monthly Transactions I](Problems/1193.cpp)                                                        |
    790 |  1202  |   Medium   | [Smallest String With Swaps](Problems/1202.cpp)                                                    |
    791 |  1203  |    Hard    | [Sort Items by Groups Respecting Dependencies](Problems/1203.cpp)                                  |
    792 |  1204  |   Medium   | [Last Person to Fit in the Bus](Problems/1204.cpp)                                                 |
    793 |  1207  |    Easy    | [Unique Number of Occurrences](Problems/1207.cpp)                                                  |
    794 |  1208  |   Medium   | [Get Equal Substrings Within Budget](Problems/1208.cpp)                                            |
    795 |  1209  |   Medium   | [Remove All Adjacent Duplicates in String II](Problems/1209.cpp)                                   |
    796 |  1211  |    Easy    | [Queries Quality and Percentage](Problems/1211.cpp)                                                |
    797 |  1218  |   Medium   | [Longest Arithmetic Subsequence of Given Difference](Problems/1218.cpp)                            |
    798 |  1219  |   Medium   | [Path with Maximum Gold](Problems/1219.cpp)                                                        |
    799 |  1220  |    Hard    | [Count Vowels Permutation](Problems/1220.cpp)                                                      |
    800 |  1222  |   Medium   | [Queens That Can Attack the King](Problems/1222.cpp)                                               |
    801 |  1227  |   Medium   | [Airplane Seat Assignment Probability](Problems/1227.cpp)                                          |
    802 |  1232  |    Easy    | [Check If It Is a Straight Line](Problems/1232.cpp)                                                |
    803 |  1233  |   Medium   | [Remove Sub-Folders from the Filesystem](Problems/1233.cpp)                                        |
    804 |  1235  |    Hard    | [Maximum Profit in Job Scheduling](Problems/1235.cpp)                                              |
    805 |  1237  |   Medium   | [Find Positive Integer Solution for a Given Equation](Problems/1237.cpp)                           |
    806 |  1238  |   Medium   | [Circular Permutation in Binary Representation](Problems/1238.cpp)                                 |
    807 |  1239  |   Medium   | [Maximum Length of a Concatenated String with Unique Characters](Problems/1239.cpp)                |
    808 |  1247  |   Medium   | [Minimum Swaps to Make Strings Equal](Problems/1247.cpp)                                           |
    809 |  1248  |   Medium   | [Count Number of Nice Subarrays](Problems/1248.cpp)                                                |
    810 |  1249  |   Medium   | [Minimum Remove to Make Valid Parentheses](Problems/1249.cpp)                                      |
    811 |  1251  |    Easy    | [Average Selling Price](Problems/1251.cpp)                                                         |
    812 |  1254  |   Medium   | [Number of Closed Islands](Problems/1254.cpp)                                                      |
    813 |  1255  |    Hard    | [Maximum Score Words Formed by Letters](Problems/1255.cpp)                                         |
    814 |  1261  |   Medium   | [Find Elements in a Contaminated Binary Tree](Problems/1261.cpp)                                   |
    815 |  1262  |   Medium   | [Greatest Sum Divisible by Three](Problems/1262.cpp)                                               |
    816 |  1262  |   Medium   | [Greatest Sum Divisible by Three](Problems/1262.cpp)                                               |
    817 |  1266  |    Easy    | [Minimum Time Visiting All Points](Problems/1266.cpp)                                              |
    818 |  1267  |   Medium   | [Count Servers that Communicate](Problems/1267.cpp)                                                |
    819 |  1268  |   Medium   | [Search Suggestions System](Problems/1268.cpp)                                                     |
    820 |  1269  |    Hard    | [Number of Ways to Stay in the Same Place After Some Steps](Problems/1269.cpp)                     |
    821 |  1276  |   Medium   | [Number of Burgers with No Waste of Ingredients](Problems/1276.cpp)                                |
    822 |  1277  |   Medium   | [Count Square Submatrices with All Ones](Problems/1277.cpp)                                        |
    823 |  1280  |    Easy    | [Students and Examinations](Problems/1280.cpp)                                                     |
    824 |  1282  |   Medium   | [Group the People Given the Group Size They Belong To](Problems/1282.cpp)                          |
    825 |  1283  |   Medium   | [Find the Smallest Divisor Given a Threshold](Problems/1283.cpp)                                   |
    826 |  1286  |   Medium   | [Iterator for Combination](Problems/1286.cpp)                                                      |
    827 |  1287  |    Easy    | [Element Appearing More Than 25% In Sorted Array](Problems/1287.cpp)                               |
    828 |  1288  |   Medium   | [Remove Covered Intervals](Problems/1288.cpp)                                                      |
    829 |  1289  |    Hard    | [Minimum Falling Path Sum II](Problems/1289.cpp)                                                   |
    830 |  1290  |    Easy    | [Convert Binary Number in a Linked List to Integer](Problems/1290.cpp)                             |
    831 |  1291  |   Medium   | [Sequential Digits](Problems/1291.cpp)                                                             |
    832 |  1292  |   Medium   | [Maximum Side Length of a Square with Sum Less than or Equal to Threshold](Problems/1292.cpp)      |
    833 |  1296  |   Medium   | [Divide Array in Sets of K Consecutive Numbers](Problems/1296.cpp)                                 |
    834 |  1297  |   Medium   | [Maximum Number of Occurrences of a Substring](Problems/1297.cpp)                                  |
    835 |  1302  |   Medium   | [Deepest Leaves Sum](Problems/1302.cpp)                                                            |
    836 |  1305  |   Medium   | [All Elements in Two Binary Search Trees](Problems/1305.cpp)                                       |
    837 |  1306  |   Medium   | [Jump Game III](Problems/1306.cpp)                                                                 |
    838 |  1310  |   Medium   | [XOR Queries of a Subarray](Problems/1310.cpp)                                                     |
    839 |  1311  |   Medium   | [Get Watched Videos by Your Friends](Problems/1311.cpp)                                            |
    840 |  1312  |    Hard    | [Minimum Insertion Steps to Make a String Palindrome](Problems/1312.cpp)                           |
    841 |  1314  |   Medium   | [Matrix Block Sum](Problems/1314.cpp)                                                              |
    842 |  1315  |   Medium   | [Sum of Nodes with Even-Valued Grandparent](Problems/1315.cpp)                                     |
    843 |  1318  |   Medium   | [Minimum Flips to Make a OR b Equal to c](Problems/1318.cpp)                                       |
    844 |  1319  |   Medium   | [Number of Operations to Make Network Connected](Problems/1319.cpp)                                |
    845 |  1321  |   Medium   | [Restaurant Growth](Problems/1321.cpp)                                                             |
    846 |  1323  |    Easy    | [Maximum 69 Number](Problems/1323.cpp)                                                             |
    847 |  1324  |   Medium   | [Print Words Vertically](Problems/1324.cpp)                                                        |
    848 |  1325  |   Medium   | [Delete Leaves With a Given Value](Problems/1325.cpp)                                              |
    849 |  1326  |    Hard    | [Minimum Number of Taps to Open to Water a Garden](Problems/1326.cpp)                              |
    850 |  1327  |    Easy    | [List the Products Ordered in a Period](Problems/1327.cpp)                                         |
    851 |  1328  |   Medium   | [Break a Palindrome](Problems/1328.cpp)                                                            |
    852 |  1329  |   Medium   | [Sort the Matrix Diagonally](Problems/1329.cpp)                                                    |
    853 |  1331  |    Easy    | [Rank Transform of an Array](Problems/1331.cpp)                                                    |
    854 |  1333  |   Medium   | [Filter Restaurants by Vegan-Friendly, Price and Distance](Problems/1333.cpp)                      |
    855 |  1334  |   Medium   | [Find the City With the Smallest Number of Neighbors at a Threshold Distance](Problems/1334.cpp)   |
    856 |  1335  |    Hard    | [Minimum Difficulty of a Job Schedule](Problems/1335.cpp)                                          |
    857 |  1337  |    Easy    | [The K Weakest Rows in a Matrix](Problems/1337.cpp)                                                |
    858 |  1338  |   Medium   | [Reduce Array Size to The Half](Problems/1338.cpp)                                                 |
    859 |  1339  |   Medium   | [Maximum Product of Splitted Binary Tree](Problems/1339.cpp)                                       |
    860 |  1341  |   Medium   | [Movie Rating](Problems/1341.cpp)                                                                  |
    861 |  1342  |    Easy    | [Number of Steps to Reduce a Number to Zero](Problems/1342.cpp)                                    |
    862 |  1343  |   Medium   | [Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold](Problems/1343.cpp) |
    863 |  1344  |   Medium   | [Angle Between Hands of a Clock](Problems/1344.cpp)                                                |
    864 |  1345  |    Hard    | [Jump Game IV](Problems/1345.cpp)                                                                  |
    865 |  1346  |    Easy    | [Check if N and Its Double Exist](Problems/1346.cpp)                                               |
    866 |  1347  |   Medium   | [Minimum Number of Steps to Make Two Strings Anagram](Problems/1347.cpp)                           |
    867 |  1351  |    Easy    | [Count Negative Numbers in a Sorted Matrix](Problems/1351.cpp)                                     |
    868 |  1352  |   Medium   | [Product of the Last K Numbers](Problems/1352.cpp)                                                 |
    869 |  1356  |    Easy    | [Sort Integers by The Number of 1 Bits](Problems/1356.cpp)                                         |
    870 |  1357  |   Medium   | [Apply Discount Every n Orders](Problems/1357.cpp)                                                 |
    871 |  1358  |   Medium   | [Number of Substrings Containing All Three Characters](Problems/1358.cpp)                          |
    872 |  1359  |    Hard    | [Count All Valid Pickup and Delivery Options](Problems/1359.cpp)                                   |
    873 |  1361  |   Medium   | [Validate Binary Tree Nodes](Problems/1361.cpp)                                                    |
    874 |  1362  |   Medium   | [Closest Divisors](Problems/1362.cpp)                                                              |
    875 |  1366  |   Medium   | [Rank Teams by Votes](Problems/1366.cpp)                                                           |
    876 |  1367  |   Medium   | [Linked List in Binary Tree ](Problems/1367.cpp)                                                   |
    877 |  1371  |   Medium   | [Find the Longest Substring Containing Vowels in Even Counts](Problems/1371.cpp)                   |
    878 |  1372  |   Medium   | [Longest ZigZag Path in a Binary Tree](Problems/1372.cpp)                                          |
    879 |  1373  |    Hard    | [Maximum Sum BST in Binary Tree](Problems/1373.cpp)                                                |
    880 |  1375  |   Medium   | [Number of Times Binary String Is Prefix-Aligned](Problems/1375.cpp)                               |
    881 |  1376  |   Medium   | [Time Needed to Inform All Employees](Problems/1376.cpp)                                           |
    882 |  1378  |    Easy    | [Replace Employee ID With The Unique Identifier](Problems/1378.cpp)                                |
    883 |  1379  |    Easy    | [Find a Corresponding Node of a Binary Tree in a Clone of That Tree](Problems/1379.cpp)            |
    884 |  1380  |    Easy    | [Lucky Numbers in a Matrix](Problems/1380.cpp)                                                     |
    885 |  1381  |   Medium   | [Design a Stack With Increment Operation](Problems/1381.cpp)                                       |
    886 |  1382  |   Medium   | [Balance a Binary Search Tree](Problems/1382.cpp)                                                  |
    887 |  1387  |   Medium   | [Sort Integers by The Power Value](Problems/1387.cpp)                                              |
    888 |  1393  |   Medium   | [Capital Gain/Loss](Problems/1393.cpp)                                                             |
    889 |  1395  |   Medium   | [Count Number of Teams](Problems/1395.cpp)                                                         |
    890 |  1396  |   Medium   | [Design Underground System](Problems/1396.cpp)                                                     |
    891 |  1400  |   Medium   | [Construct K Palindrome Strings](Problems/1400.cpp)                                                |
    892 |  1402  |    Hard    | [Reducing Dishes](Problems/1402.cpp)                                                               |
    893 |  1404  |   Medium   | [Number of Steps to Reduce a Number in Binary Representation to One](Problems/1404.cpp)            |
    894 |  1405  |   Medium   | [Longest Happy String](Problems/1405.cpp)                                                          |
    895 |  1406  |    Hard    | [Stone Game III](Problems/1406.cpp)                                                                |
    896 |  1407  |    Easy    | [Top Travellers](Problems/1407.cpp)                                                                |
    897 |  1409  |   Medium   | [Queries on a Permutation With Key](Problems/1409.cpp)                                             |
    898 |  1410  |   Medium   | [HTML Entity Parser](Problems/1410.cpp)                                                            |
    899 |  1414  |   Medium   | [Find the Minimum Number of Fibonacci Numbers Whose Sum Is K](Problems/1414.cpp)                   |
    900 |  1415  |   Medium   | [The k-th Lexicographical String of All Happy Strings of Length n](Problems/1415.cpp)              |
    901 |  1416  |    Hard    | [Restore The Array](Problems/1416.cpp)                                                             |
    902 |  1418  |   Medium   | [Display Table of Food Orders in a Restaurant](Problems/1418.cpp)                                  |
    903 |  1419  |   Medium   | [Minimum Number of Frogs Croaking](Problems/1419.cpp)                                              |
    904 |  1420  |    Hard    | [Build Array Where You Can Find The Maximum Exactly K Comparisons](Problems/1420.cpp)              |
    905 |  1422  |    Easy    | [Maximum Score After Splitting a String](Problems/1422.cpp)                                        |
    906 |  1423  |   Medium   | [Maximum Points You Can Obtain from Cards](Problems/1423.cpp)                                      |
    907 |  1424  |   Medium   | [Diagonal Traverse II](Problems/1424.cpp)                                                          |
    908 |  1425  |    Hard    | [Constrained Subsequence Sum](Problems/1425.cpp)                                                   |
    909 |  1431  |    Easy    | [Kids With the Greatest Number of Candies](Problems/1431.cpp)                                      |
    910 |  1433  |   Medium   | [Check If a String Can Break Another String](Problems/1433.cpp)                                    |
    911 |  1436  |    Easy    | [Destination City](Problems/1436.cpp)                                                              |
    912 |  1438  |   Medium   | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](Problems/1438.cpp)    |
    913 |  1441  |   Medium   | [Build an Array With Stack Operations](Problems/1441.cpp)                                          |
    914 |  1442  |   Medium   | [Count Triplets That Can Form Two Arrays of Equal XOR](Problems/1442.cpp)                          |
    915 |  1443  |   Medium   | [Minimum Time to Collect All Apples in a Tree](Problems/1443.cpp)                                  |
    916 |  1444  |    Hard    | [Number of Ways of Cutting a Pizza](Problems/1444.cpp)                                             |
    917 |  1447  |   Medium   | [Simplified Fractions](Problems/1447.cpp)                                                          |
    918 |  1448  |   Medium   | [Count Good Nodes in Binary Tree](Problems/1448.cpp)                                               |
    919 |  1451  |   Medium   | [Rearrange Words in a Sentence](Problems/1451.cpp)                                                 |
    920 |  1452  |   Medium   | [People Whose List of Favorite Companies Is Not a Subset of Another List](Problems/1452.cpp)       |
    921 |  1456  |   Medium   | [Maximum Number of Vowels in a Substring of Given Length](Problems/1456.cpp)                       |
    922 |  1457  |   Medium   | [Pseudo-Palindromic Paths in a Binary Tree](Problems/1457.cpp)                                     |
    923 |  1458  |    Hard    | [Max Dot Product of Two Subsequences](Problems/1458.cpp)                                           |
    924 |  1460  |    Easy    | [Make Two Arrays Equal by Reversing Subarrays](Problems/1460.cpp)                                  |
    925 |  1461  |   Medium   | [Check If a String Contains All Binary Codes of Size K](Problems/1461.cpp)                         |
    926 |  1462  |   Medium   | [Course Schedule IV](Problems/1462.cpp)                                                            |
    927 |  1463  |    Hard    | [Cherry Pickup II](Problems/1463.cpp)                                                              |
    928 |  1464  |    Easy    | [Maximum Product of Two Elements in an Array](Problems/1464.cpp)                                   |
    929 |  1466  |   Medium   | [Reorder Routes to Make All Paths Lead to the City Zero](Problems/1466.cpp)                        |
    930 |  1470  |    Easy    | [Shuffle the Array](Problems/1470.cpp)                                                             |
    931 |  1471  |   Medium   | [The k Strongest Values in an Array](Problems/1471.cpp)                                            |
    932 |  1472  |   Medium   | [Design Browser History ](Problems/1472.cpp)                                                       |
    933 |  1476  |   Medium   | [Subrectangle Queries](Problems/1476.cpp)                                                          |
    934 |  1480  |    Easy    | [Running Sum of 1d Array](Problems/1480.cpp)                                                       |
    935 |  1481  |   Medium   | [Least Number of Unique Integers after K Removals](Problems/1481.cpp)                              |
    936 |  1482  |   Medium   | [Minimum Number of Days to Make m Bouquets](Problems/1482.cpp)                                     |
    937 |  1484  |    Easy    | [Group Sold Products By The Date](Problems/1484.cpp)                                               |
    938 |  1489  |    Hard    | [Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](Problems/1489.cpp)              |
    939 |  1491  |    Easy    | [Average Salary Excluding the Minimum and Maximum Salary](Problems/1491.cpp)                       |
    940 |  1492  |   Medium   | [The kth Factor of n](Problems/1492.cpp)                                                           |
    941 |  1493  |   Medium   | [Longest Subarray of 1's After Deleting One Element](Problems/1493.cpp)                            |
    942 |  1496  |    Easy    | [Path Crossing](Problems/1496.cpp)                                                                 |
    943 |  1497  |   Medium   | [Check If Array Pairs Are Divisible by k](Problems/1497.cpp)                                       |
    944 |  1498  |   Medium   | [Number of Subsequences That Satisfy the Given Sum Condition](Problems/1498.cpp)                   |
    945 |  1502  |    Easy    | [Can Make Arithmetic Progression From Sequence](Problems/1502.cpp)                                 |
    946 |  1503  |   Medium   | [Last Moment Before All Ants Fall Out of a Plank](Problems/1503.cpp)                               |
    947 |  1504  |   Medium   | [Count Submatrices With All Ones](Problems/1504.cpp)                                               |
    948 |  1508  |   Medium   | [Range Sum of Sorted Subarray Sums](Problems/1508.cpp)                                             |
    949 |  1509  |   Medium   | [Minimum Difference Between Largest and Smallest Value in Three Moves](Problems/1509.cpp)          |
    950 |  1512  |    Easy    | [Number of Good Pairs](Problems/1512.cpp)                                                          |
    951 |  1514  |   Medium   | [Path with Maximum Probability](Problems/1514.cpp)                                                 |
    952 |  1517  |    Easy    | [Find Users With Valid E-Mails](Problems/1517.cpp)                                                 |
    953 |  1518  |    Easy    | [Water Bottles](Problems/1518.cpp)                                                                 |
    954 |  1519  |   Medium   | [Number of Nodes in the Sub-Tree With the Same Label](Problems/1519.cpp)                           |
    955 |  1523  |    Easy    | [Count Odd Numbers in an Interval Range](Problems/1523.cpp)                                        |
    956 |  1525  |   Medium   | [Number of Good Ways to Split a String](Problems/1525.cpp)                                         |
    957 |  1527  |    Easy    | [Patients With a Condition](Problems/1527.cpp)                                                     |
    958 |  1529  |   Medium   | [Minimum Suffix Flips](Problems/1529.cpp)                                                          |
    959 |  1530  |   Medium   | [Number of Good Leaf Nodes Pairs](Problems/1530.cpp)                                               |
    960 |  1531  |    Hard    | [String Compression II](Problems/1531.cpp)                                                         |
    961 |  1535  |   Medium   | [Find the Winner of an Array Game](Problems/1535.cpp)                                              |
    962 |  1539  |    Easy    | [Kth Missing Positive Number](Problems/1539.cpp)                                                   |
    963 |  1541  |   Medium   | [Minimum Insertions to Balance a Parentheses String](Problems/1541.cpp)                            |
    964 |  1544  |    Easy    | [Make The String Great](Problems/1544.cpp)                                                         |
    965 |  1545  |   Medium   | [Find Kth Bit in Nth Binary String](Problems/1545.cpp)                                             |
    966 |  1547  |    Hard    | [Minimum Cost to Cut a Stick](Problems/1547.cpp)                                                   |
    967 |  1550  |    Easy    | [Three Consecutive Odds](Problems/1550.cpp)                                                        |
    968 |  1551  |   Medium   | [Minimum Operations to Make Array Equal](Problems/1551.cpp)                                        |
    969 |  1552  |   Medium   | [Magnetic Force Between Two Balls](Problems/1552.cpp)                                              |
    970 |  1557  |   Medium   | [Minimum Number of Vertices to Reach All Nodes](Problems/1557.cpp)                                 |
    971 |  1558  |   Medium   | [Minimum Numbers of Function Calls to Make Target Array](Problems/1558.cpp)                        |
    972 |  1561  |   Medium   | [Maximum Number of Coins You Can Get](Problems/1561.cpp)                                           |
    973 |  1567  |   Medium   | [Maximum Length of Subarray With Positive Product](Problems/1567.cpp)                              |
    974 |  1568  |    Hard    | [Minimum Number of Days to Disconnect Island](Problems/1568.cpp)                                   |
    975 |  1569  |    Hard    | [Number of Ways to Reorder Array to Get Same BST](Problems/1569.cpp)                               |
    976 |  1572  |    Easy    | [Matrix Diagonal Sum](Problems/1572.cpp)                                                           |
    977 |  1574  |   Medium   | [Shortest Subarray to be Removed to Make Array Sorted](Problems/1574.cpp)                          |
    978 |  1575  |   Medium   | [Count All Possible Routes](Problems/1575.cpp)                                                     |
    979 |  1578  |   Medium   | [Minimum Time to Make Rope Colorful](Problems/1578.cpp)                                            |
    980 |  1579  |    Hard    | [Remove Max Number of Edges to Keep Graph Fully Traversable](Problems/1579.cpp)                    |
    981 |  1581  |    Easy    | [Customer Who Visited but Did Not Make Any Transactions](Problems/1581.cpp)                        |
    982 |  1582  |    Easy    | [Special Positions in a Binary Matrix](Problems/1582.cpp)                                          |
    983 |  1583  |   Medium   | [Count Unhappy Friends](Problems/1583.cpp)                                                         |
    984 |  1584  |   Medium   | [Min Cost to Connect All Points](Problems/1584.cpp)                                                |
    985 |  1587  |    Easy    | [Bank Account Summary II](Problems/1587.cpp)                                                       |
    986 |  1590  |   Medium   | [Make Sum Divisible by P](Problems/1590.cpp)                                                       |
    987 |  1593  |   Medium   | [Split a String Into the Max Number of Unique Substrings](Problems/1593.cpp)                       |
    988 |  1598  |    Easy    | [Crawler Log Folder](Problems/1598.cpp)                                                            |
    989 |  1600  |   Medium   | [Throne Inheritance](Problems/1600.cpp)                                                            |
    990 |  1601  |    Hard    | [Maximum Number of Achievable Transfer Requests](Problems/1601.cpp)                                |
    991 |  1603  |    Easy    | [Design Parking System](Problems/1603.cpp)                                                         |
    992 |  1605  |   Medium   | [Find Valid Matrix Given Row and Column Sums](Problems/1605.cpp)                                   |
    993 |  1608  |    Easy    | [Special Array With X Elements Greater Than or Equal X](Problems/1608.cpp)                         |
    994 |  1609  |   Medium   | [Even Odd Tree](Problems/1609.cpp)                                                                 |
    995 |  1611  |    Hard    | [Minimum One Bit Operations to Make Integers Zero](Problems/1611.cpp)                              |
    996 |  1614  |    Easy    | [Maximum Nesting Depth of the Parentheses](Problems/1614.cpp)                                      |
    997 |  1615  |   Medium   | [Maximal Network Rank](Problems/1615.cpp)                                                          |
    998 |  1624  |    Easy    | [Largest Substring Between Two Equal Characters](Problems/1624.cpp)                                |
    999 |  1625  |   Medium   | [Lexicographically Smallest String After Applying Operations](Problems/1625.cpp)                   |
   1000 |  1626  |   Medium   | [Best Team With No Conflicts](Problems/1626.cpp)                                                   |
   1001 |  1630  |   Medium   | [Arithmetic Subarrays](Problems/1630.cpp)                                                          |
   1002 |  1631  |   Medium   | [Path With Minimum Effort](Problems/1631.cpp)                                                      |
   1003 |  1633  |    Easy    | [Percentage of Users Attended a Contest](Problems/1633.cpp)                                        |
   1004 |  1636  |    Easy    | [Sort Array by Increasing Frequency](Problems/1636.cpp)                                            |
   1005 |  1637  |   Medium   | [Widest Vertical Area Between Two Points Containing No Points](Problems/1637.cpp)                  |
   1006 |  1638  |   Medium   | [Count Substrings That Differ by One Character](Problems/1638.cpp)                                 |
   1007 |  1639  |    Hard    | [Number of Ways to Form a Target String Given a Dictionary](Problems/1639.cpp)                     |
   1008 |  1641  |   Medium   | [Count Sorted Vowel Strings](Problems/1641.cpp)                                                    |
   1009 |  1642  |   Medium   | [Furthest Building You Can Reach](Problems/1642.cpp)                                               |
   1010 |  1646  |    Easy    | [Get Maximum in Generated Array](Problems/1646.cpp)                                                |
   1011 |  1647  |   Medium   | [Minimum Deletions to Make Character Frequencies Unique](Problems/1647.cpp)                        |
   1012 |  1652  |    Easy    | [Defuse the Bomb](Problems/1652.cpp)                                                               |
   1013 |  1653  |   Medium   | [Minimum Deletions to Make String Balanced](Problems/1653.cpp)                                     |
   1014 |  1657  |   Medium   | [Determine if Two Strings Are Close](Problems/1657.cpp)                                            |
   1015 |  1658  |   Medium   | [Minimum Operations to Reduce X to Zero](Problems/1658.cpp)                                        |
   1016 |  1661  |    Easy    | [Average Time of Process per Machine](Problems/1661.cpp)                                           |
   1017 |  1662  |    Easy    | [Check If Two String Arrays are Equivalent](Problems/1662.cpp)                                     |
   1018 |  1663  |   Medium   | [Smallest String With A Given Numeric Value](Problems/1663.cpp)                                    |
   1019 |  1664  |   Medium   | [Ways to Make a Fair Array](Problems/1664.cpp)                                                     |
   1020 |  1667  |    Easy    | [Fix Names in a Table](Problems/1667.cpp)                                                          |
   1021 |  1669  |   Medium   | [Merge In Between Linked Lists](Problems/1669.cpp)                                                 |
   1022 |  1670  |   Medium   | [Design Front Middle Back Queue](Problems/1670.cpp)                                                |
   1023 |  1671  |    Hard    | [Minimum Number of Removals to Make Mountain Array](Problems/1671.cpp)                             |
   1024 |  1672  |    Easy    | [Richest Customer Wealth](Problems/1672.cpp)                                                       |
   1025 |  1673  |   Medium   | [Find the Most Competitive Subsequence](Problems/1673.cpp)                                         |
   1026 |  1675  |    Hard    | [Minimize Deviation in Array](Problems/1675.cpp)                                                   |
   1027 |  1679  |   Medium   | [Max Number of K-Sum Pairs](Problems/1679.cpp)                                                     |
   1028 |  1680  |   Medium   | [Concatenation of Consecutive Binary Numbers](Problems/1680.cpp)                                   |
   1029 |  1683  |    Easy    | [Invalid Tweets](Problems/1683.cpp)                                                                |
   1030 |  1684  |    Easy    | [Count the Number of Consistent Strings](Problems/1684.cpp)                                        |
   1031 |  1685  |   Medium   | [Sum of Absolute Differences in a Sorted Array](Problems/1685.cpp)                                 |
   1032 |  1686  |   Medium   | [Stone Game VI](Problems/1686.cpp)                                                                 |
   1033 |  1688  |    Easy    | [Count of Matches in Tournament](Problems/1688.cpp)                                                |
   1034 |  1689  |   Medium   | [Partitioning Into Minimum Number Of Deci-Binary Numbers](Problems/1689.cpp)                       |
   1035 |  1690  |   Medium   | [Stone Game VII](Problems/1690.cpp)                                                                |
   1036 |  1693  |    Easy    | [Daily Leads and Partners](Problems/1693.cpp)                                                      |
   1037 |  1695  |   Medium   | [Maximum Erasure Value](Problems/1695.cpp)                                                         |
   1038 |  1696  |   Medium   | [Jump Game VI](Problems/1696.cpp)                                                                  |
   1039 |  1697  |    Hard    | [Checking Existence of Edge Length Limited Paths](Problems/1697.cpp)                               |
   1040 |  1700  |    Easy    | [Number of Students Unable to Eat Lunch](Problems/1700.cpp)                                        |
   1041 |  1701  |   Medium   | [Average Waiting Time](Problems/1701.cpp)                                                          |
   1042 |  1704  |    Easy    | [Determine if String Halves Are Alike](Problems/1704.cpp)                                          |
   1043 |  1706  |   Medium   | [Where Will the Ball Fall](Problems/1706.cpp)                                                      |
   1044 |  1716  |    Easy    | [Calculate Money in Leetcode Bank](Problems/1716.cpp)                                              |
   1045 |  1717  |   Medium   | [Maximum Score From Removing Substrings](Problems/1717.cpp)                                        |
   1046 |  1718  |   Medium   | [Construct the Lexicographically Largest Valid Sequence](Problems/1718.cpp)                        |
   1047 |  1721  |   Medium   | [Swapping Nodes in a Linked List](Problems/1721.cpp)                                               |
   1048 |  1722  |   Medium   | [Minimize Hamming Distance After Swap Operations](Problems/1722.cpp)                               |
   1049 |  1726  |   Medium   | [Tuple with Same Product](Problems/1726.cpp)                                                       |
   1050 |  1727  |   Medium   | [Largest Submatrix With Rearrangements](Problems/1727.cpp)                                         |
   1051 |  1729  |    Easy    | [Find Followers Count](Problems/1729.cpp)                                                          |
   1052 |  1731  |    Easy    | [The Number of Employees Which Report to Each Employee](Problems/1731.cpp)                         |
   1053 |  1732  |    Easy    | [Find the Highest Altitude](Problems/1732.cpp)                                                     |
   1054 |  1734  |   Medium   | [Decode XORed Permutation](Problems/1734.cpp)                                                      |
   1055 |  1738  |   Medium   | [Find Kth Largest XOR Coordinate Value](Problems/1738.cpp)                                         |
   1056 |  1741  |    Easy    | [Find Total Time Spent by Each Employee](Problems/1741.cpp)                                        |
   1057 |  1743  |   Medium   | [Restore the Array From Adjacent Pairs](Problems/1743.cpp)                                         |
   1058 |  1749  |   Medium   | [Maximum Absolute Sum of Any Subarray](Problems/1749.cpp)                                          |
   1059 |  1750  |   Medium   | [Minimum Length of String After Deleting Similar Ends](Problems/1750.cpp)                          |
   1060 |  1751  |    Hard    | [Maximum Number of Events That Can Be Attended II](Problems/1751.cpp)                              |
   1061 |  1753  |   Medium   | [Maximum Score From Removing Stones](Problems/1753.cpp)                                            |
   1062 |  1754  |   Medium   | [Largest Merge Of Two Strings](Problems/1754.cpp)                                                  |
   1063 |  1757  |    Easy    | [Recyclable and Low Fat Products](Problems/1757.cpp)                                               |
   1064 |  1758  |    Easy    | [Minimum Changes To Make Alternating Binary String](Problems/1758.cpp)                             |
   1065 |  1759  |   Medium   | [Count Number of Homogenous Substrings](Problems/1759.cpp)                                         |
   1066 |  1760  |   Medium   | [Minimum Limit of Balls in a Bag](Problems/1760.cpp)                                               |
   1067 |  1764  |   Medium   | [Form Array by Concatenating Subarrays of Another Array](Problems/1764.cpp)                        |
   1068 |  1765  |   Medium   | [Map of Highest Peak](Problems/1765.cpp)                                                           |
   1069 |  1768  |    Easy    | [Merge Strings Alternately](Problems/1768.cpp)                                                     |
   1070 |  1769  |   Medium   | [Minimum Number of Operations to Move All Balls to Each Box](Problems/1769.cpp)                    |
   1071 |  1775  |   Medium   | [Equal Sum Arrays With Minimum Number of Operations](Problems/1775.cpp)                            |
   1072 |  1780  |   Medium   | [Check if Number is a Sum of Powers of Three](Problems/1780.cpp)                                   |
   1073 |  1781  |   Medium   | [Sum of Beauty of All Substrings](Problems/1781.cpp)                                               |
   1074 |  1786  |   Medium   | [Number of Restricted Paths From First to Last Node](Problems/1786.cpp)                            |
   1075 |  1789  |    Easy    | [Primary Department for Each Employee](Problems/1789.cpp)                                          |
   1076 |  1791  |    Easy    | [Find Center of Star Graph](Problems/1791.cpp)                                                     |
   1077 |  1792  |   Medium   | [Maximum Average Pass Ratio](Problems/1792.cpp)                                                    |
   1078 |  1793  |    Hard    | [Maximum Score of a Good Subarray](Problems/1793.cpp)                                              |
   1079 |  1795  |    Easy    | [Rearrange Products Table](Problems/1795.cpp)                                                      |
   1080 |  1797  |   Medium   | [Design Authentication Manager](Problems/1797.cpp)                                                 |
   1081 |  1798  |   Medium   | [Maximum Number of Consecutive Values You Can Make](Problems/1798.cpp)                             |
   1082 |  1799  |   Medium   | [Maximize Score After N Operations](Problems/1799.cpp)                                             |
   1083 |  1801  |   Medium   | [Number of Orders in the Backlog](Problems/1801.cpp)                                               |
   1084 |  1802  |   Medium   | [Maximum Value at a Given Index in a Bounded Array](Problems/1802.cpp)                             |
   1085 |  1806  |   Medium   | [Minimum Number of Operations to Reinitialize a Permutation](Problems/1806.cpp)                    |
   1086 |  1807  |   Medium   | [Evaluate the Bracket Pairs of a String](Problems/1807.cpp)                                        |
   1087 |  1813  |   Medium   | [Sentence Similarity III](Problems/1813.cpp)                                                       |
   1088 |  1814  |   Medium   | [Count Nice Pairs in an Array](Problems/1814.cpp)                                                  |
   1089 |  1817  |   Medium   | [Finding the Users Active Minutes](Problems/1817.cpp)                                              |
   1090 |  1822  |    Easy    | [Sign of the Product of an Array](Problems/1822.cpp)                                               |
   1091 |  1823  |   Medium   | [Find the Winner of the Circular Game](Problems/1823.cpp)                                          |
   1092 |  1824  |   Medium   | [Minimum Sideway Jumps](Problems/1824.cpp)                                                         |
   1093 |  1828  |   Medium   | [Queries on Number of Points Inside a Circle](Problems/1828.cpp)                                   |
   1094 |  1829  |   Medium   | [Maximum XOR for Each Query](Problems/1829.cpp)                                                    |
   1095 |  1833  |   Medium   | [Maximum Ice Cream Bars](Problems/1833.cpp)                                                        |
   1096 |  1834  |   Medium   | [Single-Threaded CPU](Problems/1834.cpp)                                                           |
   1097 |  1838  |   Medium   | [Frequency of the Most Frequent Element](Problems/1838.cpp)                                        |
   1098 |  1839  |   Medium   | [Longest Substring Of All Vowels in Order](Problems/1839.cpp)                                      |
   1099 |  1845  |   Medium   | [Seat Reservation Manager](Problems/1845.cpp)                                                      |
   1100 |  1846  |   Medium   | [Maximum Element After Decreasing and Rearranging](Problems/1846.cpp)                              |
   1101 |  1850  |   Medium   | [Minimum Adjacent Swaps to Reach the Kth Smallest Number](Problems/1850.cpp)                       |
   1102 |  1855  |   Medium   | [Maximum Distance Between a Pair of Values](Problems/1855.cpp)                                     |
   1103 |  1857  |    Hard    | [Largest Color Value in a Directed Graph](Problems/1857.cpp)                                       |
   1104 |  1860  |   Medium   | [Incremental Memory Leak](Problems/1860.cpp)                                                       |
   1105 |  1861  |   Medium   | [Rotating the Box](Problems/1861.cpp)                                                              |
   1106 |  1863  |    Easy    | [Sum of All Subset XOR Totals](Problems/1863.cpp)                                                  |
   1107 |  1865  |   Medium   | [Finding Pairs With a Certain Sum](Problems/1865.cpp)                                              |
   1108 |  1870  |   Medium   | [Minimum Speed to Arrive on Time](Problems/1870.cpp)                                               |
   1109 |  1873  |    Easy    | [Calculate Special Bonus](Problems/1873.cpp)                                                       |
   1110 |  1877  |   Medium   | [Minimize Maximum Pair Sum in Array](Problems/1877.cpp)                                            |
   1111 |  1884  |   Medium   | [Egg Drop With 2 Eggs and N Floors](Problems/1884.cpp)                                             |
   1112 |  1887  |   Medium   | [Reduction Operations to Make the Array Elements Equal](Problems/1887.cpp)                         |
   1113 |  1890  |    Easy    | [The Latest Login in 2020](Problems/1890.cpp)                                                      |
   1114 |  1894  |   Medium   | [Find the Student that Will Replace the Chalk](Problems/1894.cpp)                                  |
   1115 |  1895  |   Medium   | [Largest Magic Square](Problems/1895.cpp)                                                          |
   1116 |  1897  |    Easy    | [Redistribute Characters to Make All Strings Equal](Problems/1897.cpp)                             |
   1117 |  1899  |   Medium   | [Merge Triplets to Form Target Triplet](Problems/1899.cpp)                                         |
   1118 |  1901  |   Medium   | [Find a Peak Element II](Problems/1901.cpp)                                                        |
   1119 |  1903  |    Easy    | [Largest Odd Number in String](Problems/1903.cpp)                                                  |
   1120 |  1905  |   Medium   | [Count Sub Islands](Problems/1905.cpp)                                                             |
   1121 |  1907  |   Medium   | [Count Salary Categories](Problems/1907.cpp)                                                       |
   1122 |  1910  |   Medium   | [Remove All Occurrences of a Substring](Problems/1910.cpp)                                         |
   1123 |  1911  |   Medium   | [Maximum Alternating Subsequence Sum](Problems/1911.cpp)                                           |
   1124 |  1913  |    Easy    | [Maximum Product Difference Between Two Pairs](Problems/1913.cpp)                                  |
   1125 |  1914  |   Medium   | [Cyclically Rotating a Grid](Problems/1914.cpp)                                                    |
   1126 |  1915  |   Medium   | [Number of Wonderful Substrings](Problems/1915.cpp)                                                |
   1127 |  1920  |    Easy    | [Build Array from Permutation](Problems/1920.cpp)                                                  |
   1128 |  1921  |   Medium   | [Eliminate Maximum Number of Monsters](Problems/1921.cpp)                                          |
   1129 |  1926  |   Medium   | [Nearest Exit from Entrance in Maze](Problems/1926.cpp)                                            |
   1130 |  1929  |    Easy    | [Concatenation of Array](Problems/1929.cpp)                                                        |
   1131 |  1930  |   Medium   | [Unique Length-3 Palindromic Subsequences](Problems/1930.cpp)                                      |
   1132 |  1934  |   Medium   | [Confirmation Rate](Problems/1934.cpp)                                                             |
   1133 |  1937  |   Medium   | [Maximum Number of Points with Cost](Problems/1937.cpp)                                            |
   1134 |  1942  |   Medium   | [The Number of the Smallest Unoccupied Chair](Problems/1942.cpp)                                   |
   1135 |  1943  |   Medium   | [Describe the Painting](Problems/1943.cpp)                                                         |
   1136 |  1945  |    Easy    | [Sum of Digits of String After Convert](Problems/1945.cpp)                                         |
   1137 |  1947  |   Medium   | [Maximum Compatibility Score Sum](Problems/1947.cpp)                                               |
   1138 |  1954  |   Medium   | [Minimum Garden Perimeter to Collect Enough Apples](Problems/1954.cpp)                             |
   1139 |  1957  |    Easy    | [Delete Characters to Make Fancy String](Problems/1957.cpp)                                        |
   1140 |  1962  |   Medium   | [Remove Stones to Minimize the Total](Problems/1962.cpp)                                           |
   1141 |  1963  |   Medium   | [Minimum Number of Swaps to Make the String Balanced](Problems/1963.cpp)                           |
   1142 |  1964  |    Hard    | [Find the Longest Valid Obstacle Course at Each Position](Problems/1964.cpp)                       |
   1143 |  1965  |    Easy    | [Employees With Missing Information](Problems/1965.cpp)                                            |
   1144 |  1970  |    Hard    | [Last Day Where You Can Still Cross](Problems/1970.cpp)                                            |
   1145 |  1971  |    Easy    | [Find if Path Exists in Graph](Problems/1971.cpp)                                                  |
   1146 |  1975  |   Medium   | [Maximum Matrix Sum](Problems/1975.cpp)                                                            |
   1147 |  1976  |   Medium   | [Number of Ways to Arrive at Destination](Problems/1976.cpp)                                       |
   1148 |  1978  |    Easy    | [Employees Whose Manager Left the Company](Problems/1978.cpp)                                      |
   1149 |  1980  |   Medium   | [Find Unique Binary String](Problems/1980.cpp)                                                     |
   1150 |  1991  |    Easy    | [Find the Middle Index in Array](Problems/1991.cpp)                                                |
   1151 |  1992  |   Medium   | [Find All Groups of Farmland](Problems/1992.cpp)                                                   |
   1152 |  2000  |    Easy    | [Reverse Prefix of Word](Problems/2000.cpp)                                                        |
   1153 |  2001  |   Medium   | [Number of Pairs of Interchangeable Rectangles](Problems/2001.cpp)                                 |
   1154 |  2002  |   Medium   | [Maximum Product of the Length of Two Palindromic Subsequences](Problems/2002.cpp)                 |
   1155 |  2009  |    Hard    | [Minimum Number of Operations to Make Array Continuous](Problems/2009.cpp)                         |
   1156 |  2011  |    Easy    | [Final Value of Variable After Performing Operations](Problems/2011.cpp)                           |
   1157 |  2013  |   Medium   | [Detect Squares](Problems/2013.cpp)                                                                |
   1158 |  2022  |    Easy    | [Convert 1D Array Into 2D Array](Problems/2022.cpp)                                                |
   1159 |  2023  |   Medium   | [Number of Pairs of Strings With Concatenation Equal to Target](Problems/2023.cpp)                 |
   1160 |  2024  |   Medium   | [Maximize the Confusion of an Exam](Problems/2024.cpp)                                             |
   1161 |  2028  |   Medium   | [Find Missing Observations](Problems/2028.cpp)                                                     |
   1162 |  2033  |   Medium   | [Minimum Operations to Make a Uni-Value Grid](Problems/2033.cpp)                                   |
   1163 |  2037  |    Easy    | [Minimum Number of Moves to Seat Everyone](Problems/2037.cpp)                                      |
   1164 |  2038  |   Medium   | [Remove Colored Pieces if Both Neighbors are the Same Color](Problems/2038.cpp)                    |
   1165 |  2039  |   Medium   | [The Time When the Network Becomes Idle](Problems/2039.cpp)                                        |
   1166 |  2043  |   Medium   | [Simple Bank System](Problems/2043.cpp)                                                            |
   1167 |  2044  |   Medium   | [Count Number of Maximum Bitwise-OR Subsets](Problems/2044.cpp)                                    |
   1168 |  2045  |    Hard    | [Second Minimum Time to Reach Destination](Problems/2045.cpp)                                      |
   1169 |  2049  |   Medium   | [Count Nodes With the Highest Score](Problems/2049.cpp)                                            |
   1170 |  2050  |    Hard    | [Parallel Courses III](Problems/2050.cpp)                                                          |
   1171 |  2053  |    Easy    | [Kth Distinct String in an Array](Problems/2053.cpp)                                               |
   1172 |  2058  |   Medium   | [Find the Minimum and Maximum Number of Nodes Between Critical Points](Problems/2058.cpp)          |
   1173 |  2059  |   Medium   | [Minimum Operations to Convert Number](Problems/2059.cpp)                                          |
   1174 |  2063  |   Medium   | [Vowels of All Substrings](Problems/2063.cpp)                                                      |
   1175 |  2064  |   Medium   | [Minimized Maximum of Products Distributed to Any Store](Problems/2064.cpp)                        |
   1176 |  2070  |   Medium   | [Most Beautiful Item for Each Query](Problems/2070.cpp)                                            |
   1177 |  2073  |    Easy    | [Time Needed to Buy Tickets](Problems/2073.cpp)                                                    |
   1178 |  2074  |   Medium   | [Reverse Nodes in Even Length Groups](Problems/2074.cpp)                                           |
   1179 |  2075  |   Medium   | [Decode the Slanted Ciphertext](Problems/2075.cpp)                                                 |
   1180 |  2079  |   Medium   | [Watering Plants](Problems/2079.cpp)                                                               |
   1181 |  2080  |   Medium   | [Range Frequency Queries](Problems/2080.cpp)                                                       |
   1182 |  2085  |    Easy    | [Count Common Words With One Occurrence](Problems/2085.cpp)                                        |
   1183 |  2087  |   Medium   | [Minimum Cost Homecoming of a Robot in a Grid](Problems/2087.cpp)                                  |
   1184 |  2090  |   Medium   | [K Radius Subarray Averages](Problems/2090.cpp)                                                    |
   1185 |  2091  |   Medium   | [Removing Minimum and Maximum From Array](Problems/2091.cpp)                                       |
   1186 |  2092  |    Hard    | [Find All People With Secret](Problems/2092.cpp)                                                   |
   1187 |  2095  |   Medium   | [Delete the Middle Node of a Linked List](Problems/2095.cpp)                                       |
   1188 |  2096  |   Medium   | [Step-By-Step Directions From a Binary Tree Node to Another](Problems/2096.cpp)                    |
   1189 |  2100  |   Medium   | [Find Good Days to Rob the Bank](Problems/2100.cpp)                                                |
   1190 |  2101  |   Medium   | [Detonate the Maximum Bombs](Problems/2101.cpp)                                                    |
   1191 |  2104  |   Medium   | [Sum of Subarray Ranges](Problems/2104.cpp)                                                        |
   1192 |  2108  |    Easy    | [Find First Palindromic String in the Array](Problems/2108.cpp)                                    |
   1193 |  2109  |   Medium   | [Adding Spaces to a String](Problems/2109.cpp)                                                     |
   1194 |  2110  |   Medium   | [Number of Smooth Descent Periods of a Stock](Problems/2110.cpp)                                   |
   1195 |  2115  |   Medium   | [Find All Possible Recipes from Given Supplies](Problems/2115.cpp)                                 |
   1196 |  2120  |   Medium   | [Execution of All Suffix Instructions Staying in a Grid](Problems/2120.cpp)                        |
   1197 |  2125  |   Medium   | [Number of Laser Beams in a Bank](Problems/2125.cpp)                                               |
   1198 |  2126  |   Medium   | [Destroying Asteroids](Problems/2126.cpp)                                                          |
   1199 |  2130  |   Medium   | [Maximum Twin Sum of a Linked List](Problems/2130.cpp)                                             |
   1200 |  2131  |   Medium   | [Longest Palindrome by Concatenating Two Letter Words](Problems/2131.cpp)                          |
   1201 |  2134  |   Medium   | [Minimum Swaps to Group All 1's Together II](Problems/2134.cpp)                                    |
   1202 |  2139  |   Medium   | [Minimum Moves to Reach Target Score](Problems/2139.cpp)                                           |
   1203 |  2140  |   Medium   | [Solving Questions With Brainpower](Problems/2140.cpp)                                             |
   1204 |  2141  |    Hard    | [Maximum Running Time of N Computers](Problems/2141.cpp)                                           |
   1205 |  2147  |    Hard    | [Number of Ways to Divide a Long Corridor](Problems/2147.cpp)                                      |
   1206 |  2149  |   Medium   | [Rearrange Array Elements by Sign](Problems/2149.cpp)                                              |
   1207 |  2150  |   Medium   | [Find All Lonely Numbers in the Array](Problems/2150.cpp)                                          |
   1208 |  2155  |   Medium   | [All Divisions With the Highest Score of a Binary Array](Problems/2155.cpp)                        |
   1209 |  2161  |   Medium   | [Partition Array According to Given Pivot](Problems/2161.cpp)                                      |
   1210 |  2165  |   Medium   | [Smallest Value of the Rearranged Number](Problems/2165.cpp)                                       |
   1211 |  2177  |   Medium   | [Find Three Consecutive Integers That Sum to a Given Number](Problems/2177.cpp)                    |
   1212 |  2178  |   Medium   | [Maximum Split of Positive Even Integers](Problems/2178.cpp)                                       |
   1213 |  2181  |   Medium   | [Merge Nodes in Between Zeros](Problems/2181.cpp)                                                  |
   1214 |  2182  |   Medium   | [Construct String With Repeat Limit](Problems/2182.cpp)                                            |
   1215 |  2186  |   Medium   | [Minimum Number of Steps to Make Two Strings Anagram II](Problems/2186.cpp)                        |
   1216 |  2187  |   Medium   | [Minimum Time to Complete Trips](Problems/2187.cpp)                                                |
   1217 |  2191  |   Medium   | [Sort the Jumbled Numbers](Problems/2191.cpp)                                                      |
   1218 |  2192  |   Medium   | [All Ancestors of a Node in a Directed Acyclic Graph](Problems/2192.cpp)                           |
   1219 |  2196  |   Medium   | [Create Binary Tree From Descriptions](Problems/2196.cpp)                                          |
   1220 |  2201  |   Medium   | [Count Artifacts That Can Be Extracted](Problems/2201.cpp)                                         |
   1221 |  2212  |   Medium   | [Maximum Points in an Archery Competition](Problems/2212.cpp)                                      |
   1222 |  2215  |    Easy    | [Find the Difference of Two Arrays](Problems/2215.cpp)                                             |
   1223 |  2218  |    Hard    | [Maximum Value of K Coins From Piles](Problems/2218.cpp)                                           |
   1224 |  2220  |    Easy    | [Minimum Bit Flips to Convert Number](Problems/2220.cpp)                                           |
   1225 |  2221  |   Medium   | [Find Triangular Sum of an Array](Problems/2221.cpp)                                               |
   1226 |  2222  |   Medium   | [Number of Ways to Select Buildings](Problems/2222.cpp)                                            |
   1227 |  2225  |   Medium   | [Find Players With Zero or One Losses](Problems/2225.cpp)                                          |
   1228 |  2232  |   Medium   | [Minimize Result by Adding Parentheses to Expression](Problems/2232.cpp)                           |
   1229 |  2235  |    Easy    | [Add Two Integers](Problems/2235.cpp)                                                              |
   1230 |  2236  |    Easy    | [Root Equals Sum of Children](Problems/2236.cpp)                                                   |
   1231 |  2240  |   Medium   | [Number of Ways to Buy Pens and Pencils](Problems/2240.cpp)                                        |
   1232 |  2243  |    Easy    | [Calculate Digit Sum of a String](Problems/2243.cpp)                                               |
   1233 |  2244  |   Medium   | [Minimum Rounds to Complete All Tasks](Problems/2244.cpp)                                          |
   1234 |  2246  |    Hard    | [Longest Path With Different Adjacent Characters](Problems/2246.cpp)                               |
   1235 |  2249  |   Medium   | [Count Lattice Points Inside a Circle](Problems/2249.cpp)                                          |
   1236 |  2251  |    Hard    | [Number of Flowers in Full Bloom](Problems/2251.cpp)                                               |
   1237 |  2257  |   Medium   | [Count Unguarded Cells in the Grid](Problems/2257.cpp)                                             |
   1238 |  2260  |   Medium   | [Minimum Consecutive Cards to Pick Up](Problems/2260.cpp)                                          |
   1239 |  2264  |    Easy    | [Largest 3-Same-Digit Number in String](Problems/2264.cpp)                                         |
   1240 |  2265  |   Medium   | [Count Nodes Equal to Average of Subtree](Problems/2265.cpp)                                       |
   1241 |  2265  |   Medium   | [Count Nodes Equal to Average of Subtree](Problems/2265.cpp)                                       |
   1242 |  2272  |    Hard    | [Substring With Largest Variance](Problems/2272.cpp)                                               |
   1243 |  2274  |   Medium   | [Maximum Consecutive Floors Without Special Floors](Problems/2274.cpp)                             |
   1244 |  2275  |   Medium   | [Largest Combination With Bitwise AND Greater Than Zero](Problems/2275.cpp)                        |
   1245 |  2279  |   Medium   | [Maximum Bags With Full Capacity of Rocks](Problems/2279.cpp)                                      |
   1246 |  2284  |   Medium   | [Sender With Largest Word Count](Problems/2284.cpp)                                                |
   1247 |  2285  |   Medium   | [Maximum Total Importance of Roads](Problems/2285.cpp)                                             |
   1248 |  2294  |   Medium   | [Partition Array Such That Maximum Difference Is K](Problems/2294.cpp)                             |
   1249 |  2295  |   Medium   | [Replace Elements in an Array](Problems/2295.cpp)                                                  |
   1250 |  2300  |   Medium   | [Successful Pairs of Spells and Potions](Problems/2300.cpp)                                        |
   1251 |  2304  |   Medium   | [Minimum Path Cost in a Grid](Problems/2304.cpp)                                                   |
   1252 |  2305  |   Medium   | [Fair Distribution of Cookies](Problems/2305.cpp)                                                  |
   1253 |  2306  |    Hard    | [Naming a Company](Problems/2306.cpp)                                                              |
   1254 |  2316  |   Medium   | [Count Unreachable Pairs of Nodes in an Undirected Graph](Problems/2316.cpp)                       |
   1255 |  2317  |   Medium   | [Maximum XOR After Operations](Problems/2317.cpp)                                                  |
   1256 |  2326  |   Medium   | [Spiral Matrix IV](Problems/2326.cpp)                                                              |
   1257 |  2328  |    Hard    | [Number of Increasing Paths in a Grid](Problems/2328.cpp)                                          |
   1258 |  2331  |    Easy    | [Evaluate Boolean Binary Tree](Problems/2331.cpp)                                                  |
   1259 |  2336  |   Medium   | [Smallest Number in Infinite Set](Problems/2336.cpp)                                               |
   1260 |  2342  |   Medium   | [Max Sum of a Pair With Equal Sum of Digits](Problems/2342.cpp)                                    |
   1261 |  2343  |   Medium   | [Query Kth Smallest Trimmed Number](Problems/2343.cpp)                                             |
   1262 |  2348  |   Medium   | [Number of Zero-Filled Subarrays](Problems/2348.cpp)                                               |
   1263 |  2352  |   Medium   | [Equal Row and Column Pairs](Problems/2352.cpp)                                                    |
   1264 |  2353  |   Medium   | [Design a Food Rating System](Problems/2353.cpp)                                                   |
   1265 |  2356  |    Easy    | [Number of Unique Subjects Taught by Each Teacher](Problems/2356.cpp)                              |
   1266 |  2358  |   Medium   | [Maximum Number of Groups Entering a Competition](Problems/2358.cpp)                               |
   1267 |  2359  |   Medium   | [Find Closest Node to Given Two Nodes](Problems/2359.cpp)                                          |
   1268 |  2360  |    Hard    | [Longest Cycle in a Graph](Problems/2360.cpp)                                                      |
   1269 |  2365  |   Medium   | [Task Scheduler II](Problems/2365.cpp)                                                             |
   1270 |  2366  |    Hard    | [Minimum Replacements to Sort the Array](Problems/2366.cpp)                                        |
   1271 |  2368  |   Medium   | [Reachable Nodes With Restrictions](Problems/2368.cpp)                                             |
   1272 |  2369  |   Medium   | [Check if There is a Valid Partition For The Array](Problems/2369.cpp)                             |
   1273 |  2370  |   Medium   | [Longest Ideal Subsequence](Problems/2370.cpp)                                                     |
   1274 |  2373  |    Easy    | [Largest Local Values in a Matrix](Problems/2373.cpp)                                              |
   1275 |  2374  |   Medium   | [Node With Highest Edge Score](Problems/2374.cpp)                                                  |
   1276 |  2375  |   Medium   | [Construct Smallest Number From DI String](Problems/2375.cpp)                                      |
   1277 |  2380  |   Medium   | [Time Needed to Rearrange a Binary String](Problems/2380.cpp)                                      |
   1278 |  2385  |   Medium   | [Amount of Time for Binary Tree to Be Infected](Problems/2385.cpp)                                 |
   1279 |  2390  |   Medium   | [Removing Stars From a String](Problems/2390.cpp)                                                  |
   1280 |  2391  |   Medium   | [Minimum Amount of Time to Collect Garbage](Problems/2391.cpp)                                     |
   1281 |  2392  |    Hard    | [Build a Matrix With Conditions](Problems/2392.cpp)                                                |
   1282 |  2396  |   Medium   | [Strictly Palindromic Number](Problems/2396.cpp)                                                   |
   1283 |  2397  |   Medium   | [Maximum Rows Covered by Columns](Problems/2397.cpp)                                               |
   1284 |  2401  |   Medium   | [Longest Nice Subarray](Problems/2401.cpp)                                                         |
   1285 |  2402  |    Hard    | [Meeting Rooms III](Problems/2402.cpp)                                                             |
   1286 |  2405  |   Medium   | [Optimal Partition of String](Problems/2405.cpp)                                                   |
   1287 |  2406  |   Medium   | [Divide Intervals Into Minimum Number of Groups](Problems/2406.cpp)                                |
   1288 |  2410  |   Medium   | [Maximum Matching of Players With Trainers](Problems/2410.cpp)                                     |
   1289 |  2414  |   Medium   | [Length of the Longest Alphabetical Continuous Substring](Problems/2414.cpp)                       |
   1290 |  2415  |   Medium   | [Reverse Odd Levels of Binary Tree](Problems/2415.cpp)                                             |
   1291 |  2416  |    Hard    | [Sum of Prefix Scores of Strings](Problems/2416.cpp)                                               |
   1292 |  2418  |    Easy    | [Sort the People](Problems/2418.cpp)                                                               |
   1293 |  2419  |   Medium   | [Longest Subarray With Maximum Bitwise AND](Problems/2419.cpp)                                     |
   1294 |  2421  |   Medium   | [Number of Good Paths](Problems/2421.cpp)                                                          |
   1295 |  2423  |    Easy    | [Remove Letter To Equalize Frequency](Problems/2423.cpp)                                           |
   1296 |  2424  |   Medium   | [Longest Uploaded Prefix](Problems/2424.cpp)                                                       |
   1297 |  2425  |   Medium   | [Bitwise XOR of All Pairings](Problems/2425.cpp)                                                   |
   1298 |  2428  |   Medium   | [Maximum Sum of an Hourglass](Problems/2428.cpp)                                                   |
   1299 |  2433  |   Medium   | [Find The Original Array of Prefix Xor](Problems/2433.cpp)                                         |
   1300 |  2439  |   Medium   | [Minimize Maximum of Array](Problems/2439.cpp)                                                     |
   1301 |  2441  |    Easy    | [Largest Positive Integer That Exists With Its Negative](Problems/2441.cpp)                        |
   1302 |  2442  |   Medium   | [Count Number of Distinct Integers After Reverse Operations](Problems/2442.cpp)                    |
   1303 |  2444  |    Hard    | [Count Subarrays With Fixed Bounds](Problems/2444.cpp)                                             |
   1304 |  2448  |    Hard    | [Minimum Cost to Make Array Equal](Problems/2448.cpp)                                              |
   1305 |  2452  |   Medium   | [Words Within Two Edits of Dictionary](Problems/2452.cpp)                                          |
   1306 |  2458  |    Hard    | [Height of Binary Tree After Subtree Removal Queries](Problems/2458.cpp)                           |
   1307 |  2461  |   Medium   | [Maximum Sum of Distinct Subarrays With Length K](Problems/2461.cpp)                               |
   1308 |  2462  |   Medium   | [Total Cost to Hire K Workers](Problems/2462.cpp)                                                  |
   1309 |  2463  |   Medium   | [Minimum Total Distance Traveled](Problems/2463.cpp)                                               |
   1310 |  2465  |    Easy    | [Number of Distinct Averages](Problems/2465.cpp)                                                   |
   1311 |  2466  |   Medium   | [Count Ways To Build Good Strings](Problems/2466.cpp)                                              |
   1312 |  2467  |   Medium   | [Most Profitable Path in a Tree](Problems/2467.cpp)                                                |
   1313 |  2469  |    Easy    | [Convert the Temperature](Problems/2469.cpp)                                                       |
   1314 |  2471  |   Medium   | [Minimum Number of Operations to Sort a Binary Tree by Level](Problems/2471.cpp)                   |
   1315 |  2477  |   Medium   | [Minimum Fuel Cost to Report to the Capital](Problems/2477.cpp)                                    |
   1316 |  2482  |   Medium   | [Difference Between Ones and Zeros in Row and Column](Problems/2482.cpp)                           |
   1317 |  2483  |   Medium   | [Minimum Penalty for a Shop](Problems/2483.cpp)                                                    |
   1318 |  2485  |    Easy    | [Find the Pivot Integer](Problems/2485.cpp)                                                        |
   1319 |  2486  |   Medium   | [Append Characters to String to Make Subsequence](Problems/2486.cpp)                               |
   1320 |  2487  |   Medium   | [Remove Nodes From Linked List](Problems/2487.cpp)                                                 |
   1321 |  2490  |    Easy    | [Circular Sentence](Problems/2490.cpp)                                                             |
   1322 |  2491  |   Medium   | [Divide Players Into Teams of Equal Skill](Problems/2491.cpp)                                      |
   1323 |  2492  |   Medium   | [Minimum Score of a Path Between Two Cities](Problems/2492.cpp)                                    |
   1324 |  2497  |   Medium   | [Maximum Star Sum of a Graph](Problems/2497.cpp)                                                   |
   1325 |  2498  |   Medium   | [Frog Jump II](Problems/2498.cpp)                                                                  |
   1326 |  2501  |   Medium   | [Longest Square Streak in an Array](Problems/2501.cpp)                                             |
   1327 |  2516  |   Medium   | [Take K of Each Character From Left and Right](Problems/2516.cpp)                                  |
   1328 |  2517  |   Medium   | [Maximum Tastiness of Candy Basket](Problems/2517.cpp)                                             |
   1329 |  2526  |   Medium   | [Find Consecutive Integers from a Data Stream](Problems/2526.cpp)                                  |
   1330 |  2527  |   Medium   | [Find Xor-Beauty of Array](Problems/2527.cpp)                                                      |
   1331 |  2530  |   Medium   | [Maximal Score After Applying K Operations](Problems/2530.cpp)                                     |
   1332 |  2536  |   Medium   | [Increment Submatrices by One](Problems/2536.cpp)                                                  |
   1333 |  2537  |   Medium   | [Count the Number of Good Subarrays](Problems/2537.cpp)                                            |
   1334 |  2540  |    Easy    | [Minimum Common Value](Problems/2540.cpp)                                                          |
   1335 |  2542  |   Medium   | [Maximum Subsequence Score](Problems/2542.cpp)                                                     |
   1336 |  2545  |   Medium   | [Sort the Students by Their Kth Score](Problems/2545.cpp)                                          |
   1337 |  2551  |    Hard    | [Put Marbles in Bags](Problems/2551.cpp)                                                           |
   1338 |  2554  |   Medium   | [Maximum Number of Integers to Choose From a Range I](Problems/2554.cpp)                           |
   1339 |  2559  |   Medium   | [Count Vowel Strings in Ranges](Problems/2559.cpp)                                                 |
   1340 |  2563  |   Medium   | [Count the Number of Fair Pairs](Problems/2563.cpp)                                                |
   1341 |  2568  |   Medium   | [Minimum Impossible OR](Problems/2568.cpp)                                                         |
   1342 |  2571  |   Medium   | [Minimum Operations to Reduce an Integer to 0](Problems/2571.cpp)                                  |
   1343 |  2579  |   Medium   | [Count Total Number of Colored Cells](Problems/2579.cpp)                                           |
   1344 |  2582  |    Easy    | [Pass the Pillow](Problems/2582.cpp)                                                               |
   1345 |  2583  |   Medium   | [Kth Largest Sum in a Binary Tree](Problems/2583.cpp)                                              |
   1346 |  2588  |   Medium   | [Count the Number of Beautiful Subarrays](Problems/2588.cpp)                                       |
   1347 |  2592  |   Medium   | [Maximize Greatness of an Array](Problems/2592.cpp)                                                |
   1348 |  2593  |   Medium   | [Find Score of an Array After Marking All Elements](Problems/2593.cpp)                             |
   1349 |  2596  |   Medium   | [Check Knight Tour Configuration](Problems/2596.cpp)                                               |
   1350 |  2597  |   Medium   | [The Number of Beautiful Subsets](Problems/2597.cpp)                                               |
   1351 |  2601  |   Medium   | [Prime Subtraction Operation](Problems/2601.cpp)                                                   |
   1352 |  2606  |   Medium   | [Find the Substring With Maximum Cost](Problems/2606.cpp)                                          |
   1353 |  2610  |   Medium   | [Convert an Array Into a 2D Array With Conditions](Problems/2610.cpp)                              |
   1354 |  2616  |   Medium   | [Minimize the Maximum Difference of Pairs](Problems/2616.cpp)                                      |
   1355 |  2620  |    Easy    | [Counter](Problems/2620.js)                                                                        |
   1356 |  2621  |    Easy    | [Sleep](Problems/2621.js)                                                                          |
   1357 |  2622  |   Medium   | [Cache With Time Limit](Problems/2622.js)                                                          |
   1358 |  2623  |   Medium   | [Memoize](Problems/2623.js)                                                                        |
   1359 |  2626  |    Easy    | [Array Reduce Transformation](Problems/2626.js)                                                    |
   1360 |  2627  |   Medium   | [Debounce](Problems/2627.js)                                                                       |
   1361 |  2629  |    Easy    | [Function Composition](Problems/2629.js)                                                           |
   1362 |  2632  |   Medium   | [Curry](Problems/2632.js)                                                                          |
   1363 |  2634  |    Easy    | [Filter Elements from Array](Problems/2634.js)                                                     |
   1364 |  2635  |    Easy    | [Apply Transform Over Each Element in Array](Problems/2635.js)                                     |
   1365 |  2636  |   Medium   | [Promise Pool ](Problems/2636.js)                                                                  |
   1366 |  2637  |    Easy    | [Promise Time Limit](Problems/2637.js)                                                             |
   1367 |  2640  |   Medium   | [Find the Score of All Prefixes of an Array](Problems/2640.cpp)                                    |
   1368 |  2641  |   Medium   | [Cousins in Binary Tree II](Problems/2641.cpp)                                                     |
   1369 |  2642  |    Hard    | [Design Graph With Shortest Path Calculator](Problems/2642.cpp)                                    |
   1370 |  2645  |   Medium   | [Minimum Additions to Make Valid String](Problems/2645.cpp)                                        |
   1371 |  2657  |   Medium   | [Find the Prefix Common Array of Two Arrays](Problems/2657.cpp)                                    |
   1372 |  2658  |   Medium   | [Maximum Number of Fish in a Grid](Problems/2658.cpp)                                              |
   1373 |  2661  |   Medium   | [First Completely Painted Row or Column](Problems/2661.cpp)                                        |
   1374 |  2665  |    Easy    | [Counter II](Problems/2665.js)                                                                     |
   1375 |  2666  |    Easy    | [Allow One Function Call](Problems/2666.js)                                                        |
   1376 |  2667  |    Easy    | [Create Hello World Function](Problems/2667.js)                                                    |
   1377 |  2672  |   Medium   | [Number of Adjacent Elements With the Same Color](Problems/2672.cpp)                               |
   1378 |  2673  |   Medium   | [Make Costs of Paths Equal in a Binary Tree](Problems/2673.cpp)                                    |
   1379 |  2676  |   Medium   | [Throttle](Problems/2676.js)                                                                       |
   1380 |  2678  |    Easy    | [Number of Senior Citizens](Problems/2678.cpp)                                                     |
   1381 |  2679  |   Medium   | [Sum in a Matrix](Problems/2679.cpp)                                                               |
   1382 |  2683  |   Medium   | [Neighboring Bitwise XOR](Problems/2683.cpp)                                                       |
   1383 |  2684  |   Medium   | [Maximum Number of Moves in a Grid](Problems/2684.cpp)                                             |
   1384 |  2685  |   Medium   | [Count the Number of Complete Components](Problems/2685.cpp)                                       |
   1385 |  2696  |    Easy    | [Minimum String Length After Removing Substrings](Problems/2696.cpp)                               |
   1386 |  2698  |   Medium   | [Find the Punishment Number of an Integer](Problems/2698.cpp)                                      |
   1387 |  2699  |    Hard    | [Modify Graph Edge Weights](Problems/2699.cpp)                                                     |
   1388 |  2706  |    Easy    | [Buy Two Chocolates](Problems/2706.cpp)                                                            |
   1389 |  2707  |   Medium   | [Extra Characters in a String](Problems/2707.cpp)                                                  |
   1390 |  2709  |    Hard    | [Greatest Common Divisor Traversal](Problems/2709.cpp)                                             |
   1391 |  2711  |   Medium   | [Difference of Number of Distinct Values on Diagonals](Problems/2711.cpp)                          |
   1392 |  2712  |   Medium   | [Minimum Cost to Make All Characters Equal](Problems/2712.cpp)                                     |
   1393 |  2740  |   Medium   | [Find the Value of the Partition](Problems/2740.cpp)                                               |
   1394 |  2742  |    Hard    | [Painting the Walls](Problems/2742.cpp)                                                            |
   1395 |  2745  |   Medium   | [Construct the Longest New String](Problems/2745.cpp)                                              |
   1396 |  2751  |    Hard    | [Robot Collisions](Problems/2751.cpp)                                                              |
   1397 |  2766  |   Medium   | [Relocate Marbles](Problems/2766.cpp)                                                              |
   1398 |  2767  |   Medium   | [Partition String Into Minimum Beautiful Substrings](Problems/2767.cpp)                            |
   1399 |  2769  |    Easy    | [Find the Maximum Achievable Number](Problems/2769.cpp)                                            |
   1400 |  2780  |   Medium   | [Minimum Index of a Valid Split](Problems/2780.cpp)                                                |
   1401 |  2785  |   Medium   | [Sort Vowels in a String](Problems/2785.cpp)                                                       |
   1402 |  2799  |   Medium   | [Count Complete Subarrays in an Array](Problems/2799.cpp)                                          |
   1403 |  2807  |   Medium   | [Insert Greatest Common Divisors in Linked List](Problems/2807.cpp)                                |
   1404 |  2812  |   Medium   | [Find the Safest Path in a Grid](Problems/2812.cpp)                                                |
   1405 |  2816  |   Medium   | [Double a Number Represented as a Linked List](Problems/2816.cpp)                                  |
   1406 |  2825  |   Medium   | [Make String a Subsequence Using Cyclic Increments](Problems/2825.cpp)                             |
   1407 |  2840  |   Medium   | [Check if Strings Can be Made Equal With Operations II](Problems/2840.cpp)                         |
   1408 |  2849  |   Medium   | [Determine if a Cell Is Reachable at a Given Time](Problems/2849.cpp)                              |
   1409 |  2856  |   Medium   | [Minimum Array Length After Pair Removals](Problems/2856.cpp)                                      |
   1410 |  2860  |   Medium   | [Happy Students](Problems/2860.cpp)                                                                |
   1411 |  2864  |    Easy    | [Maximum Odd Binary Number](Problems/2864.cpp)                                                     |
   1412 |  2870  |   Medium   | [Minimum Number of Operations to Make Array Empty](Problems/2870.cpp)                              |
   1413 |  2895  |   Medium   | [Minimum Processing Time](Problems/2895.cpp)                                                       |
   1414 |  2900  |   Medium   | [Longest Unequal Adjacent Groups Subsequence I](Problems/2900.cpp)                                 |
   1415 |  2909  |   Medium   | [Minimum Sum of Mountain Triplets II](Problems/2909.cpp)                                           |
   1416 |  2914  |   Medium   | [Minimum Number of Changes to Make Binary String Beautiful](Problems/2914.cpp)                     |
   1417 |  2924  |   Medium   | [Find Champion II](Problems/2924.cpp)                                                              |
   1418 |  2938  |   Medium   | [Separate Black and White Balls](Problems/2938.cpp)                                                |
   1419 |  2947  |   Medium   | [Count Beautiful Substrings I](Problems/2947.cpp)                                                  |
   1420 |  2952  |   Medium   | [Minimum Number of Coins to be Added](Problems/2952.cpp)                                           |
   1421 |  2957  |   Medium   | [Remove Adjacent Almost-Equal Characters](Problems/2957.cpp)                                       |
   1422 |  2958  |   Medium   | [Length of Longest Subarray With at Most K Frequency](Problems/2958.cpp)                           |
   1423 |  2962  |   Medium   | [Count Subarrays Where Max Element Appears at Least K Times](Problems/2962.cpp)                    |
   1424 |  2966  |   Medium   | [Divide Array Into Arrays With Max Difference](Problems/2966.cpp)                                  |
   1425 |  2971  |   Medium   | [Find Polygon With the Largest Perimeter](Problems/2971.cpp)                                       |
   1426 |  2976  |   Medium   | [Minimum Cost to Convert String I](Problems/2976.cpp)                                              |
   1427 |  2997  |   Medium   | [Minimum Number of Operations to Make Array XOR Equal to K](Problems/2997.cpp)                     |
   1428 |  3005  |    Easy    | [Count Elements With Maximum Frequency](Problems/3005.cpp)                                         |
   1429 |  3011  |   Medium   | [Find if Array Can Be Sorted](Problems/3011.cpp)                                                   |
   1430 |  3015  |   Medium   | [Count the Number of Houses at a Certain Distance I](Problems/3015.cpp)                            |
   1431 |  3016  |   Medium   | [Minimum Number of Pushes to Type Word II](Problems/3016.cpp)                                      |
   1432 |  3034  |   Medium   | [Number of Subarrays That Match a Pattern I](Problems/3034.cpp)                                    |
   1433 |  3039  |   Medium   | [Apply Operations to Make String Empty](Problems/3039.cpp)                                         |
   1434 |  3043  |   Medium   | [Find the Length of the Longest Common Prefix](Problems/3043.cpp)                                  |
   1435 |  3067  |   Medium   | [Count Pairs of Connectable Servers in a Weighted Tree Network](Problems/3067.cpp)                 |
   1436 |  3068  |    Hard    | [Find the Maximum Sum of Node Values](Problems/3068.cpp)                                           |
   1437 |  3070  |   Medium   | [Count Submatrices with Top-Left Element and Sum Less Than k](Problems/3070.cpp)                   |
   1438 |  3075  |   Medium   | [Maximize Happiness of Selected Children](Problems/3075.cpp)                                       |
   1439 |  3080  |   Medium   | [Mark Elements on Array by Performing Queries](Problems/3080.cpp)                                  |
   1440 |  3097  |   Medium   | [Shortest Subarray With OR at Least K II](Problems/3097.cpp)                                       |
   1441 |  3100  |   Medium   | [Water Bottles II](Problems/3100.cpp)                                                              |
   1442 |  3101  |   Medium   | [Count Alternating Subarrays](Problems/3101.cpp)                                                   |
   1443 |  3106  |   Medium   | [Lexicographically Smallest String After Operations With Constraint](Problems/3106.cpp)            |
   1444 |  3110  |    Easy    | [Score of a String](Problems/3110.cpp)                                                             |
   1445 |  3111  |   Medium   | [Minimum Rectangles to Cover Points](Problems/3111.cpp)                                            |
   1446 |  3133  |   Medium   | [Minimum Array End](Problems/3133.cpp)                                                             |
   1447 |  3137  |   Medium   | [Minimum Number of Operations to Make Word K-Periodic](Problems/3137.cpp)                          |
   1448 |  3159  |   Medium   | [Find Occurrences of an Element in an Array](Problems/3159.cpp)                                    |
   1449 |  3163  |   Medium   | [String Compression III](Problems/3163.cpp)                                                        |
   1450 |  3190  |    Easy    | [Find Minimum Operations to Make All Elements Divisible by Three](Problems/3190.cpp)               |
   1451 |  3191  |   Medium   | [Minimum Operations to Make Binary Array Elements Equal to One I](Problems/3191.cpp)               |
   1452 |  3192  |   Medium   | [Minimum Operations to Make Binary Array Elements Equal to One II](Problems/3192.cpp)              |
   1453 |  3195  |   Medium   | [Find the Minimum Area to Cover All Ones I](Problems/3195.cpp)                                     |
   1454 |  3211  |   Medium   | [Generate Binary Strings Without Adjacent Zeros](Problems/3211.cpp)                                |
   1455 |  3212  |   Medium   | [Count Submatrices With Equal Frequency of X and Y](Problems/3212.cpp)                             |
   1456 |  3217  |   Medium   | [Delete Nodes From Linked List Present in Array](Problems/3217.cpp)                                |
   1457 |  3218  |   Medium   | [Minimum Cost for Cutting Cake I](Problems/3218.cpp)                                               |
   1458 |  3223  |   Medium   | [Minimum Length of String After Operations](Problems/3223.cpp)                                     |
   1459 |  3227  |   Medium   | [Vowels Game in a String](Problems/3227.cpp)                                                       |
   1460 |  3228  |   Medium   | [Maximum Number of Operations to Move Ones to the End](Problems/3228.cpp)                          |
   1461 |  3239  |   Medium   | [Minimum Number of Flips to Make Binary Grid Palindromic I](Problems/3239.cpp)                     |
   1462 |  3249  |   Medium   | [Count the Number of Good Nodes](Problems/3249.cpp)                                                |
   1463 |  3254  |   Medium   | [Find the Power of K-Size Subarrays I](Problems/3254.cpp)                                          |
   1464 |  3291  |   Medium   | [Minimum Number of Valid Strings to Form Target I](Problems/3291.cpp)                              |
   1465 |  3310  |   Medium   | [Remove Methods From Project](Problems/3310.cpp)                                                   |