README.md

# LeetCode Solutions

![Total](https://img.shields.io/badge/Total-1765-blue) ![Easy](https://img.shields.io/badge/Easy-543-success) ![Medium](https://img.shields.io/badge/Medium-950-orange) ![Hard](https://img.shields.io/badge/Hard-272-red)

My solutions for LeetCode problems.

- **LeetCode Profile:** [Avuvos](https://leetcode.com/Avuvos/)
- **Total Solved:** 1765
- **Global Rank:** Top 0.31%

## Solutions

| # | Title | Difficulty | Solution |
| - | - | - | - |
| 0001 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [java](./solutions/0001-0500/0001-two-sum.java) |
| 0002 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [java](./solutions/0001-0500/0002-add-two-numbers.java) |
| 0003 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [python3](./solutions/0001-0500/0003-longest-substring-without-repeating-characters.py) |
| 0004 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [python3](./solutions/0001-0500/0004-median-of-two-sorted-arrays.py) |
| 0005 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | Medium | [java](./solutions/0001-0500/0005-longest-palindromic-substring.java) |
| 0007 | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | Medium | [cpp](./solutions/0001-0500/0007-reverse-integer.cpp) |
| 0009 | [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | Easy | [cpp](./solutions/0001-0500/0009-palindrome-number.cpp) |
| 0010 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/) | Hard | [cpp](./solutions/0001-0500/0010-regular-expression-matching.cpp) |
| 0011 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | Medium | [java](./solutions/0001-0500/0011-container-with-most-water.java) |
| 0014 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | Easy | [java](./solutions/0001-0500/0014-longest-common-prefix.java) |
| 0015 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [python3](./solutions/0001-0500/0015-3sum.py) |
| 0017 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | Medium | [cpp](./solutions/0001-0500/0017-letter-combinations-of-a-phone-number.cpp) |
| 0018 | [4Sum](https://leetcode.com/problems/4sum/) | Medium | [cpp](./solutions/0001-0500/0018-4sum.cpp) |
| 0019 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | Medium | [c](./solutions/0001-0500/0019-remove-nth-node-from-end-of-list.c) |
| 0020 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [cpp](./solutions/0001-0500/0020-valid-parentheses.cpp) |
| 0021 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | Easy | [java](./solutions/0001-0500/0021-merge-two-sorted-lists.java) |
| 0022 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | Medium | [java](./solutions/0001-0500/0022-generate-parentheses.java) |
| 0023 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [java](./solutions/0001-0500/0023-merge-k-sorted-lists.java) |
| 0024 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) | Medium | [c](./solutions/0001-0500/0024-swap-nodes-in-pairs.c) |
| 0025 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | Hard | [java](./solutions/0001-0500/0025-reverse-nodes-in-k-group.java) |
| 0033 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [cpp](./solutions/0001-0500/0033-search-in-rotated-sorted-array.cpp) |
| 0034 | [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/) | Medium | [cpp](./solutions/0001-0500/0034-find-first-and-last-position-of-element-in-sorted-array.cpp) |
| 0035 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | Easy | [cpp](./solutions/0001-0500/0035-search-insert-position.cpp) |
| 0036 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | Medium | [java](./solutions/0001-0500/0036-valid-sudoku.java) |
| 0037 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver/) | Hard | [java](./solutions/0001-0500/0037-sudoku-solver.java) |
| 0039 | [Combination Sum](https://leetcode.com/problems/combination-sum/) | Medium | [python3](./solutions/0001-0500/0039-combination-sum.py) |
| 0040 | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii/) | Medium | [cpp](./solutions/0001-0500/0040-combination-sum-ii.cpp) |
| 0042 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [cpp](./solutions/0001-0500/0042-trapping-rain-water.cpp) |
| 0043 | [Multiply Strings](https://leetcode.com/problems/multiply-strings/) | Medium | [python3](./solutions/0001-0500/0043-multiply-strings.py) |
| 0045 | [Jump Game II](https://leetcode.com/problems/jump-game-ii/) | Medium | [python3](./solutions/0001-0500/0045-jump-game-ii.py) |
| 0046 | [Permutations](https://leetcode.com/problems/permutations/) | Medium | [cpp](./solutions/0001-0500/0046-permutations.cpp) |
| 0047 | [Permutations II](https://leetcode.com/problems/permutations-ii/) | Medium | [python3](./solutions/0001-0500/0047-permutations-ii.py) |
| 0048 | [Rotate Image](https://leetcode.com/problems/rotate-image/) | Medium | [cpp](./solutions/0001-0500/0048-rotate-image.cpp) |
| 0049 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [cpp](./solutions/0001-0500/0049-group-anagrams.cpp) |
| 0050 | [Pow(x, n)](https://leetcode.com/problems/powx-n/) | Medium | [cpp](./solutions/0001-0500/0050-powx-n.cpp) |
| 0051 | [N-Queens](https://leetcode.com/problems/n-queens/) | Hard | [java](./solutions/0001-0500/0051-n-queens.java) |
| 0053 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Medium | [python3](./solutions/0001-0500/0053-maximum-subarray.py) |
| 0054 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | Medium | [python3](./solutions/0001-0500/0054-spiral-matrix.py) |
| 0055 | [Jump Game](https://leetcode.com/problems/jump-game/) | Medium | [java](./solutions/0001-0500/0055-jump-game.java) |
| 0056 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [python3](./solutions/0001-0500/0056-merge-intervals.py) |
| 0057 | [Insert Interval](https://leetcode.com/problems/insert-interval/) | Medium | [java](./solutions/0001-0500/0057-insert-interval.java) |
| 0059 | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/) | Medium | [python3](./solutions/0001-0500/0059-spiral-matrix-ii.py) |
| 0062 | [Unique Paths](https://leetcode.com/problems/unique-paths/) | Medium | [cpp](./solutions/0001-0500/0062-unique-paths.cpp) |
| 0063 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii/) | Medium | [cpp](./solutions/0001-0500/0063-unique-paths-ii.cpp) |
| 0064 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) | Medium | [python3](./solutions/0001-0500/0064-minimum-path-sum.py) |
| 0067 | [Add Binary](https://leetcode.com/problems/add-binary/) | Easy | [python3](./solutions/0001-0500/0067-add-binary.py) |
| 0068 | [Text Justification](https://leetcode.com/problems/text-justification/) | Hard | [python3](./solutions/0001-0500/0068-text-justification.py) |
| 0069 | [Sqrt(x)](https://leetcode.com/problems/sqrtx/) | Easy | [python3](./solutions/0001-0500/0069-sqrtx.py) |
| 0070 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | Easy | [java](./solutions/0001-0500/0070-climbing-stairs.java) |
| 0071 | [Simplify Path](https://leetcode.com/problems/simplify-path/) | Medium | [python3](./solutions/0001-0500/0071-simplify-path.py) |
| 0072 | [Edit Distance](https://leetcode.com/problems/edit-distance/) | Medium | [java](./solutions/0001-0500/0072-edit-distance.java) |
| 0073 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | Medium | [python3](./solutions/0001-0500/0073-set-matrix-zeroes.py) |
| 0074 | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/) | Medium | [cpp](./solutions/0001-0500/0074-search-a-2d-matrix.cpp) |
| 0075 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | Medium | [java](./solutions/0001-0500/0075-sort-colors.java) |
| 0076 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) | Hard | [cpp](./solutions/0001-0500/0076-minimum-window-substring.cpp) |
| 0077 | [Combinations](https://leetcode.com/problems/combinations/) | Medium | [cpp](./solutions/0001-0500/0077-combinations.cpp) |
| 0078 | [Subsets](https://leetcode.com/problems/subsets/) | Medium | [java](./solutions/0001-0500/0078-subsets.java) |
| 0079 | [Word Search](https://leetcode.com/problems/word-search/) | Medium | [java](./solutions/0001-0500/0079-word-search.java) |
| 0081 | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/) | Medium | [cpp](./solutions/0001-0500/0081-search-in-rotated-sorted-array-ii.cpp) |
| 0082 | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/) | Medium | [c](./solutions/0001-0500/0082-remove-duplicates-from-sorted-list-ii.c) |
| 0083 | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | Easy | [c](./solutions/0001-0500/0083-remove-duplicates-from-sorted-list.c) |
| 0086 | [Partition List](https://leetcode.com/problems/partition-list/) | Medium | [cpp](./solutions/0001-0500/0086-partition-list.cpp) |
| 0088 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | Easy | [java](./solutions/0001-0500/0088-merge-sorted-array.java) |
| 0090 | [Subsets II](https://leetcode.com/problems/subsets-ii/) | Medium | [python3](./solutions/0001-0500/0090-subsets-ii.py) |
| 0091 | [Decode Ways](https://leetcode.com/problems/decode-ways/) | Medium | [cpp](./solutions/0001-0500/0091-decode-ways.cpp) |
| 0092 | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/) | Medium | [cpp](./solutions/0001-0500/0092-reverse-linked-list-ii.cpp) |
| 0094 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | Easy | [cpp](./solutions/0001-0500/0094-binary-tree-inorder-traversal.cpp) |
| 0095 | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/) | Medium | [python3](./solutions/0001-0500/0095-unique-binary-search-trees-ii.py) |
| 0096 | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/) | Medium | [python3](./solutions/0001-0500/0096-unique-binary-search-trees.py) |
| 0097 | [Interleaving String](https://leetcode.com/problems/interleaving-string/) | Medium | [cpp](./solutions/0001-0500/0097-interleaving-string.cpp) |
| 0098 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | Medium | [java](./solutions/0001-0500/0098-validate-binary-search-tree.java) |
| 0100 | [Same Tree](https://leetcode.com/problems/same-tree/) | Easy | [cpp](./solutions/0001-0500/0100-same-tree.cpp) |
| 0101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | Easy | [java](./solutions/0001-0500/0101-symmetric-tree.java) |
| 0102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | Medium | [python3](./solutions/0001-0500/0102-binary-tree-level-order-traversal.py) |
| 0103 | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/) | Medium | [java](./solutions/0001-0500/0103-binary-tree-zigzag-level-order-traversal.java) |
| 0104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | Easy | [python3](./solutions/0001-0500/0104-maximum-depth-of-binary-tree.py) |
| 0105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | Medium | [python3](./solutions/0001-0500/0105-construct-binary-tree-from-preorder-and-inorder-traversal.py) |
| 0107 | [Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/) | Medium | [java](./solutions/0001-0500/0107-binary-tree-level-order-traversal-ii.java) |
| 0108 | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) | Easy | [python3](./solutions/0001-0500/0108-convert-sorted-array-to-binary-search-tree.py) |
| 0110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | Easy | [python3](./solutions/0001-0500/0110-balanced-binary-tree.py) |
| 0111 | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/) | Easy | [cpp](./solutions/0001-0500/0111-minimum-depth-of-binary-tree.cpp) |
| 0112 | [Path Sum](https://leetcode.com/problems/path-sum/) | Easy | [cpp](./solutions/0001-0500/0112-path-sum.cpp) |
| 0113 | [Path Sum II](https://leetcode.com/problems/path-sum-ii/) | Medium | [cpp](./solutions/0001-0500/0113-path-sum-ii.cpp) |
| 0116 | [Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) | Medium | [java](./solutions/0001-0500/0116-populating-next-right-pointers-in-each-node.java) |
| 0117 | [Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/) | Medium | [java](./solutions/0001-0500/0117-populating-next-right-pointers-in-each-node-ii.java) |
| 0118 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) | Easy | [cpp](./solutions/0001-0500/0118-pascals-triangle.cpp) |
| 0119 | [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/) | Easy | [python3](./solutions/0001-0500/0119-pascals-triangle-ii.py) |
| 0120 | [Triangle](https://leetcode.com/problems/triangle/) | Medium | [python3](./solutions/0001-0500/0120-triangle.py) |
| 0121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [python3](./solutions/0001-0500/0121-best-time-to-buy-and-sell-stock.py) |
| 0122 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | Medium | [python3](./solutions/0001-0500/0122-best-time-to-buy-and-sell-stock-ii.py) |
| 0123 | [Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/) | Hard | [python3](./solutions/0001-0500/0123-best-time-to-buy-and-sell-stock-iii.py) |
| 0124 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | Hard | [java](./solutions/0001-0500/0124-binary-tree-maximum-path-sum.java) |
| 0125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | Easy | [python3](./solutions/0001-0500/0125-valid-palindrome.py) |
| 0127 | [Word Ladder](https://leetcode.com/problems/word-ladder/) | Hard | [python3](./solutions/0001-0500/0127-word-ladder.py) |
| 0128 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | Medium | [python3](./solutions/0001-0500/0128-longest-consecutive-sequence.py) |
| 0129 | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/) | Medium | [python3](./solutions/0001-0500/0129-sum-root-to-leaf-numbers.py) |
| 0130 | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions/) | Medium | [java](./solutions/0001-0500/0130-surrounded-regions.java) |
| 0132 | [Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii/) | Hard | [python3](./solutions/0001-0500/0132-palindrome-partitioning-ii.py) |
| 0133 | [Clone Graph](https://leetcode.com/problems/clone-graph/) | Medium | [cpp](./solutions/0001-0500/0133-clone-graph.cpp) |
| 0134 | [Gas Station](https://leetcode.com/problems/gas-station/) | Medium | [cpp](./solutions/0001-0500/0134-gas-station.cpp) |
| 0135 | [Candy](https://leetcode.com/problems/candy/) | Hard | [cpp](./solutions/0001-0500/0135-candy.cpp) |
| 0136 | [Single Number](https://leetcode.com/problems/single-number/) | Easy | [java](./solutions/0001-0500/0136-single-number.java) |
| 0137 | [Single Number II](https://leetcode.com/problems/single-number-ii/) | Medium | [cpp](./solutions/0001-0500/0137-single-number-ii.cpp) |
| 0138 | [Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/) | Medium | [cpp](./solutions/0001-0500/0138-copy-list-with-random-pointer.cpp) |
| 0139 | [Word Break](https://leetcode.com/problems/word-break/) | Medium | [cpp](./solutions/0001-0500/0139-word-break.cpp) |
| 0141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | Easy | [c](./solutions/0001-0500/0141-linked-list-cycle.c) |
| 0142 | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/) | Medium | [java](./solutions/0001-0500/0142-linked-list-cycle-ii.java) |
| 0143 | [Reorder List](https://leetcode.com/problems/reorder-list/) | Medium | [java](./solutions/0001-0500/0143-reorder-list.java) |
| 0144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/) | Easy | [java](./solutions/0001-0500/0144-binary-tree-preorder-traversal.java) |
| 0145 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) | Easy | [cpp](./solutions/0001-0500/0145-binary-tree-postorder-traversal.cpp) |
| 0146 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Medium | [cpp](./solutions/0001-0500/0146-lru-cache.cpp) |
| 0149 | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/) | Hard | [java](./solutions/0001-0500/0149-max-points-on-a-line.java) |
| 0152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | Medium | [java](./solutions/0001-0500/0152-maximum-product-subarray.java) |
| 0153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | Medium | [java](./solutions/0001-0500/0153-find-minimum-in-rotated-sorted-array.java) |
| 0155 | [Min Stack](https://leetcode.com/problems/min-stack/) | Medium | [python3](./solutions/0001-0500/0155-min-stack.py) |
| 0160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | Easy | [java](./solutions/0001-0500/0160-intersection-of-two-linked-lists.java) |
| 0162 | [Find Peak Element](https://leetcode.com/problems/find-peak-element/) | Medium | [java](./solutions/0001-0500/0162-find-peak-element.java) |
| 0167 | [Two Sum II - Input Array Is Sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) | Medium | [java](./solutions/0001-0500/0167-two-sum-ii-input-array-is-sorted.java) |
| 0168 | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/) | Easy | [cpp](./solutions/0001-0500/0168-excel-sheet-column-title.cpp) |
| 0169 | [Majority Element](https://leetcode.com/problems/majority-element/) | Easy | [python3](./solutions/0001-0500/0169-majority-element.py) |
| 0173 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/) | Medium | [java](./solutions/0001-0500/0173-binary-search-tree-iterator.java) |
| 0174 | [Dungeon Game](https://leetcode.com/problems/dungeon-game/) | Hard | [python3](./solutions/0001-0500/0174-dungeon-game.py) |
| 0175 | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables/) | Easy | [postgresql](./solutions/0001-0500/0175-combine-two-tables.txt) |
| 0179 | [Largest Number](https://leetcode.com/problems/largest-number/) | Medium | [cpp](./solutions/0001-0500/0179-largest-number.cpp) |
| 0181 | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers/) | Easy | [postgresql](./solutions/0001-0500/0181-employees-earning-more-than-their-managers.txt) |
| 0187 | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/) | Medium | [java](./solutions/0001-0500/0187-repeated-dna-sequences.java) |
| 0188 | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/) | Hard | [cpp](./solutions/0001-0500/0188-best-time-to-buy-and-sell-stock-iv.cpp) |
| 0189 | [Rotate Array](https://leetcode.com/problems/rotate-array/) | Medium | [java](./solutions/0001-0500/0189-rotate-array.java) |
| 0190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits/) | Easy | [java](./solutions/0001-0500/0190-reverse-bits.java) |
| 0191 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | Easy | [c](./solutions/0001-0500/0191-number-of-1-bits.c) |
| 0198 | [House Robber](https://leetcode.com/problems/house-robber/) | Medium | [cpp](./solutions/0001-0500/0198-house-robber.cpp) |
| 0199 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) | Medium | [python3](./solutions/0001-0500/0199-binary-tree-right-side-view.py) |
| 0200 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [python3](./solutions/0001-0500/0200-number-of-islands.py) |
| 0201 | [Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) | Medium | [cpp](./solutions/0001-0500/0201-bitwise-and-of-numbers-range.cpp) |
| 0202 | [Happy Number](https://leetcode.com/problems/happy-number/) | Easy | [python3](./solutions/0001-0500/0202-happy-number.py) |
| 0203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/) | Easy | [java](./solutions/0001-0500/0203-remove-linked-list-elements.java) |
| 0204 | [Count Primes](https://leetcode.com/problems/count-primes/) | Medium | [cpp](./solutions/0001-0500/0204-count-primes.cpp) |
| 0205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/) | Easy | [python3](./solutions/0001-0500/0205-isomorphic-strings.py) |
| 0206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | Easy | [c](./solutions/0001-0500/0206-reverse-linked-list.c) |
| 0207 | [Course Schedule](https://leetcode.com/problems/course-schedule/) | Medium | [cpp](./solutions/0001-0500/0207-course-schedule.cpp) |
| 0208 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/) | Medium | [java](./solutions/0001-0500/0208-implement-trie-prefix-tree.java) |
| 0209 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/) | Medium | [cpp](./solutions/0001-0500/0209-minimum-size-subarray-sum.cpp) |
| 0211 | [Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/) | Medium | [java](./solutions/0001-0500/0211-design-add-and-search-words-data-structure.java) |
| 0212 | [Word Search II](https://leetcode.com/problems/word-search-ii/) | Hard | [java](./solutions/0001-0500/0212-word-search-ii.java) |
| 0213 | [House Robber II](https://leetcode.com/problems/house-robber-ii/) | Medium | [cpp](./solutions/0001-0500/0213-house-robber-ii.cpp) |
| 0214 | [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome/) | Hard | [cpp](./solutions/0001-0500/0214-shortest-palindrome.cpp) |
| 0215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | Medium | [cpp](./solutions/0001-0500/0215-kth-largest-element-in-an-array.cpp) |
| 0216 | [Combination Sum III](https://leetcode.com/problems/combination-sum-iii/) | Medium | [python3](./solutions/0001-0500/0216-combination-sum-iii.py) |
| 0217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | Easy | [java](./solutions/0001-0500/0217-contains-duplicate.java) |
| 0218 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/) | Hard | [cpp](./solutions/0001-0500/0218-the-skyline-problem.cpp) |
| 0219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/) | Easy | [cpp](./solutions/0001-0500/0219-contains-duplicate-ii.cpp) |
| 0221 | [Maximal Square](https://leetcode.com/problems/maximal-square/) | Medium | [python3](./solutions/0001-0500/0221-maximal-square.py) |
| 0222 | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/) | Easy | [java](./solutions/0001-0500/0222-count-complete-tree-nodes.java) |
| 0225 | [Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/) | Easy | [python3](./solutions/0001-0500/0225-implement-stack-using-queues.py) |
| 0226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | Easy | [java](./solutions/0001-0500/0226-invert-binary-tree.java) |
| 0228 | [Summary Ranges](https://leetcode.com/problems/summary-ranges/) | Easy | [python3](./solutions/0001-0500/0228-summary-ranges.py) |
| 0229 | [Majority Element II](https://leetcode.com/problems/majority-element-ii/) | Medium | [cpp](./solutions/0001-0500/0229-majority-element-ii.cpp) |
| 0230 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) | Medium | [java](./solutions/0001-0500/0230-kth-smallest-element-in-a-bst.java) |
| 0231 | [Power of Two](https://leetcode.com/problems/power-of-two/) | Easy | [cpp](./solutions/0001-0500/0231-power-of-two.cpp) |
| 0232 | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/) | Easy | [java](./solutions/0001-0500/0232-implement-queue-using-stacks.java) |
| 0234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | Easy | [cpp](./solutions/0001-0500/0234-palindrome-linked-list.cpp) |
| 0235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | Medium | [cpp](./solutions/0001-0500/0235-lowest-common-ancestor-of-a-binary-search-tree.cpp) |
| 0236 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | Medium | [cpp](./solutions/0001-0500/0236-lowest-common-ancestor-of-a-binary-tree.cpp) |
| 0237 | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/) | Medium | [c](./solutions/0001-0500/0237-delete-node-in-a-linked-list.c) |
| 0238 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | Medium | [java](./solutions/0001-0500/0238-product-of-array-except-self.java) |
| 0239 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | Hard | [cpp](./solutions/0001-0500/0239-sliding-window-maximum.cpp) |
| 0240 | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/) | Medium | [java](./solutions/0001-0500/0240-search-a-2d-matrix-ii.java) |
| 0242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | Easy | [java](./solutions/0001-0500/0242-valid-anagram.java) |
| 0257 | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/) | Easy | [python3](./solutions/0001-0500/0257-binary-tree-paths.py) |
| 0258 | [Add Digits](https://leetcode.com/problems/add-digits/) | Easy | [cpp](./solutions/0001-0500/0258-add-digits.cpp) |
| 0260 | [Single Number III](https://leetcode.com/problems/single-number-iii/) | Medium | [c](./solutions/0001-0500/0260-single-number-iii.c) |
| 0263 | [Ugly Number](https://leetcode.com/problems/ugly-number/) | Easy | [cpp](./solutions/0001-0500/0263-ugly-number.cpp) |
| 0264 | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii/) | Medium | [cpp](./solutions/0001-0500/0264-ugly-number-ii.cpp) |
| 0268 | [Missing Number](https://leetcode.com/problems/missing-number/) | Easy | [python3](./solutions/0001-0500/0268-missing-number.py) |
| 0278 | [First Bad Version](https://leetcode.com/problems/first-bad-version/) | Easy | [python3](./solutions/0001-0500/0278-first-bad-version.py) |
| 0279 | [Perfect Squares](https://leetcode.com/problems/perfect-squares/) | Medium | [python3](./solutions/0001-0500/0279-perfect-squares.py) |
| 0283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | Easy | [cpp](./solutions/0001-0500/0283-move-zeroes.cpp) |
| 0284 | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator/) | Medium | [java](./solutions/0001-0500/0284-peeking-iterator.java) |
| 0287 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | Medium | [cpp](./solutions/0001-0500/0287-find-the-duplicate-number.cpp) |
| 0290 | [Word Pattern](https://leetcode.com/problems/word-pattern/) | Easy | [cpp](./solutions/0001-0500/0290-word-pattern.cpp) |
| 0292 | [Nim Game](https://leetcode.com/problems/nim-game/) | Easy | [python3](./solutions/0001-0500/0292-nim-game.py) |
| 0295 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | Hard | [cpp](./solutions/0001-0500/0295-find-median-from-data-stream.cpp) |
| 0297 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard | [java](./solutions/0001-0500/0297-serialize-and-deserialize-binary-tree.java) |
| 0300 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | Medium | [python3](./solutions/0001-0500/0300-longest-increasing-subsequence.py) |
| 0303 | [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/) | Easy | [java](./solutions/0001-0500/0303-range-sum-query-immutable.java) |
| 0304 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/) | Medium | [cpp](./solutions/0001-0500/0304-range-sum-query-2d-immutable.cpp) |
| 0307 | [Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/) | Medium | [cpp](./solutions/0001-0500/0307-range-sum-query-mutable.cpp) |
| 0309 | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/) | Medium | [python3](./solutions/0001-0500/0309-best-time-to-buy-and-sell-stock-with-cooldown.py) |
| 0312 | [Burst Balloons](https://leetcode.com/problems/burst-balloons/) | Hard | [cpp](./solutions/0001-0500/0312-burst-balloons.cpp) |
| 0315 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/) | Hard | [cpp](./solutions/0001-0500/0315-count-of-smaller-numbers-after-self.cpp) |
| 0316 | [Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters/) | Medium | [cpp](./solutions/0001-0500/0316-remove-duplicate-letters.cpp) |
| 0318 | [Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) | Medium | [python3](./solutions/0001-0500/0318-maximum-product-of-word-lengths.py) |
| 0319 | [Bulb Switcher](https://leetcode.com/problems/bulb-switcher/) | Medium | [cpp](./solutions/0001-0500/0319-bulb-switcher.cpp) |
| 0322 | [Coin Change](https://leetcode.com/problems/coin-change/) | Medium | [java](./solutions/0001-0500/0322-coin-change.java) |
| 0326 | [Power of Three](https://leetcode.com/problems/power-of-three/) | Easy | [cpp](./solutions/0001-0500/0326-power-of-three.cpp) |
| 0328 | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/) | Medium | [cpp](./solutions/0001-0500/0328-odd-even-linked-list.cpp) |
| 0330 | [Patching Array](https://leetcode.com/problems/patching-array/) | Hard | [java](./solutions/0001-0500/0330-patching-array.java) |
| 0331 | [Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/) | Medium | [java](./solutions/0001-0500/0331-verify-preorder-serialization-of-a-binary-tree.java) |
| 0332 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/) | Hard | [cpp](./solutions/0001-0500/0332-reconstruct-itinerary.cpp) |
| 0334 | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/) | Medium | [cpp](./solutions/0001-0500/0334-increasing-triplet-subsequence.cpp) |
| 0336 | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/) | Hard | [cpp](./solutions/0001-0500/0336-palindrome-pairs.cpp) |
| 0338 | [Counting Bits](https://leetcode.com/problems/counting-bits/) | Easy | [cpp](./solutions/0001-0500/0338-counting-bits.cpp) |
| 0342 | [Power of Four](https://leetcode.com/problems/power-of-four/) | Easy | [cpp](./solutions/0001-0500/0342-power-of-four.cpp) |
| 0343 | [Integer Break](https://leetcode.com/problems/integer-break/) | Medium | [cpp](./solutions/0001-0500/0343-integer-break.cpp) |
| 0344 | [Reverse String](https://leetcode.com/problems/reverse-string/) | Easy | [java](./solutions/0001-0500/0344-reverse-string.java) |
| 0345 | [Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/) | Easy | [cpp](./solutions/0001-0500/0345-reverse-vowels-of-a-string.cpp) |
| 0347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | Medium | [python3](./solutions/0001-0500/0347-top-k-frequent-elements.py) |
| 0349 | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/) | Easy | [python3](./solutions/0001-0500/0349-intersection-of-two-arrays.py) |
| 0350 | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | Easy | [cpp](./solutions/0001-0500/0350-intersection-of-two-arrays-ii.cpp) |
| 0365 | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem/) | Medium | [python3](./solutions/0001-0500/0365-water-and-jug-problem.py) |
| 0367 | [Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/) | Easy | [python3](./solutions/0001-0500/0367-valid-perfect-square.py) |
| 0368 | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/) | Medium | [cpp](./solutions/0001-0500/0368-largest-divisible-subset.cpp) |
| 0371 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) | Medium | [java](./solutions/0001-0500/0371-sum-of-two-integers.java) |
| 0373 | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/) | Medium | [cpp](./solutions/0001-0500/0373-find-k-pairs-with-smallest-sums.cpp) |
| 0374 | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/) | Easy | [cpp](./solutions/0001-0500/0374-guess-number-higher-or-lower.cpp) |
| 0376 | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/) | Medium | [python3](./solutions/0001-0500/0376-wiggle-subsequence.py) |
| 0377 | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/) | Medium | [cpp](./solutions/0001-0500/0377-combination-sum-iv.cpp) |
| 0378 | [Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/) | Medium | [python3](./solutions/0001-0500/0378-kth-smallest-element-in-a-sorted-matrix.py) |
| 0380 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | Medium | [java](./solutions/0001-0500/0380-insert-delete-getrandom-o1.java) |
| 0383 | [Ransom Note](https://leetcode.com/problems/ransom-note/) | Easy | [cpp](./solutions/0001-0500/0383-ransom-note.cpp) |
| 0384 | [Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/) | Medium | [python3](./solutions/0001-0500/0384-shuffle-an-array.py) |
| 0386 | [Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/) | Medium | [cpp](./solutions/0001-0500/0386-lexicographical-numbers.cpp) |
| 0387 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | Easy | [cpp](./solutions/0001-0500/0387-first-unique-character-in-a-string.cpp) |
| 0389 | [Find the Difference](https://leetcode.com/problems/find-the-difference/) | Easy | [cpp](./solutions/0001-0500/0389-find-the-difference.cpp) |
| 0392 | [Is Subsequence](https://leetcode.com/problems/is-subsequence/) | Easy | [cpp](./solutions/0001-0500/0392-is-subsequence.cpp) |
| 0393 | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation/) | Medium | [cpp](./solutions/0001-0500/0393-utf-8-validation.cpp) |
| 0399 | [Evaluate Division](https://leetcode.com/problems/evaluate-division/) | Medium | [cpp](./solutions/0001-0500/0399-evaluate-division.cpp) |
| 0403 | [Frog Jump](https://leetcode.com/problems/frog-jump/) | Hard | [python3](./solutions/0001-0500/0403-frog-jump.py) |
| 0404 | [Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/) | Easy | [java](./solutions/0001-0500/0404-sum-of-left-leaves.java) |
| 0409 | [Longest Palindrome](https://leetcode.com/problems/longest-palindrome/) | Easy | [python3](./solutions/0001-0500/0409-longest-palindrome.py) |
| 0412 | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz/) | Easy | [java](./solutions/0001-0500/0412-fizz-buzz.java) |
| 0413 | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/) | Medium | [java](./solutions/0001-0500/0413-arithmetic-slices.java) |
| 0414 | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number/) | Easy | [python3](./solutions/0001-0500/0414-third-maximum-number.py) |
| 0415 | [Add Strings](https://leetcode.com/problems/add-strings/) | Easy | [python3](./solutions/0001-0500/0415-add-strings.py) |
| 0416 | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/) | Medium | [python3](./solutions/0001-0500/0416-partition-equal-subset-sum.py) |
| 0417 | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/) | Medium | [cpp](./solutions/0001-0500/0417-pacific-atlantic-water-flow.cpp) |
| 0424 | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) | Medium | [java](./solutions/0001-0500/0424-longest-repeating-character-replacement.java) |
| 0429 | [N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal/) | Medium | [cpp](./solutions/0001-0500/0429-n-ary-tree-level-order-traversal.cpp) |
| 0432 | [All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure/) | Hard | [cpp](./solutions/0001-0500/0432-all-oone-data-structure.cpp) |
| 0433 | [Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation/) | Medium | [python3](./solutions/0001-0500/0433-minimum-genetic-mutation.py) |
| 0435 | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/) | Medium | [cpp](./solutions/0001-0500/0435-non-overlapping-intervals.cpp) |
| 0437 | [Path Sum III](https://leetcode.com/problems/path-sum-iii/) | Medium | [java](./solutions/0001-0500/0437-path-sum-iii.java) |
| 0438 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/) | Medium | [java](./solutions/0001-0500/0438-find-all-anagrams-in-a-string.java) |
| 0441 | [Arranging Coins](https://leetcode.com/problems/arranging-coins/) | Easy | [python3](./solutions/0001-0500/0441-arranging-coins.py) |
| 0442 | [Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/) | Medium | [python3](./solutions/0001-0500/0442-find-all-duplicates-in-an-array.py) |
| 0445 | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/) | Medium | [cpp](./solutions/0001-0500/0445-add-two-numbers-ii.cpp) |
| 0449 | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst/) | Medium | [java](./solutions/0001-0500/0449-serialize-and-deserialize-bst.java) |
| 0450 | [Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/) | Medium | [java](./solutions/0001-0500/0450-delete-node-in-a-bst.java) |
| 0451 | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/) | Medium | [cpp](./solutions/0001-0500/0451-sort-characters-by-frequency.cpp) |
| 0455 | [Assign Cookies](https://leetcode.com/problems/assign-cookies/) | Easy | [python3](./solutions/0001-0500/0455-assign-cookies.py) |
| 0456 | [132 Pattern](https://leetcode.com/problems/132-pattern/) | Medium | [cpp](./solutions/0001-0500/0456-132-pattern.cpp) |
| 0459 | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/) | Easy | [cpp](./solutions/0001-0500/0459-repeated-substring-pattern.cpp) |
| 0461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance/) | Easy | [java](./solutions/0001-0500/0461-hamming-distance.java) |
| 0462 | [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/) | Medium | [python3](./solutions/0001-0500/0462-minimum-moves-to-equal-array-elements-ii.py) |
| 0463 | [Island Perimeter](https://leetcode.com/problems/island-perimeter/) | Easy | [java](./solutions/0001-0500/0463-island-perimeter.java) |
| 0470 | [Implement Rand10() Using Rand7()](https://leetcode.com/problems/implement-rand10-using-rand7/) | Medium | [python3](./solutions/0001-0500/0470-implement-rand10-using-rand7.py) |
| 0473 | [Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square/) | Medium | [python3](./solutions/0001-0500/0473-matchsticks-to-square.py) |
| 0476 | [Number Complement](https://leetcode.com/problems/number-complement/) | Easy | [cpp](./solutions/0001-0500/0476-number-complement.cpp) |
| 0485 | [Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/) | Easy | [java](./solutions/0001-0500/0485-max-consecutive-ones.java) |
| 0486 | [Predict the Winner](https://leetcode.com/problems/predict-the-winner/) | Medium | [cpp](./solutions/0001-0500/0486-predict-the-winner.cpp) |
| 0491 | [Non-decreasing Subsequences](https://leetcode.com/problems/non-decreasing-subsequences/) | Medium | [cpp](./solutions/0001-0500/0491-non-decreasing-subsequences.cpp) |
| 0494 | [Target Sum](https://leetcode.com/problems/target-sum/) | Medium | [python3](./solutions/0001-0500/0494-target-sum.py) |
| 0496 | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/) | Easy | [java](./solutions/0001-0500/0496-next-greater-element-i.java) |
| 0502 | [IPO](https://leetcode.com/problems/ipo/) | Hard | [cpp](./solutions/0501-1000/0502-ipo.cpp) |
| 0506 | [Relative Ranks](https://leetcode.com/problems/relative-ranks/) | Easy | [java](./solutions/0501-1000/0506-relative-ranks.java) |
| 0507 | [Perfect Number](https://leetcode.com/problems/perfect-number/) | Easy | [cpp](./solutions/0501-1000/0507-perfect-number.cpp) |
| 0508 | [Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum/) | Medium | [java](./solutions/0501-1000/0508-most-frequent-subtree-sum.java) |
| 0509 | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number/) | Easy | [python3](./solutions/0501-1000/0509-fibonacci-number.py) |
| 0513 | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/) | Medium | [java](./solutions/0501-1000/0513-find-bottom-left-tree-value.java) |
| 0515 | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/) | Medium | [java](./solutions/0501-1000/0515-find-largest-value-in-each-tree-row.java) |
| 0516 | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/) | Medium | [cpp](./solutions/0501-1000/0516-longest-palindromic-subsequence.cpp) |
| 0518 | [Coin Change II](https://leetcode.com/problems/coin-change-ii/) | Medium | [cpp](./solutions/0501-1000/0518-coin-change-ii.cpp) |
| 0520 | [Detect Capital](https://leetcode.com/problems/detect-capital/) | Easy | [python3](./solutions/0501-1000/0520-detect-capital.py) |
| 0521 | [Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i/) | Easy | [java](./solutions/0501-1000/0521-longest-uncommon-subsequence-i.java) |
| 0522 | [Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii/) | Medium | [java](./solutions/0501-1000/0522-longest-uncommon-subsequence-ii.java) |
| 0523 | [Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/) | Medium | [cpp](./solutions/0501-1000/0523-continuous-subarray-sum.cpp) |
| 0524 | [Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/) | Medium | [cpp](./solutions/0501-1000/0524-longest-word-in-dictionary-through-deleting.cpp) |
| 0530 | [Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/) | Easy | [cpp](./solutions/0501-1000/0530-minimum-absolute-difference-in-bst.cpp) |
| 0532 | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/) | Medium | [cpp](./solutions/0501-1000/0532-k-diff-pairs-in-an-array.cpp) |
| 0537 | [Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication/) | Medium | [java](./solutions/0501-1000/0537-complex-number-multiplication.java) |
| 0538 | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/) | Medium | [python3](./solutions/0501-1000/0538-convert-bst-to-greater-tree.py) |
| 0542 | [01 Matrix](https://leetcode.com/problems/01-matrix/) | Medium | [cpp](./solutions/0501-1000/0542-01-matrix.cpp) |
| 0543 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) | Easy | [java](./solutions/0501-1000/0543-diameter-of-binary-tree.java) |
| 0546 | [Remove Boxes](https://leetcode.com/problems/remove-boxes/) | Hard | [python3](./solutions/0501-1000/0546-remove-boxes.py) |
| 0547 | [Number of Provinces](https://leetcode.com/problems/number-of-provinces/) | Medium | [cpp](./solutions/0501-1000/0547-number-of-provinces.cpp) |
| 0557 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/) | Easy | [python3](./solutions/0501-1000/0557-reverse-words-in-a-string-iii.py) |
| 0559 | [Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree/) | Easy | [java](./solutions/0501-1000/0559-maximum-depth-of-n-ary-tree.java) |
| 0560 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [java](./solutions/0501-1000/0560-subarray-sum-equals-k.java) |
| 0561 | [Array Partition](https://leetcode.com/problems/array-partition/) | Easy | [cpp](./solutions/0501-1000/0561-array-partition.cpp) |
| 0563 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/) | Easy | [cpp](./solutions/0501-1000/0563-binary-tree-tilt.cpp) |
| 0566 | [Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix/) | Easy | [java](./solutions/0501-1000/0566-reshape-the-matrix.java) |
| 0567 | [Permutation in String](https://leetcode.com/problems/permutation-in-string/) | Medium | [cpp](./solutions/0501-1000/0567-permutation-in-string.cpp) |
| 0572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/) | Easy | [java](./solutions/0501-1000/0572-subtree-of-another-tree.java) |
| 0576 | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths/) | Medium | [python3](./solutions/0501-1000/0576-out-of-boundary-paths.py) |
| 0583 | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings/) | Medium | [java](./solutions/0501-1000/0583-delete-operation-for-two-strings.java) |
| 0584 | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee/) | Easy | [postgresql](./solutions/0501-1000/0584-find-customer-referee.txt) |
| 0586 | [Customer Placing the Largest Number of Orders](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders/) | Easy | [postgresql](./solutions/0501-1000/0586-customer-placing-the-largest-number-of-orders.txt) |
| 0589 | [N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal/) | Easy | [java](./solutions/0501-1000/0589-n-ary-tree-preorder-traversal.java) |
| 0590 | [N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal/) | Easy | [cpp](./solutions/0501-1000/0590-n-ary-tree-postorder-traversal.cpp) |
| 0595 | [Big Countries](https://leetcode.com/problems/big-countries/) | Easy | [mysql](./solutions/0501-1000/0595-big-countries.sql) |
| 0596 | [Classes With at Least 5 Students](https://leetcode.com/problems/classes-with-at-least-5-students/) | Easy | [postgresql](./solutions/0501-1000/0596-classes-with-at-least-5-students.txt) |
| 0598 | [Range Addition II](https://leetcode.com/problems/range-addition-ii/) | Easy | [java](./solutions/0501-1000/0598-range-addition-ii.java) |
| 0606 | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree/) | Medium | [cpp](./solutions/0501-1000/0606-construct-string-from-binary-tree.cpp) |
| 0607 | [Sales Person](https://leetcode.com/problems/sales-person/) | Easy | [postgresql](./solutions/0501-1000/0607-sales-person.txt) |
| 0608 | [Tree Node](https://leetcode.com/problems/tree-node/) | Medium | [postgresql](./solutions/0501-1000/0608-tree-node.txt) |
| 0609 | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system/) | Medium | [cpp](./solutions/0501-1000/0609-find-duplicate-file-in-system.cpp) |
| 0610 | [Triangle Judgement](https://leetcode.com/problems/triangle-judgement/) | Easy | [postgresql](./solutions/0501-1000/0610-triangle-judgement.txt) |
| 0617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/) | Easy | [python3](./solutions/0501-1000/0617-merge-two-binary-trees.py) |
| 0620 | [Not Boring Movies](https://leetcode.com/problems/not-boring-movies/) | Easy | [postgresql](./solutions/0501-1000/0620-not-boring-movies.txt) |
| 0622 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue/) | Medium | [cpp](./solutions/0501-1000/0622-design-circular-queue.cpp) |
| 0623 | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree/) | Medium | [java](./solutions/0501-1000/0623-add-one-row-to-tree.java) |
| 0624 | [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays/) | Medium | [cpp](./solutions/0501-1000/0624-maximum-distance-in-arrays.cpp) |
| 0633 | [Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers/) | Medium | [cpp](./solutions/0501-1000/0633-sum-of-square-numbers.cpp) |
| 0637 | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/) | Easy | [cpp](./solutions/0501-1000/0637-average-of-levels-in-binary-tree.cpp) |
| 0638 | [Shopping Offers](https://leetcode.com/problems/shopping-offers/) | Medium | [python3](./solutions/0501-1000/0638-shopping-offers.py) |
| 0641 | [Design Circular Deque](https://leetcode.com/problems/design-circular-deque/) | Medium | [cpp](./solutions/0501-1000/0641-design-circular-deque.cpp) |
| 0645 | [Set Mismatch](https://leetcode.com/problems/set-mismatch/) | Easy | [cpp](./solutions/0501-1000/0645-set-mismatch.cpp) |
| 0646 | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain/) | Medium | [cpp](./solutions/0501-1000/0646-maximum-length-of-pair-chain.cpp) |
| 0647 | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) | Medium | [cpp](./solutions/0501-1000/0647-palindromic-substrings.cpp) |
| 0648 | [Replace Words](https://leetcode.com/problems/replace-words/) | Medium | [cpp](./solutions/0501-1000/0648-replace-words.cpp) |
| 0649 | [Dota2 Senate](https://leetcode.com/problems/dota2-senate/) | Medium | [cpp](./solutions/0501-1000/0649-dota2-senate.cpp) |
| 0650 | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard/) | Medium | [cpp](./solutions/0501-1000/0650-2-keys-keyboard.cpp) |
| 0653 | [Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/) | Easy | [java](./solutions/0501-1000/0653-two-sum-iv-input-is-a-bst.java) |
| 0654 | [Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree/) | Medium | [python3](./solutions/0501-1000/0654-maximum-binary-tree.py) |
| 0658 | [Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements/) | Medium | [cpp](./solutions/0501-1000/0658-find-k-closest-elements.cpp) |
| 0659 | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences/) | Medium | [cpp](./solutions/0501-1000/0659-split-array-into-consecutive-subsequences.cpp) |
| 0662 | [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree/) | Medium | [python3](./solutions/0501-1000/0662-maximum-width-of-binary-tree.py) |
| 0664 | [Strange Printer](https://leetcode.com/problems/strange-printer/) | Hard | [python3](./solutions/0501-1000/0664-strange-printer.py) |
| 0670 | [Maximum Swap](https://leetcode.com/problems/maximum-swap/) | Medium | [cpp](./solutions/0501-1000/0670-maximum-swap.cpp) |
| 0673 | [Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence/) | Medium | [cpp](./solutions/0501-1000/0673-number-of-longest-increasing-subsequence.cpp) |
| 0674 | [Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence/) | Easy | [java](./solutions/0501-1000/0674-longest-continuous-increasing-subsequence.java) |
| 0682 | [Baseball Game](https://leetcode.com/problems/baseball-game/) | Easy | [java](./solutions/0501-1000/0682-baseball-game.java) |
| 0687 | [Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path/) | Medium | [java](./solutions/0501-1000/0687-longest-univalue-path.java) |
| 0688 | [Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard/) | Medium | [cpp](./solutions/0501-1000/0688-knight-probability-in-chessboard.cpp) |
| 0690 | [Employee Importance](https://leetcode.com/problems/employee-importance/) | Medium | [java](./solutions/0501-1000/0690-employee-importance.java) |
| 0692 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/) | Medium | [cpp](./solutions/0501-1000/0692-top-k-frequent-words.cpp) |
| 0695 | [Max Area of Island](https://leetcode.com/problems/max-area-of-island/) | Medium | [cpp](./solutions/0501-1000/0695-max-area-of-island.cpp) |
| 0700 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/) | Easy | [python3](./solutions/0501-1000/0700-search-in-a-binary-search-tree.py) |
| 0701 | [Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/) | Medium | [java](./solutions/0501-1000/0701-insert-into-a-binary-search-tree.java) |
| 0703 | [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/) | Easy | [cpp](./solutions/0501-1000/0703-kth-largest-element-in-a-stream.cpp) |
| 0704 | [Binary Search](https://leetcode.com/problems/binary-search/) | Easy | [cpp](./solutions/0501-1000/0704-binary-search.cpp) |
| 0705 | [Design HashSet](https://leetcode.com/problems/design-hashset/) | Easy | [cpp](./solutions/0501-1000/0705-design-hashset.cpp) |
| 0706 | [Design HashMap](https://leetcode.com/problems/design-hashmap/) | Easy | [cpp](./solutions/0501-1000/0706-design-hashmap.cpp) |
| 0707 | [Design Linked List](https://leetcode.com/problems/design-linked-list/) | Medium | [java](./solutions/0501-1000/0707-design-linked-list.java) |
| 0709 | [To Lower Case](https://leetcode.com/problems/to-lower-case/) | Easy | [python3](./solutions/0501-1000/0709-to-lower-case.py) |
| 0712 | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/) | Medium | [python3](./solutions/0501-1000/0712-minimum-ascii-delete-sum-for-two-strings.py) |
| 0713 | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k/) | Medium | [cpp](./solutions/0501-1000/0713-subarray-product-less-than-k.cpp) |
| 0714 | [Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/) | Medium | [cpp](./solutions/0501-1000/0714-best-time-to-buy-and-sell-stock-with-transaction-fee.cpp) |
| 0718 | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/) | Medium | [cpp](./solutions/0501-1000/0718-maximum-length-of-repeated-subarray.cpp) |
| 0719 | [Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance/) | Hard | [cpp](./solutions/0501-1000/0719-find-k-th-smallest-pair-distance.cpp) |
| 0724 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index/) | Easy | [java](./solutions/0501-1000/0724-find-pivot-index.java) |
| 0725 | [Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts/) | Medium | [cpp](./solutions/0501-1000/0725-split-linked-list-in-parts.cpp) |
| 0728 | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers/) | Easy | [cpp](./solutions/0501-1000/0728-self-dividing-numbers.cpp) |
| 0733 | [Flood Fill](https://leetcode.com/problems/flood-fill/) | Easy | [java](./solutions/0501-1000/0733-flood-fill.java) |
| 0735 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision/) | Medium | [cpp](./solutions/0501-1000/0735-asteroid-collision.cpp) |
| 0739 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures/) | Medium | [cpp](./solutions/0501-1000/0739-daily-temperatures.cpp) |
| 0740 | [Delete and Earn](https://leetcode.com/problems/delete-and-earn/) | Medium | [cpp](./solutions/0501-1000/0740-delete-and-earn.cpp) |
| 0743 | [Network Delay Time](https://leetcode.com/problems/network-delay-time/) | Medium | [cpp](./solutions/0501-1000/0743-network-delay-time.cpp) |
| 0744 | [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target/) | Easy | [cpp](./solutions/0501-1000/0744-find-smallest-letter-greater-than-target.cpp) |
| 0746 | [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/) | Easy | [cpp](./solutions/0501-1000/0746-min-cost-climbing-stairs.cpp) |
| 0747 | [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others/) | Easy | [cpp](./solutions/0501-1000/0747-largest-number-at-least-twice-of-others.cpp) |
| 0752 | [Open the Lock](https://leetcode.com/problems/open-the-lock/) | Medium | [python3](./solutions/0501-1000/0752-open-the-lock.py) |
| 0763 | [Partition Labels](https://leetcode.com/problems/partition-labels/) | Medium | [java](./solutions/0501-1000/0763-partition-labels.java) |
| 0766 | [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix/) | Easy | [cpp](./solutions/0501-1000/0766-toeplitz-matrix.cpp) |
| 0767 | [Reorganize String](https://leetcode.com/problems/reorganize-string/) | Medium | [cpp](./solutions/0501-1000/0767-reorganize-string.cpp) |
| 0771 | [Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/) | Easy | [python3](./solutions/0501-1000/0771-jewels-and-stones.py) |
| 0778 | [Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water/) | Hard | [cpp](./solutions/0501-1000/0778-swim-in-rising-water.cpp) |
| 0783 | [Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/) | Easy | [java](./solutions/0501-1000/0783-minimum-distance-between-bst-nodes.java) |
| 0784 | [Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation/) | Medium | [python3](./solutions/0501-1000/0784-letter-case-permutation.py) |
| 0785 | [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite/) | Medium | [cpp](./solutions/0501-1000/0785-is-graph-bipartite.cpp) |
| 0787 | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops/) | Medium | [python3](./solutions/0501-1000/0787-cheapest-flights-within-k-stops.py) |
| 0792 | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences/) | Medium | [cpp](./solutions/0501-1000/0792-number-of-matching-subsequences.cpp) |
| 0797 | [All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target/) | Medium | [java](./solutions/0501-1000/0797-all-paths-from-source-to-target.java) |
| 0799 | [Champagne Tower](https://leetcode.com/problems/champagne-tower/) | Medium | [cpp](./solutions/0501-1000/0799-champagne-tower.cpp) |
| 0802 | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states/) | Medium | [cpp](./solutions/0501-1000/0802-find-eventual-safe-states.cpp) |
| 0804 | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/) | Easy | [cpp](./solutions/0501-1000/0804-unique-morse-code-words.cpp) |
| 0808 | [Soup Servings](https://leetcode.com/problems/soup-servings/) | Medium | [python3](./solutions/0501-1000/0808-soup-servings.py) |
| 0814 | [Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning/) | Medium | [cpp](./solutions/0501-1000/0814-binary-tree-pruning.cpp) |
| 0827 | [Making A Large Island](https://leetcode.com/problems/making-a-large-island/) | Hard | [python3](./solutions/0501-1000/0827-making-a-large-island.py) |
| 0837 | [New 21 Game](https://leetcode.com/problems/new-21-game/) | Medium | [cpp](./solutions/0501-1000/0837-new-21-game.cpp) |
| 0838 | [Push Dominoes](https://leetcode.com/problems/push-dominoes/) | Medium | [cpp](./solutions/0501-1000/0838-push-dominoes.cpp) |
| 0839 | [Similar String Groups](https://leetcode.com/problems/similar-string-groups/) | Hard | [python3](./solutions/0501-1000/0839-similar-string-groups.py) |
| 0840 | [Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid/) | Medium | [cpp](./solutions/0501-1000/0840-magic-squares-in-grid.cpp) |
| 0841 | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/) | Medium | [cpp](./solutions/0501-1000/0841-keys-and-rooms.cpp) |
| 0844 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/) | Easy | [java](./solutions/0501-1000/0844-backspace-string-compare.java) |
| 0846 | [Hand of Straights](https://leetcode.com/problems/hand-of-straights/) | Medium | [cpp](./solutions/0501-1000/0846-hand-of-straights.cpp) |
| 0847 | [Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes/) | Hard | [cpp](./solutions/0501-1000/0847-shortest-path-visiting-all-nodes.cpp) |
| 0850 | [Rectangle Area II](https://leetcode.com/problems/rectangle-area-ii/) | Hard | [python3](./solutions/0501-1000/0850-rectangle-area-ii.py) |
| 0852 | [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/) | Medium | [cpp](./solutions/0501-1000/0852-peak-index-in-a-mountain-array.cpp) |
| 0857 | [Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers/) | Hard | [cpp](./solutions/0501-1000/0857-minimum-cost-to-hire-k-workers.cpp) |
| 0859 | [Buddy Strings](https://leetcode.com/problems/buddy-strings/) | Easy | [cpp](./solutions/0501-1000/0859-buddy-strings.cpp) |
| 0860 | [Lemonade Change](https://leetcode.com/problems/lemonade-change/) | Easy | [cpp](./solutions/0501-1000/0860-lemonade-change.cpp) |
| 0863 | [All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/) | Medium | [cpp](./solutions/0501-1000/0863-all-nodes-distance-k-in-binary-tree.cpp) |
| 0864 | [Shortest Path to Get All Keys](https://leetcode.com/problems/shortest-path-to-get-all-keys/) | Hard | [cpp](./solutions/0501-1000/0864-shortest-path-to-get-all-keys.cpp) |
| 0871 | [Minimum Number of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops/) | Hard | [python3](./solutions/0501-1000/0871-minimum-number-of-refueling-stops.py) |
| 0872 | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees/) | Easy | [python3](./solutions/0501-1000/0872-leaf-similar-trees.py) |
| 0874 | [Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation/) | Medium | [cpp](./solutions/0501-1000/0874-walking-robot-simulation.cpp) |
| 0875 | [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas/) | Medium | [python3](./solutions/0501-1000/0875-koko-eating-bananas.py) |
| 0876 | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/) | Easy | [java](./solutions/0501-1000/0876-middle-of-the-linked-list.java) |
| 0877 | [Stone Game](https://leetcode.com/problems/stone-game/) | Medium | [python3](./solutions/0501-1000/0877-stone-game.py) |
| 0879 | [Profitable Schemes](https://leetcode.com/problems/profitable-schemes/) | Hard | [cpp](./solutions/0501-1000/0879-profitable-schemes.cpp) |
| 0880 | [Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index/) | Medium | [cpp](./solutions/0501-1000/0880-decoded-string-at-index.cpp) |
| 0881 | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people/) | Medium | [python3](./solutions/0501-1000/0881-boats-to-save-people.py) |
| 0884 | [Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences/) | Easy | [python3](./solutions/0501-1000/0884-uncommon-words-from-two-sentences.py) |
| 0886 | [Possible Bipartition](https://leetcode.com/problems/possible-bipartition/) | Medium | [python3](./solutions/0501-1000/0886-possible-bipartition.py) |
| 0894 | [All Possible Full Binary Trees](https://leetcode.com/problems/all-possible-full-binary-trees/) | Medium | [cpp](./solutions/0501-1000/0894-all-possible-full-binary-trees.cpp) |
| 0896 | [Monotonic Array](https://leetcode.com/problems/monotonic-array/) | Easy | [cpp](./solutions/0501-1000/0896-monotonic-array.cpp) |
| 0897 | [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree/) | Easy | [python3](./solutions/0501-1000/0897-increasing-order-search-tree.py) |
| 0901 | [Online Stock Span](https://leetcode.com/problems/online-stock-span/) | Medium | [cpp](./solutions/0501-1000/0901-online-stock-span.cpp) |
| 0904 | [Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets/) | Medium | [cpp](./solutions/0501-1000/0904-fruit-into-baskets.cpp) |
| 0905 | [Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity/) | Easy | [cpp](./solutions/0501-1000/0905-sort-array-by-parity.cpp) |
| 0907 | [Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums/) | Medium | [cpp](./solutions/0501-1000/0907-sum-of-subarray-minimums.cpp) |
| 0912 | [Sort an Array](https://leetcode.com/problems/sort-an-array/) | Medium | [cpp](./solutions/0501-1000/0912-sort-an-array.cpp) |
| 0915 | [Partition Array into Disjoint Intervals](https://leetcode.com/problems/partition-array-into-disjoint-intervals/) | Medium | [python3](./solutions/0501-1000/0915-partition-array-into-disjoint-intervals.py) |
| 0918 | [Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray/) | Medium | [python3](./solutions/0501-1000/0918-maximum-sum-circular-subarray.py) |
| 0919 | [Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter/) | Medium | [java](./solutions/0501-1000/0919-complete-binary-tree-inserter.java) |
| 0920 | [Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists/) | Hard | [python3](./solutions/0501-1000/0920-number-of-music-playlists.py) |
| 0926 | [Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing/) | Medium | [python3](./solutions/0501-1000/0926-flip-string-to-monotone-increasing.py) |
| 0931 | [Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum/) | Medium | [python3](./solutions/0501-1000/0931-minimum-falling-path-sum.py) |
| 0934 | [Shortest Bridge](https://leetcode.com/problems/shortest-bridge/) | Medium | [cpp](./solutions/0501-1000/0934-shortest-bridge.cpp) |
| 0938 | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/) | Easy | [python3](./solutions/0501-1000/0938-range-sum-of-bst.py) |
| 0941 | [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array/) | Easy | [java](./solutions/0501-1000/0941-valid-mountain-array.java) |
| 0945 | [Minimum Increment to Make Array Unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique/) | Medium | [cpp](./solutions/0501-1000/0945-minimum-increment-to-make-array-unique.cpp) |
| 0946 | [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences/) | Medium | [python3](./solutions/0501-1000/0946-validate-stack-sequences.py) |
| 0948 | [Bag of Tokens](https://leetcode.com/problems/bag-of-tokens/) | Medium | [cpp](./solutions/0501-1000/0948-bag-of-tokens.cpp) |
| 0951 | [Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees/) | Medium | [java](./solutions/0501-1000/0951-flip-equivalent-binary-trees.java) |
| 0953 | [Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary/) | Easy | [python3](./solutions/0501-1000/0953-verifying-an-alien-dictionary.py) |
| 0954 | [Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs/) | Medium | [python3](./solutions/0501-1000/0954-array-of-doubled-pairs.py) |
| 0956 | [Tallest Billboard](https://leetcode.com/problems/tallest-billboard/) | Hard | [cpp](./solutions/0501-1000/0956-tallest-billboard.cpp) |
| 0958 | [Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree/) | Medium | [java](./solutions/0501-1000/0958-check-completeness-of-a-binary-tree.java) |
| 0959 | [Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes/) | Medium | [cpp](./solutions/0501-1000/0959-regions-cut-by-slashes.cpp) |
| 0962 | [Maximum Width Ramp](https://leetcode.com/problems/maximum-width-ramp/) | Medium | [cpp](./solutions/0501-1000/0962-maximum-width-ramp.cpp) |
| 0965 | [Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree/) | Easy | [python3](./solutions/0501-1000/0965-univalued-binary-tree.py) |
| 0967 | [Numbers With Same Consecutive Differences](https://leetcode.com/problems/numbers-with-same-consecutive-differences/) | Medium | [cpp](./solutions/0501-1000/0967-numbers-with-same-consecutive-differences.cpp) |
| 0973 | [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | Medium | [java](./solutions/0501-1000/0973-k-closest-points-to-origin.java) |
| 0974 | [Subarray Sums Divisible by K](https://leetcode.com/problems/subarray-sums-divisible-by-k/) | Medium | [cpp](./solutions/0501-1000/0974-subarray-sums-divisible-by-k.cpp) |
| 0976 | [Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/) | Easy | [cpp](./solutions/0501-1000/0976-largest-perimeter-triangle.cpp) |
| 0977 | [Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/) | Easy | [java](./solutions/0501-1000/0977-squares-of-a-sorted-array.java) |
| 0979 | [Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree/) | Medium | [java](./solutions/0501-1000/0979-distribute-coins-in-binary-tree.java) |
| 0983 | [Minimum Cost For Tickets](https://leetcode.com/problems/minimum-cost-for-tickets/) | Medium | [java](./solutions/0501-1000/0983-minimum-cost-for-tickets.java) |
| 0985 | [Sum of Even Numbers After Queries](https://leetcode.com/problems/sum-of-even-numbers-after-queries/) | Medium | [cpp](./solutions/0501-1000/0985-sum-of-even-numbers-after-queries.cpp) |
| 0986 | [Interval List Intersections](https://leetcode.com/problems/interval-list-intersections/) | Medium | [java](./solutions/0501-1000/0986-interval-list-intersections.java) |
| 0987 | [Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/) | Hard | [cpp](./solutions/0501-1000/0987-vertical-order-traversal-of-a-binary-tree.cpp) |
| 0990 | [Satisfiability of Equality Equations](https://leetcode.com/problems/satisfiability-of-equality-equations/) | Medium | [cpp](./solutions/0501-1000/0990-satisfiability-of-equality-equations.cpp) |
| 0991 | [Broken Calculator](https://leetcode.com/problems/broken-calculator/) | Medium | [python3](./solutions/0501-1000/0991-broken-calculator.py) |
| 0993 | [Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree/) | Easy | [java](./solutions/0501-1000/0993-cousins-in-binary-tree.java) |
| 0994 | [Rotting Oranges](https://leetcode.com/problems/rotting-oranges/) | Medium | [java](./solutions/0501-1000/0994-rotting-oranges.java) |
| 0995 | [Minimum Number of K Consecutive Bit Flips](https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/) | Hard | [cpp](./solutions/0501-1000/0995-minimum-number-of-k-consecutive-bit-flips.cpp) |
| 0997 | [Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/) | Easy | [java](./solutions/0501-1000/0997-find-the-town-judge.java) |
| 1002 | [Find Common Characters](https://leetcode.com/problems/find-common-characters/) | Easy | [cpp](./solutions/1001-1500/1002-find-common-characters.cpp) |
| 1008 | [Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/) | Medium | [python3](./solutions/1001-1500/1008-construct-binary-search-tree-from-preorder-traversal.py) |
| 1013 | [Partition Array Into Three Parts With Equal Sum](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/) | Easy | [python3](./solutions/1001-1500/1013-partition-array-into-three-parts-with-equal-sum.py) |
| 1014 | [Best Sightseeing Pair](https://leetcode.com/problems/best-sightseeing-pair/) | Medium | [python3](./solutions/1001-1500/1014-best-sightseeing-pair.py) |
| 1015 | [Smallest Integer Divisible by K](https://leetcode.com/problems/smallest-integer-divisible-by-k/) | Medium | [cpp](./solutions/1001-1500/1015-smallest-integer-divisible-by-k.cpp) |
| 1020 | [Number of Enclaves](https://leetcode.com/problems/number-of-enclaves/) | Medium | [cpp](./solutions/1001-1500/1020-number-of-enclaves.cpp) |
| 1022 | [Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/) | Easy | [python3](./solutions/1001-1500/1022-sum-of-root-to-leaf-binary-numbers.py) |
| 1027 | [Longest Arithmetic Subsequence](https://leetcode.com/problems/longest-arithmetic-subsequence/) | Medium | [cpp](./solutions/1001-1500/1027-longest-arithmetic-subsequence.cpp) |
| 1029 | [Two City Scheduling](https://leetcode.com/problems/two-city-scheduling/) | Medium | [java](./solutions/1001-1500/1029-two-city-scheduling.java) |
| 1035 | [Uncrossed Lines](https://leetcode.com/problems/uncrossed-lines/) | Medium | [python3](./solutions/1001-1500/1035-uncrossed-lines.py) |
| 1038 | [Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/) | Medium | [python3](./solutions/1001-1500/1038-binary-search-tree-to-greater-sum-tree.py) |
| 1046 | [Last Stone Weight](https://leetcode.com/problems/last-stone-weight/) | Easy | [cpp](./solutions/1001-1500/1046-last-stone-weight.cpp) |
| 1047 | [Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/) | Easy | [cpp](./solutions/1001-1500/1047-remove-all-adjacent-duplicates-in-string.cpp) |
| 1048 | [Longest String Chain](https://leetcode.com/problems/longest-string-chain/) | Medium | [cpp](./solutions/1001-1500/1048-longest-string-chain.cpp) |
| 1051 | [Height Checker](https://leetcode.com/problems/height-checker/) | Easy | [cpp](./solutions/1001-1500/1051-height-checker.cpp) |
| 1052 | [Grumpy Bookstore Owner](https://leetcode.com/problems/grumpy-bookstore-owner/) | Medium | [python3](./solutions/1001-1500/1052-grumpy-bookstore-owner.py) |
| 1061 | [Lexicographically Smallest Equivalent String](https://leetcode.com/problems/lexicographically-smallest-equivalent-string/) | Medium | [cpp](./solutions/1001-1500/1061-lexicographically-smallest-equivalent-string.cpp) |
| 1091 | [Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/) | Medium | [cpp](./solutions/1001-1500/1091-shortest-path-in-binary-matrix.cpp) |
| 1094 | [Car Pooling](https://leetcode.com/problems/car-pooling/) | Medium | [java](./solutions/1001-1500/1094-car-pooling.java) |
| 1104 | [Path In Zigzag Labelled Binary Tree](https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/) | Medium | [python3](./solutions/1001-1500/1104-path-in-zigzag-labelled-binary-tree.py) |
| 1105 | [Filling Bookcase Shelves](https://leetcode.com/problems/filling-bookcase-shelves/) | Medium | [cpp](./solutions/1001-1500/1105-filling-bookcase-shelves.cpp) |
| 1108 | [Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address/) | Easy | [python3](./solutions/1001-1500/1108-defanging-an-ip-address.py) |
| 1122 | [Relative Sort Array](https://leetcode.com/problems/relative-sort-array/) | Easy | [cpp](./solutions/1001-1500/1122-relative-sort-array.cpp) |
| 1125 | [Smallest Sufficient Team](https://leetcode.com/problems/smallest-sufficient-team/) | Hard | [python3](./solutions/1001-1500/1125-smallest-sufficient-team.py) |
| 1129 | [Shortest Path with Alternating Colors](https://leetcode.com/problems/shortest-path-with-alternating-colors/) | Medium | [python3](./solutions/1001-1500/1129-shortest-path-with-alternating-colors.py) |
| 1137 | [N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/) | Easy | [python3](./solutions/1001-1500/1137-n-th-tribonacci-number.py) |
| 1140 | [Stone Game II](https://leetcode.com/problems/stone-game-ii/) | Medium | [cpp](./solutions/1001-1500/1140-stone-game-ii.cpp) |
| 1143 | [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | Medium | [java](./solutions/1001-1500/1143-longest-common-subsequence.java) |
| 1146 | [Snapshot Array](https://leetcode.com/problems/snapshot-array/) | Medium | [cpp](./solutions/1001-1500/1146-snapshot-array.cpp) |
| 1148 | [Article Views I](https://leetcode.com/problems/article-views-i/) | Easy | [mysql](./solutions/1001-1500/1148-article-views-i.sql) |
| 1155 | [Number of Dice Rolls With Target Sum](https://leetcode.com/problems/number-of-dice-rolls-with-target-sum/) | Medium | [cpp](./solutions/1001-1500/1155-number-of-dice-rolls-with-target-sum.cpp) |
| 1161 | [Maximum Level Sum of a Binary Tree](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/) | Medium | [cpp](./solutions/1001-1500/1161-maximum-level-sum-of-a-binary-tree.cpp) |
| 1162 | [As Far from Land as Possible](https://leetcode.com/problems/as-far-from-land-as-possible/) | Medium | [java](./solutions/1001-1500/1162-as-far-from-land-as-possible.java) |
| 1187 | [Make Array Strictly Increasing](https://leetcode.com/problems/make-array-strictly-increasing/) | Hard | [cpp](./solutions/1001-1500/1187-make-array-strictly-increasing.cpp) |
| 1189 | [Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/) | Easy | [python3](./solutions/1001-1500/1189-maximum-number-of-balloons.py) |
| 1193 | [Monthly Transactions I](https://leetcode.com/problems/monthly-transactions-i/) | Medium | [postgresql](./solutions/1001-1500/1193-monthly-transactions-i.txt) |
| 1203 | [Sort Items by Groups Respecting Dependencies](https://leetcode.com/problems/sort-items-by-groups-respecting-dependencies/) | Hard | [cpp](./solutions/1001-1500/1203-sort-items-by-groups-respecting-dependencies.cpp) |
| 1207 | [Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/) | Easy | [cpp](./solutions/1001-1500/1207-unique-number-of-occurrences.cpp) |
| 1208 | [Get Equal Substrings Within Budget](https://leetcode.com/problems/get-equal-substrings-within-budget/) | Medium | [cpp](./solutions/1001-1500/1208-get-equal-substrings-within-budget.cpp) |
| 1218 | [Longest Arithmetic Subsequence of Given Difference](https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference/) | Medium | [cpp](./solutions/1001-1500/1218-longest-arithmetic-subsequence-of-given-difference.cpp) |
| 1219 | [Path with Maximum Gold](https://leetcode.com/problems/path-with-maximum-gold/) | Medium | [java](./solutions/1001-1500/1219-path-with-maximum-gold.java) |
| 1227 | [Airplane Seat Assignment Probability](https://leetcode.com/problems/airplane-seat-assignment-probability/) | Medium | [java](./solutions/1001-1500/1227-airplane-seat-assignment-probability.java) |
| 1232 | [Check If It Is a Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line/) | Easy | [cpp](./solutions/1001-1500/1232-check-if-it-is-a-straight-line.cpp) |
| 1235 | [Maximum Profit in Job Scheduling](https://leetcode.com/problems/maximum-profit-in-job-scheduling/) | Hard | [java](./solutions/1001-1500/1235-maximum-profit-in-job-scheduling.java) |
| 1248 | [Count Number of Nice Subarrays](https://leetcode.com/problems/count-number-of-nice-subarrays/) | Medium | [python3](./solutions/1001-1500/1248-count-number-of-nice-subarrays.py) |
| 1249 | [Minimum Remove to Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/) | Medium | [java](./solutions/1001-1500/1249-minimum-remove-to-make-valid-parentheses.java) |
| 1250 | [Check If It Is a Good Array](https://leetcode.com/problems/check-if-it-is-a-good-array/) | Hard | [cpp](./solutions/1001-1500/1250-check-if-it-is-a-good-array.cpp) |
| 1254 | [Number of Closed Islands](https://leetcode.com/problems/number-of-closed-islands/) | Medium | [cpp](./solutions/1001-1500/1254-number-of-closed-islands.cpp) |
| 1261 | [Find Elements in a Contaminated Binary Tree](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/) | Medium | [java](./solutions/1001-1500/1261-find-elements-in-a-contaminated-binary-tree.java) |
| 1268 | [Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/) | Medium | [cpp](./solutions/1001-1500/1268-search-suggestions-system.cpp) |
| 1269 | [Number of Ways to Stay in the Same Place After Some Steps](https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/) | Hard | [python3](./solutions/1001-1500/1269-number-of-ways-to-stay-in-the-same-place-after-some-steps.py) |
| 1277 | [Count Square Submatrices with All Ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones/) | Medium | [cpp](./solutions/1001-1500/1277-count-square-submatrices-with-all-ones.cpp) |
| 1281 | [Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/) | Easy | [c](./solutions/1001-1500/1281-subtract-the-product-and-sum-of-digits-of-an-integer.c) |
| 1282 | [Group the People Given the Group Size They Belong To](https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/) | Medium | [cpp](./solutions/1001-1500/1282-group-the-people-given-the-group-size-they-belong-to.cpp) |
| 1284 | [Minimum Number of Flips to Convert Binary Matrix to Zero Matrix](https://leetcode.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/) | Hard | [python3](./solutions/1001-1500/1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix.py) |
| 1290 | [Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/) | Easy | [java](./solutions/1001-1500/1290-convert-binary-number-in-a-linked-list-to-integer.java) |
| 1295 | [Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/) | Easy | [python](./solutions/1001-1500/1295-find-numbers-with-even-number-of-digits.py) |
| 1296 | [Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/) | Medium | [cpp](./solutions/1001-1500/1296-divide-array-in-sets-of-k-consecutive-numbers.cpp) |
| 1302 | [Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/) | Medium | [java](./solutions/1001-1500/1302-deepest-leaves-sum.java) |
| 1305 | [All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/) | Medium | [java](./solutions/1001-1500/1305-all-elements-in-two-binary-search-trees.java) |
| 1306 | [Jump Game III](https://leetcode.com/problems/jump-game-iii/) | Medium | [python3](./solutions/1001-1500/1306-jump-game-iii.py) |
| 1309 | [Decrypt String from Alphabet to Integer Mapping](https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping/) | Easy | [python3](./solutions/1001-1500/1309-decrypt-string-from-alphabet-to-integer-mapping.py) |
| 1310 | [XOR Queries of a Subarray](https://leetcode.com/problems/xor-queries-of-a-subarray/) | Medium | [cpp](./solutions/1001-1500/1310-xor-queries-of-a-subarray.cpp) |
| 1312 | [Minimum Insertion Steps to Make a String Palindrome](https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/) | Hard | [cpp](./solutions/1001-1500/1312-minimum-insertion-steps-to-make-a-string-palindrome.cpp) |
| 1314 | [Matrix Block Sum](https://leetcode.com/problems/matrix-block-sum/) | Medium | [python3](./solutions/1001-1500/1314-matrix-block-sum.py) |
| 1315 | [Sum of Nodes with Even-Valued Grandparent](https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/) | Medium | [java](./solutions/1001-1500/1315-sum-of-nodes-with-even-valued-grandparent.java) |
| 1318 | [Minimum Flips to Make a OR b Equal to c](https://leetcode.com/problems/minimum-flips-to-make-a-or-b-equal-to-c/) | Medium | [cpp](./solutions/1001-1500/1318-minimum-flips-to-make-a-or-b-equal-to-c.cpp) |
| 1319 | [Number of Operations to Make Network Connected](https://leetcode.com/problems/number-of-operations-to-make-network-connected/) | Medium | [java](./solutions/1001-1500/1319-number-of-operations-to-make-network-connected.java) |
| 1323 | [Maximum 69 Number](https://leetcode.com/problems/maximum-69-number/) | Easy | [cpp](./solutions/1001-1500/1323-maximum-69-number.cpp) |
| 1325 | [Delete Leaves With a Given Value](https://leetcode.com/problems/delete-leaves-with-a-given-value/) | Medium | [python3](./solutions/1001-1500/1325-delete-leaves-with-a-given-value.py) |
| 1326 | [Minimum Number of Taps to Open to Water a Garden](https://leetcode.com/problems/minimum-number-of-taps-to-open-to-water-a-garden/) | Hard | [cpp](./solutions/1001-1500/1326-minimum-number-of-taps-to-open-to-water-a-garden.cpp) |
| 1332 | [Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/) | Easy | [python3](./solutions/1001-1500/1332-remove-palindromic-subsequences.py) |
| 1337 | [The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/) | Easy | [cpp](./solutions/1001-1500/1337-the-k-weakest-rows-in-a-matrix.cpp) |
| 1339 | [Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/) | Medium | [cpp](./solutions/1001-1500/1339-maximum-product-of-splitted-binary-tree.cpp) |
| 1342 | [Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/) | Easy | [python3](./solutions/1001-1500/1342-number-of-steps-to-reduce-a-number-to-zero.py) |
| 1343 | [Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold](https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/) | Medium | [java](./solutions/1001-1500/1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.java) |
| 1345 | [Jump Game IV](https://leetcode.com/problems/jump-game-iv/) | Hard | [cpp](./solutions/1001-1500/1345-jump-game-iv.cpp) |
| 1346 | [Check If N and Its Double Exist](https://leetcode.com/problems/check-if-n-and-its-double-exist/) | Easy | [java](./solutions/1001-1500/1346-check-if-n-and-its-double-exist.java) |
| 1351 | [Count Negative Numbers in a Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/) | Easy | [cpp](./solutions/1001-1500/1351-count-negative-numbers-in-a-sorted-matrix.cpp) |
| 1352 | [Product of the Last K Numbers](https://leetcode.com/problems/product-of-the-last-k-numbers/) | Medium | [java](./solutions/1001-1500/1352-product-of-the-last-k-numbers.java) |
| 1356 | [Sort Integers by The Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/) | Easy | [python3](./solutions/1001-1500/1356-sort-integers-by-the-number-of-1-bits.py) |
| 1358 | [Number of Substrings Containing All Three Characters](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/) | Medium | [java](./solutions/1001-1500/1358-number-of-substrings-containing-all-three-characters.java) |
| 1359 | [Count All Valid Pickup and Delivery Options](https://leetcode.com/problems/count-all-valid-pickup-and-delivery-options/) | Hard | [cpp](./solutions/1001-1500/1359-count-all-valid-pickup-and-delivery-options.cpp) |
| 1365 | [How Many Numbers Are Smaller Than the Current Number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/) | Easy | [python3](./solutions/1001-1500/1365-how-many-numbers-are-smaller-than-the-current-number.py) |
| 1367 | [Linked List in Binary Tree](https://leetcode.com/problems/linked-list-in-binary-tree/) | Medium | [cpp](./solutions/1001-1500/1367-linked-list-in-binary-tree.cpp) |
| 1371 | [Find the Longest Substring Containing Vowels in Even Counts](https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/) | Medium | [cpp](./solutions/1001-1500/1371-find-the-longest-substring-containing-vowels-in-even-counts.cpp) |
| 1372 | [Longest ZigZag Path in a Binary Tree](https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/) | Medium | [cpp](./solutions/1001-1500/1372-longest-zigzag-path-in-a-binary-tree.cpp) |
| 1376 | [Time Needed to Inform All Employees](https://leetcode.com/problems/time-needed-to-inform-all-employees/) | Medium | [cpp](./solutions/1001-1500/1376-time-needed-to-inform-all-employees.cpp) |
| 1377 | [Frog Position After T Seconds](https://leetcode.com/problems/frog-position-after-t-seconds/) | Hard | [cpp](./solutions/1001-1500/1377-frog-position-after-t-seconds.cpp) |
| 1379 | [Find a Corresponding Node of a Binary Tree in a Clone of That Tree](https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/) | Easy | [python3](./solutions/1001-1500/1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.py) |
| 1382 | [Balance a Binary Search Tree](https://leetcode.com/problems/balance-a-binary-search-tree/) | Medium | [java](./solutions/1001-1500/1382-balance-a-binary-search-tree.java) |
| 1383 | [Maximum Performance of a Team](https://leetcode.com/problems/maximum-performance-of-a-team/) | Hard | [cpp](./solutions/1001-1500/1383-maximum-performance-of-a-team.cpp) |
| 1385 | [Find the Distance Value Between Two Arrays](https://leetcode.com/problems/find-the-distance-value-between-two-arrays/) | Easy | [python3](./solutions/1001-1500/1385-find-the-distance-value-between-two-arrays.py) |
| 1387 | [Sort Integers by The Power Value](https://leetcode.com/problems/sort-integers-by-the-power-value/) | Medium | [python3](./solutions/1001-1500/1387-sort-integers-by-the-power-value.py) |
| 1394 | [Find Lucky Integer in an Array](https://leetcode.com/problems/find-lucky-integer-in-an-array/) | Easy | [python3](./solutions/1001-1500/1394-find-lucky-integer-in-an-array.py) |
| 1395 | [Count Number of Teams](https://leetcode.com/problems/count-number-of-teams/) | Medium | [cpp](./solutions/1001-1500/1395-count-number-of-teams.cpp) |
| 1396 | [Design Underground System](https://leetcode.com/problems/design-underground-system/) | Medium | [cpp](./solutions/1001-1500/1396-design-underground-system.cpp) |
| 1402 | [Reducing Dishes](https://leetcode.com/problems/reducing-dishes/) | Hard | [cpp](./solutions/1001-1500/1402-reducing-dishes.cpp) |
| 1403 | [Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/) | Easy | [python3](./solutions/1001-1500/1403-minimum-subsequence-in-non-increasing-order.py) |
| 1404 | [Number of Steps to Reduce a Number in Binary Representation to One](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/) | Medium | [cpp](./solutions/1001-1500/1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one.cpp) |
| 1406 | [Stone Game III](https://leetcode.com/problems/stone-game-iii/) | Hard | [cpp](./solutions/1001-1500/1406-stone-game-iii.cpp) |
| 1416 | [Restore The Array](https://leetcode.com/problems/restore-the-array/) | Hard | [cpp](./solutions/1001-1500/1416-restore-the-array.cpp) |
| 1420 | [Build Array Where You Can Find The Maximum Exactly K Comparisons](https://leetcode.com/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons/) | Hard | [cpp](./solutions/1001-1500/1420-build-array-where-you-can-find-the-maximum-exactly-k-comparisons.cpp) |
| 1425 | [Constrained Subsequence Sum](https://leetcode.com/problems/constrained-subsequence-sum/) | Hard | [cpp](./solutions/1001-1500/1425-constrained-subsequence-sum.cpp) |
| 1431 | [Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/) | Easy | [python3](./solutions/1001-1500/1431-kids-with-the-greatest-number-of-candies.py) |
| 1436 | [Destination City](https://leetcode.com/problems/destination-city/) | Easy | [python3](./solutions/1001-1500/1436-destination-city.py) |
| 1442 | [Count Triplets That Can Form Two Arrays of Equal XOR](https://leetcode.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor/) | Medium | [cpp](./solutions/1001-1500/1442-count-triplets-that-can-form-two-arrays-of-equal-xor.cpp) |
| 1443 | [Minimum Time to Collect All Apples in a Tree](https://leetcode.com/problems/minimum-time-to-collect-all-apples-in-a-tree/) | Medium | [cpp](./solutions/1001-1500/1443-minimum-time-to-collect-all-apples-in-a-tree.cpp) |
| 1444 | [Number of Ways of Cutting a Pizza](https://leetcode.com/problems/number-of-ways-of-cutting-a-pizza/) | Hard | [cpp](./solutions/1001-1500/1444-number-of-ways-of-cutting-a-pizza.cpp) |
| 1448 | [Count Good Nodes in Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/) | Medium | [cpp](./solutions/1001-1500/1448-count-good-nodes-in-binary-tree.cpp) |
| 1450 | [Number of Students Doing Homework at a Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/) | Easy | [python3](./solutions/1001-1500/1450-number-of-students-doing-homework-at-a-given-time.py) |
| 1456 | [Maximum Number of Vowels in a Substring of Given Length](https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/) | Medium | [cpp](./solutions/1001-1500/1456-maximum-number-of-vowels-in-a-substring-of-given-length.cpp) |
| 1457 | [Pseudo-Palindromic Paths in a Binary Tree](https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/) | Medium | [cpp](./solutions/1001-1500/1457-pseudo-palindromic-paths-in-a-binary-tree.cpp) |
| 1458 | [Max Dot Product of Two Subsequences](https://leetcode.com/problems/max-dot-product-of-two-subsequences/) | Hard | [cpp](./solutions/1001-1500/1458-max-dot-product-of-two-subsequences.cpp) |
| 1460 | [Make Two Arrays Equal by Reversing Subarrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-subarrays/) | Easy | [cpp](./solutions/1001-1500/1460-make-two-arrays-equal-by-reversing-subarrays.cpp) |
| 1464 | [Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/) | Easy | [java](./solutions/1001-1500/1464-maximum-product-of-two-elements-in-an-array.java) |
| 1465 | [Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts](https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/) | Medium | [python3](./solutions/1001-1500/1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts.py) |
| 1466 | [Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/) | Medium | [python3](./solutions/1001-1500/1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.py) |
| 1470 | [Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/) | Easy | [python3](./solutions/1001-1500/1470-shuffle-the-array.py) |
| 1472 | [Design Browser History](https://leetcode.com/problems/design-browser-history/) | Medium | [cpp](./solutions/1001-1500/1472-design-browser-history.cpp) |
| 1480 | [Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/) | Easy | [python3](./solutions/1001-1500/1480-running-sum-of-1d-array.py) |
| 1483 | [Kth Ancestor of a Tree Node](https://leetcode.com/problems/kth-ancestor-of-a-tree-node/) | Hard | [cpp](./solutions/1001-1500/1483-kth-ancestor-of-a-tree-node.cpp) |
| 1489 | [Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/) | Hard | [cpp](./solutions/1001-1500/1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.cpp) |
| 1491 | [Average Salary Excluding the Minimum and Maximum Salary](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/) | Easy | [cpp](./solutions/1001-1500/1491-average-salary-excluding-the-minimum-and-maximum-salary.cpp) |
| 1492 | [The kth Factor of n](https://leetcode.com/problems/the-kth-factor-of-n/) | Medium | [cpp](./solutions/1001-1500/1492-the-kth-factor-of-n.cpp) |
| 1493 | [Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/) | Medium | [cpp](./solutions/1001-1500/1493-longest-subarray-of-1s-after-deleting-one-element.cpp) |
| 1498 | [Number of Subsequences That Satisfy the Given Sum Condition](https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/) | Medium | [cpp](./solutions/1001-1500/1498-number-of-subsequences-that-satisfy-the-given-sum-condition.cpp) |
| 1502 | [Can Make Arithmetic Progression From Sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/) | Easy | [cpp](./solutions/1501-2000/1502-can-make-arithmetic-progression-from-sequence.cpp) |
| 1508 | [Range Sum of Sorted Subarray Sums](https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/) | Medium | [cpp](./solutions/1501-2000/1508-range-sum-of-sorted-subarray-sums.cpp) |
| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves](https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves/) | Medium | [cpp](./solutions/1501-2000/1509-minimum-difference-between-largest-and-smallest-value-in-three-moves.cpp) |
| 1512 | [Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs/) | Easy | [cpp](./solutions/1501-2000/1512-number-of-good-pairs.cpp) |
| 1514 | [Path with Maximum Probability](https://leetcode.com/problems/path-with-maximum-probability/) | Medium | [cpp](./solutions/1501-2000/1514-path-with-maximum-probability.cpp) |
| 1519 | [Number of Nodes in the Sub-Tree With the Same Label](https://leetcode.com/problems/number-of-nodes-in-the-sub-tree-with-the-same-label/) | Medium | [cpp](./solutions/1501-2000/1519-number-of-nodes-in-the-sub-tree-with-the-same-label.cpp) |
| 1523 | [Count Odd Numbers in an Interval Range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/) | Easy | [c](./solutions/1501-2000/1523-count-odd-numbers-in-an-interval-range.c) |
| 1528 | [Shuffle String](https://leetcode.com/problems/shuffle-string/) | Easy | [python3](./solutions/1501-2000/1528-shuffle-string.py) |
| 1530 | [Number of Good Leaf Nodes Pairs](https://leetcode.com/problems/number-of-good-leaf-nodes-pairs/) | Medium | [cpp](./solutions/1501-2000/1530-number-of-good-leaf-nodes-pairs.cpp) |
| 1534 | [Count Good Triplets](https://leetcode.com/problems/count-good-triplets/) | Easy | [python3](./solutions/1501-2000/1534-count-good-triplets.py) |
| 1547 | [Minimum Cost to Cut a Stick](https://leetcode.com/problems/minimum-cost-to-cut-a-stick/) | Hard | [cpp](./solutions/1501-2000/1547-minimum-cost-to-cut-a-stick.cpp) |
| 1550 | [Three Consecutive Odds](https://leetcode.com/problems/three-consecutive-odds/) | Easy | [cpp](./solutions/1501-2000/1550-three-consecutive-odds.cpp) |
| 1557 | [Minimum Number of Vertices to Reach All Nodes](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/) | Medium | [cpp](./solutions/1501-2000/1557-minimum-number-of-vertices-to-reach-all-nodes.cpp) |
| 1567 | [Maximum Length of Subarray With Positive Product](https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/) | Medium | [python3](./solutions/1501-2000/1567-maximum-length-of-subarray-with-positive-product.py) |
| 1569 | [Number of Ways to Reorder Array to Get Same BST](https://leetcode.com/problems/number-of-ways-to-reorder-array-to-get-same-bst/) | Hard | [python3](./solutions/1501-2000/1569-number-of-ways-to-reorder-array-to-get-same-bst.py) |
| 1572 | [Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/) | Easy | [python3](./solutions/1501-2000/1572-matrix-diagonal-sum.py) |
| 1575 | [Count All Possible Routes](https://leetcode.com/problems/count-all-possible-routes/) | Hard | [cpp](./solutions/1501-2000/1575-count-all-possible-routes.cpp) |
| 1578 | [Minimum Time to Make Rope Colorful](https://leetcode.com/problems/minimum-time-to-make-rope-colorful/) | Medium | [cpp](./solutions/1501-2000/1578-minimum-time-to-make-rope-colorful.cpp) |
| 1579 | [Remove Max Number of Edges to Keep Graph Fully Traversable](https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/) | Hard | [python3](./solutions/1501-2000/1579-remove-max-number-of-edges-to-keep-graph-fully-traversable.py) |
| 1584 | [Min Cost to Connect All Points](https://leetcode.com/problems/min-cost-to-connect-all-points/) | Medium | [cpp](./solutions/1501-2000/1584-min-cost-to-connect-all-points.cpp) |
| 1588 | [Sum of All Odd Length Subarrays](https://leetcode.com/problems/sum-of-all-odd-length-subarrays/) | Easy | [python3](./solutions/1501-2000/1588-sum-of-all-odd-length-subarrays.py) |
| 1601 | [Maximum Number of Achievable Transfer Requests](https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests/) | Hard | [cpp](./solutions/1501-2000/1601-maximum-number-of-achievable-transfer-requests.cpp) |
| 1603 | [Design Parking System](https://leetcode.com/problems/design-parking-system/) | Easy | [cpp](./solutions/1501-2000/1603-design-parking-system.cpp) |
| 1609 | [Even Odd Tree](https://leetcode.com/problems/even-odd-tree/) | Medium | [java](./solutions/1501-2000/1609-even-odd-tree.java) |
| 1614 | [Maximum Nesting Depth of the Parentheses](https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/) | Easy | [java](./solutions/1501-2000/1614-maximum-nesting-depth-of-the-parentheses.java) |
| 1615 | [Maximal Network Rank](https://leetcode.com/problems/maximal-network-rank/) | Medium | [cpp](./solutions/1501-2000/1615-maximal-network-rank.cpp) |
| 1631 | [Path With Minimum Effort](https://leetcode.com/problems/path-with-minimum-effort/) | Medium | [cpp](./solutions/1501-2000/1631-path-with-minimum-effort.cpp) |
| 1632 | [Rank Transform of a Matrix](https://leetcode.com/problems/rank-transform-of-a-matrix/) | Hard | [python3](./solutions/1501-2000/1632-rank-transform-of-a-matrix.py) |
| 1636 | [Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/) | Easy | [cpp](./solutions/1501-2000/1636-sort-array-by-increasing-frequency.cpp) |
| 1639 | [Number of Ways to Form a Target String Given a Dictionary](https://leetcode.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary/) | Hard | [cpp](./solutions/1501-2000/1639-number-of-ways-to-form-a-target-string-given-a-dictionary.cpp) |
| 1642 | [Furthest Building You Can Reach](https://leetcode.com/problems/furthest-building-you-can-reach/) | Medium | [cpp](./solutions/1501-2000/1642-furthest-building-you-can-reach.cpp) |
| 1646 | [Get Maximum in Generated Array](https://leetcode.com/problems/get-maximum-in-generated-array/) | Easy | [python3](./solutions/1501-2000/1646-get-maximum-in-generated-array.py) |
| 1647 | [Minimum Deletions to Make Character Frequencies Unique](https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique/) | Medium | [cpp](./solutions/1501-2000/1647-minimum-deletions-to-make-character-frequencies-unique.cpp) |
| 1652 | [Defuse the Bomb](https://leetcode.com/problems/defuse-the-bomb/) | Easy | [cpp](./solutions/1501-2000/1652-defuse-the-bomb.cpp) |
| 1653 | [Minimum Deletions to Make String Balanced](https://leetcode.com/problems/minimum-deletions-to-make-string-balanced/) | Medium | [cpp](./solutions/1501-2000/1653-minimum-deletions-to-make-string-balanced.cpp) |
| 1654 | [Minimum Jumps to Reach Home](https://leetcode.com/problems/minimum-jumps-to-reach-home/) | Medium | [python3](./solutions/1501-2000/1654-minimum-jumps-to-reach-home.py) |
| 1657 | [Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/) | Medium | [cpp](./solutions/1501-2000/1657-determine-if-two-strings-are-close.cpp) |
| 1658 | [Minimum Operations to Reduce X to Zero](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/) | Medium | [cpp](./solutions/1501-2000/1658-minimum-operations-to-reduce-x-to-zero.cpp) |
| 1662 | [Check If Two String Arrays are Equivalent](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/) | Easy | [python3](./solutions/1501-2000/1662-check-if-two-string-arrays-are-equivalent.py) |
| 1664 | [Ways to Make a Fair Array](https://leetcode.com/problems/ways-to-make-a-fair-array/) | Medium | [java](./solutions/1501-2000/1664-ways-to-make-a-fair-array.java) |
| 1672 | [Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth/) | Easy | [python3](./solutions/1501-2000/1672-richest-customer-wealth.py) |
| 1678 | [Goal Parser Interpretation](https://leetcode.com/problems/goal-parser-interpretation/) | Easy | [python3](./solutions/1501-2000/1678-goal-parser-interpretation.py) |
| 1680 | [Concatenation of Consecutive Binary Numbers](https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/) | Medium | [cpp](./solutions/1501-2000/1680-concatenation-of-consecutive-binary-numbers.cpp) |
| 1683 | [Invalid Tweets](https://leetcode.com/problems/invalid-tweets/) | Easy | [mysql](./solutions/1501-2000/1683-invalid-tweets.sql) |
| 1684 | [Count the Number of Consistent Strings](https://leetcode.com/problems/count-the-number-of-consistent-strings/) | Easy | [cpp](./solutions/1501-2000/1684-count-the-number-of-consistent-strings.cpp) |
| 1688 | [Count of Matches in Tournament](https://leetcode.com/problems/count-of-matches-in-tournament/) | Easy | [python3](./solutions/1501-2000/1688-count-of-matches-in-tournament.py) |
| 1695 | [Maximum Erasure Value](https://leetcode.com/problems/maximum-erasure-value/) | Medium | [python3](./solutions/1501-2000/1695-maximum-erasure-value.py) |
| 1697 | [Checking Existence of Edge Length Limited Paths](https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths/) | Hard | [python3](./solutions/1501-2000/1697-checking-existence-of-edge-length-limited-paths.py) |
| 1706 | [Where Will the Ball Fall](https://leetcode.com/problems/where-will-the-ball-fall/) | Medium | [cpp](./solutions/1501-2000/1706-where-will-the-ball-fall.cpp) |
| 1710 | [Maximum Units on a Truck](https://leetcode.com/problems/maximum-units-on-a-truck/) | Easy | [python3](./solutions/1501-2000/1710-maximum-units-on-a-truck.py) |
| 1721 | [Swapping Nodes in a Linked List](https://leetcode.com/problems/swapping-nodes-in-a-linked-list/) | Medium | [c](./solutions/1501-2000/1721-swapping-nodes-in-a-linked-list.c) |
| 1732 | [Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude/) | Easy | [cpp](./solutions/1501-2000/1732-find-the-highest-altitude.cpp) |
| 1748 | [Sum of Unique Elements](https://leetcode.com/problems/sum-of-unique-elements/) | Easy | [java](./solutions/1501-2000/1748-sum-of-unique-elements.java) |
| 1749 | [Maximum Absolute Sum of Any Subarray](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/) | Medium | [java](./solutions/1501-2000/1749-maximum-absolute-sum-of-any-subarray.java) |
| 1751 | [Maximum Number of Events That Can Be Attended II](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended-ii/) | Hard | [cpp](./solutions/1501-2000/1751-maximum-number-of-events-that-can-be-attended-ii.cpp) |
| 1757 | [Recyclable and Low Fat Products](https://leetcode.com/problems/recyclable-and-low-fat-products/) | Easy | [mysql](./solutions/1501-2000/1757-recyclable-and-low-fat-products.sql) |
| 1768 | [Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/) | Easy | [cpp](./solutions/1501-2000/1768-merge-strings-alternately.cpp) |
| 1769 | [Minimum Number of Operations to Move All Balls to Each Box](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/) | Medium | [python3](./solutions/1501-2000/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.py) |
| 1770 | [Maximum Score from Performing Multiplication Operations](https://leetcode.com/problems/maximum-score-from-performing-multiplication-operations/) | Hard | [cpp](./solutions/1501-2000/1770-maximum-score-from-performing-multiplication-operations.cpp) |
| 1773 | [Count Items Matching a Rule](https://leetcode.com/problems/count-items-matching-a-rule/) | Easy | [python3](./solutions/1501-2000/1773-count-items-matching-a-rule.py) |
| 1779 | [Find Nearest Point That Has the Same X or Y Coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/) | Easy | [c](./solutions/1501-2000/1779-find-nearest-point-that-has-the-same-x-or-y-coordinate.c) |
| 1790 | [Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/) | Easy | [python3](./solutions/1501-2000/1790-check-if-one-string-swap-can-make-strings-equal.py) |
| 1791 | [Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph/) | Easy | [java](./solutions/1501-2000/1791-find-center-of-star-graph.java) |
| 1792 | [Maximum Average Pass Ratio](https://leetcode.com/problems/maximum-average-pass-ratio/) | Medium | [java](./solutions/1501-2000/1792-maximum-average-pass-ratio.java) |
| 1799 | [Maximize Score After N Operations](https://leetcode.com/problems/maximize-score-after-n-operations/) | Hard | [python3](./solutions/1501-2000/1799-maximize-score-after-n-operations.py) |
| 1802 | [Maximum Value at a Given Index in a Bounded Array](https://leetcode.com/problems/maximum-value-at-a-given-index-in-a-bounded-array/) | Medium | [cpp](./solutions/1501-2000/1802-maximum-value-at-a-given-index-in-a-bounded-array.cpp) |
| 1812 | [Determine Color of a Chessboard Square](https://leetcode.com/problems/determine-color-of-a-chessboard-square/) | Easy | [python3](./solutions/1501-2000/1812-determine-color-of-a-chessboard-square.py) |
| 1813 | [Sentence Similarity III](https://leetcode.com/problems/sentence-similarity-iii/) | Medium | [python3](./solutions/1501-2000/1813-sentence-similarity-iii.py) |
| 1814 | [Count Nice Pairs in an Array](https://leetcode.com/problems/count-nice-pairs-in-an-array/) | Medium | [python3](./solutions/1501-2000/1814-count-nice-pairs-in-an-array.py) |
| 1819 | [Number of Different Subsequences GCDs](https://leetcode.com/problems/number-of-different-subsequences-gcds/) | Hard | [cpp](./solutions/1501-2000/1819-number-of-different-subsequences-gcds.cpp) |
| 1822 | [Sign of the Product of an Array](https://leetcode.com/problems/sign-of-the-product-of-an-array/) | Easy | [python3](./solutions/1501-2000/1822-sign-of-the-product-of-an-array.py) |
| 1823 | [Find the Winner of the Circular Game](https://leetcode.com/problems/find-the-winner-of-the-circular-game/) | Medium | [java](./solutions/1501-2000/1823-find-the-winner-of-the-circular-game.java) |
| 1827 | [Minimum Operations to Make the Array Increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/) | Easy | [java](./solutions/1501-2000/1827-minimum-operations-to-make-the-array-increasing.java) |
| 1832 | [Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram/) | Easy | [cpp](./solutions/1501-2000/1832-check-if-the-sentence-is-pangram.cpp) |
| 1834 | [Single-Threaded CPU](https://leetcode.com/problems/single-threaded-cpu/) | Medium | [python3](./solutions/1501-2000/1834-single-threaded-cpu.py) |
| 1837 | [Sum of Digits in Base K](https://leetcode.com/problems/sum-of-digits-in-base-k/) | Easy | [java](./solutions/1501-2000/1837-sum-of-digits-in-base-k.java) |
| 1845 | [Seat Reservation Manager](https://leetcode.com/problems/seat-reservation-manager/) | Medium | [cpp](./solutions/1501-2000/1845-seat-reservation-manager.cpp) |
| 1848 | [Minimum Distance to the Target Element](https://leetcode.com/problems/minimum-distance-to-the-target-element/) | Easy | [java](./solutions/1501-2000/1848-minimum-distance-to-the-target-element.java) |
| 1857 | [Largest Color Value in a Directed Graph](https://leetcode.com/problems/largest-color-value-in-a-directed-graph/) | Hard | [cpp](./solutions/1501-2000/1857-largest-color-value-in-a-directed-graph.cpp) |
| 1859 | [Sorting the Sentence](https://leetcode.com/problems/sorting-the-sentence/) | Easy | [python3](./solutions/1501-2000/1859-sorting-the-sentence.py) |
| 1870 | [Minimum Speed to Arrive on Time](https://leetcode.com/problems/minimum-speed-to-arrive-on-time/) | Medium | [cpp](./solutions/1501-2000/1870-minimum-speed-to-arrive-on-time.cpp) |
| 1877 | [Minimize Maximum Pair Sum in Array](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/) | Medium | [python3](./solutions/1501-2000/1877-minimize-maximum-pair-sum-in-array.py) |
| 1879 | [Minimum XOR Sum of Two Arrays](https://leetcode.com/problems/minimum-xor-sum-of-two-arrays/) | Hard | [cpp](./solutions/1501-2000/1879-minimum-xor-sum-of-two-arrays.cpp) |
| 1894 | [Find the Student that Will Replace the Chalk](https://leetcode.com/problems/find-the-student-that-will-replace-the-chalk/) | Medium | [cpp](./solutions/1501-2000/1894-find-the-student-that-will-replace-the-chalk.cpp) |
| 1905 | [Count Sub Islands](https://leetcode.com/problems/count-sub-islands/) | Medium | [cpp](./solutions/1501-2000/1905-count-sub-islands.cpp) |
| 1911 | [Maximum Alternating Subsequence Sum](https://leetcode.com/problems/maximum-alternating-subsequence-sum/) | Medium | [java](./solutions/1501-2000/1911-maximum-alternating-subsequence-sum.java) |
| 1920 | [Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation/) | Easy | [python3](./solutions/1501-2000/1920-build-array-from-permutation.py) |
| 1921 | [Eliminate Maximum Number of Monsters](https://leetcode.com/problems/eliminate-maximum-number-of-monsters/) | Medium | [cpp](./solutions/1501-2000/1921-eliminate-maximum-number-of-monsters.cpp) |
| 1925 | [Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples/) | Easy | [cpp](./solutions/1501-2000/1925-count-square-sum-triples.cpp) |
| 1926 | [Nearest Exit from Entrance in Maze](https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/) | Medium | [java](./solutions/1501-2000/1926-nearest-exit-from-entrance-in-maze.java) |
| 1929 | [Concatenation of Array](https://leetcode.com/problems/concatenation-of-array/) | Easy | [python3](./solutions/1501-2000/1929-concatenation-of-array.py) |
| 1930 | [Unique Length-3 Palindromic Subsequences](https://leetcode.com/problems/unique-length-3-palindromic-subsequences/) | Medium | [cpp](./solutions/1501-2000/1930-unique-length-3-palindromic-subsequences.cpp) |
| 1937 | [Maximum Number of Points with Cost](https://leetcode.com/problems/maximum-number-of-points-with-cost/) | Medium | [cpp](./solutions/1501-2000/1937-maximum-number-of-points-with-cost.cpp) |
| 1941 | [Check if All Characters Have Equal Number of Occurrences](https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/) | Easy | [python3](./solutions/1501-2000/1941-check-if-all-characters-have-equal-number-of-occurrences.py) |
| 1942 | [The Number of the Smallest Unoccupied Chair](https://leetcode.com/problems/the-number-of-the-smallest-unoccupied-chair/) | Medium | [cpp](./solutions/1501-2000/1942-the-number-of-the-smallest-unoccupied-chair.cpp) |
| 1945 | [Sum of Digits of String After Convert](https://leetcode.com/problems/sum-of-digits-of-string-after-convert/) | Easy | [cpp](./solutions/1501-2000/1945-sum-of-digits-of-string-after-convert.cpp) |
| 1947 | [Maximum Compatibility Score Sum](https://leetcode.com/problems/maximum-compatibility-score-sum/) | Medium | [python3](./solutions/1501-2000/1947-maximum-compatibility-score-sum.py) |
| 1957 | [Delete Characters to Make Fancy String](https://leetcode.com/problems/delete-characters-to-make-fancy-string/) | Easy | [cpp](./solutions/1501-2000/1957-delete-characters-to-make-fancy-string.cpp) |
| 1964 | [Find the Longest Valid Obstacle Course at Each Position](https://leetcode.com/problems/find-the-longest-valid-obstacle-course-at-each-position/) | Hard | [cpp](./solutions/1501-2000/1964-find-the-longest-valid-obstacle-course-at-each-position.cpp) |
| 1970 | [Last Day Where You Can Still Cross](https://leetcode.com/problems/last-day-where-you-can-still-cross/) | Hard | [cpp](./solutions/1501-2000/1970-last-day-where-you-can-still-cross.cpp) |
| 1971 | [Find if Path Exists in Graph](https://leetcode.com/problems/find-if-path-exists-in-graph/) | Easy | [python3](./solutions/1501-2000/1971-find-if-path-exists-in-graph.py) |
| 1974 | [Minimum Time to Type Word Using Special Typewriter](https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter/) | Easy | [java](./solutions/1501-2000/1974-minimum-time-to-type-word-using-special-typewriter.java) |
| 1979 | [Find Greatest Common Divisor of Array](https://leetcode.com/problems/find-greatest-common-divisor-of-array/) | Easy | [python3](./solutions/1501-2000/1979-find-greatest-common-divisor-of-array.py) |
| 1985 | [Find the Kth Largest Integer in the Array](https://leetcode.com/problems/find-the-kth-largest-integer-in-the-array/) | Medium | [python3](./solutions/1501-2000/1985-find-the-kth-largest-integer-in-the-array.py) |
| 1991 | [Find the Middle Index in Array](https://leetcode.com/problems/find-the-middle-index-in-array/) | Easy | [java](./solutions/1501-2000/1991-find-the-middle-index-in-array.java) |
| 1992 | [Find All Groups of Farmland](https://leetcode.com/problems/find-all-groups-of-farmland/) | Medium | [python3](./solutions/1501-2000/1992-find-all-groups-of-farmland.py) |
| 1995 | [Count Special Quadruplets](https://leetcode.com/problems/count-special-quadruplets/) | Easy | [java](./solutions/1501-2000/1995-count-special-quadruplets.java) |
| 1996 | [The Number of Weak Characters in the Game](https://leetcode.com/problems/the-number-of-weak-characters-in-the-game/) | Medium | [cpp](./solutions/1501-2000/1996-the-number-of-weak-characters-in-the-game.cpp) |
| 2000 | [Reverse Prefix of Word](https://leetcode.com/problems/reverse-prefix-of-word/) | Easy | [python3](./solutions/1501-2000/2000-reverse-prefix-of-word.py) |
| 2006 | [Count Number of Pairs With Absolute Difference K](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/) | Easy | [java](./solutions/2001-2500/2006-count-number-of-pairs-with-absolute-difference-k.java) |
| 2007 | [Find Original Array From Doubled Array](https://leetcode.com/problems/find-original-array-from-doubled-array/) | Medium | [cpp](./solutions/2001-2500/2007-find-original-array-from-doubled-array.cpp) |
| 2008 | [Maximum Earnings From Taxi](https://leetcode.com/problems/maximum-earnings-from-taxi/) | Medium | [python3](./solutions/2001-2500/2008-maximum-earnings-from-taxi.py) |
| 2011 | [Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/) | Easy | [python3](./solutions/2001-2500/2011-final-value-of-variable-after-performing-operations.py) |
| 2013 | [Detect Squares](https://leetcode.com/problems/detect-squares/) | Medium | [python3](./solutions/2001-2500/2013-detect-squares.py) |
| 2016 | [Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements/) | Easy | [java](./solutions/2001-2500/2016-maximum-difference-between-increasing-elements.java) |
| 2022 | [Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array/) | Easy | [cpp](./solutions/2001-2500/2022-convert-1d-array-into-2d-array.cpp) |
| 2023 | [Number of Pairs of Strings With Concatenation Equal to Target](https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/) | Medium | [java](./solutions/2001-2500/2023-number-of-pairs-of-strings-with-concatenation-equal-to-target.java) |
| 2024 | [Maximize the Confusion of an Exam](https://leetcode.com/problems/maximize-the-confusion-of-an-exam/) | Medium | [cpp](./solutions/2001-2500/2024-maximize-the-confusion-of-an-exam.cpp) |
| 2027 | [Minimum Moves to Convert String](https://leetcode.com/problems/minimum-moves-to-convert-string/) | Easy | [java](./solutions/2001-2500/2027-minimum-moves-to-convert-string.java) |
| 2028 | [Find Missing Observations](https://leetcode.com/problems/find-missing-observations/) | Medium | [cpp](./solutions/2001-2500/2028-find-missing-observations.cpp) |
| 2032 | [Two Out of Three](https://leetcode.com/problems/two-out-of-three/) | Easy | [python3](./solutions/2001-2500/2032-two-out-of-three.py) |
| 2037 | [Minimum Number of Moves to Seat Everyone](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/) | Easy | [cpp](./solutions/2001-2500/2037-minimum-number-of-moves-to-seat-everyone.cpp) |
| 2038 | [Remove Colored Pieces if Both Neighbors are the Same Color](https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/) | Medium | [cpp](./solutions/2001-2500/2038-remove-colored-pieces-if-both-neighbors-are-the-same-color.cpp) |
| 2042 | [Check if Numbers Are Ascending in a Sentence](https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence/) | Easy | [python3](./solutions/2001-2500/2042-check-if-numbers-are-ascending-in-a-sentence.py) |
| 2043 | [Simple Bank System](https://leetcode.com/problems/simple-bank-system/) | Medium | [cpp](./solutions/2001-2500/2043-simple-bank-system.cpp) |
| 2044 | [Count Number of Maximum Bitwise-OR Subsets](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/) | Medium | [cpp](./solutions/2001-2500/2044-count-number-of-maximum-bitwise-or-subsets.cpp) |
| 2049 | [Count Nodes With the Highest Score](https://leetcode.com/problems/count-nodes-with-the-highest-score/) | Medium | [python3](./solutions/2001-2500/2049-count-nodes-with-the-highest-score.py) |
| 2053 | [Kth Distinct String in an Array](https://leetcode.com/problems/kth-distinct-string-in-an-array/) | Easy | [cpp](./solutions/2001-2500/2053-kth-distinct-string-in-an-array.cpp) |
| 2054 | [Two Best Non-Overlapping Events](https://leetcode.com/problems/two-best-non-overlapping-events/) | Medium | [python](./solutions/2001-2500/2054-two-best-non-overlapping-events.py) |
| 2057 | [Smallest Index With Equal Value](https://leetcode.com/problems/smallest-index-with-equal-value/) | Easy | [python3](./solutions/2001-2500/2057-smallest-index-with-equal-value.py) |
| 2058 | [Find the Minimum and Maximum Number of Nodes Between Critical Points](https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/) | Medium | [python3](./solutions/2001-2500/2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points.py) |
| 2059 | [Minimum Operations to Convert Number](https://leetcode.com/problems/minimum-operations-to-convert-number/) | Medium | [java](./solutions/2001-2500/2059-minimum-operations-to-convert-number.java) |
| 2062 | [Count Vowel Substrings of a String](https://leetcode.com/problems/count-vowel-substrings-of-a-string/) | Easy | [python3](./solutions/2001-2500/2062-count-vowel-substrings-of-a-string.py) |
| 2065 | [Maximum Path Quality of a Graph](https://leetcode.com/problems/maximum-path-quality-of-a-graph/) | Hard | [java](./solutions/2001-2500/2065-maximum-path-quality-of-a-graph.java) |
| 2068 | [Check Whether Two Strings are Almost Equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/) | Easy | [java](./solutions/2001-2500/2068-check-whether-two-strings-are-almost-equivalent.java) |
| 2069 | [Walking Robot Simulation II](https://leetcode.com/problems/walking-robot-simulation-ii/) | Medium | [java](./solutions/2001-2500/2069-walking-robot-simulation-ii.java) |
| 2070 | [Most Beautiful Item for Each Query](https://leetcode.com/problems/most-beautiful-item-for-each-query/) | Medium | [java](./solutions/2001-2500/2070-most-beautiful-item-for-each-query.java) |
| 2073 | [Time Needed to Buy Tickets](https://leetcode.com/problems/time-needed-to-buy-tickets/) | Easy | [java](./solutions/2001-2500/2073-time-needed-to-buy-tickets.java) |
| 2078 | [Two Furthest Houses With Different Colors](https://leetcode.com/problems/two-furthest-houses-with-different-colors/) | Easy | [java](./solutions/2001-2500/2078-two-furthest-houses-with-different-colors.java) |
| 2079 | [Watering Plants](https://leetcode.com/problems/watering-plants/) | Medium | [java](./solutions/2001-2500/2079-watering-plants.java) |
| 2080 | [Range Frequency Queries](https://leetcode.com/problems/range-frequency-queries/) | Medium | [java](./solutions/2001-2500/2080-range-frequency-queries.java) |
| 2085 | [Count Common Words With One Occurrence](https://leetcode.com/problems/count-common-words-with-one-occurrence/) | Easy | [java](./solutions/2001-2500/2085-count-common-words-with-one-occurrence.java) |
| 2086 | [Minimum Number of Food Buckets to Feed the Hamsters](https://leetcode.com/problems/minimum-number-of-food-buckets-to-feed-the-hamsters/) | Medium | [java](./solutions/2001-2500/2086-minimum-number-of-food-buckets-to-feed-the-hamsters.java) |
| 2087 | [Minimum Cost Homecoming of a Robot in a Grid](https://leetcode.com/problems/minimum-cost-homecoming-of-a-robot-in-a-grid/) | Medium | [java](./solutions/2001-2500/2087-minimum-cost-homecoming-of-a-robot-in-a-grid.java) |
| 2089 | [Find Target Indices After Sorting Array](https://leetcode.com/problems/find-target-indices-after-sorting-array/) | Easy | [java](./solutions/2001-2500/2089-find-target-indices-after-sorting-array.java) |
| 2090 | [K Radius Subarray Averages](https://leetcode.com/problems/k-radius-subarray-averages/) | Medium | [cpp](./solutions/2001-2500/2090-k-radius-subarray-averages.cpp) |
| 2091 | [Removing Minimum and Maximum From Array](https://leetcode.com/problems/removing-minimum-and-maximum-from-array/) | Medium | [java](./solutions/2001-2500/2091-removing-minimum-and-maximum-from-array.java) |
| 2094 | [Finding 3-Digit Even Numbers](https://leetcode.com/problems/finding-3-digit-even-numbers/) | Easy | [java](./solutions/2001-2500/2094-finding-3-digit-even-numbers.java) |
| 2095 | [Delete the Middle Node of a Linked List](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/) | Medium | [java](./solutions/2001-2500/2095-delete-the-middle-node-of-a-linked-list.java) |
| 2099 | [Find Subsequence of Length K With the Largest Sum](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/) | Easy | [cpp](./solutions/2001-2500/2099-find-subsequence-of-length-k-with-the-largest-sum.cpp) |
| 2101 | [Detonate the Maximum Bombs](https://leetcode.com/problems/detonate-the-maximum-bombs/) | Medium | [cpp](./solutions/2001-2500/2101-detonate-the-maximum-bombs.cpp) |
| 2103 | [Rings and Rods](https://leetcode.com/problems/rings-and-rods/) | Easy | [java](./solutions/2001-2500/2103-rings-and-rods.java) |
| 2104 | [Sum of Subarray Ranges](https://leetcode.com/problems/sum-of-subarray-ranges/) | Medium | [java](./solutions/2001-2500/2104-sum-of-subarray-ranges.java) |
| 2105 | [Watering Plants II](https://leetcode.com/problems/watering-plants-ii/) | Medium | [java](./solutions/2001-2500/2105-watering-plants-ii.java) |
| 2108 | [Find First Palindromic String in the Array](https://leetcode.com/problems/find-first-palindromic-string-in-the-array/) | Easy | [java](./solutions/2001-2500/2108-find-first-palindromic-string-in-the-array.java) |
| 2109 | [Adding Spaces to a String](https://leetcode.com/problems/adding-spaces-to-a-string/) | Medium | [java](./solutions/2001-2500/2109-adding-spaces-to-a-string.java) |
| 2110 | [Number of Smooth Descent Periods of a Stock](https://leetcode.com/problems/number-of-smooth-descent-periods-of-a-stock/) | Medium | [java](./solutions/2001-2500/2110-number-of-smooth-descent-periods-of-a-stock.java) |
| 2114 | [Maximum Number of Words Found in Sentences](https://leetcode.com/problems/maximum-number-of-words-found-in-sentences/) | Easy | [java](./solutions/2001-2500/2114-maximum-number-of-words-found-in-sentences.java) |
| 2115 | [Find All Possible Recipes from Given Supplies](https://leetcode.com/problems/find-all-possible-recipes-from-given-supplies/) | Medium | [python3](./solutions/2001-2500/2115-find-all-possible-recipes-from-given-supplies.py) |
| 2119 | [A Number After a Double Reversal](https://leetcode.com/problems/a-number-after-a-double-reversal/) | Easy | [python3](./solutions/2001-2500/2119-a-number-after-a-double-reversal.py) |
| 2120 | [Execution of All Suffix Instructions Staying in a Grid](https://leetcode.com/problems/execution-of-all-suffix-instructions-staying-in-a-grid/) | Medium | [python3](./solutions/2001-2500/2120-execution-of-all-suffix-instructions-staying-in-a-grid.py) |
| 2124 | [Check if All A's Appears Before All B's](https://leetcode.com/problems/check-if-all-as-appears-before-all-bs/) | Easy | [java](./solutions/2001-2500/2124-check-if-all-as-appears-before-all-bs.java) |
| 2125 | [Number of Laser Beams in a Bank](https://leetcode.com/problems/number-of-laser-beams-in-a-bank/) | Medium | [java](./solutions/2001-2500/2125-number-of-laser-beams-in-a-bank.java) |
| 2126 | [Destroying Asteroids](https://leetcode.com/problems/destroying-asteroids/) | Medium | [java](./solutions/2001-2500/2126-destroying-asteroids.java) |
| 2129 | [Capitalize the Title](https://leetcode.com/problems/capitalize-the-title/) | Easy | [java](./solutions/2001-2500/2129-capitalize-the-title.java) |
| 2130 | [Maximum Twin Sum of a Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/) | Medium | [cpp](./solutions/2001-2500/2130-maximum-twin-sum-of-a-linked-list.cpp) |
| 2131 | [Longest Palindrome by Concatenating Two Letter Words](https://leetcode.com/problems/longest-palindrome-by-concatenating-two-letter-words/) | Medium | [java](./solutions/2001-2500/2131-longest-palindrome-by-concatenating-two-letter-words.java) |
| 2133 | [Check if Every Row and Column Contains All Numbers](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/) | Easy | [java](./solutions/2001-2500/2133-check-if-every-row-and-column-contains-all-numbers.java) |
| 2134 | [Minimum Swaps to Group All 1's Together II](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/) | Medium | [cpp](./solutions/2001-2500/2134-minimum-swaps-to-group-all-1s-together-ii.cpp) |
| 2139 | [Minimum Moves to Reach Target Score](https://leetcode.com/problems/minimum-moves-to-reach-target-score/) | Medium | [python3](./solutions/2001-2500/2139-minimum-moves-to-reach-target-score.py) |
| 2140 | [Solving Questions With Brainpower](https://leetcode.com/problems/solving-questions-with-brainpower/) | Medium | [python3](./solutions/2001-2500/2140-solving-questions-with-brainpower.py) |
| 2141 | [Maximum Running Time of N Computers](https://leetcode.com/problems/maximum-running-time-of-n-computers/) | Hard | [cpp](./solutions/2001-2500/2141-maximum-running-time-of-n-computers.cpp) |
| 2144 | [Minimum Cost of Buying Candies With Discount](https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount/) | Easy | [java](./solutions/2001-2500/2144-minimum-cost-of-buying-candies-with-discount.java) |
| 2145 | [Count the Hidden Sequences](https://leetcode.com/problems/count-the-hidden-sequences/) | Medium | [java](./solutions/2001-2500/2145-count-the-hidden-sequences.java) |
| 2146 | [K Highest Ranked Items Within a Price Range](https://leetcode.com/problems/k-highest-ranked-items-within-a-price-range/) | Medium | [java](./solutions/2001-2500/2146-k-highest-ranked-items-within-a-price-range.java) |
| 2148 | [Count Elements With Strictly Smaller and Greater Elements ](https://leetcode.com/problems/count-elements-with-strictly-smaller-and-greater-elements/) | Easy | [python3](./solutions/2001-2500/2148-count-elements-with-strictly-smaller-and-greater-elements.py) |
| 2149 | [Rearrange Array Elements by Sign](https://leetcode.com/problems/rearrange-array-elements-by-sign/) | Medium | [python3](./solutions/2001-2500/2149-rearrange-array-elements-by-sign.py) |
| 2150 | [Find All Lonely Numbers in the Array](https://leetcode.com/problems/find-all-lonely-numbers-in-the-array/) | Medium | [python3](./solutions/2001-2500/2150-find-all-lonely-numbers-in-the-array.py) |
| 2154 | [Keep Multiplying Found Values by Two](https://leetcode.com/problems/keep-multiplying-found-values-by-two/) | Easy | [python3](./solutions/2001-2500/2154-keep-multiplying-found-values-by-two.py) |
| 2155 | [All Divisions With the Highest Score of a Binary Array](https://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array/) | Medium | [python3](./solutions/2001-2500/2155-all-divisions-with-the-highest-score-of-a-binary-array.py) |
| 2160 | [Minimum Sum of Four Digit Number After Splitting Digits](https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/) | Easy | [python3](./solutions/2001-2500/2160-minimum-sum-of-four-digit-number-after-splitting-digits.py) |
| 2161 | [Partition Array According to Given Pivot](https://leetcode.com/problems/partition-array-according-to-given-pivot/) | Medium | [python3](./solutions/2001-2500/2161-partition-array-according-to-given-pivot.py) |
| 2162 | [Minimum Cost to Set Cooking Time](https://leetcode.com/problems/minimum-cost-to-set-cooking-time/) | Medium | [python3](./solutions/2001-2500/2162-minimum-cost-to-set-cooking-time.py) |
| 2176 | [Count Equal and Divisible Pairs in an Array](https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/) | Easy | [python3](./solutions/2001-2500/2176-count-equal-and-divisible-pairs-in-an-array.py) |
| 2177 | [Find Three Consecutive Integers That Sum to a Given Number](https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/) | Medium | [python3](./solutions/2001-2500/2177-find-three-consecutive-integers-that-sum-to-a-given-number.py) |
| 2180 | [Count Integers With Even Digit Sum](https://leetcode.com/problems/count-integers-with-even-digit-sum/) | Easy | [python3](./solutions/2001-2500/2180-count-integers-with-even-digit-sum.py) |
| 2181 | [Merge Nodes in Between Zeros](https://leetcode.com/problems/merge-nodes-in-between-zeros/) | Medium | [python3](./solutions/2001-2500/2181-merge-nodes-in-between-zeros.py) |
| 2183 | [Count Array Pairs Divisible by K](https://leetcode.com/problems/count-array-pairs-divisible-by-k/) | Hard | [cpp](./solutions/2001-2500/2183-count-array-pairs-divisible-by-k.cpp) |
| 2185 | [Counting Words With a Given Prefix](https://leetcode.com/problems/counting-words-with-a-given-prefix/) | Easy | [java](./solutions/2001-2500/2185-counting-words-with-a-given-prefix.java) |
| 2186 | [Minimum Number of Steps to Make Two Strings Anagram II](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/) | Medium | [java](./solutions/2001-2500/2186-minimum-number-of-steps-to-make-two-strings-anagram-ii.java) |
| 2187 | [Minimum Time to Complete Trips](https://leetcode.com/problems/minimum-time-to-complete-trips/) | Medium | [java](./solutions/2001-2500/2187-minimum-time-to-complete-trips.java) |
| 2190 | [Most Frequent Number Following Key In an Array](https://leetcode.com/problems/most-frequent-number-following-key-in-an-array/) | Easy | [java](./solutions/2001-2500/2190-most-frequent-number-following-key-in-an-array.java) |
| 2191 | [Sort the Jumbled Numbers](https://leetcode.com/problems/sort-the-jumbled-numbers/) | Medium | [cpp](./solutions/2001-2500/2191-sort-the-jumbled-numbers.cpp) |
| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph](https://leetcode.com/problems/all-ancestors-of-a-node-in-a-directed-acyclic-graph/) | Medium | [cpp](./solutions/2001-2500/2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph.cpp) |
| 2194 | [Cells in a Range on an Excel Sheet](https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet/) | Easy | [java](./solutions/2001-2500/2194-cells-in-a-range-on-an-excel-sheet.java) |
| 2196 | [Create Binary Tree From Descriptions](https://leetcode.com/problems/create-binary-tree-from-descriptions/) | Medium | [java](./solutions/2001-2500/2196-create-binary-tree-from-descriptions.java) |
| 2200 | [Find All K-Distant Indices in an Array](https://leetcode.com/problems/find-all-k-distant-indices-in-an-array/) | Easy | [java](./solutions/2001-2500/2200-find-all-k-distant-indices-in-an-array.java) |
| 2201 | [Count Artifacts That Can Be Extracted](https://leetcode.com/problems/count-artifacts-that-can-be-extracted/) | Medium | [java](./solutions/2001-2500/2201-count-artifacts-that-can-be-extracted.java) |
| 2206 | [Divide Array Into Equal Pairs](https://leetcode.com/problems/divide-array-into-equal-pairs/) | Easy | [java](./solutions/2001-2500/2206-divide-array-into-equal-pairs.java) |
| 2207 | [Maximize Number of Subsequences in a String](https://leetcode.com/problems/maximize-number-of-subsequences-in-a-string/) | Medium | [java](./solutions/2001-2500/2207-maximize-number-of-subsequences-in-a-string.java) |
| 2208 | [Minimum Operations to Halve Array Sum](https://leetcode.com/problems/minimum-operations-to-halve-array-sum/) | Medium | [java](./solutions/2001-2500/2208-minimum-operations-to-halve-array-sum.java) |
| 2210 | [Count Hills and Valleys in an Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array/) | Easy | [python3](./solutions/2001-2500/2210-count-hills-and-valleys-in-an-array.py) |
| 2211 | [Count Collisions on a Road](https://leetcode.com/problems/count-collisions-on-a-road/) | Medium | [python3](./solutions/2001-2500/2211-count-collisions-on-a-road.py) |
| 2212 | [Maximum Points in an Archery Competition](https://leetcode.com/problems/maximum-points-in-an-archery-competition/) | Medium | [python3](./solutions/2001-2500/2212-maximum-points-in-an-archery-competition.py) |
| 2213 | [Longest Substring of One Repeating Character](https://leetcode.com/problems/longest-substring-of-one-repeating-character/) | Hard | [cpp](./solutions/2001-2500/2213-longest-substring-of-one-repeating-character.cpp) |
| 2215 | [Find the Difference of Two Arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays/) | Easy | [python3](./solutions/2001-2500/2215-find-the-difference-of-two-arrays.py) |
| 2216 | [Minimum Deletions to Make Array Beautiful](https://leetcode.com/problems/minimum-deletions-to-make-array-beautiful/) | Medium | [java](./solutions/2001-2500/2216-minimum-deletions-to-make-array-beautiful.java) |
| 2218 | [Maximum Value of K Coins From Piles](https://leetcode.com/problems/maximum-value-of-k-coins-from-piles/) | Hard | [cpp](./solutions/2001-2500/2218-maximum-value-of-k-coins-from-piles.cpp) |
| 2220 | [Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number/) | Easy | [cpp](./solutions/2001-2500/2220-minimum-bit-flips-to-convert-number.cpp) |
| 2221 | [Find Triangular Sum of an Array](https://leetcode.com/problems/find-triangular-sum-of-an-array/) | Medium | [python3](./solutions/2001-2500/2221-find-triangular-sum-of-an-array.py) |
| 2222 | [Number of Ways to Select Buildings](https://leetcode.com/problems/number-of-ways-to-select-buildings/) | Medium | [python3](./solutions/2001-2500/2222-number-of-ways-to-select-buildings.py) |
| 2223 | [Sum of Scores of Built Strings](https://leetcode.com/problems/sum-of-scores-of-built-strings/) | Hard | [cpp](./solutions/2001-2500/2223-sum-of-scores-of-built-strings.cpp) |
| 2225 | [Find Players With Zero or One Losses](https://leetcode.com/problems/find-players-with-zero-or-one-losses/) | Medium | [python3](./solutions/2001-2500/2225-find-players-with-zero-or-one-losses.py) |
| 2226 | [Maximum Candies Allocated to K Children](https://leetcode.com/problems/maximum-candies-allocated-to-k-children/) | Medium | [python3](./solutions/2001-2500/2226-maximum-candies-allocated-to-k-children.py) |
| 2233 | [Maximum Product After K Increments](https://leetcode.com/problems/maximum-product-after-k-increments/) | Medium | [python3](./solutions/2001-2500/2233-maximum-product-after-k-increments.py) |
| 2239 | [Find Closest Number to Zero](https://leetcode.com/problems/find-closest-number-to-zero/) | Easy | [python3](./solutions/2001-2500/2239-find-closest-number-to-zero.py) |
| 2240 | [Number of Ways to Buy Pens and Pencils](https://leetcode.com/problems/number-of-ways-to-buy-pens-and-pencils/) | Medium | [python3](./solutions/2001-2500/2240-number-of-ways-to-buy-pens-and-pencils.py) |
| 2241 | [Design an ATM Machine](https://leetcode.com/problems/design-an-atm-machine/) | Medium | [python3](./solutions/2001-2500/2241-design-an-atm-machine.py) |
| 2244 | [Minimum Rounds to Complete All Tasks](https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/) | Medium | [python3](./solutions/2001-2500/2244-minimum-rounds-to-complete-all-tasks.py) |
| 2246 | [Longest Path With Different Adjacent Characters](https://leetcode.com/problems/longest-path-with-different-adjacent-characters/) | Hard | [cpp](./solutions/2001-2500/2246-longest-path-with-different-adjacent-characters.cpp) |
| 2248 | [Intersection of Multiple Arrays](https://leetcode.com/problems/intersection-of-multiple-arrays/) | Easy | [python3](./solutions/2001-2500/2248-intersection-of-multiple-arrays.py) |
| 2249 | [Count Lattice Points Inside a Circle](https://leetcode.com/problems/count-lattice-points-inside-a-circle/) | Medium | [python3](./solutions/2001-2500/2249-count-lattice-points-inside-a-circle.py) |
| 2255 | [Count Prefixes of a Given String](https://leetcode.com/problems/count-prefixes-of-a-given-string/) | Easy | [python3](./solutions/2001-2500/2255-count-prefixes-of-a-given-string.py) |
| 2256 | [Minimum Average Difference](https://leetcode.com/problems/minimum-average-difference/) | Medium | [python3](./solutions/2001-2500/2256-minimum-average-difference.py) |
| 2257 | [Count Unguarded Cells in the Grid](https://leetcode.com/problems/count-unguarded-cells-in-the-grid/) | Medium | [python3](./solutions/2001-2500/2257-count-unguarded-cells-in-the-grid.py) |
| 2258 | [Escape the Spreading Fire](https://leetcode.com/problems/escape-the-spreading-fire/) | Hard | [python3](./solutions/2001-2500/2258-escape-the-spreading-fire.py) |
| 2259 | [Remove Digit From Number to Maximize Result](https://leetcode.com/problems/remove-digit-from-number-to-maximize-result/) | Easy | [python3](./solutions/2001-2500/2259-remove-digit-from-number-to-maximize-result.py) |
| 2260 | [Minimum Consecutive Cards to Pick Up](https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/) | Medium | [python3](./solutions/2001-2500/2260-minimum-consecutive-cards-to-pick-up.py) |
| 2264 | [Largest 3-Same-Digit Number in String](https://leetcode.com/problems/largest-3-same-digit-number-in-string/) | Easy | [python3](./solutions/2001-2500/2264-largest-3-same-digit-number-in-string.py) |
| 2265 | [Count Nodes Equal to Average of Subtree](https://leetcode.com/problems/count-nodes-equal-to-average-of-subtree/) | Medium | [python3](./solutions/2001-2500/2265-count-nodes-equal-to-average-of-subtree.py) |
| 2266 | [Count Number of Texts](https://leetcode.com/problems/count-number-of-texts/) | Medium | [python3](./solutions/2001-2500/2266-count-number-of-texts.py) |
| 2267 | [ Check if There Is a Valid Parentheses String Path](https://leetcode.com/problems/check-if-there-is-a-valid-parentheses-string-path/) | Hard | [python3](./solutions/2001-2500/2267-check-if-there-is-a-valid-parentheses-string-path.py) |
| 2269 | [Find the K-Beauty of a Number](https://leetcode.com/problems/find-the-k-beauty-of-a-number/) | Easy | [python3](./solutions/2001-2500/2269-find-the-k-beauty-of-a-number.py) |
| 2270 | [Number of Ways to Split Array](https://leetcode.com/problems/number-of-ways-to-split-array/) | Medium | [python3](./solutions/2001-2500/2270-number-of-ways-to-split-array.py) |
| 2271 | [Maximum White Tiles Covered by a Carpet](https://leetcode.com/problems/maximum-white-tiles-covered-by-a-carpet/) | Medium | [python3](./solutions/2001-2500/2271-maximum-white-tiles-covered-by-a-carpet.py) |
| 2272 | [Substring With Largest Variance](https://leetcode.com/problems/substring-with-largest-variance/) | Hard | [cpp](./solutions/2001-2500/2272-substring-with-largest-variance.cpp) |
| 2273 | [Find Resultant Array After Removing Anagrams](https://leetcode.com/problems/find-resultant-array-after-removing-anagrams/) | Easy | [python3](./solutions/2001-2500/2273-find-resultant-array-after-removing-anagrams.py) |
| 2274 | [Maximum Consecutive Floors Without Special Floors](https://leetcode.com/problems/maximum-consecutive-floors-without-special-floors/) | Medium | [python3](./solutions/2001-2500/2274-maximum-consecutive-floors-without-special-floors.py) |
| 2278 | [Percentage of Letter in String](https://leetcode.com/problems/percentage-of-letter-in-string/) | Easy | [python3](./solutions/2001-2500/2278-percentage-of-letter-in-string.py) |
| 2279 | [Maximum Bags With Full Capacity of Rocks](https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks/) | Medium | [python3](./solutions/2001-2500/2279-maximum-bags-with-full-capacity-of-rocks.py) |
| 2280 | [Minimum Lines to Represent a Line Chart](https://leetcode.com/problems/minimum-lines-to-represent-a-line-chart/) | Medium | [python3](./solutions/2001-2500/2280-minimum-lines-to-represent-a-line-chart.py) |
| 2283 | [Check if Number Has Equal Digit Count and Digit Value](https://leetcode.com/problems/check-if-number-has-equal-digit-count-and-digit-value/) | Easy | [python3](./solutions/2001-2500/2283-check-if-number-has-equal-digit-count-and-digit-value.py) |
| 2284 | [Sender With Largest Word Count](https://leetcode.com/problems/sender-with-largest-word-count/) | Medium | [python3](./solutions/2001-2500/2284-sender-with-largest-word-count.py) |
| 2285 | [Maximum Total Importance of Roads](https://leetcode.com/problems/maximum-total-importance-of-roads/) | Medium | [cpp](./solutions/2001-2500/2285-maximum-total-importance-of-roads.cpp) |
| 2286 | [Booking Concert Tickets in Groups](https://leetcode.com/problems/booking-concert-tickets-in-groups/) | Hard | [cpp](./solutions/2001-2500/2286-booking-concert-tickets-in-groups.cpp) |
| 2287 | [Rearrange Characters to Make Target String](https://leetcode.com/problems/rearrange-characters-to-make-target-string/) | Easy | [python3](./solutions/2001-2500/2287-rearrange-characters-to-make-target-string.py) |
| 2288 | [Apply Discount to Prices](https://leetcode.com/problems/apply-discount-to-prices/) | Medium | [python3](./solutions/2001-2500/2288-apply-discount-to-prices.py) |
| 2290 | [Minimum Obstacle Removal to Reach Corner](https://leetcode.com/problems/minimum-obstacle-removal-to-reach-corner/) | Hard | [python3](./solutions/2001-2500/2290-minimum-obstacle-removal-to-reach-corner.py) |
| 2293 | [Min Max Game](https://leetcode.com/problems/min-max-game/) | Easy | [python3](./solutions/2001-2500/2293-min-max-game.py) |
| 2294 | [Partition Array Such That Maximum Difference Is K](https://leetcode.com/problems/partition-array-such-that-maximum-difference-is-k/) | Medium | [python3](./solutions/2001-2500/2294-partition-array-such-that-maximum-difference-is-k.py) |
| 2295 | [Replace Elements in an Array](https://leetcode.com/problems/replace-elements-in-an-array/) | Medium | [python3](./solutions/2001-2500/2295-replace-elements-in-an-array.py) |
| 2299 | [Strong Password Checker II](https://leetcode.com/problems/strong-password-checker-ii/) | Easy | [python3](./solutions/2001-2500/2299-strong-password-checker-ii.py) |
| 2300 | [Successful Pairs of Spells and Potions](https://leetcode.com/problems/successful-pairs-of-spells-and-potions/) | Medium | [cpp](./solutions/2001-2500/2300-successful-pairs-of-spells-and-potions.cpp) |
| 2301 | [Match Substring After Replacement](https://leetcode.com/problems/match-substring-after-replacement/) | Hard | [python3](./solutions/2001-2500/2301-match-substring-after-replacement.py) |
| 2302 | [Count Subarrays With Score Less Than K](https://leetcode.com/problems/count-subarrays-with-score-less-than-k/) | Hard | [python3](./solutions/2001-2500/2302-count-subarrays-with-score-less-than-k.py) |
| 2303 | [Calculate Amount Paid in Taxes](https://leetcode.com/problems/calculate-amount-paid-in-taxes/) | Easy | [python3](./solutions/2001-2500/2303-calculate-amount-paid-in-taxes.py) |
| 2304 | [Minimum Path Cost in a Grid](https://leetcode.com/problems/minimum-path-cost-in-a-grid/) | Medium | [python3](./solutions/2001-2500/2304-minimum-path-cost-in-a-grid.py) |
| 2305 | [Fair Distribution of Cookies](https://leetcode.com/problems/fair-distribution-of-cookies/) | Medium | [cpp](./solutions/2001-2500/2305-fair-distribution-of-cookies.cpp) |
| 2309 | [Greatest English Letter in Upper and Lower Case](https://leetcode.com/problems/greatest-english-letter-in-upper-and-lower-case/) | Easy | [python3](./solutions/2001-2500/2309-greatest-english-letter-in-upper-and-lower-case.py) |
| 2310 | [Sum of Numbers With Units Digit K](https://leetcode.com/problems/sum-of-numbers-with-units-digit-k/) | Medium | [python3](./solutions/2001-2500/2310-sum-of-numbers-with-units-digit-k.py) |
| 2311 | [Longest Binary Subsequence Less Than or Equal to K](https://leetcode.com/problems/longest-binary-subsequence-less-than-or-equal-to-k/) | Medium | [python3](./solutions/2001-2500/2311-longest-binary-subsequence-less-than-or-equal-to-k.py) |
| 2312 | [Selling Pieces of Wood](https://leetcode.com/problems/selling-pieces-of-wood/) | Hard | [python3](./solutions/2001-2500/2312-selling-pieces-of-wood.py) |
| 2315 | [Count Asterisks](https://leetcode.com/problems/count-asterisks/) | Easy | [python3](./solutions/2001-2500/2315-count-asterisks.py) |
| 2316 | [Count Unreachable Pairs of Nodes in an Undirected Graph](https://leetcode.com/problems/count-unreachable-pairs-of-nodes-in-an-undirected-graph/) | Medium | [cpp](./solutions/2001-2500/2316-count-unreachable-pairs-of-nodes-in-an-undirected-graph.cpp) |
| 2317 | [Maximum XOR After Operations ](https://leetcode.com/problems/maximum-xor-after-operations/) | Medium | [python3](./solutions/2001-2500/2317-maximum-xor-after-operations.py) |
| 2325 | [Decode the Message](https://leetcode.com/problems/decode-the-message/) | Easy | [python3](./solutions/2001-2500/2325-decode-the-message.py) |
| 2326 | [Spiral Matrix IV](https://leetcode.com/problems/spiral-matrix-iv/) | Medium | [cpp](./solutions/2001-2500/2326-spiral-matrix-iv.cpp) |
| 2328 | [Number of Increasing Paths in a Grid](https://leetcode.com/problems/number-of-increasing-paths-in-a-grid/) | Hard | [cpp](./solutions/2001-2500/2328-number-of-increasing-paths-in-a-grid.cpp) |
| 2331 | [Evaluate Boolean Binary Tree](https://leetcode.com/problems/evaluate-boolean-binary-tree/) | Easy | [python3](./solutions/2001-2500/2331-evaluate-boolean-binary-tree.py) |
| 2332 | [The Latest Time to Catch a Bus](https://leetcode.com/problems/the-latest-time-to-catch-a-bus/) | Medium | [python3](./solutions/2001-2500/2332-the-latest-time-to-catch-a-bus.py) |
| 2335 | [Minimum Amount of Time to Fill Cups](https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups/) | Easy | [python3](./solutions/2001-2500/2335-minimum-amount-of-time-to-fill-cups.py) |
| 2336 | [Smallest Number in Infinite Set](https://leetcode.com/problems/smallest-number-in-infinite-set/) | Medium | [cpp](./solutions/2001-2500/2336-smallest-number-in-infinite-set.cpp) |
| 2337 | [Move Pieces to Obtain a String](https://leetcode.com/problems/move-pieces-to-obtain-a-string/) | Medium | [python3](./solutions/2001-2500/2337-move-pieces-to-obtain-a-string.py) |
| 2341 | [Maximum Number of Pairs in Array](https://leetcode.com/problems/maximum-number-of-pairs-in-array/) | Easy | [python3](./solutions/2001-2500/2341-maximum-number-of-pairs-in-array.py) |
| 2342 | [Max Sum of a Pair With Equal Sum of Digits](https://leetcode.com/problems/max-sum-of-a-pair-with-equal-sum-of-digits/) | Medium | [python3](./solutions/2001-2500/2342-max-sum-of-a-pair-with-equal-sum-of-digits.py) |
| 2343 | [Query Kth Smallest Trimmed Number](https://leetcode.com/problems/query-kth-smallest-trimmed-number/) | Medium | [python3](./solutions/2001-2500/2343-query-kth-smallest-trimmed-number.py) |
| 2344 | [Minimum Deletions to Make Array Divisible](https://leetcode.com/problems/minimum-deletions-to-make-array-divisible/) | Hard | [python3](./solutions/2001-2500/2344-minimum-deletions-to-make-array-divisible.py) |
| 2347 | [Best Poker Hand](https://leetcode.com/problems/best-poker-hand/) | Easy | [python3](./solutions/2001-2500/2347-best-poker-hand.py) |
| 2348 | [Number of Zero-Filled Subarrays](https://leetcode.com/problems/number-of-zero-filled-subarrays/) | Medium | [python3](./solutions/2001-2500/2348-number-of-zero-filled-subarrays.py) |
| 2349 | [Design a Number Container System](https://leetcode.com/problems/design-a-number-container-system/) | Medium | [python3](./solutions/2001-2500/2349-design-a-number-container-system.py) |
| 2350 | [Shortest Impossible Sequence of Rolls](https://leetcode.com/problems/shortest-impossible-sequence-of-rolls/) | Hard | [python3](./solutions/2001-2500/2350-shortest-impossible-sequence-of-rolls.py) |
| 2351 | [First Letter to Appear Twice](https://leetcode.com/problems/first-letter-to-appear-twice/) | Easy | [python3](./solutions/2001-2500/2351-first-letter-to-appear-twice.py) |
| 2352 | [Equal Row and Column Pairs](https://leetcode.com/problems/equal-row-and-column-pairs/) | Medium | [cpp](./solutions/2001-2500/2352-equal-row-and-column-pairs.cpp) |
| 2353 | [Design a Food Rating System](https://leetcode.com/problems/design-a-food-rating-system/) | Medium | [python3](./solutions/2001-2500/2353-design-a-food-rating-system.py) |
| 2354 | [Number of Excellent Pairs](https://leetcode.com/problems/number-of-excellent-pairs/) | Hard | [python3](./solutions/2001-2500/2354-number-of-excellent-pairs.py) |
| 2357 | [Make Array Zero by Subtracting Equal Amounts](https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts/) | Easy | [python3](./solutions/2001-2500/2357-make-array-zero-by-subtracting-equal-amounts.py) |
| 2358 | [Maximum Number of Groups Entering a Competition](https://leetcode.com/problems/maximum-number-of-groups-entering-a-competition/) | Medium | [python3](./solutions/2001-2500/2358-maximum-number-of-groups-entering-a-competition.py) |
| 2359 | [Find Closest Node to Given Two Nodes](https://leetcode.com/problems/find-closest-node-to-given-two-nodes/) | Medium | [python3](./solutions/2001-2500/2359-find-closest-node-to-given-two-nodes.py) |
| 2360 | [Longest Cycle in a Graph](https://leetcode.com/problems/longest-cycle-in-a-graph/) | Hard | [python3](./solutions/2001-2500/2360-longest-cycle-in-a-graph.py) |
| 2363 | [Merge Similar Items](https://leetcode.com/problems/merge-similar-items/) | Easy | [python3](./solutions/2001-2500/2363-merge-similar-items.py) |
| 2364 | [Count Number of Bad Pairs](https://leetcode.com/problems/count-number-of-bad-pairs/) | Medium | [python3](./solutions/2001-2500/2364-count-number-of-bad-pairs.py) |
| 2365 | [Task Scheduler II](https://leetcode.com/problems/task-scheduler-ii/) | Medium | [python3](./solutions/2001-2500/2365-task-scheduler-ii.py) |
| 2366 | [Minimum Replacements to Sort the Array](https://leetcode.com/problems/minimum-replacements-to-sort-the-array/) | Hard | [python3](./solutions/2001-2500/2366-minimum-replacements-to-sort-the-array.py) |
| 2367 | [Number of Arithmetic Triplets](https://leetcode.com/problems/number-of-arithmetic-triplets/) | Easy | [python3](./solutions/2001-2500/2367-number-of-arithmetic-triplets.py) |
| 2368 | [Reachable Nodes With Restrictions](https://leetcode.com/problems/reachable-nodes-with-restrictions/) | Medium | [python3](./solutions/2001-2500/2368-reachable-nodes-with-restrictions.py) |
| 2369 | [Check if There is a Valid Partition For The Array](https://leetcode.com/problems/check-if-there-is-a-valid-partition-for-the-array/) | Medium | [cpp](./solutions/2001-2500/2369-check-if-there-is-a-valid-partition-for-the-array.cpp) |
| 2370 | [Longest Ideal Subsequence](https://leetcode.com/problems/longest-ideal-subsequence/) | Medium | [python3](./solutions/2001-2500/2370-longest-ideal-subsequence.py) |
| 2373 | [Largest Local Values in a Matrix](https://leetcode.com/problems/largest-local-values-in-a-matrix/) | Easy | [python3](./solutions/2001-2500/2373-largest-local-values-in-a-matrix.py) |
| 2374 | [Node With Highest Edge Score](https://leetcode.com/problems/node-with-highest-edge-score/) | Medium | [python3](./solutions/2001-2500/2374-node-with-highest-edge-score.py) |
| 2375 | [Construct Smallest Number From DI String](https://leetcode.com/problems/construct-smallest-number-from-di-string/) | Medium | [python3](./solutions/2001-2500/2375-construct-smallest-number-from-di-string.py) |
| 2379 | [Minimum Recolors to Get K Consecutive Black Blocks](https://leetcode.com/problems/minimum-recolors-to-get-k-consecutive-black-blocks/) | Easy | [python3](./solutions/2001-2500/2379-minimum-recolors-to-get-k-consecutive-black-blocks.py) |
| 2380 | [Time Needed to Rearrange a Binary String](https://leetcode.com/problems/time-needed-to-rearrange-a-binary-string/) | Medium | [python3](./solutions/2001-2500/2380-time-needed-to-rearrange-a-binary-string.py) |
| 2381 | [Shifting Letters II](https://leetcode.com/problems/shifting-letters-ii/) | Medium | [python3](./solutions/2001-2500/2381-shifting-letters-ii.py) |
| 2383 | [Minimum Hours of Training to Win a Competition](https://leetcode.com/problems/minimum-hours-of-training-to-win-a-competition/) | Easy | [cpp](./solutions/2001-2500/2383-minimum-hours-of-training-to-win-a-competition.cpp) |
| 2384 | [Largest Palindromic Number](https://leetcode.com/problems/largest-palindromic-number/) | Medium | [cpp](./solutions/2001-2500/2384-largest-palindromic-number.cpp) |
| 2385 | [Amount of Time for Binary Tree to Be Infected](https://leetcode.com/problems/amount-of-time-for-binary-tree-to-be-infected/) | Medium | [cpp](./solutions/2001-2500/2385-amount-of-time-for-binary-tree-to-be-infected.cpp) |
| 2386 | [Find the K-Sum of an Array](https://leetcode.com/problems/find-the-k-sum-of-an-array/) | Hard | [cpp](./solutions/2001-2500/2386-find-the-k-sum-of-an-array.cpp) |
| 2389 | [Longest Subsequence With Limited Sum](https://leetcode.com/problems/longest-subsequence-with-limited-sum/) | Easy | [cpp](./solutions/2001-2500/2389-longest-subsequence-with-limited-sum.cpp) |
| 2390 | [Removing Stars From a String](https://leetcode.com/problems/removing-stars-from-a-string/) | Medium | [cpp](./solutions/2001-2500/2390-removing-stars-from-a-string.cpp) |
| 2391 | [Minimum Amount of Time to Collect Garbage](https://leetcode.com/problems/minimum-amount-of-time-to-collect-garbage/) | Medium | [cpp](./solutions/2001-2500/2391-minimum-amount-of-time-to-collect-garbage.cpp) |
| 2395 | [Find Subarrays With Equal Sum](https://leetcode.com/problems/find-subarrays-with-equal-sum/) | Easy | [python3](./solutions/2001-2500/2395-find-subarrays-with-equal-sum.py) |
| 2396 | [Strictly Palindromic Number](https://leetcode.com/problems/strictly-palindromic-number/) | Medium | [python3](./solutions/2001-2500/2396-strictly-palindromic-number.py) |
| 2397 | [Maximum Rows Covered by Columns](https://leetcode.com/problems/maximum-rows-covered-by-columns/) | Medium | [python3](./solutions/2001-2500/2397-maximum-rows-covered-by-columns.py) |
| 2398 | [Maximum Number of Robots Within Budget](https://leetcode.com/problems/maximum-number-of-robots-within-budget/) | Hard | [python3](./solutions/2001-2500/2398-maximum-number-of-robots-within-budget.py) |
| 2399 | [Check Distances Between Same Letters](https://leetcode.com/problems/check-distances-between-same-letters/) | Easy | [cpp](./solutions/2001-2500/2399-check-distances-between-same-letters.cpp) |
| 2400 | [Number of Ways to Reach a Position After Exactly k Steps](https://leetcode.com/problems/number-of-ways-to-reach-a-position-after-exactly-k-steps/) | Medium | [cpp](./solutions/2001-2500/2400-number-of-ways-to-reach-a-position-after-exactly-k-steps.cpp) |
| 2401 | [Longest Nice Subarray](https://leetcode.com/problems/longest-nice-subarray/) | Medium | [cpp](./solutions/2001-2500/2401-longest-nice-subarray.cpp) |
| 2402 | [Meeting Rooms III](https://leetcode.com/problems/meeting-rooms-iii/) | Hard | [cpp](./solutions/2001-2500/2402-meeting-rooms-iii.cpp) |
| 2404 | [Most Frequent Even Element](https://leetcode.com/problems/most-frequent-even-element/) | Easy | [cpp](./solutions/2001-2500/2404-most-frequent-even-element.cpp) |
| 2405 | [Optimal Partition of String](https://leetcode.com/problems/optimal-partition-of-string/) | Medium | [cpp](./solutions/2001-2500/2405-optimal-partition-of-string.cpp) |
| 2406 | [Divide Intervals Into Minimum Number of Groups](https://leetcode.com/problems/divide-intervals-into-minimum-number-of-groups/) | Medium | [cpp](./solutions/2001-2500/2406-divide-intervals-into-minimum-number-of-groups.cpp) |
| 2407 | [Longest Increasing Subsequence II](https://leetcode.com/problems/longest-increasing-subsequence-ii/) | Hard | [cpp](./solutions/2001-2500/2407-longest-increasing-subsequence-ii.cpp) |
| 2409 | [Count Days Spent Together](https://leetcode.com/problems/count-days-spent-together/) | Easy | [python3](./solutions/2001-2500/2409-count-days-spent-together.py) |
| 2410 | [Maximum Matching of Players With Trainers](https://leetcode.com/problems/maximum-matching-of-players-with-trainers/) | Medium | [cpp](./solutions/2001-2500/2410-maximum-matching-of-players-with-trainers.cpp) |
| 2411 | [Smallest Subarrays With Maximum Bitwise OR](https://leetcode.com/problems/smallest-subarrays-with-maximum-bitwise-or/) | Medium | [cpp](./solutions/2001-2500/2411-smallest-subarrays-with-maximum-bitwise-or.cpp) |
| 2412 | [Minimum Money Required Before Transactions](https://leetcode.com/problems/minimum-money-required-before-transactions/) | Hard | [cpp](./solutions/2001-2500/2412-minimum-money-required-before-transactions.cpp) |
| 2413 | [Smallest Even Multiple](https://leetcode.com/problems/smallest-even-multiple/) | Easy | [cpp](./solutions/2001-2500/2413-smallest-even-multiple.cpp) |
| 2414 | [Length of the Longest Alphabetical Continuous Substring](https://leetcode.com/problems/length-of-the-longest-alphabetical-continuous-substring/) | Medium | [cpp](./solutions/2001-2500/2414-length-of-the-longest-alphabetical-continuous-substring.cpp) |
| 2415 | [Reverse Odd Levels of Binary Tree](https://leetcode.com/problems/reverse-odd-levels-of-binary-tree/) | Medium | [cpp](./solutions/2001-2500/2415-reverse-odd-levels-of-binary-tree.cpp) |
| 2418 | [Sort the People](https://leetcode.com/problems/sort-the-people/) | Easy | [cpp](./solutions/2001-2500/2418-sort-the-people.cpp) |
| 2419 | [Longest Subarray With Maximum Bitwise AND](https://leetcode.com/problems/longest-subarray-with-maximum-bitwise-and/) | Medium | [cpp](./solutions/2001-2500/2419-longest-subarray-with-maximum-bitwise-and.cpp) |
| 2420 | [Find All Good Indices](https://leetcode.com/problems/find-all-good-indices/) | Medium | [cpp](./solutions/2001-2500/2420-find-all-good-indices.cpp) |
| 2421 | [Number of Good Paths](https://leetcode.com/problems/number-of-good-paths/) | Hard | [cpp](./solutions/2001-2500/2421-number-of-good-paths.cpp) |
| 2424 | [Longest Uploaded Prefix](https://leetcode.com/problems/longest-uploaded-prefix/) | Medium | [cpp](./solutions/2001-2500/2424-longest-uploaded-prefix.cpp) |
| 2425 | [Bitwise XOR of All Pairings](https://leetcode.com/problems/bitwise-xor-of-all-pairings/) | Medium | [cpp](./solutions/2001-2500/2425-bitwise-xor-of-all-pairings.cpp) |
| 2426 | [Number of Pairs Satisfying Inequality](https://leetcode.com/problems/number-of-pairs-satisfying-inequality/) | Hard | [python3](./solutions/2001-2500/2426-number-of-pairs-satisfying-inequality.py) |
| 2427 | [Number of Common Factors](https://leetcode.com/problems/number-of-common-factors/) | Easy | [cpp](./solutions/2001-2500/2427-number-of-common-factors.cpp) |
| 2428 | [Maximum Sum of an Hourglass](https://leetcode.com/problems/maximum-sum-of-an-hourglass/) | Medium | [cpp](./solutions/2001-2500/2428-maximum-sum-of-an-hourglass.cpp) |
| 2429 | [Minimize XOR](https://leetcode.com/problems/minimize-xor/) | Medium | [cpp](./solutions/2001-2500/2429-minimize-xor.cpp) |
| 2432 | [The Employee That Worked on the Longest Task](https://leetcode.com/problems/the-employee-that-worked-on-the-longest-task/) | Easy | [cpp](./solutions/2001-2500/2432-the-employee-that-worked-on-the-longest-task.cpp) |
| 2433 | [Find The Original Array of Prefix Xor](https://leetcode.com/problems/find-the-original-array-of-prefix-xor/) | Medium | [cpp](./solutions/2001-2500/2433-find-the-original-array-of-prefix-xor.cpp) |
| 2437 | [Number of Valid Clock Times](https://leetcode.com/problems/number-of-valid-clock-times/) | Easy | [python3](./solutions/2001-2500/2437-number-of-valid-clock-times.py) |
| 2438 | [Range Product Queries of Powers](https://leetcode.com/problems/range-product-queries-of-powers/) | Medium | [python3](./solutions/2001-2500/2438-range-product-queries-of-powers.py) |
| 2439 | [Minimize Maximum of Array](https://leetcode.com/problems/minimize-maximum-of-array/) | Medium | [cpp](./solutions/2001-2500/2439-minimize-maximum-of-array.cpp) |
| 2441 | [Largest Positive Integer That Exists With Its Negative](https://leetcode.com/problems/largest-positive-integer-that-exists-with-its-negative/) | Easy | [cpp](./solutions/2001-2500/2441-largest-positive-integer-that-exists-with-its-negative.cpp) |
| 2442 | [Count Number of Distinct Integers After Reverse Operations](https://leetcode.com/problems/count-number-of-distinct-integers-after-reverse-operations/) | Medium | [cpp](./solutions/2001-2500/2442-count-number-of-distinct-integers-after-reverse-operations.cpp) |
| 2443 | [Sum of Number and Its Reverse](https://leetcode.com/problems/sum-of-number-and-its-reverse/) | Medium | [python3](./solutions/2001-2500/2443-sum-of-number-and-its-reverse.py) |
| 2447 | [Number of Subarrays With GCD Equal to K](https://leetcode.com/problems/number-of-subarrays-with-gcd-equal-to-k/) | Medium | [cpp](./solutions/2001-2500/2447-number-of-subarrays-with-gcd-equal-to-k.cpp) |
| 2448 | [Minimum Cost to Make Array Equal](https://leetcode.com/problems/minimum-cost-to-make-array-equal/) | Hard | [cpp](./solutions/2001-2500/2448-minimum-cost-to-make-array-equal.cpp) |
| 2451 | [Odd String Difference](https://leetcode.com/problems/odd-string-difference/) | Easy | [python3](./solutions/2001-2500/2451-odd-string-difference.py) |
| 2452 | [Words Within Two Edits of Dictionary](https://leetcode.com/problems/words-within-two-edits-of-dictionary/) | Medium | [python3](./solutions/2001-2500/2452-words-within-two-edits-of-dictionary.py) |
| 2453 | [Destroy Sequential Targets](https://leetcode.com/problems/destroy-sequential-targets/) | Medium | [python3](./solutions/2001-2500/2453-destroy-sequential-targets.py) |
| 2455 | [Average Value of Even Numbers That Are Divisible by Three](https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three/) | Easy | [python3](./solutions/2001-2500/2455-average-value-of-even-numbers-that-are-divisible-by-three.py) |
| 2456 | [Most Popular Video Creator](https://leetcode.com/problems/most-popular-video-creator/) | Medium | [python3](./solutions/2001-2500/2456-most-popular-video-creator.py) |
| 2460 | [Apply Operations to an Array](https://leetcode.com/problems/apply-operations-to-an-array/) | Easy | [cpp](./solutions/2001-2500/2460-apply-operations-to-an-array.cpp) |
| 2461 | [Maximum Sum of Distinct Subarrays With Length K](https://leetcode.com/problems/maximum-sum-of-distinct-subarrays-with-length-k/) | Medium | [cpp](./solutions/2001-2500/2461-maximum-sum-of-distinct-subarrays-with-length-k.cpp) |
| 2462 | [Total Cost to Hire K Workers](https://leetcode.com/problems/total-cost-to-hire-k-workers/) | Medium | [cpp](./solutions/2001-2500/2462-total-cost-to-hire-k-workers.cpp) |
| 2463 | [Minimum Total Distance Traveled](https://leetcode.com/problems/minimum-total-distance-traveled/) | Hard | [cpp](./solutions/2001-2500/2463-minimum-total-distance-traveled.cpp) |
| 2465 | [Number of Distinct Averages](https://leetcode.com/problems/number-of-distinct-averages/) | Easy | [cpp](./solutions/2001-2500/2465-number-of-distinct-averages.cpp) |
| 2466 | [Count Ways To Build Good Strings](https://leetcode.com/problems/count-ways-to-build-good-strings/) | Medium | [python3](./solutions/2001-2500/2466-count-ways-to-build-good-strings.py) |
| 2467 | [Most Profitable Path in a Tree](https://leetcode.com/problems/most-profitable-path-in-a-tree/) | Medium | [cpp](./solutions/2001-2500/2467-most-profitable-path-in-a-tree.cpp) |
| 2469 | [Convert the Temperature](https://leetcode.com/problems/convert-the-temperature/) | Easy | [cpp](./solutions/2001-2500/2469-convert-the-temperature.cpp) |
| 2470 | [Number of Subarrays With LCM Equal to K](https://leetcode.com/problems/number-of-subarrays-with-lcm-equal-to-k/) | Medium | [cpp](./solutions/2001-2500/2470-number-of-subarrays-with-lcm-equal-to-k.cpp) |
| 2471 | [Minimum Number of Operations to Sort a Binary Tree by Level](https://leetcode.com/problems/minimum-number-of-operations-to-sort-a-binary-tree-by-level/) | Medium | [cpp](./solutions/2001-2500/2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level.cpp) |
| 2472 | [Maximum Number of Non-overlapping Palindrome Substrings](https://leetcode.com/problems/maximum-number-of-non-overlapping-palindrome-substrings/) | Hard | [cpp](./solutions/2001-2500/2472-maximum-number-of-non-overlapping-palindrome-substrings.cpp) |
| 2475 | [Number of Unequal Triplets in Array](https://leetcode.com/problems/number-of-unequal-triplets-in-array/) | Easy | [cpp](./solutions/2001-2500/2475-number-of-unequal-triplets-in-array.cpp) |
| 2476 | [Closest Nodes Queries in a Binary Search Tree](https://leetcode.com/problems/closest-nodes-queries-in-a-binary-search-tree/) | Medium | [cpp](./solutions/2001-2500/2476-closest-nodes-queries-in-a-binary-search-tree.cpp) |
| 2481 | [Minimum Cuts to Divide a Circle](https://leetcode.com/problems/minimum-cuts-to-divide-a-circle/) | Easy | [cpp](./solutions/2001-2500/2481-minimum-cuts-to-divide-a-circle.cpp) |
| 2482 | [Difference Between Ones and Zeros in Row and Column](https://leetcode.com/problems/difference-between-ones-and-zeros-in-row-and-column/) | Medium | [cpp](./solutions/2001-2500/2482-difference-between-ones-and-zeros-in-row-and-column.cpp) |
| 2483 | [Minimum Penalty for a Shop](https://leetcode.com/problems/minimum-penalty-for-a-shop/) | Medium | [cpp](./solutions/2001-2500/2483-minimum-penalty-for-a-shop.cpp) |
| 2485 | [Find the Pivot Integer](https://leetcode.com/problems/find-the-pivot-integer/) | Easy | [cpp](./solutions/2001-2500/2485-find-the-pivot-integer.cpp) |
| 2486 | [Append Characters to String to Make Subsequence](https://leetcode.com/problems/append-characters-to-string-to-make-subsequence/) | Medium | [cpp](./solutions/2001-2500/2486-append-characters-to-string-to-make-subsequence.cpp) |
| 2487 | [Remove Nodes From Linked List](https://leetcode.com/problems/remove-nodes-from-linked-list/) | Medium | [cpp](./solutions/2001-2500/2487-remove-nodes-from-linked-list.cpp) |
| 2488 | [Count Subarrays With Median K](https://leetcode.com/problems/count-subarrays-with-median-k/) | Hard | [python3](./solutions/2001-2500/2488-count-subarrays-with-median-k.py) |
| 2490 | [Circular Sentence](https://leetcode.com/problems/circular-sentence/) | Easy | [python3](./solutions/2001-2500/2490-circular-sentence.py) |
| 2491 | [Divide Players Into Teams of Equal Skill](https://leetcode.com/problems/divide-players-into-teams-of-equal-skill/) | Medium | [cpp](./solutions/2001-2500/2491-divide-players-into-teams-of-equal-skill.cpp) |
| 2492 | [Minimum Score of a Path Between Two Cities](https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities/) | Medium | [cpp](./solutions/2001-2500/2492-minimum-score-of-a-path-between-two-cities.cpp) |
| 2493 | [Divide Nodes Into the Maximum Number of Groups](https://leetcode.com/problems/divide-nodes-into-the-maximum-number-of-groups/) | Hard | [cpp](./solutions/2001-2500/2493-divide-nodes-into-the-maximum-number-of-groups.cpp) |
| 2496 | [Maximum Value of a String in an Array](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/) | Easy | [cpp](./solutions/2001-2500/2496-maximum-value-of-a-string-in-an-array.cpp) |
| 2497 | [Maximum Star Sum of a Graph](https://leetcode.com/problems/maximum-star-sum-of-a-graph/) | Medium | [cpp](./solutions/2001-2500/2497-maximum-star-sum-of-a-graph.cpp) |
| 2498 | [Frog Jump II](https://leetcode.com/problems/frog-jump-ii/) | Medium | [cpp](./solutions/2001-2500/2498-frog-jump-ii.cpp) |
| 2500 | [Delete Greatest Value in Each Row](https://leetcode.com/problems/delete-greatest-value-in-each-row/) | Easy | [cpp](./solutions/2001-2500/2500-delete-greatest-value-in-each-row.cpp) |
| 2501 | [Longest Square Streak in an Array](https://leetcode.com/problems/longest-square-streak-in-an-array/) | Medium | [cpp](./solutions/2501-3000/2501-longest-square-streak-in-an-array.cpp) |
| 2502 | [Design Memory Allocator](https://leetcode.com/problems/design-memory-allocator/) | Medium | [cpp](./solutions/2501-3000/2502-design-memory-allocator.cpp) |
| 2503 | [Maximum Number of Points From Grid Queries](https://leetcode.com/problems/maximum-number-of-points-from-grid-queries/) | Hard | [cpp](./solutions/2501-3000/2503-maximum-number-of-points-from-grid-queries.cpp) |
| 2506 | [Count Pairs Of Similar Strings](https://leetcode.com/problems/count-pairs-of-similar-strings/) | Easy | [cpp](./solutions/2501-3000/2506-count-pairs-of-similar-strings.cpp) |
| 2507 | [Smallest Value After Replacing With Sum of Prime Factors](https://leetcode.com/problems/smallest-value-after-replacing-with-sum-of-prime-factors/) | Medium | [cpp](./solutions/2501-3000/2507-smallest-value-after-replacing-with-sum-of-prime-factors.cpp) |
| 2508 | [Add Edges to Make Degrees of All Nodes Even](https://leetcode.com/problems/add-edges-to-make-degrees-of-all-nodes-even/) | Hard | [cpp](./solutions/2501-3000/2508-add-edges-to-make-degrees-of-all-nodes-even.cpp) |
| 2509 | [Cycle Length Queries in a Tree](https://leetcode.com/problems/cycle-length-queries-in-a-tree/) | Hard | [cpp](./solutions/2501-3000/2509-cycle-length-queries-in-a-tree.cpp) |
| 2511 | [Maximum Enemy Forts That Can Be Captured](https://leetcode.com/problems/maximum-enemy-forts-that-can-be-captured/) | Easy | [cpp](./solutions/2501-3000/2511-maximum-enemy-forts-that-can-be-captured.cpp) |
| 2512 | [Reward Top K Students](https://leetcode.com/problems/reward-top-k-students/) | Medium | [python3](./solutions/2501-3000/2512-reward-top-k-students.py) |
| 2513 | [Minimize the Maximum of Two Arrays](https://leetcode.com/problems/minimize-the-maximum-of-two-arrays/) | Medium | [cpp](./solutions/2501-3000/2513-minimize-the-maximum-of-two-arrays.cpp) |
| 2514 | [Count Anagrams](https://leetcode.com/problems/count-anagrams/) | Hard | [python3](./solutions/2501-3000/2514-count-anagrams.py) |
| 2515 | [Shortest Distance to Target String in a Circular Array](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array/) | Easy | [python3](./solutions/2501-3000/2515-shortest-distance-to-target-string-in-a-circular-array.py) |
| 2516 | [Take K of Each Character From Left and Right](https://leetcode.com/problems/take-k-of-each-character-from-left-and-right/) | Medium | [python3](./solutions/2501-3000/2516-take-k-of-each-character-from-left-and-right.py) |
| 2517 | [Maximum Tastiness of Candy Basket](https://leetcode.com/problems/maximum-tastiness-of-candy-basket/) | Medium | [python3](./solutions/2501-3000/2517-maximum-tastiness-of-candy-basket.py) |
| 2520 | [Count the Digits That Divide a Number](https://leetcode.com/problems/count-the-digits-that-divide-a-number/) | Easy | [cpp](./solutions/2501-3000/2520-count-the-digits-that-divide-a-number.cpp) |
| 2521 | [Distinct Prime Factors of Product of Array](https://leetcode.com/problems/distinct-prime-factors-of-product-of-array/) | Medium | [cpp](./solutions/2501-3000/2521-distinct-prime-factors-of-product-of-array.cpp) |
| 2522 | [Partition String Into Substrings With Values at Most K](https://leetcode.com/problems/partition-string-into-substrings-with-values-at-most-k/) | Medium | [cpp](./solutions/2501-3000/2522-partition-string-into-substrings-with-values-at-most-k.cpp) |
| 2523 | [Closest Prime Numbers in Range](https://leetcode.com/problems/closest-prime-numbers-in-range/) | Medium | [cpp](./solutions/2501-3000/2523-closest-prime-numbers-in-range.cpp) |
| 2525 | [Categorize Box According to Criteria](https://leetcode.com/problems/categorize-box-according-to-criteria/) | Easy | [cpp](./solutions/2501-3000/2525-categorize-box-according-to-criteria.cpp) |
| 2526 | [Find Consecutive Integers from a Data Stream](https://leetcode.com/problems/find-consecutive-integers-from-a-data-stream/) | Medium | [cpp](./solutions/2501-3000/2526-find-consecutive-integers-from-a-data-stream.cpp) |
| 2527 | [Find Xor-Beauty of Array](https://leetcode.com/problems/find-xor-beauty-of-array/) | Medium | [cpp](./solutions/2501-3000/2527-find-xor-beauty-of-array.cpp) |
| 2529 | [Maximum Count of Positive Integer and Negative Integer](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer/) | Easy | [cpp](./solutions/2501-3000/2529-maximum-count-of-positive-integer-and-negative-integer.cpp) |
| 2530 | [Maximal Score After Applying K Operations](https://leetcode.com/problems/maximal-score-after-applying-k-operations/) | Medium | [cpp](./solutions/2501-3000/2530-maximal-score-after-applying-k-operations.cpp) |
| 2531 | [Make Number of Distinct Characters Equal](https://leetcode.com/problems/make-number-of-distinct-characters-equal/) | Medium | [cpp](./solutions/2501-3000/2531-make-number-of-distinct-characters-equal.cpp) |
| 2535 | [Difference Between Element Sum and Digit Sum of an Array](https://leetcode.com/problems/difference-between-element-sum-and-digit-sum-of-an-array/) | Easy | [cpp](./solutions/2501-3000/2535-difference-between-element-sum-and-digit-sum-of-an-array.cpp) |
| 2536 | [Increment Submatrices by One](https://leetcode.com/problems/increment-submatrices-by-one/) | Medium | [cpp](./solutions/2501-3000/2536-increment-submatrices-by-one.cpp) |
| 2537 | [Count the Number of Good Subarrays](https://leetcode.com/problems/count-the-number-of-good-subarrays/) | Medium | [cpp](./solutions/2501-3000/2537-count-the-number-of-good-subarrays.cpp) |
| 2540 | [Minimum Common Value](https://leetcode.com/problems/minimum-common-value/) | Easy | [python3](./solutions/2501-3000/2540-minimum-common-value.py) |
| 2541 | [Minimum Operations to Make Array Equal II](https://leetcode.com/problems/minimum-operations-to-make-array-equal-ii/) | Medium | [python3](./solutions/2501-3000/2541-minimum-operations-to-make-array-equal-ii.py) |
| 2542 | [Maximum Subsequence Score](https://leetcode.com/problems/maximum-subsequence-score/) | Medium | [cpp](./solutions/2501-3000/2542-maximum-subsequence-score.cpp) |
| 2543 | [Check if Point Is Reachable](https://leetcode.com/problems/check-if-point-is-reachable/) | Hard | [python3](./solutions/2501-3000/2543-check-if-point-is-reachable.py) |
| 2544 | [Alternating Digit Sum](https://leetcode.com/problems/alternating-digit-sum/) | Easy | [python3](./solutions/2501-3000/2544-alternating-digit-sum.py) |
| 2545 | [Sort the Students by Their Kth Score](https://leetcode.com/problems/sort-the-students-by-their-kth-score/) | Medium | [python3](./solutions/2501-3000/2545-sort-the-students-by-their-kth-score.py) |
| 2546 | [Apply Bitwise Operations to Make Strings Equal](https://leetcode.com/problems/apply-bitwise-operations-to-make-strings-equal/) | Medium | [python3](./solutions/2501-3000/2546-apply-bitwise-operations-to-make-strings-equal.py) |
| 2547 | [Minimum Cost to Split an Array](https://leetcode.com/problems/minimum-cost-to-split-an-array/) | Hard | [cpp](./solutions/2501-3000/2547-minimum-cost-to-split-an-array.cpp) |
| 2549 | [Count Distinct Numbers on Board](https://leetcode.com/problems/count-distinct-numbers-on-board/) | Easy | [cpp](./solutions/2501-3000/2549-count-distinct-numbers-on-board.cpp) |
| 2550 | [Count Collisions of Monkeys on a Polygon](https://leetcode.com/problems/count-collisions-of-monkeys-on-a-polygon/) | Medium | [python3](./solutions/2501-3000/2550-count-collisions-of-monkeys-on-a-polygon.py) |
| 2551 | [Put Marbles in Bags](https://leetcode.com/problems/put-marbles-in-bags/) | Hard | [cpp](./solutions/2501-3000/2551-put-marbles-in-bags.cpp) |
| 2552 | [Count Increasing Quadruplets](https://leetcode.com/problems/count-increasing-quadruplets/) | Hard | [cpp](./solutions/2501-3000/2552-count-increasing-quadruplets.cpp) |
| 2553 | [Separate the Digits in an Array](https://leetcode.com/problems/separate-the-digits-in-an-array/) | Easy | [python3](./solutions/2501-3000/2553-separate-the-digits-in-an-array.py) |
| 2554 | [Maximum Number of Integers to Choose From a Range I](https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-i/) | Medium | [python3](./solutions/2501-3000/2554-maximum-number-of-integers-to-choose-from-a-range-i.py) |
| 2555 | [Maximize Win From Two Segments](https://leetcode.com/problems/maximize-win-from-two-segments/) | Medium | [python3](./solutions/2501-3000/2555-maximize-win-from-two-segments.py) |
| 2556 | [Disconnect Path in a Binary Matrix by at Most One Flip](https://leetcode.com/problems/disconnect-path-in-a-binary-matrix-by-at-most-one-flip/) | Medium | [cpp](./solutions/2501-3000/2556-disconnect-path-in-a-binary-matrix-by-at-most-one-flip.cpp) |
| 2558 | [Take Gifts From the Richest Pile](https://leetcode.com/problems/take-gifts-from-the-richest-pile/) | Easy | [cpp](./solutions/2501-3000/2558-take-gifts-from-the-richest-pile.cpp) |
| 2559 | [Count Vowel Strings in Ranges](https://leetcode.com/problems/count-vowel-strings-in-ranges/) | Medium | [cpp](./solutions/2501-3000/2559-count-vowel-strings-in-ranges.cpp) |
| 2560 | [House Robber IV](https://leetcode.com/problems/house-robber-iv/) | Medium | [python3](./solutions/2501-3000/2560-house-robber-iv.py) |
| 2561 | [Rearranging Fruits](https://leetcode.com/problems/rearranging-fruits/) | Hard | [python3](./solutions/2501-3000/2561-rearranging-fruits.py) |
| 2562 | [Find the Array Concatenation Value](https://leetcode.com/problems/find-the-array-concatenation-value/) | Easy | [python3](./solutions/2501-3000/2562-find-the-array-concatenation-value.py) |
| 2563 | [Count the Number of Fair Pairs](https://leetcode.com/problems/count-the-number-of-fair-pairs/) | Medium | [cpp](./solutions/2501-3000/2563-count-the-number-of-fair-pairs.cpp) |
| 2564 | [Substring XOR Queries](https://leetcode.com/problems/substring-xor-queries/) | Medium | [cpp](./solutions/2501-3000/2564-substring-xor-queries.cpp) |
| 2566 | [Maximum Difference by Remapping a Digit](https://leetcode.com/problems/maximum-difference-by-remapping-a-digit/) | Easy | [python3](./solutions/2501-3000/2566-maximum-difference-by-remapping-a-digit.py) |
| 2567 | [Minimum Score by Changing Two Elements](https://leetcode.com/problems/minimum-score-by-changing-two-elements/) | Medium | [python3](./solutions/2501-3000/2567-minimum-score-by-changing-two-elements.py) |
| 2568 | [Minimum Impossible OR](https://leetcode.com/problems/minimum-impossible-or/) | Medium | [cpp](./solutions/2501-3000/2568-minimum-impossible-or.cpp) |
| 2569 | [Handling Sum Queries After Update](https://leetcode.com/problems/handling-sum-queries-after-update/) | Hard | [cpp](./solutions/2501-3000/2569-handling-sum-queries-after-update.cpp) |
| 2570 | [Merge Two 2D Arrays by Summing Values](https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values/) | Easy | [python3](./solutions/2501-3000/2570-merge-two-2d-arrays-by-summing-values.py) |
| 2571 | [Minimum Operations to Reduce an Integer to 0](https://leetcode.com/problems/minimum-operations-to-reduce-an-integer-to-0/) | Medium | [python3](./solutions/2501-3000/2571-minimum-operations-to-reduce-an-integer-to-0.py) |
| 2572 | [Count the Number of Square-Free Subsets](https://leetcode.com/problems/count-the-number-of-square-free-subsets/) | Medium | [cpp](./solutions/2501-3000/2572-count-the-number-of-square-free-subsets.cpp) |
| 2574 | [Left and Right Sum Differences](https://leetcode.com/problems/left-and-right-sum-differences/) | Easy | [python3](./solutions/2501-3000/2574-left-and-right-sum-differences.py) |
| 2575 | [Find the Divisibility Array of a String](https://leetcode.com/problems/find-the-divisibility-array-of-a-string/) | Medium | [python3](./solutions/2501-3000/2575-find-the-divisibility-array-of-a-string.py) |
| 2576 | [Find the Maximum Number of Marked Indices](https://leetcode.com/problems/find-the-maximum-number-of-marked-indices/) | Medium | [cpp](./solutions/2501-3000/2576-find-the-maximum-number-of-marked-indices.cpp) |
| 2577 | [Minimum Time to Visit a Cell In a Grid](https://leetcode.com/problems/minimum-time-to-visit-a-cell-in-a-grid/) | Hard | [cpp](./solutions/2501-3000/2577-minimum-time-to-visit-a-cell-in-a-grid.cpp) |
| 2578 | [Split With Minimum Sum](https://leetcode.com/problems/split-with-minimum-sum/) | Easy | [python3](./solutions/2501-3000/2578-split-with-minimum-sum.py) |
| 2579 | [Count Total Number of Colored Cells](https://leetcode.com/problems/count-total-number-of-colored-cells/) | Medium | [python3](./solutions/2501-3000/2579-count-total-number-of-colored-cells.py) |
| 2580 | [Count Ways to Group Overlapping Ranges](https://leetcode.com/problems/count-ways-to-group-overlapping-ranges/) | Medium | [cpp](./solutions/2501-3000/2580-count-ways-to-group-overlapping-ranges.cpp) |
| 2581 | [Count Number of Possible Root Nodes](https://leetcode.com/problems/count-number-of-possible-root-nodes/) | Hard | [cpp](./solutions/2501-3000/2581-count-number-of-possible-root-nodes.cpp) |
| 2582 | [Pass the Pillow](https://leetcode.com/problems/pass-the-pillow/) | Easy | [python3](./solutions/2501-3000/2582-pass-the-pillow.py) |
| 2583 | [Kth Largest Sum in a Binary Tree](https://leetcode.com/problems/kth-largest-sum-in-a-binary-tree/) | Medium | [cpp](./solutions/2501-3000/2583-kth-largest-sum-in-a-binary-tree.cpp) |
| 2584 | [Split the Array to Make Coprime Products](https://leetcode.com/problems/split-the-array-to-make-coprime-products/) | Hard | [cpp](./solutions/2501-3000/2584-split-the-array-to-make-coprime-products.cpp) |
| 2585 | [Number of Ways to Earn Points](https://leetcode.com/problems/number-of-ways-to-earn-points/) | Hard | [cpp](./solutions/2501-3000/2585-number-of-ways-to-earn-points.cpp) |
| 2586 | [Count the Number of Vowel Strings in Range](https://leetcode.com/problems/count-the-number-of-vowel-strings-in-range/) | Easy | [python3](./solutions/2501-3000/2586-count-the-number-of-vowel-strings-in-range.py) |
| 2587 | [Rearrange Array to Maximize Prefix Score](https://leetcode.com/problems/rearrange-array-to-maximize-prefix-score/) | Medium | [cpp](./solutions/2501-3000/2587-rearrange-array-to-maximize-prefix-score.cpp) |
| 2588 | [Count the Number of Beautiful Subarrays](https://leetcode.com/problems/count-the-number-of-beautiful-subarrays/) | Medium | [cpp](./solutions/2501-3000/2588-count-the-number-of-beautiful-subarrays.cpp) |
| 2589 | [Minimum Time to Complete All Tasks](https://leetcode.com/problems/minimum-time-to-complete-all-tasks/) | Hard | [cpp](./solutions/2501-3000/2589-minimum-time-to-complete-all-tasks.cpp) |
| 2591 | [Distribute Money to Maximum Children](https://leetcode.com/problems/distribute-money-to-maximum-children/) | Easy | [cpp](./solutions/2501-3000/2591-distribute-money-to-maximum-children.cpp) |
| 2592 | [Maximize Greatness of an Array](https://leetcode.com/problems/maximize-greatness-of-an-array/) | Medium | [cpp](./solutions/2501-3000/2592-maximize-greatness-of-an-array.cpp) |
| 2593 | [Find Score of an Array After Marking All Elements](https://leetcode.com/problems/find-score-of-an-array-after-marking-all-elements/) | Medium | [cpp](./solutions/2501-3000/2593-find-score-of-an-array-after-marking-all-elements.cpp) |
| 2594 | [Minimum Time to Repair Cars](https://leetcode.com/problems/minimum-time-to-repair-cars/) | Medium | [cpp](./solutions/2501-3000/2594-minimum-time-to-repair-cars.cpp) |
| 2595 | [Number of Even and Odd Bits](https://leetcode.com/problems/number-of-even-and-odd-bits/) | Easy | [python3](./solutions/2501-3000/2595-number-of-even-and-odd-bits.py) |
| 2596 | [Check Knight Tour Configuration](https://leetcode.com/problems/check-knight-tour-configuration/) | Medium | [cpp](./solutions/2501-3000/2596-check-knight-tour-configuration.cpp) |
| 2597 | [The Number of Beautiful Subsets](https://leetcode.com/problems/the-number-of-beautiful-subsets/) | Medium | [cpp](./solutions/2501-3000/2597-the-number-of-beautiful-subsets.cpp) |
| 2598 | [Smallest Missing Non-negative Integer After Operations](https://leetcode.com/problems/smallest-missing-non-negative-integer-after-operations/) | Medium | [cpp](./solutions/2501-3000/2598-smallest-missing-non-negative-integer-after-operations.cpp) |
| 2600 | [K Items With the Maximum Sum](https://leetcode.com/problems/k-items-with-the-maximum-sum/) | Easy | [python3](./solutions/2501-3000/2600-k-items-with-the-maximum-sum.py) |
| 2601 | [Prime Subtraction Operation](https://leetcode.com/problems/prime-subtraction-operation/) | Medium | [cpp](./solutions/2501-3000/2601-prime-subtraction-operation.cpp) |
| 2602 | [Minimum Operations to Make All Array Elements Equal](https://leetcode.com/problems/minimum-operations-to-make-all-array-elements-equal/) | Medium | [cpp](./solutions/2501-3000/2602-minimum-operations-to-make-all-array-elements-equal.cpp) |
| 2605 | [Form Smallest Number From Two Digit Arrays](https://leetcode.com/problems/form-smallest-number-from-two-digit-arrays/) | Easy | [python3](./solutions/2501-3000/2605-form-smallest-number-from-two-digit-arrays.py) |
| 2606 | [Find the Substring With Maximum Cost](https://leetcode.com/problems/find-the-substring-with-maximum-cost/) | Medium | [python3](./solutions/2501-3000/2606-find-the-substring-with-maximum-cost.py) |
| 2607 | [Make K-Subarray Sums Equal](https://leetcode.com/problems/make-k-subarray-sums-equal/) | Medium | [python3](./solutions/2501-3000/2607-make-k-subarray-sums-equal.py) |
| 2608 | [Shortest Cycle in a Graph](https://leetcode.com/problems/shortest-cycle-in-a-graph/) | Hard | [cpp](./solutions/2501-3000/2608-shortest-cycle-in-a-graph.cpp) |
| 2609 | [Find the Longest Balanced Substring of a Binary String](https://leetcode.com/problems/find-the-longest-balanced-substring-of-a-binary-string/) | Easy | [python3](./solutions/2501-3000/2609-find-the-longest-balanced-substring-of-a-binary-string.py) |
| 2610 | [Convert an Array Into a 2D Array With Conditions](https://leetcode.com/problems/convert-an-array-into-a-2d-array-with-conditions/) | Medium | [python3](./solutions/2501-3000/2610-convert-an-array-into-a-2d-array-with-conditions.py) |
| 2611 | [Mice and Cheese](https://leetcode.com/problems/mice-and-cheese/) | Medium | [python3](./solutions/2501-3000/2611-mice-and-cheese.py) |
| 2614 | [Prime In Diagonal](https://leetcode.com/problems/prime-in-diagonal/) | Easy | [cpp](./solutions/2501-3000/2614-prime-in-diagonal.cpp) |
| 2615 | [Sum of Distances](https://leetcode.com/problems/sum-of-distances/) | Medium | [cpp](./solutions/2501-3000/2615-sum-of-distances.cpp) |
| 2616 | [Minimize the Maximum Difference of Pairs](https://leetcode.com/problems/minimize-the-maximum-difference-of-pairs/) | Medium | [python3](./solutions/2501-3000/2616-minimize-the-maximum-difference-of-pairs.py) |
| 2617 | [Minimum Number of Visited Cells in a Grid](https://leetcode.com/problems/minimum-number-of-visited-cells-in-a-grid/) | Hard | [cpp](./solutions/2501-3000/2617-minimum-number-of-visited-cells-in-a-grid.cpp) |
| 2620 | [Counter](https://leetcode.com/problems/counter/) | Easy | [javascript](./solutions/2501-3000/2620-counter.js) |
| 2626 | [Array Reduce Transformation](https://leetcode.com/problems/array-reduce-transformation/) | Easy | [javascript](./solutions/2501-3000/2626-array-reduce-transformation.js) |
| 2634 | [Filter Elements from Array](https://leetcode.com/problems/filter-elements-from-array/) | Easy | [javascript](./solutions/2501-3000/2634-filter-elements-from-array.js) |
| 2635 | [Apply Transform Over Each Element in Array](https://leetcode.com/problems/apply-transform-over-each-element-in-array/) | Easy | [javascript](./solutions/2501-3000/2635-apply-transform-over-each-element-in-array.js) |
| 2639 | [Find the Width of Columns of a Grid](https://leetcode.com/problems/find-the-width-of-columns-of-a-grid/) | Easy | [cpp](./solutions/2501-3000/2639-find-the-width-of-columns-of-a-grid.cpp) |
| 2640 | [Find the Score of All Prefixes of an Array](https://leetcode.com/problems/find-the-score-of-all-prefixes-of-an-array/) | Medium | [cpp](./solutions/2501-3000/2640-find-the-score-of-all-prefixes-of-an-array.cpp) |
| 2641 | [Cousins in Binary Tree II](https://leetcode.com/problems/cousins-in-binary-tree-ii/) | Medium | [cpp](./solutions/2501-3000/2641-cousins-in-binary-tree-ii.cpp) |
| 2642 | [Design Graph With Shortest Path Calculator](https://leetcode.com/problems/design-graph-with-shortest-path-calculator/) | Hard | [cpp](./solutions/2501-3000/2642-design-graph-with-shortest-path-calculator.cpp) |
| 2643 | [Row With Maximum Ones](https://leetcode.com/problems/row-with-maximum-ones/) | Easy | [python3](./solutions/2501-3000/2643-row-with-maximum-ones.py) |
| 2644 | [Find the Maximum Divisibility Score](https://leetcode.com/problems/find-the-maximum-divisibility-score/) | Easy | [cpp](./solutions/2501-3000/2644-find-the-maximum-divisibility-score.cpp) |
| 2645 | [Minimum Additions to Make Valid String](https://leetcode.com/problems/minimum-additions-to-make-valid-string/) | Medium | [python3](./solutions/2501-3000/2645-minimum-additions-to-make-valid-string.py) |
| 2646 | [Minimize the Total Price of the Trips](https://leetcode.com/problems/minimize-the-total-price-of-the-trips/) | Hard | [cpp](./solutions/2501-3000/2646-minimize-the-total-price-of-the-trips.cpp) |
| 2651 | [Calculate Delayed Arrival Time](https://leetcode.com/problems/calculate-delayed-arrival-time/) | Easy | [cpp](./solutions/2501-3000/2651-calculate-delayed-arrival-time.cpp) |
| 2652 | [Sum Multiples](https://leetcode.com/problems/sum-multiples/) | Easy | [cpp](./solutions/2501-3000/2652-sum-multiples.cpp) |
| 2653 | [Sliding Subarray Beauty](https://leetcode.com/problems/sliding-subarray-beauty/) | Medium | [python3](./solutions/2501-3000/2653-sliding-subarray-beauty.py) |
| 2654 | [Minimum Number of Operations to Make All Array Elements Equal to 1](https://leetcode.com/problems/minimum-number-of-operations-to-make-all-array-elements-equal-to-1/) | Medium | [python3](./solutions/2501-3000/2654-minimum-number-of-operations-to-make-all-array-elements-equal-to-1.py) |
| 2656 | [Maximum Sum With Exactly K Elements ](https://leetcode.com/problems/maximum-sum-with-exactly-k-elements/) | Easy | [python3](./solutions/2501-3000/2656-maximum-sum-with-exactly-k-elements.py) |
| 2657 | [Find the Prefix Common Array of Two Arrays](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/) | Medium | [python3](./solutions/2501-3000/2657-find-the-prefix-common-array-of-two-arrays.py) |
| 2658 | [Maximum Number of Fish in a Grid](https://leetcode.com/problems/maximum-number-of-fish-in-a-grid/) | Medium | [python3](./solutions/2501-3000/2658-maximum-number-of-fish-in-a-grid.py) |
| 2659 | [Make Array Empty](https://leetcode.com/problems/make-array-empty/) | Hard | [python3](./solutions/2501-3000/2659-make-array-empty.py) |
| 2660 | [Determine the Winner of a Bowling Game](https://leetcode.com/problems/determine-the-winner-of-a-bowling-game/) | Easy | [python3](./solutions/2501-3000/2660-determine-the-winner-of-a-bowling-game.py) |
| 2661 | [First Completely Painted Row or Column](https://leetcode.com/problems/first-completely-painted-row-or-column/) | Medium | [python3](./solutions/2501-3000/2661-first-completely-painted-row-or-column.py) |
| 2662 | [Minimum Cost of a Path With Special Roads](https://leetcode.com/problems/minimum-cost-of-a-path-with-special-roads/) | Medium | [cpp](./solutions/2501-3000/2662-minimum-cost-of-a-path-with-special-roads.cpp) |
| 2663 | [Lexicographically Smallest Beautiful String](https://leetcode.com/problems/lexicographically-smallest-beautiful-string/) | Hard | [python3](./solutions/2501-3000/2663-lexicographically-smallest-beautiful-string.py) |
| 2665 | [Counter II](https://leetcode.com/problems/counter-ii/) | Easy | [javascript](./solutions/2501-3000/2665-counter-ii.js) |
| 2667 | [Create Hello World Function](https://leetcode.com/problems/create-hello-world-function/) | Easy | [javascript](./solutions/2501-3000/2667-create-hello-world-function.js) |
| 2670 | [Find the Distinct Difference Array](https://leetcode.com/problems/find-the-distinct-difference-array/) | Easy | [python3](./solutions/2501-3000/2670-find-the-distinct-difference-array.py) |
| 2671 | [Frequency Tracker](https://leetcode.com/problems/frequency-tracker/) | Medium | [python3](./solutions/2501-3000/2671-frequency-tracker.py) |
| 2672 | [Number of Adjacent Elements With the Same Color](https://leetcode.com/problems/number-of-adjacent-elements-with-the-same-color/) | Medium | [python3](./solutions/2501-3000/2672-number-of-adjacent-elements-with-the-same-color.py) |
| 2673 | [Make Costs of Paths Equal in a Binary Tree](https://leetcode.com/problems/make-costs-of-paths-equal-in-a-binary-tree/) | Medium | [python3](./solutions/2501-3000/2673-make-costs-of-paths-equal-in-a-binary-tree.py) |
| 2678 | [Number of Senior Citizens](https://leetcode.com/problems/number-of-senior-citizens/) | Easy | [cpp](./solutions/2501-3000/2678-number-of-senior-citizens.cpp) |
| 2679 | [Sum in a Matrix](https://leetcode.com/problems/sum-in-a-matrix/) | Medium | [python3](./solutions/2501-3000/2679-sum-in-a-matrix.py) |
| 2680 | [Maximum OR](https://leetcode.com/problems/maximum-or/) | Medium | [cpp](./solutions/2501-3000/2680-maximum-or.cpp) |
| 2681 | [Power of Heroes](https://leetcode.com/problems/power-of-heroes/) | Hard | [python3](./solutions/2501-3000/2681-power-of-heroes.py) |
| 2682 | [Find the Losers of the Circular Game](https://leetcode.com/problems/find-the-losers-of-the-circular-game/) | Easy | [cpp](./solutions/2501-3000/2682-find-the-losers-of-the-circular-game.cpp) |
| 2683 | [Neighboring Bitwise XOR](https://leetcode.com/problems/neighboring-bitwise-xor/) | Medium | [cpp](./solutions/2501-3000/2683-neighboring-bitwise-xor.cpp) |
| 2684 | [Maximum Number of Moves in a Grid](https://leetcode.com/problems/maximum-number-of-moves-in-a-grid/) | Medium | [cpp](./solutions/2501-3000/2684-maximum-number-of-moves-in-a-grid.cpp) |
| 2685 | [Count the Number of Complete Components](https://leetcode.com/problems/count-the-number-of-complete-components/) | Medium | [python3](./solutions/2501-3000/2685-count-the-number-of-complete-components.py) |
| 2696 | [Minimum String Length After Removing Substrings](https://leetcode.com/problems/minimum-string-length-after-removing-substrings/) | Easy | [cpp](./solutions/2501-3000/2696-minimum-string-length-after-removing-substrings.cpp) |
| 2697 | [Lexicographically Smallest Palindrome](https://leetcode.com/problems/lexicographically-smallest-palindrome/) | Easy | [cpp](./solutions/2501-3000/2697-lexicographically-smallest-palindrome.cpp) |
| 2698 | [Find the Punishment Number of an Integer](https://leetcode.com/problems/find-the-punishment-number-of-an-integer/) | Medium | [python3](./solutions/2501-3000/2698-find-the-punishment-number-of-an-integer.py) |
| 2699 | [Modify Graph Edge Weights](https://leetcode.com/problems/modify-graph-edge-weights/) | Hard | [cpp](./solutions/2501-3000/2699-modify-graph-edge-weights.cpp) |
| 2704 | [To Be Or Not To Be](https://leetcode.com/problems/to-be-or-not-to-be/) | Easy | [javascript](./solutions/2501-3000/2704-to-be-or-not-to-be.js) |
| 2706 | [Buy Two Chocolates](https://leetcode.com/problems/buy-two-chocolates/) | Easy | [python3](./solutions/2501-3000/2706-buy-two-chocolates.py) |
| 2707 | [Extra Characters in a String](https://leetcode.com/problems/extra-characters-in-a-string/) | Medium | [cpp](./solutions/2501-3000/2707-extra-characters-in-a-string.cpp) |
| 2708 | [Maximum Strength of a Group](https://leetcode.com/problems/maximum-strength-of-a-group/) | Medium | [cpp](./solutions/2501-3000/2708-maximum-strength-of-a-group.cpp) |
| 2709 | [Greatest Common Divisor Traversal](https://leetcode.com/problems/greatest-common-divisor-traversal/) | Hard | [cpp](./solutions/2501-3000/2709-greatest-common-divisor-traversal.cpp) |
| 2710 | [Remove Trailing Zeros From a String](https://leetcode.com/problems/remove-trailing-zeros-from-a-string/) | Easy | [cpp](./solutions/2501-3000/2710-remove-trailing-zeros-from-a-string.cpp) |
| 2711 | [Difference of Number of Distinct Values on Diagonals](https://leetcode.com/problems/difference-of-number-of-distinct-values-on-diagonals/) | Medium | [cpp](./solutions/2501-3000/2711-difference-of-number-of-distinct-values-on-diagonals.cpp) |
| 2712 | [Minimum Cost to Make All Characters Equal](https://leetcode.com/problems/minimum-cost-to-make-all-characters-equal/) | Medium | [cpp](./solutions/2501-3000/2712-minimum-cost-to-make-all-characters-equal.cpp) |
| 2716 | [Minimize String Length](https://leetcode.com/problems/minimize-string-length/) | Easy | [python3](./solutions/2501-3000/2716-minimize-string-length.py) |
| 2717 | [Semi-Ordered Permutation](https://leetcode.com/problems/semi-ordered-permutation/) | Easy | [cpp](./solutions/2501-3000/2717-semi-ordered-permutation.cpp) |
| 2718 | [Sum of Matrix After Queries](https://leetcode.com/problems/sum-of-matrix-after-queries/) | Medium | [cpp](./solutions/2501-3000/2718-sum-of-matrix-after-queries.cpp) |
| 2719 | [Count of Integers](https://leetcode.com/problems/count-of-integers/) | Hard | [cpp](./solutions/2501-3000/2719-count-of-integers.cpp) |
| 2729 | [Check if The Number is Fascinating](https://leetcode.com/problems/check-if-the-number-is-fascinating/) | Easy | [python3](./solutions/2501-3000/2729-check-if-the-number-is-fascinating.py) |
| 2730 | [Find the Longest Semi-Repetitive Substring](https://leetcode.com/problems/find-the-longest-semi-repetitive-substring/) | Medium | [python3](./solutions/2501-3000/2730-find-the-longest-semi-repetitive-substring.py) |
| 2731 | [Movement of Robots](https://leetcode.com/problems/movement-of-robots/) | Medium | [cpp](./solutions/2501-3000/2731-movement-of-robots.cpp) |
| 2732 | [Find a Good Subset of the Matrix](https://leetcode.com/problems/find-a-good-subset-of-the-matrix/) | Hard | [cpp](./solutions/2501-3000/2732-find-a-good-subset-of-the-matrix.cpp) |
| 2733 | [Neither Minimum nor Maximum](https://leetcode.com/problems/neither-minimum-nor-maximum/) | Easy | [python3](./solutions/2501-3000/2733-neither-minimum-nor-maximum.py) |
| 2734 | [Lexicographically Smallest String After Substring Operation](https://leetcode.com/problems/lexicographically-smallest-string-after-substring-operation/) | Medium | [cpp](./solutions/2501-3000/2734-lexicographically-smallest-string-after-substring-operation.cpp) |
| 2735 | [Collecting Chocolates](https://leetcode.com/problems/collecting-chocolates/) | Medium | [cpp](./solutions/2501-3000/2735-collecting-chocolates.cpp) |
| 2736 | [Maximum Sum Queries](https://leetcode.com/problems/maximum-sum-queries/) | Hard | [cpp](./solutions/2501-3000/2736-maximum-sum-queries.cpp) |
| 2739 | [Total Distance Traveled](https://leetcode.com/problems/total-distance-traveled/) | Easy | [cpp](./solutions/2501-3000/2739-total-distance-traveled.cpp) |
| 2740 | [Find the Value of the Partition](https://leetcode.com/problems/find-the-value-of-the-partition/) | Medium | [cpp](./solutions/2501-3000/2740-find-the-value-of-the-partition.cpp) |
| 2741 | [Special Permutations](https://leetcode.com/problems/special-permutations/) | Medium | [cpp](./solutions/2501-3000/2741-special-permutations.cpp) |
| 2742 | [Painting the Walls](https://leetcode.com/problems/painting-the-walls/) | Hard | [cpp](./solutions/2501-3000/2742-painting-the-walls.cpp) |
| 2744 | [Find Maximum Number of String Pairs](https://leetcode.com/problems/find-maximum-number-of-string-pairs/) | Easy | [cpp](./solutions/2501-3000/2744-find-maximum-number-of-string-pairs.cpp) |
| 2745 | [Construct the Longest New String](https://leetcode.com/problems/construct-the-longest-new-string/) | Medium | [cpp](./solutions/2501-3000/2745-construct-the-longest-new-string.cpp) |
| 2746 | [Decremental String Concatenation](https://leetcode.com/problems/decremental-string-concatenation/) | Medium | [cpp](./solutions/2501-3000/2746-decremental-string-concatenation.cpp) |
| 2747 | [Count Zero Request Servers](https://leetcode.com/problems/count-zero-request-servers/) | Medium | [python3](./solutions/2501-3000/2747-count-zero-request-servers.py) |
| 2748 | [Number of Beautiful Pairs](https://leetcode.com/problems/number-of-beautiful-pairs/) | Easy | [python3](./solutions/2501-3000/2748-number-of-beautiful-pairs.py) |
| 2749 | [Minimum Operations to Make the Integer Zero](https://leetcode.com/problems/minimum-operations-to-make-the-integer-zero/) | Medium | [python3](./solutions/2501-3000/2749-minimum-operations-to-make-the-integer-zero.py) |
| 2750 | [Ways to Split Array Into Good Subarrays](https://leetcode.com/problems/ways-to-split-array-into-good-subarrays/) | Medium | [python3](./solutions/2501-3000/2750-ways-to-split-array-into-good-subarrays.py) |
| 2751 | [Robot Collisions](https://leetcode.com/problems/robot-collisions/) | Hard | [python3](./solutions/2501-3000/2751-robot-collisions.py) |
| 2760 | [Longest Even Odd Subarray With Threshold](https://leetcode.com/problems/longest-even-odd-subarray-with-threshold/) | Easy | [cpp](./solutions/2501-3000/2760-longest-even-odd-subarray-with-threshold.cpp) |
| 2761 | [Prime Pairs With Target Sum](https://leetcode.com/problems/prime-pairs-with-target-sum/) | Medium | [cpp](./solutions/2501-3000/2761-prime-pairs-with-target-sum.cpp) |
| 2762 | [Continuous Subarrays](https://leetcode.com/problems/continuous-subarrays/) | Medium | [cpp](./solutions/2501-3000/2762-continuous-subarrays.cpp) |
| 2763 | [Sum of Imbalance Numbers of All Subarrays](https://leetcode.com/problems/sum-of-imbalance-numbers-of-all-subarrays/) | Hard | [cpp](./solutions/2501-3000/2763-sum-of-imbalance-numbers-of-all-subarrays.cpp) |
| 2765 | [Longest Alternating Subarray](https://leetcode.com/problems/longest-alternating-subarray/) | Easy | [cpp](./solutions/2501-3000/2765-longest-alternating-subarray.cpp) |
| 2766 | [Relocate Marbles](https://leetcode.com/problems/relocate-marbles/) | Medium | [cpp](./solutions/2501-3000/2766-relocate-marbles.cpp) |
| 2767 | [Partition String Into Minimum Beautiful Substrings](https://leetcode.com/problems/partition-string-into-minimum-beautiful-substrings/) | Medium | [cpp](./solutions/2501-3000/2767-partition-string-into-minimum-beautiful-substrings.cpp) |
| 2768 | [Number of Black Blocks](https://leetcode.com/problems/number-of-black-blocks/) | Medium | [cpp](./solutions/2501-3000/2768-number-of-black-blocks.cpp) |
| 2769 | [Find the Maximum Achievable Number](https://leetcode.com/problems/find-the-maximum-achievable-number/) | Easy | [cpp](./solutions/2501-3000/2769-find-the-maximum-achievable-number.cpp) |
| 2770 | [Maximum Number of Jumps to Reach the Last Index](https://leetcode.com/problems/maximum-number-of-jumps-to-reach-the-last-index/) | Medium | [cpp](./solutions/2501-3000/2770-maximum-number-of-jumps-to-reach-the-last-index.cpp) |
| 2771 | [Longest Non-decreasing Subarray From Two Arrays](https://leetcode.com/problems/longest-non-decreasing-subarray-from-two-arrays/) | Medium | [cpp](./solutions/2501-3000/2771-longest-non-decreasing-subarray-from-two-arrays.cpp) |
| 2772 | [Apply Operations to Make All Array Elements Equal to Zero](https://leetcode.com/problems/apply-operations-to-make-all-array-elements-equal-to-zero/) | Medium | [cpp](./solutions/2501-3000/2772-apply-operations-to-make-all-array-elements-equal-to-zero.cpp) |
| 2778 | [Sum of Squares of Special Elements ](https://leetcode.com/problems/sum-of-squares-of-special-elements/) | Easy | [cpp](./solutions/2501-3000/2778-sum-of-squares-of-special-elements.cpp) |
| 2779 | [Maximum Beauty of an Array After Applying Operation](https://leetcode.com/problems/maximum-beauty-of-an-array-after-applying-operation/) | Medium | [cpp](./solutions/2501-3000/2779-maximum-beauty-of-an-array-after-applying-operation.cpp) |
| 2780 | [Minimum Index of a Valid Split](https://leetcode.com/problems/minimum-index-of-a-valid-split/) | Medium | [cpp](./solutions/2501-3000/2780-minimum-index-of-a-valid-split.cpp) |
| 2781 | [Length of the Longest Valid Substring](https://leetcode.com/problems/length-of-the-longest-valid-substring/) | Hard | [cpp](./solutions/2501-3000/2781-length-of-the-longest-valid-substring.cpp) |
| 2784 | [Check if Array is Good](https://leetcode.com/problems/check-if-array-is-good/) | Easy | [cpp](./solutions/2501-3000/2784-check-if-array-is-good.cpp) |
| 2785 | [Sort Vowels in a String](https://leetcode.com/problems/sort-vowels-in-a-string/) | Medium | [cpp](./solutions/2501-3000/2785-sort-vowels-in-a-string.cpp) |
| 2786 | [Visit Array Positions to Maximize Score](https://leetcode.com/problems/visit-array-positions-to-maximize-score/) | Medium | [cpp](./solutions/2501-3000/2786-visit-array-positions-to-maximize-score.cpp) |
| 2787 | [Ways to Express an Integer as Sum of Powers](https://leetcode.com/problems/ways-to-express-an-integer-as-sum-of-powers/) | Medium | [cpp](./solutions/2501-3000/2787-ways-to-express-an-integer-as-sum-of-powers.cpp) |
| 2788 | [Split Strings by Separator](https://leetcode.com/problems/split-strings-by-separator/) | Easy | [python3](./solutions/2501-3000/2788-split-strings-by-separator.py) |
| 2789 | [Largest Element in an Array after Merge Operations](https://leetcode.com/problems/largest-element-in-an-array-after-merge-operations/) | Medium | [python3](./solutions/2501-3000/2789-largest-element-in-an-array-after-merge-operations.py) |
| 2791 | [Count Paths That Can Form a Palindrome in a Tree](https://leetcode.com/problems/count-paths-that-can-form-a-palindrome-in-a-tree/) | Hard | [cpp](./solutions/2501-3000/2791-count-paths-that-can-form-a-palindrome-in-a-tree.cpp) |
| 2798 | [Number of Employees Who Met the Target](https://leetcode.com/problems/number-of-employees-who-met-the-target/) | Easy | [python3](./solutions/2501-3000/2798-number-of-employees-who-met-the-target.py) |
| 2799 | [Count Complete Subarrays in an Array](https://leetcode.com/problems/count-complete-subarrays-in-an-array/) | Medium | [python3](./solutions/2501-3000/2799-count-complete-subarrays-in-an-array.py) |
| 2800 | [Shortest String That Contains Three Strings](https://leetcode.com/problems/shortest-string-that-contains-three-strings/) | Medium | [python3](./solutions/2501-3000/2800-shortest-string-that-contains-three-strings.py) |
| 2801 | [Count Stepping Numbers in Range](https://leetcode.com/problems/count-stepping-numbers-in-range/) | Hard | [python3](./solutions/2501-3000/2801-count-stepping-numbers-in-range.py) |
| 2806 | [Account Balance After Rounded Purchase](https://leetcode.com/problems/account-balance-after-rounded-purchase/) | Easy | [cpp](./solutions/2501-3000/2806-account-balance-after-rounded-purchase.cpp) |
| 2807 | [Insert Greatest Common Divisors in Linked List](https://leetcode.com/problems/insert-greatest-common-divisors-in-linked-list/) | Medium | [cpp](./solutions/2501-3000/2807-insert-greatest-common-divisors-in-linked-list.cpp) |
| 2808 | [Minimum Seconds to Equalize a Circular Array](https://leetcode.com/problems/minimum-seconds-to-equalize-a-circular-array/) | Medium | [cpp](./solutions/2501-3000/2808-minimum-seconds-to-equalize-a-circular-array.cpp) |
| 2809 | [Minimum Time to Make Array Sum At Most x](https://leetcode.com/problems/minimum-time-to-make-array-sum-at-most-x/) | Hard | [cpp](./solutions/2501-3000/2809-minimum-time-to-make-array-sum-at-most-x.cpp) |
| 2810 | [Faulty Keyboard](https://leetcode.com/problems/faulty-keyboard/) | Easy | [cpp](./solutions/2501-3000/2810-faulty-keyboard.cpp) |
| 2811 | [Check if it is Possible to Split Array](https://leetcode.com/problems/check-if-it-is-possible-to-split-array/) | Medium | [cpp](./solutions/2501-3000/2811-check-if-it-is-possible-to-split-array.cpp) |
| 2812 | [Find the Safest Path in a Grid](https://leetcode.com/problems/find-the-safest-path-in-a-grid/) | Medium | [python3](./solutions/2501-3000/2812-find-the-safest-path-in-a-grid.py) |
| 2813 | [Maximum Elegance of a K-Length Subsequence](https://leetcode.com/problems/maximum-elegance-of-a-k-length-subsequence/) | Hard | [python3](./solutions/2501-3000/2813-maximum-elegance-of-a-k-length-subsequence.py) |
| 2815 | [Max Pair Sum in an Array](https://leetcode.com/problems/max-pair-sum-in-an-array/) | Easy | [python3](./solutions/2501-3000/2815-max-pair-sum-in-an-array.py) |
| 2816 | [Double a Number Represented as a Linked List](https://leetcode.com/problems/double-a-number-represented-as-a-linked-list/) | Medium | [python3](./solutions/2501-3000/2816-double-a-number-represented-as-a-linked-list.py) |
| 2817 | [Minimum Absolute Difference Between Elements With Constraint](https://leetcode.com/problems/minimum-absolute-difference-between-elements-with-constraint/) | Medium | [cpp](./solutions/2501-3000/2817-minimum-absolute-difference-between-elements-with-constraint.cpp) |
| 2818 | [Apply Operations to Maximize Score](https://leetcode.com/problems/apply-operations-to-maximize-score/) | Hard | [cpp](./solutions/2501-3000/2818-apply-operations-to-maximize-score.cpp) |
| 2824 | [Count Pairs Whose Sum is Less than Target](https://leetcode.com/problems/count-pairs-whose-sum-is-less-than-target/) | Easy | [cpp](./solutions/2501-3000/2824-count-pairs-whose-sum-is-less-than-target.cpp) |
| 2825 | [Make String a Subsequence Using Cyclic Increments](https://leetcode.com/problems/make-string-a-subsequence-using-cyclic-increments/) | Medium | [python3](./solutions/2501-3000/2825-make-string-a-subsequence-using-cyclic-increments.py) |
| 2826 | [Sorting Three Groups](https://leetcode.com/problems/sorting-three-groups/) | Medium | [python3](./solutions/2501-3000/2826-sorting-three-groups.py) |
| 2827 | [Number of Beautiful Integers in the Range](https://leetcode.com/problems/number-of-beautiful-integers-in-the-range/) | Hard | [python3](./solutions/2501-3000/2827-number-of-beautiful-integers-in-the-range.py) |
| 2828 | [Check if a String Is an Acronym of Words](https://leetcode.com/problems/check-if-a-string-is-an-acronym-of-words/) | Easy | [cpp](./solutions/2501-3000/2828-check-if-a-string-is-an-acronym-of-words.cpp) |
| 2829 | [Determine the Minimum Sum of a k-avoiding Array](https://leetcode.com/problems/determine-the-minimum-sum-of-a-k-avoiding-array/) | Medium | [cpp](./solutions/2501-3000/2829-determine-the-minimum-sum-of-a-k-avoiding-array.cpp) |
| 2830 | [Maximize the Profit as the Salesman](https://leetcode.com/problems/maximize-the-profit-as-the-salesman/) | Medium | [cpp](./solutions/2501-3000/2830-maximize-the-profit-as-the-salesman.cpp) |
| 2831 | [Find the Longest Equal Subarray](https://leetcode.com/problems/find-the-longest-equal-subarray/) | Medium | [cpp](./solutions/2501-3000/2831-find-the-longest-equal-subarray.cpp) |
| 2833 | [Furthest Point From Origin](https://leetcode.com/problems/furthest-point-from-origin/) | Easy | [python3](./solutions/2501-3000/2833-furthest-point-from-origin.py) |
| 2834 | [Find the Minimum Possible Sum of a Beautiful Array](https://leetcode.com/problems/find-the-minimum-possible-sum-of-a-beautiful-array/) | Medium | [python3](./solutions/2501-3000/2834-find-the-minimum-possible-sum-of-a-beautiful-array.py) |
| 2835 | [Minimum Operations to Form Subsequence With Target Sum](https://leetcode.com/problems/minimum-operations-to-form-subsequence-with-target-sum/) | Hard | [python3](./solutions/2501-3000/2835-minimum-operations-to-form-subsequence-with-target-sum.py) |
| 2836 | [Maximize Value of Function in a Ball Passing Game](https://leetcode.com/problems/maximize-value-of-function-in-a-ball-passing-game/) | Hard | [python3](./solutions/2501-3000/2836-maximize-value-of-function-in-a-ball-passing-game.py) |
| 2839 | [Check if Strings Can be Made Equal With Operations I](https://leetcode.com/problems/check-if-strings-can-be-made-equal-with-operations-i/) | Easy | [cpp](./solutions/2501-3000/2839-check-if-strings-can-be-made-equal-with-operations-i.cpp) |
| 2840 | [Check if Strings Can be Made Equal With Operations II](https://leetcode.com/problems/check-if-strings-can-be-made-equal-with-operations-ii/) | Medium | [cpp](./solutions/2501-3000/2840-check-if-strings-can-be-made-equal-with-operations-ii.cpp) |
| 2841 | [Maximum Sum of Almost Unique Subarray](https://leetcode.com/problems/maximum-sum-of-almost-unique-subarray/) | Medium | [cpp](./solutions/2501-3000/2841-maximum-sum-of-almost-unique-subarray.cpp) |
| 2842 | [Count K-Subsequences of a String With Maximum Beauty](https://leetcode.com/problems/count-k-subsequences-of-a-string-with-maximum-beauty/) | Hard | [cpp](./solutions/2501-3000/2842-count-k-subsequences-of-a-string-with-maximum-beauty.cpp) |
| 2843 | [  Count Symmetric Integers](https://leetcode.com/problems/count-symmetric-integers/) | Easy | [cpp](./solutions/2501-3000/2843-count-symmetric-integers.cpp) |
| 2844 | [Minimum Operations to Make a Special Number](https://leetcode.com/problems/minimum-operations-to-make-a-special-number/) | Medium | [cpp](./solutions/2501-3000/2844-minimum-operations-to-make-a-special-number.cpp) |
| 2845 | [Count of Interesting Subarrays](https://leetcode.com/problems/count-of-interesting-subarrays/) | Medium | [cpp](./solutions/2501-3000/2845-count-of-interesting-subarrays.cpp) |
| 2846 | [Minimum Edge Weight Equilibrium Queries in a Tree](https://leetcode.com/problems/minimum-edge-weight-equilibrium-queries-in-a-tree/) | Hard | [cpp](./solutions/2501-3000/2846-minimum-edge-weight-equilibrium-queries-in-a-tree.cpp) |
| 2848 | [Points That Intersect With Cars](https://leetcode.com/problems/points-that-intersect-with-cars/) | Easy | [cpp](./solutions/2501-3000/2848-points-that-intersect-with-cars.cpp) |
| 2849 | [Determine if a Cell Is Reachable at a Given Time](https://leetcode.com/problems/determine-if-a-cell-is-reachable-at-a-given-time/) | Medium | [cpp](./solutions/2501-3000/2849-determine-if-a-cell-is-reachable-at-a-given-time.cpp) |
| 2850 | [Minimum Moves to Spread Stones Over Grid](https://leetcode.com/problems/minimum-moves-to-spread-stones-over-grid/) | Medium | [cpp](./solutions/2501-3000/2850-minimum-moves-to-spread-stones-over-grid.cpp) |
| 2855 | [Minimum Right Shifts to Sort the Array](https://leetcode.com/problems/minimum-right-shifts-to-sort-the-array/) | Easy | [cpp](./solutions/2501-3000/2855-minimum-right-shifts-to-sort-the-array.cpp) |
| 2856 | [Minimum Array Length After Pair Removals](https://leetcode.com/problems/minimum-array-length-after-pair-removals/) | Medium | [cpp](./solutions/2501-3000/2856-minimum-array-length-after-pair-removals.cpp) |
| 2857 | [Count Pairs of Points With Distance k](https://leetcode.com/problems/count-pairs-of-points-with-distance-k/) | Medium | [cpp](./solutions/2501-3000/2857-count-pairs-of-points-with-distance-k.cpp) |
| 2858 | [Minimum Edge Reversals So Every Node Is Reachable](https://leetcode.com/problems/minimum-edge-reversals-so-every-node-is-reachable/) | Hard | [cpp](./solutions/2501-3000/2858-minimum-edge-reversals-so-every-node-is-reachable.cpp) |
| 2859 | [Sum of Values at Indices With K Set Bits](https://leetcode.com/problems/sum-of-values-at-indices-with-k-set-bits/) | Easy | [cpp](./solutions/2501-3000/2859-sum-of-values-at-indices-with-k-set-bits.cpp) |
| 2860 | [Happy Students](https://leetcode.com/problems/happy-students/) | Medium | [cpp](./solutions/2501-3000/2860-happy-students.cpp) |
| 2861 | [Maximum Number of Alloys](https://leetcode.com/problems/maximum-number-of-alloys/) | Medium | [cpp](./solutions/2501-3000/2861-maximum-number-of-alloys.cpp) |
| 2862 | [Maximum Element-Sum of a Complete Subset of Indices](https://leetcode.com/problems/maximum-element-sum-of-a-complete-subset-of-indices/) | Hard | [cpp](./solutions/2501-3000/2862-maximum-element-sum-of-a-complete-subset-of-indices.cpp) |
| 2864 | [Maximum Odd Binary Number](https://leetcode.com/problems/maximum-odd-binary-number/) | Easy | [cpp](./solutions/2501-3000/2864-maximum-odd-binary-number.cpp) |
| 2865 | [Beautiful Towers I](https://leetcode.com/problems/beautiful-towers-i/) | Medium | [cpp](./solutions/2501-3000/2865-beautiful-towers-i.cpp) |
| 2866 | [Beautiful Towers II](https://leetcode.com/problems/beautiful-towers-ii/) | Medium | [cpp](./solutions/2501-3000/2866-beautiful-towers-ii.cpp) |
| 2867 | [Count Valid Paths in a Tree](https://leetcode.com/problems/count-valid-paths-in-a-tree/) | Hard | [cpp](./solutions/2501-3000/2867-count-valid-paths-in-a-tree.cpp) |
| 2869 | [Minimum Operations to Collect Elements](https://leetcode.com/problems/minimum-operations-to-collect-elements/) | Easy | [cpp](./solutions/2501-3000/2869-minimum-operations-to-collect-elements.cpp) |
| 2870 | [Minimum Number of Operations to Make Array Empty](https://leetcode.com/problems/minimum-number-of-operations-to-make-array-empty/) | Medium | [cpp](./solutions/2501-3000/2870-minimum-number-of-operations-to-make-array-empty.cpp) |
| 2871 | [Split Array Into Maximum Number of Subarrays](https://leetcode.com/problems/split-array-into-maximum-number-of-subarrays/) | Medium | [cpp](./solutions/2501-3000/2871-split-array-into-maximum-number-of-subarrays.cpp) |
| 2872 | [Maximum Number of K-Divisible Components](https://leetcode.com/problems/maximum-number-of-k-divisible-components/) | Hard | [cpp](./solutions/2501-3000/2872-maximum-number-of-k-divisible-components.cpp) |
| 2873 | [Maximum Value of an Ordered Triplet I](https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-i/) | Easy | [cpp](./solutions/2501-3000/2873-maximum-value-of-an-ordered-triplet-i.cpp) |
| 2874 | [Maximum Value of an Ordered Triplet II](https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-ii/) | Medium | [cpp](./solutions/2501-3000/2874-maximum-value-of-an-ordered-triplet-ii.cpp) |
| 2875 | [Minimum Size Subarray in Infinite Array](https://leetcode.com/problems/minimum-size-subarray-in-infinite-array/) | Medium | [cpp](./solutions/2501-3000/2875-minimum-size-subarray-in-infinite-array.cpp) |
| 2876 | [Count Visited Nodes in a Directed Graph](https://leetcode.com/problems/count-visited-nodes-in-a-directed-graph/) | Hard | [cpp](./solutions/2501-3000/2876-count-visited-nodes-in-a-directed-graph.cpp) |
| 2894 | [Divisible and Non-divisible Sums Difference](https://leetcode.com/problems/divisible-and-non-divisible-sums-difference/) | Easy | [cpp](./solutions/2501-3000/2894-divisible-and-non-divisible-sums-difference.cpp) |
| 2895 | [Minimum Processing Time](https://leetcode.com/problems/minimum-processing-time/) | Medium | [cpp](./solutions/2501-3000/2895-minimum-processing-time.cpp) |
| 2899 | [Last Visited Integers](https://leetcode.com/problems/last-visited-integers/) | Easy | [cpp](./solutions/2501-3000/2899-last-visited-integers.cpp) |
| 2900 | [Longest Unequal Adjacent Groups Subsequence I](https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-i/) | Easy | [cpp](./solutions/2501-3000/2900-longest-unequal-adjacent-groups-subsequence-i.cpp) |
| 2901 | [Longest Unequal Adjacent Groups Subsequence II](https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-ii/) | Medium | [cpp](./solutions/2501-3000/2901-longest-unequal-adjacent-groups-subsequence-ii.cpp) |
| 2904 | [Shortest and Lexicographically Smallest Beautiful String](https://leetcode.com/problems/shortest-and-lexicographically-smallest-beautiful-string/) | Medium | [cpp](./solutions/2501-3000/2904-shortest-and-lexicographically-smallest-beautiful-string.cpp) |
| 2908 | [Minimum Sum of Mountain Triplets I](https://leetcode.com/problems/minimum-sum-of-mountain-triplets-i/) | Easy | [cpp](./solutions/2501-3000/2908-minimum-sum-of-mountain-triplets-i.cpp) |
| 2909 | [Minimum Sum of Mountain Triplets II](https://leetcode.com/problems/minimum-sum-of-mountain-triplets-ii/) | Medium | [cpp](./solutions/2501-3000/2909-minimum-sum-of-mountain-triplets-ii.cpp) |
| 2917 | [Find the K-or of an Array](https://leetcode.com/problems/find-the-k-or-of-an-array/) | Easy | [cpp](./solutions/2501-3000/2917-find-the-k-or-of-an-array.cpp) |
| 2918 | [Minimum Equal Sum of Two Arrays After Replacing Zeros](https://leetcode.com/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros/) | Medium | [cpp](./solutions/2501-3000/2918-minimum-equal-sum-of-two-arrays-after-replacing-zeros.cpp) |
| 2919 | [Minimum Increment Operations to Make Array Beautiful](https://leetcode.com/problems/minimum-increment-operations-to-make-array-beautiful/) | Medium | [cpp](./solutions/2501-3000/2919-minimum-increment-operations-to-make-array-beautiful.cpp) |
| 2920 | [Maximum Points After Collecting Coins From All Nodes](https://leetcode.com/problems/maximum-points-after-collecting-coins-from-all-nodes/) | Hard | [cpp](./solutions/2501-3000/2920-maximum-points-after-collecting-coins-from-all-nodes.cpp) |
| 2923 | [Find Champion I](https://leetcode.com/problems/find-champion-i/) | Easy | [cpp](./solutions/2501-3000/2923-find-champion-i.cpp) |
| 2924 | [Find Champion II](https://leetcode.com/problems/find-champion-ii/) | Medium | [cpp](./solutions/2501-3000/2924-find-champion-ii.cpp) |
| 2925 | [Maximum Score After Applying Operations on a Tree](https://leetcode.com/problems/maximum-score-after-applying-operations-on-a-tree/) | Medium | [cpp](./solutions/2501-3000/2925-maximum-score-after-applying-operations-on-a-tree.cpp) |
| 2926 | [Maximum Balanced Subsequence Sum](https://leetcode.com/problems/maximum-balanced-subsequence-sum/) | Hard | [cpp](./solutions/2501-3000/2926-maximum-balanced-subsequence-sum.cpp) |
| 2930 | [Number of Strings Which Can Be Rearranged to Contain Substring](https://leetcode.com/problems/number-of-strings-which-can-be-rearranged-to-contain-substring/) | Medium | [cpp](./solutions/2501-3000/2930-number-of-strings-which-can-be-rearranged-to-contain-substring.cpp) |
| 2931 | [Maximum Spending After Buying Items](https://leetcode.com/problems/maximum-spending-after-buying-items/) | Hard | [cpp](./solutions/2501-3000/2931-maximum-spending-after-buying-items.cpp) |
| 2932 | [Maximum Strong Pair XOR I](https://leetcode.com/problems/maximum-strong-pair-xor-i/) | Easy | [cpp](./solutions/2501-3000/2932-maximum-strong-pair-xor-i.cpp) |
| 2933 | [High-Access Employees](https://leetcode.com/problems/high-access-employees/) | Medium | [python3](./solutions/2501-3000/2933-high-access-employees.py) |
| 2934 | [Minimum Operations to Maximize Last Elements in Arrays](https://leetcode.com/problems/minimum-operations-to-maximize-last-elements-in-arrays/) | Medium | [cpp](./solutions/2501-3000/2934-minimum-operations-to-maximize-last-elements-in-arrays.cpp) |
| 2937 | [Make Three Strings Equal](https://leetcode.com/problems/make-three-strings-equal/) | Easy | [cpp](./solutions/2501-3000/2937-make-three-strings-equal.cpp) |
| 2938 | [Separate Black and White Balls](https://leetcode.com/problems/separate-black-and-white-balls/) | Medium | [cpp](./solutions/2501-3000/2938-separate-black-and-white-balls.cpp) |
| 2939 | [Maximum Xor Product](https://leetcode.com/problems/maximum-xor-product/) | Medium | [cpp](./solutions/2501-3000/2939-maximum-xor-product.cpp) |
| 2940 | [Find Building Where Alice and Bob Can Meet](https://leetcode.com/problems/find-building-where-alice-and-bob-can-meet/) | Hard | [cpp](./solutions/2501-3000/2940-find-building-where-alice-and-bob-can-meet.cpp) |
| 2942 | [Find Words Containing Character](https://leetcode.com/problems/find-words-containing-character/) | Easy | [cpp](./solutions/2501-3000/2942-find-words-containing-character.cpp) |
| 2943 | [Maximize Area of Square Hole in Grid](https://leetcode.com/problems/maximize-area-of-square-hole-in-grid/) | Medium | [cpp](./solutions/2501-3000/2943-maximize-area-of-square-hole-in-grid.cpp) |
| 2944 | [Minimum Number of Coins for Fruits](https://leetcode.com/problems/minimum-number-of-coins-for-fruits/) | Medium | [cpp](./solutions/2501-3000/2944-minimum-number-of-coins-for-fruits.cpp) |
| 2946 | [Matrix Similarity After Cyclic Shifts](https://leetcode.com/problems/matrix-similarity-after-cyclic-shifts/) | Easy | [cpp](./solutions/2501-3000/2946-matrix-similarity-after-cyclic-shifts.cpp) |
| 2948 | [Make Lexicographically Smallest Array by Swapping Elements](https://leetcode.com/problems/make-lexicographically-smallest-array-by-swapping-elements/) | Medium | [cpp](./solutions/2501-3000/2948-make-lexicographically-smallest-array-by-swapping-elements.cpp) |
| 2951 | [Find the Peaks](https://leetcode.com/problems/find-the-peaks/) | Easy | [cpp](./solutions/2501-3000/2951-find-the-peaks.cpp) |
| 2952 | [Minimum Number of Coins to be Added](https://leetcode.com/problems/minimum-number-of-coins-to-be-added/) | Medium | [cpp](./solutions/2501-3000/2952-minimum-number-of-coins-to-be-added.cpp) |
| 2956 | [Find Common Elements Between Two Arrays](https://leetcode.com/problems/find-common-elements-between-two-arrays/) | Easy | [cpp](./solutions/2501-3000/2956-find-common-elements-between-two-arrays.cpp) |
| 2957 | [Remove Adjacent Almost-Equal Characters](https://leetcode.com/problems/remove-adjacent-almost-equal-characters/) | Medium | [cpp](./solutions/2501-3000/2957-remove-adjacent-almost-equal-characters.cpp) |
| 2958 | [Length of Longest Subarray With at Most K Frequency](https://leetcode.com/problems/length-of-longest-subarray-with-at-most-k-frequency/) | Medium | [cpp](./solutions/2501-3000/2958-length-of-longest-subarray-with-at-most-k-frequency.cpp) |
| 2959 | [Number of Possible Sets of Closing Branches](https://leetcode.com/problems/number-of-possible-sets-of-closing-branches/) | Hard | [cpp](./solutions/2501-3000/2959-number-of-possible-sets-of-closing-branches.cpp) |
| 2960 | [Count Tested Devices After Test Operations](https://leetcode.com/problems/count-tested-devices-after-test-operations/) | Easy | [cpp](./solutions/2501-3000/2960-count-tested-devices-after-test-operations.cpp) |
| 2961 | [Double Modular Exponentiation](https://leetcode.com/problems/double-modular-exponentiation/) | Medium | [cpp](./solutions/2501-3000/2961-double-modular-exponentiation.cpp) |
| 2963 | [Count the Number of Good Partitions](https://leetcode.com/problems/count-the-number-of-good-partitions/) | Hard | [cpp](./solutions/2501-3000/2963-count-the-number-of-good-partitions.cpp) |
| 2965 | [Find Missing and Repeated Values](https://leetcode.com/problems/find-missing-and-repeated-values/) | Easy | [cpp](./solutions/2501-3000/2965-find-missing-and-repeated-values.cpp) |
| 2966 | [Divide Array Into Arrays With Max Difference](https://leetcode.com/problems/divide-array-into-arrays-with-max-difference/) | Medium | [cpp](./solutions/2501-3000/2966-divide-array-into-arrays-with-max-difference.cpp) |
| 2967 | [Minimum Cost to Make Array Equalindromic](https://leetcode.com/problems/minimum-cost-to-make-array-equalindromic/) | Medium | [cpp](./solutions/2501-3000/2967-minimum-cost-to-make-array-equalindromic.cpp) |
| 2970 | [Count the Number of Incremovable Subarrays I](https://leetcode.com/problems/count-the-number-of-incremovable-subarrays-i/) | Easy | [cpp](./solutions/2501-3000/2970-count-the-number-of-incremovable-subarrays-i.cpp) |
| 2971 | [Find Polygon With the Largest Perimeter](https://leetcode.com/problems/find-polygon-with-the-largest-perimeter/) | Medium | [cpp](./solutions/2501-3000/2971-find-polygon-with-the-largest-perimeter.cpp) |
| 2973 | [Find Number of Coins to Place in Tree Nodes](https://leetcode.com/problems/find-number-of-coins-to-place-in-tree-nodes/) | Hard | [cpp](./solutions/2501-3000/2973-find-number-of-coins-to-place-in-tree-nodes.cpp) |
| 2974 | [Minimum Number Game](https://leetcode.com/problems/minimum-number-game/) | Easy | [cpp](./solutions/2501-3000/2974-minimum-number-game.cpp) |
| 2975 | [Maximum Square Area by Removing Fences From a Field](https://leetcode.com/problems/maximum-square-area-by-removing-fences-from-a-field/) | Medium | [cpp](./solutions/2501-3000/2975-maximum-square-area-by-removing-fences-from-a-field.cpp) |
| 2976 | [Minimum Cost to Convert String I](https://leetcode.com/problems/minimum-cost-to-convert-string-i/) | Medium | [cpp](./solutions/2501-3000/2976-minimum-cost-to-convert-string-i.cpp) |
| 2980 | [Check if Bitwise OR Has Trailing Zeros](https://leetcode.com/problems/check-if-bitwise-or-has-trailing-zeros/) | Easy | [cpp](./solutions/2501-3000/2980-check-if-bitwise-or-has-trailing-zeros.cpp) |
| 2981 | [Find Longest Special Substring That Occurs Thrice I](https://leetcode.com/problems/find-longest-special-substring-that-occurs-thrice-i/) | Medium | [cpp](./solutions/2501-3000/2981-find-longest-special-substring-that-occurs-thrice-i.cpp) |
| 2982 | [Find Longest Special Substring That Occurs Thrice II](https://leetcode.com/problems/find-longest-special-substring-that-occurs-thrice-ii/) | Medium | [cpp](./solutions/2501-3000/2982-find-longest-special-substring-that-occurs-thrice-ii.cpp) |
| 2996 | [Smallest Missing Integer Greater Than Sequential Prefix Sum](https://leetcode.com/problems/smallest-missing-integer-greater-than-sequential-prefix-sum/) | Easy | [cpp](./solutions/2501-3000/2996-smallest-missing-integer-greater-than-sequential-prefix-sum.cpp) |
| 2997 | [Minimum Number of Operations to Make Array XOR Equal to K](https://leetcode.com/problems/minimum-number-of-operations-to-make-array-xor-equal-to-k/) | Medium | [cpp](./solutions/2501-3000/2997-minimum-number-of-operations-to-make-array-xor-equal-to-k.cpp) |
| 2998 | [Minimum Number of Operations to Make X and Y Equal](https://leetcode.com/problems/minimum-number-of-operations-to-make-x-and-y-equal/) | Medium | [cpp](./solutions/2501-3000/2998-minimum-number-of-operations-to-make-x-and-y-equal.cpp) |
| 2999 | [Count the Number of Powerful Integers](https://leetcode.com/problems/count-the-number-of-powerful-integers/) | Hard | [cpp](./solutions/2501-3000/2999-count-the-number-of-powerful-integers.cpp) |
| 3000 | [Maximum Area of Longest Diagonal Rectangle](https://leetcode.com/problems/maximum-area-of-longest-diagonal-rectangle/) | Easy | [cpp](./solutions/2501-3000/3000-maximum-area-of-longest-diagonal-rectangle.cpp) |
| 3002 | [Maximum Size of a Set After Removals](https://leetcode.com/problems/maximum-size-of-a-set-after-removals/) | Medium | [cpp](./solutions/3001-3500/3002-maximum-size-of-a-set-after-removals.cpp) |
| 3003 | [Maximize the Number of Partitions After Operations](https://leetcode.com/problems/maximize-the-number-of-partitions-after-operations/) | Hard | [cpp](./solutions/3001-3500/3003-maximize-the-number-of-partitions-after-operations.cpp) |
| 3005 | [Count Elements With Maximum Frequency](https://leetcode.com/problems/count-elements-with-maximum-frequency/) | Easy | [python3](./solutions/3001-3500/3005-count-elements-with-maximum-frequency.py) |
| 3006 | [Find Beautiful Indices in the Given Array I](https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-i/) | Medium | [cpp](./solutions/3001-3500/3006-find-beautiful-indices-in-the-given-array-i.cpp) |
| 3008 | [Find Beautiful Indices in the Given Array II](https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-ii/) | Hard | [cpp](./solutions/3001-3500/3008-find-beautiful-indices-in-the-given-array-ii.cpp) |
| 3014 | [Minimum Number of Pushes to Type Word I](https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-i/) | Easy | [cpp](./solutions/3001-3500/3014-minimum-number-of-pushes-to-type-word-i.cpp) |
| 3016 | [Minimum Number of Pushes to Type Word II](https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-ii/) | Medium | [cpp](./solutions/3001-3500/3016-minimum-number-of-pushes-to-type-word-ii.cpp) |
| 3019 | [Number of Changing Keys](https://leetcode.com/problems/number-of-changing-keys/) | Easy | [cpp](./solutions/3001-3500/3019-number-of-changing-keys.cpp) |
| 3020 | [Find the Maximum Number of Elements in Subset](https://leetcode.com/problems/find-the-maximum-number-of-elements-in-subset/) | Medium | [cpp](./solutions/3001-3500/3020-find-the-maximum-number-of-elements-in-subset.cpp) |
| 3021 | [Alice and Bob Playing Flower Game](https://leetcode.com/problems/alice-and-bob-playing-flower-game/) | Medium | [cpp](./solutions/3001-3500/3021-alice-and-bob-playing-flower-game.cpp) |
| 3022 | [Minimize OR of Remaining Elements Using Operations](https://leetcode.com/problems/minimize-or-of-remaining-elements-using-operations/) | Hard | [cpp](./solutions/3001-3500/3022-minimize-or-of-remaining-elements-using-operations.cpp) |
| 3024 | [Type of Triangle](https://leetcode.com/problems/type-of-triangle/) | Easy | [cpp](./solutions/3001-3500/3024-type-of-triangle.cpp) |
| 3025 | [Find the Number of Ways to Place People I](https://leetcode.com/problems/find-the-number-of-ways-to-place-people-i/) | Medium | [cpp](./solutions/3001-3500/3025-find-the-number-of-ways-to-place-people-i.cpp) |
| 3026 | [Maximum Good Subarray Sum](https://leetcode.com/problems/maximum-good-subarray-sum/) | Medium | [cpp](./solutions/3001-3500/3026-maximum-good-subarray-sum.cpp) |
| 3027 | [Find the Number of Ways to Place People II](https://leetcode.com/problems/find-the-number-of-ways-to-place-people-ii/) | Hard | [cpp](./solutions/3001-3500/3027-find-the-number-of-ways-to-place-people-ii.cpp) |
| 3028 | [Ant on the Boundary](https://leetcode.com/problems/ant-on-the-boundary/) | Easy | [cpp](./solutions/3001-3500/3028-ant-on-the-boundary.cpp) |
| 3029 | [Minimum Time to Revert Word to Initial State I](https://leetcode.com/problems/minimum-time-to-revert-word-to-initial-state-i/) | Medium | [cpp](./solutions/3001-3500/3029-minimum-time-to-revert-word-to-initial-state-i.cpp) |
| 3030 | [Find the Grid of Region Average](https://leetcode.com/problems/find-the-grid-of-region-average/) | Medium | [cpp](./solutions/3001-3500/3030-find-the-grid-of-region-average.cpp) |
| 3031 | [Minimum Time to Revert Word to Initial State II](https://leetcode.com/problems/minimum-time-to-revert-word-to-initial-state-ii/) | Hard | [cpp](./solutions/3001-3500/3031-minimum-time-to-revert-word-to-initial-state-ii.cpp) |
| 3033 | [Modify the Matrix](https://leetcode.com/problems/modify-the-matrix/) | Easy | [cpp](./solutions/3001-3500/3033-modify-the-matrix.cpp) |
| 3034 | [Number of Subarrays That Match a Pattern I](https://leetcode.com/problems/number-of-subarrays-that-match-a-pattern-i/) | Medium | [cpp](./solutions/3001-3500/3034-number-of-subarrays-that-match-a-pattern-i.cpp) |
| 3035 | [Maximum Palindromes After Operations](https://leetcode.com/problems/maximum-palindromes-after-operations/) | Medium | [cpp](./solutions/3001-3500/3035-maximum-palindromes-after-operations.cpp) |
| 3036 | [Number of Subarrays That Match a Pattern II](https://leetcode.com/problems/number-of-subarrays-that-match-a-pattern-ii/) | Hard | [cpp](./solutions/3001-3500/3036-number-of-subarrays-that-match-a-pattern-ii.cpp) |
| 3038 | [Maximum Number of Operations With the Same Score I](https://leetcode.com/problems/maximum-number-of-operations-with-the-same-score-i/) | Easy | [cpp](./solutions/3001-3500/3038-maximum-number-of-operations-with-the-same-score-i.cpp) |
| 3039 | [Apply Operations to Make String Empty](https://leetcode.com/problems/apply-operations-to-make-string-empty/) | Medium | [cpp](./solutions/3001-3500/3039-apply-operations-to-make-string-empty.cpp) |
| 3040 | [Maximum Number of Operations With the Same Score II](https://leetcode.com/problems/maximum-number-of-operations-with-the-same-score-ii/) | Medium | [cpp](./solutions/3001-3500/3040-maximum-number-of-operations-with-the-same-score-ii.cpp) |
| 3041 | [Maximize Consecutive Elements in an Array After Modification](https://leetcode.com/problems/maximize-consecutive-elements-in-an-array-after-modification/) | Hard | [cpp](./solutions/3001-3500/3041-maximize-consecutive-elements-in-an-array-after-modification.cpp) |
| 3042 | [Count Prefix and Suffix Pairs I](https://leetcode.com/problems/count-prefix-and-suffix-pairs-i/) | Easy | [cpp](./solutions/3001-3500/3042-count-prefix-and-suffix-pairs-i.cpp) |
| 3043 | [Find the Length of the Longest Common Prefix](https://leetcode.com/problems/find-the-length-of-the-longest-common-prefix/) | Medium | [cpp](./solutions/3001-3500/3043-find-the-length-of-the-longest-common-prefix.cpp) |
| 3044 | [Most Frequent Prime](https://leetcode.com/problems/most-frequent-prime/) | Medium | [cpp](./solutions/3001-3500/3044-most-frequent-prime.cpp) |
| 3045 | [Count Prefix and Suffix Pairs II](https://leetcode.com/problems/count-prefix-and-suffix-pairs-ii/) | Hard | [cpp](./solutions/3001-3500/3045-count-prefix-and-suffix-pairs-ii.cpp) |
| 3046 | [Split the Array](https://leetcode.com/problems/split-the-array/) | Easy | [cpp](./solutions/3001-3500/3046-split-the-array.cpp) |
| 3047 | [Find the Largest Area of Square Inside Two Rectangles](https://leetcode.com/problems/find-the-largest-area-of-square-inside-two-rectangles/) | Medium | [cpp](./solutions/3001-3500/3047-find-the-largest-area-of-square-inside-two-rectangles.cpp) |
| 3048 | [Earliest Second to Mark Indices I](https://leetcode.com/problems/earliest-second-to-mark-indices-i/) | Medium | [cpp](./solutions/3001-3500/3048-earliest-second-to-mark-indices-i.cpp) |
| 3065 | [Minimum Operations to Exceed Threshold Value I](https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-i/) | Easy | [cpp](./solutions/3001-3500/3065-minimum-operations-to-exceed-threshold-value-i.cpp) |
| 3066 | [Minimum Operations to Exceed Threshold Value II](https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-ii/) | Medium | [cpp](./solutions/3001-3500/3066-minimum-operations-to-exceed-threshold-value-ii.cpp) |
| 3067 | [Count Pairs of Connectable Servers in a Weighted Tree Network](https://leetcode.com/problems/count-pairs-of-connectable-servers-in-a-weighted-tree-network/) | Medium | [cpp](./solutions/3001-3500/3067-count-pairs-of-connectable-servers-in-a-weighted-tree-network.cpp) |
| 3068 | [Find the Maximum Sum of Node Values](https://leetcode.com/problems/find-the-maximum-sum-of-node-values/) | Hard | [cpp](./solutions/3001-3500/3068-find-the-maximum-sum-of-node-values.cpp) |
| 3069 | [Distribute Elements Into Two Arrays I](https://leetcode.com/problems/distribute-elements-into-two-arrays-i/) | Easy | [cpp](./solutions/3001-3500/3069-distribute-elements-into-two-arrays-i.cpp) |
| 3070 | [Count Submatrices with Top-Left Element and Sum Less Than k](https://leetcode.com/problems/count-submatrices-with-top-left-element-and-sum-less-than-k/) | Medium | [cpp](./solutions/3001-3500/3070-count-submatrices-with-top-left-element-and-sum-less-than-k.cpp) |
| 3071 | [Minimum Operations to Write the Letter Y on a Grid](https://leetcode.com/problems/minimum-operations-to-write-the-letter-y-on-a-grid/) | Medium | [cpp](./solutions/3001-3500/3071-minimum-operations-to-write-the-letter-y-on-a-grid.cpp) |
| 3072 | [Distribute Elements Into Two Arrays II](https://leetcode.com/problems/distribute-elements-into-two-arrays-ii/) | Hard | [cpp](./solutions/3001-3500/3072-distribute-elements-into-two-arrays-ii.cpp) |
| 3074 | [Apple Redistribution into Boxes](https://leetcode.com/problems/apple-redistribution-into-boxes/) | Easy | [cpp](./solutions/3001-3500/3074-apple-redistribution-into-boxes.cpp) |
| 3075 | [Maximize Happiness of Selected Children](https://leetcode.com/problems/maximize-happiness-of-selected-children/) | Medium | [cpp](./solutions/3001-3500/3075-maximize-happiness-of-selected-children.cpp) |
| 3076 | [Shortest Uncommon Substring in an Array](https://leetcode.com/problems/shortest-uncommon-substring-in-an-array/) | Medium | [cpp](./solutions/3001-3500/3076-shortest-uncommon-substring-in-an-array.cpp) |
| 3079 | [Find the Sum of Encrypted Integers](https://leetcode.com/problems/find-the-sum-of-encrypted-integers/) | Easy | [cpp](./solutions/3001-3500/3079-find-the-sum-of-encrypted-integers.cpp) |
| 3080 | [Mark Elements on Array by Performing Queries](https://leetcode.com/problems/mark-elements-on-array-by-performing-queries/) | Medium | [cpp](./solutions/3001-3500/3080-mark-elements-on-array-by-performing-queries.cpp) |
| 3081 | [Replace Question Marks in String to Minimize Its Value](https://leetcode.com/problems/replace-question-marks-in-string-to-minimize-its-value/) | Medium | [cpp](./solutions/3001-3500/3081-replace-question-marks-in-string-to-minimize-its-value.cpp) |
| 3082 | [Find the Sum of the Power of All Subsequences](https://leetcode.com/problems/find-the-sum-of-the-power-of-all-subsequences/) | Hard | [cpp](./solutions/3001-3500/3082-find-the-sum-of-the-power-of-all-subsequences.cpp) |
| 3083 | [Existence of a Substring in a String and Its Reverse](https://leetcode.com/problems/existence-of-a-substring-in-a-string-and-its-reverse/) | Easy | [cpp](./solutions/3001-3500/3083-existence-of-a-substring-in-a-string-and-its-reverse.cpp) |
| 3084 | [Count Substrings Starting and Ending with Given Character](https://leetcode.com/problems/count-substrings-starting-and-ending-with-given-character/) | Medium | [cpp](./solutions/3001-3500/3084-count-substrings-starting-and-ending-with-given-character.cpp) |
| 3085 | [Minimum Deletions to Make String K-Special](https://leetcode.com/problems/minimum-deletions-to-make-string-k-special/) | Medium | [cpp](./solutions/3001-3500/3085-minimum-deletions-to-make-string-k-special.cpp) |
| 3090 | [Maximum Length Substring With Two Occurrences](https://leetcode.com/problems/maximum-length-substring-with-two-occurrences/) | Easy | [cpp](./solutions/3001-3500/3090-maximum-length-substring-with-two-occurrences.cpp) |
| 3091 | [Apply Operations to Make Sum of Array Greater Than or Equal to k](https://leetcode.com/problems/apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k/) | Medium | [cpp](./solutions/3001-3500/3091-apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k.cpp) |
| 3092 | [Most Frequent IDs](https://leetcode.com/problems/most-frequent-ids/) | Medium | [cpp](./solutions/3001-3500/3092-most-frequent-ids.cpp) |
| 3093 | [Longest Common Suffix Queries](https://leetcode.com/problems/longest-common-suffix-queries/) | Hard | [cpp](./solutions/3001-3500/3093-longest-common-suffix-queries.cpp) |
| 3095 | [Shortest Subarray With OR at Least K I](https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-i/) | Easy | [cpp](./solutions/3001-3500/3095-shortest-subarray-with-or-at-least-k-i.cpp) |
| 3096 | [Minimum Levels to Gain More Points](https://leetcode.com/problems/minimum-levels-to-gain-more-points/) | Medium | [cpp](./solutions/3001-3500/3096-minimum-levels-to-gain-more-points.cpp) |
| 3097 | [Shortest Subarray With OR at Least K II](https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-ii/) | Medium | [cpp](./solutions/3001-3500/3097-shortest-subarray-with-or-at-least-k-ii.cpp) |
| 3098 | [Find the Sum of Subsequence Powers](https://leetcode.com/problems/find-the-sum-of-subsequence-powers/) | Hard | [cpp](./solutions/3001-3500/3098-find-the-sum-of-subsequence-powers.cpp) |
| 3099 | [Harshad Number](https://leetcode.com/problems/harshad-number/) | Easy | [cpp](./solutions/3001-3500/3099-harshad-number.cpp) |
| 3100 | [Water Bottles II](https://leetcode.com/problems/water-bottles-ii/) | Medium | [cpp](./solutions/3001-3500/3100-water-bottles-ii.cpp) |
| 3101 | [Count Alternating Subarrays](https://leetcode.com/problems/count-alternating-subarrays/) | Medium | [cpp](./solutions/3001-3500/3101-count-alternating-subarrays.cpp) |
| 3105 | [Longest Strictly Increasing or Strictly Decreasing Subarray](https://leetcode.com/problems/longest-strictly-increasing-or-strictly-decreasing-subarray/) | Easy | [cpp](./solutions/3001-3500/3105-longest-strictly-increasing-or-strictly-decreasing-subarray.cpp) |
| 3106 | [Lexicographically Smallest String After Operations With Constraint](https://leetcode.com/problems/lexicographically-smallest-string-after-operations-with-constraint/) | Medium | [cpp](./solutions/3001-3500/3106-lexicographically-smallest-string-after-operations-with-constraint.cpp) |
| 3107 | [Minimum Operations to Make Median of Array Equal to K](https://leetcode.com/problems/minimum-operations-to-make-median-of-array-equal-to-k/) | Medium | [cpp](./solutions/3001-3500/3107-minimum-operations-to-make-median-of-array-equal-to-k.cpp) |
| 3108 | [Minimum Cost Walk in Weighted Graph](https://leetcode.com/problems/minimum-cost-walk-in-weighted-graph/) | Hard | [cpp](./solutions/3001-3500/3108-minimum-cost-walk-in-weighted-graph.cpp) |
| 3110 | [Score of a String](https://leetcode.com/problems/score-of-a-string/) | Easy | [cpp](./solutions/3001-3500/3110-score-of-a-string.cpp) |
| 3111 | [Minimum Rectangles to Cover Points](https://leetcode.com/problems/minimum-rectangles-to-cover-points/) | Medium | [cpp](./solutions/3001-3500/3111-minimum-rectangles-to-cover-points.cpp) |
| 3112 | [Minimum Time to Visit Disappearing Nodes](https://leetcode.com/problems/minimum-time-to-visit-disappearing-nodes/) | Medium | [cpp](./solutions/3001-3500/3112-minimum-time-to-visit-disappearing-nodes.cpp) |
| 3113 | [Find the Number of Subarrays Where Boundary Elements Are Maximum](https://leetcode.com/problems/find-the-number-of-subarrays-where-boundary-elements-are-maximum/) | Hard | [cpp](./solutions/3001-3500/3113-find-the-number-of-subarrays-where-boundary-elements-are-maximum.cpp) |
| 3114 | [Latest Time You Can Obtain After Replacing Characters](https://leetcode.com/problems/latest-time-you-can-obtain-after-replacing-characters/) | Easy | [cpp](./solutions/3001-3500/3114-latest-time-you-can-obtain-after-replacing-characters.cpp) |
| 3115 | [Maximum Prime Difference](https://leetcode.com/problems/maximum-prime-difference/) | Medium | [cpp](./solutions/3001-3500/3115-maximum-prime-difference.cpp) |
| 3116 | [Kth Smallest Amount With Single Denomination Combination](https://leetcode.com/problems/kth-smallest-amount-with-single-denomination-combination/) | Hard | [cpp](./solutions/3001-3500/3116-kth-smallest-amount-with-single-denomination-combination.cpp) |
| 3117 | [Minimum Sum of Values by Dividing Array](https://leetcode.com/problems/minimum-sum-of-values-by-dividing-array/) | Hard | [cpp](./solutions/3001-3500/3117-minimum-sum-of-values-by-dividing-array.cpp) |
| 3120 | [Count the Number of Special Characters I](https://leetcode.com/problems/count-the-number-of-special-characters-i/) | Easy | [cpp](./solutions/3001-3500/3120-count-the-number-of-special-characters-i.cpp) |
| 3121 | [Count the Number of Special Characters II](https://leetcode.com/problems/count-the-number-of-special-characters-ii/) | Medium | [cpp](./solutions/3001-3500/3121-count-the-number-of-special-characters-ii.cpp) |
| 3122 | [Minimum Number of Operations to Satisfy Conditions](https://leetcode.com/problems/minimum-number-of-operations-to-satisfy-conditions/) | Medium | [cpp](./solutions/3001-3500/3122-minimum-number-of-operations-to-satisfy-conditions.cpp) |
| 3123 | [Find Edges in Shortest Paths](https://leetcode.com/problems/find-edges-in-shortest-paths/) | Hard | [cpp](./solutions/3001-3500/3123-find-edges-in-shortest-paths.cpp) |
| 3127 | [Make a Square with the Same Color](https://leetcode.com/problems/make-a-square-with-the-same-color/) | Easy | [cpp](./solutions/3001-3500/3127-make-a-square-with-the-same-color.cpp) |
| 3128 | [Right Triangles](https://leetcode.com/problems/right-triangles/) | Medium | [cpp](./solutions/3001-3500/3128-right-triangles.cpp) |
| 3129 | [Find All Possible Stable Binary Arrays I](https://leetcode.com/problems/find-all-possible-stable-binary-arrays-i/) | Medium | [cpp](./solutions/3001-3500/3129-find-all-possible-stable-binary-arrays-i.cpp) |
| 3130 | [Find All Possible Stable Binary Arrays II](https://leetcode.com/problems/find-all-possible-stable-binary-arrays-ii/) | Hard | [cpp](./solutions/3001-3500/3130-find-all-possible-stable-binary-arrays-ii.cpp) |
| 3131 | [Find the Integer Added to Array I](https://leetcode.com/problems/find-the-integer-added-to-array-i/) | Easy | [cpp](./solutions/3001-3500/3131-find-the-integer-added-to-array-i.cpp) |
| 3132 | [Find the Integer Added to Array II](https://leetcode.com/problems/find-the-integer-added-to-array-ii/) | Medium | [cpp](./solutions/3001-3500/3132-find-the-integer-added-to-array-ii.cpp) |
| 3133 | [Minimum Array End](https://leetcode.com/problems/minimum-array-end/) | Medium | [cpp](./solutions/3001-3500/3133-minimum-array-end.cpp) |
| 3134 | [Find the Median of the Uniqueness Array](https://leetcode.com/problems/find-the-median-of-the-uniqueness-array/) | Hard | [cpp](./solutions/3001-3500/3134-find-the-median-of-the-uniqueness-array.cpp) |
| 3136 | [Valid Word](https://leetcode.com/problems/valid-word/) | Easy | [cpp](./solutions/3001-3500/3136-valid-word.cpp) |
| 3137 | [Minimum Number of Operations to Make Word K-Periodic](https://leetcode.com/problems/minimum-number-of-operations-to-make-word-k-periodic/) | Medium | [cpp](./solutions/3001-3500/3137-minimum-number-of-operations-to-make-word-k-periodic.cpp) |
| 3138 | [Minimum Length of Anagram Concatenation](https://leetcode.com/problems/minimum-length-of-anagram-concatenation/) | Medium | [cpp](./solutions/3001-3500/3138-minimum-length-of-anagram-concatenation.cpp) |
| 3142 | [Check if Grid Satisfies Conditions](https://leetcode.com/problems/check-if-grid-satisfies-conditions/) | Easy | [cpp](./solutions/3001-3500/3142-check-if-grid-satisfies-conditions.cpp) |
| 3143 | [Maximum Points Inside the Square](https://leetcode.com/problems/maximum-points-inside-the-square/) | Medium | [cpp](./solutions/3001-3500/3143-maximum-points-inside-the-square.cpp) |
| 3144 | [Minimum Substring Partition of Equal Character Frequency](https://leetcode.com/problems/minimum-substring-partition-of-equal-character-frequency/) | Medium | [cpp](./solutions/3001-3500/3144-minimum-substring-partition-of-equal-character-frequency.cpp) |
| 3146 | [Permutation Difference between Two Strings](https://leetcode.com/problems/permutation-difference-between-two-strings/) | Easy | [cpp](./solutions/3001-3500/3146-permutation-difference-between-two-strings.cpp) |
| 3147 | [Taking Maximum Energy From the Mystic Dungeon](https://leetcode.com/problems/taking-maximum-energy-from-the-mystic-dungeon/) | Medium | [cpp](./solutions/3001-3500/3147-taking-maximum-energy-from-the-mystic-dungeon.cpp) |
| 3148 | [Maximum Difference Score in a Grid](https://leetcode.com/problems/maximum-difference-score-in-a-grid/) | Medium | [cpp](./solutions/3001-3500/3148-maximum-difference-score-in-a-grid.cpp) |
| 3151 | [Special Array I](https://leetcode.com/problems/special-array-i/) | Easy | [cpp](./solutions/3001-3500/3151-special-array-i.cpp) |
| 3152 | [Special Array II](https://leetcode.com/problems/special-array-ii/) | Medium | [cpp](./solutions/3001-3500/3152-special-array-ii.cpp) |
| 3153 | [Sum of Digit Differences of All Pairs](https://leetcode.com/problems/sum-of-digit-differences-of-all-pairs/) | Medium | [cpp](./solutions/3001-3500/3153-sum-of-digit-differences-of-all-pairs.cpp) |
| 3154 | [Find Number of Ways to Reach the K-th Stair](https://leetcode.com/problems/find-number-of-ways-to-reach-the-k-th-stair/) | Hard | [cpp](./solutions/3001-3500/3154-find-number-of-ways-to-reach-the-k-th-stair.cpp) |
| 3158 | [Find the XOR of Numbers Which Appear Twice](https://leetcode.com/problems/find-the-xor-of-numbers-which-appear-twice/) | Easy | [cpp](./solutions/3001-3500/3158-find-the-xor-of-numbers-which-appear-twice.cpp) |
| 3159 | [Find Occurrences of an Element in an Array](https://leetcode.com/problems/find-occurrences-of-an-element-in-an-array/) | Medium | [cpp](./solutions/3001-3500/3159-find-occurrences-of-an-element-in-an-array.cpp) |
| 3160 | [Find the Number of Distinct Colors Among the Balls](https://leetcode.com/problems/find-the-number-of-distinct-colors-among-the-balls/) | Medium | [cpp](./solutions/3001-3500/3160-find-the-number-of-distinct-colors-among-the-balls.cpp) |
| 3161 | [Block Placement Queries](https://leetcode.com/problems/block-placement-queries/) | Hard | [cpp](./solutions/3001-3500/3161-block-placement-queries.cpp) |
| 3162 | [Find the Number of Good Pairs I](https://leetcode.com/problems/find-the-number-of-good-pairs-i/) | Easy | [cpp](./solutions/3001-3500/3162-find-the-number-of-good-pairs-i.cpp) |
| 3163 | [String Compression III](https://leetcode.com/problems/string-compression-iii/) | Medium | [cpp](./solutions/3001-3500/3163-string-compression-iii.cpp) |
| 3164 | [Find the Number of Good Pairs II](https://leetcode.com/problems/find-the-number-of-good-pairs-ii/) | Medium | [cpp](./solutions/3001-3500/3164-find-the-number-of-good-pairs-ii.cpp) |
| 3165 | [Maximum Sum of Subsequence With Non-adjacent Elements](https://leetcode.com/problems/maximum-sum-of-subsequence-with-non-adjacent-elements/) | Hard | [cpp](./solutions/3001-3500/3165-maximum-sum-of-subsequence-with-non-adjacent-elements.cpp) |
| 3168 | [Minimum Number of Chairs in a Waiting Room](https://leetcode.com/problems/minimum-number-of-chairs-in-a-waiting-room/) | Easy | [cpp](./solutions/3001-3500/3168-minimum-number-of-chairs-in-a-waiting-room.cpp) |
| 3169 | [Count Days Without Meetings](https://leetcode.com/problems/count-days-without-meetings/) | Medium | [cpp](./solutions/3001-3500/3169-count-days-without-meetings.cpp) |
| 3170 | [Lexicographically Minimum String After Removing Stars](https://leetcode.com/problems/lexicographically-minimum-string-after-removing-stars/) | Medium | [cpp](./solutions/3001-3500/3170-lexicographically-minimum-string-after-removing-stars.cpp) |
| 3171 | [Find Subarray With Bitwise OR Closest to K](https://leetcode.com/problems/find-subarray-with-bitwise-or-closest-to-k/) | Hard | [cpp](./solutions/3001-3500/3171-find-subarray-with-bitwise-or-closest-to-k.cpp) |
| 3174 | [Clear Digits](https://leetcode.com/problems/clear-digits/) | Easy | [cpp](./solutions/3001-3500/3174-clear-digits.cpp) |
| 3175 | [Find The First Player to win K Games in a Row](https://leetcode.com/problems/find-the-first-player-to-win-k-games-in-a-row/) | Medium | [cpp](./solutions/3001-3500/3175-find-the-first-player-to-win-k-games-in-a-row.cpp) |
| 3176 | [Find the Maximum Length of a Good Subsequence I](https://leetcode.com/problems/find-the-maximum-length-of-a-good-subsequence-i/) | Medium | [cpp](./solutions/3001-3500/3176-find-the-maximum-length-of-a-good-subsequence-i.cpp) |
| 3177 | [Find the Maximum Length of a Good Subsequence II](https://leetcode.com/problems/find-the-maximum-length-of-a-good-subsequence-ii/) | Hard | [cpp](./solutions/3001-3500/3177-find-the-maximum-length-of-a-good-subsequence-ii.cpp) |
| 3178 | [Find the Child Who Has the Ball After K Seconds](https://leetcode.com/problems/find-the-child-who-has-the-ball-after-k-seconds/) | Easy | [cpp](./solutions/3001-3500/3178-find-the-child-who-has-the-ball-after-k-seconds.cpp) |
| 3179 | [Find the N-th Value After K Seconds](https://leetcode.com/problems/find-the-n-th-value-after-k-seconds/) | Medium | [cpp](./solutions/3001-3500/3179-find-the-n-th-value-after-k-seconds.cpp) |
| 3180 | [Maximum Total Reward Using Operations I](https://leetcode.com/problems/maximum-total-reward-using-operations-i/) | Medium | [cpp](./solutions/3001-3500/3180-maximum-total-reward-using-operations-i.cpp) |
| 3181 | [Maximum Total Reward Using Operations II](https://leetcode.com/problems/maximum-total-reward-using-operations-ii/) | Hard | [cpp](./solutions/3001-3500/3181-maximum-total-reward-using-operations-ii.cpp) |
| 3184 | [Count Pairs That Form a Complete Day I](https://leetcode.com/problems/count-pairs-that-form-a-complete-day-i/) | Easy | [cpp](./solutions/3001-3500/3184-count-pairs-that-form-a-complete-day-i.cpp) |
| 3185 | [Count Pairs That Form a Complete Day II](https://leetcode.com/problems/count-pairs-that-form-a-complete-day-ii/) | Medium | [cpp](./solutions/3001-3500/3185-count-pairs-that-form-a-complete-day-ii.cpp) |
| 3186 | [Maximum Total Damage With Spell Casting](https://leetcode.com/problems/maximum-total-damage-with-spell-casting/) | Medium | [cpp](./solutions/3001-3500/3186-maximum-total-damage-with-spell-casting.cpp) |
| 3187 | [Peaks in Array](https://leetcode.com/problems/peaks-in-array/) | Hard | [cpp](./solutions/3001-3500/3187-peaks-in-array.cpp) |
| 3190 | [Find Minimum Operations to Make All Elements Divisible by Three](https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three/) | Easy | [cpp](./solutions/3001-3500/3190-find-minimum-operations-to-make-all-elements-divisible-by-three.cpp) |
| 3191 | [Minimum Operations to Make Binary Array Elements Equal to One I](https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i/) | Medium | [cpp](./solutions/3001-3500/3191-minimum-operations-to-make-binary-array-elements-equal-to-one-i.cpp) |
| 3192 | [Minimum Operations to Make Binary Array Elements Equal to One II](https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii/) | Medium | [cpp](./solutions/3001-3500/3192-minimum-operations-to-make-binary-array-elements-equal-to-one-ii.cpp) |
| 3193 | [Count the Number of Inversions](https://leetcode.com/problems/count-the-number-of-inversions/) | Hard | [cpp](./solutions/3001-3500/3193-count-the-number-of-inversions.cpp) |
| 3194 | [Minimum Average of Smallest and Largest Elements](https://leetcode.com/problems/minimum-average-of-smallest-and-largest-elements/) | Easy | [cpp](./solutions/3001-3500/3194-minimum-average-of-smallest-and-largest-elements.cpp) |
| 3195 | [Find the Minimum Area to Cover All Ones I](https://leetcode.com/problems/find-the-minimum-area-to-cover-all-ones-i/) | Medium | [cpp](./solutions/3001-3500/3195-find-the-minimum-area-to-cover-all-ones-i.cpp) |
| 3196 | [Maximize Total Cost of Alternating Subarrays](https://leetcode.com/problems/maximize-total-cost-of-alternating-subarrays/) | Medium | [cpp](./solutions/3001-3500/3196-maximize-total-cost-of-alternating-subarrays.cpp) |
| 3200 | [Maximum Height of a Triangle](https://leetcode.com/problems/maximum-height-of-a-triangle/) | Easy | [cpp](./solutions/3001-3500/3200-maximum-height-of-a-triangle.cpp) |
| 3201 | [Find the Maximum Length of Valid Subsequence I](https://leetcode.com/problems/find-the-maximum-length-of-valid-subsequence-i/) | Medium | [cpp](./solutions/3001-3500/3201-find-the-maximum-length-of-valid-subsequence-i.cpp) |
| 3202 | [Find the Maximum Length of Valid Subsequence II](https://leetcode.com/problems/find-the-maximum-length-of-valid-subsequence-ii/) | Medium | [cpp](./solutions/3001-3500/3202-find-the-maximum-length-of-valid-subsequence-ii.cpp) |
| 3203 | [Find Minimum Diameter After Merging Two Trees](https://leetcode.com/problems/find-minimum-diameter-after-merging-two-trees/) | Hard | [cpp](./solutions/3001-3500/3203-find-minimum-diameter-after-merging-two-trees.cpp) |
| 3206 | [Alternating Groups I](https://leetcode.com/problems/alternating-groups-i/) | Easy | [cpp](./solutions/3001-3500/3206-alternating-groups-i.cpp) |
| 3207 | [Maximum Points After Enemy Battles](https://leetcode.com/problems/maximum-points-after-enemy-battles/) | Medium | [cpp](./solutions/3001-3500/3207-maximum-points-after-enemy-battles.cpp) |
| 3208 | [Alternating Groups II](https://leetcode.com/problems/alternating-groups-ii/) | Medium | [cpp](./solutions/3001-3500/3208-alternating-groups-ii.cpp) |
| 3209 | [Number of Subarrays With AND Value of K](https://leetcode.com/problems/number-of-subarrays-with-and-value-of-k/) | Hard | [cpp](./solutions/3001-3500/3209-number-of-subarrays-with-and-value-of-k.cpp) |
| 3210 | [Find the Encrypted String](https://leetcode.com/problems/find-the-encrypted-string/) | Easy | [cpp](./solutions/3001-3500/3210-find-the-encrypted-string.cpp) |
| 3211 | [Generate Binary Strings Without Adjacent Zeros](https://leetcode.com/problems/generate-binary-strings-without-adjacent-zeros/) | Medium | [cpp](./solutions/3001-3500/3211-generate-binary-strings-without-adjacent-zeros.cpp) |
| 3212 | [Count Submatrices With Equal Frequency of X and Y](https://leetcode.com/problems/count-submatrices-with-equal-frequency-of-x-and-y/) | Medium | [cpp](./solutions/3001-3500/3212-count-submatrices-with-equal-frequency-of-x-and-y.cpp) |
| 3216 | [Lexicographically Smallest String After a Swap](https://leetcode.com/problems/lexicographically-smallest-string-after-a-swap/) | Easy | [cpp](./solutions/3001-3500/3216-lexicographically-smallest-string-after-a-swap.cpp) |
| 3217 | [Delete Nodes From Linked List Present in Array](https://leetcode.com/problems/delete-nodes-from-linked-list-present-in-array/) | Medium | [cpp](./solutions/3001-3500/3217-delete-nodes-from-linked-list-present-in-array.cpp) |
| 3218 | [Minimum Cost for Cutting Cake I](https://leetcode.com/problems/minimum-cost-for-cutting-cake-i/) | Medium | [cpp](./solutions/3001-3500/3218-minimum-cost-for-cutting-cake-i.cpp) |
| 3219 | [Minimum Cost for Cutting Cake II](https://leetcode.com/problems/minimum-cost-for-cutting-cake-ii/) | Hard | [cpp](./solutions/3001-3500/3219-minimum-cost-for-cutting-cake-ii.cpp) |
| 3222 | [Find the Winning Player in Coin Game](https://leetcode.com/problems/find-the-winning-player-in-coin-game/) | Easy | [cpp](./solutions/3001-3500/3222-find-the-winning-player-in-coin-game.cpp) |
| 3223 | [Minimum Length of String After Operations](https://leetcode.com/problems/minimum-length-of-string-after-operations/) | Medium | [cpp](./solutions/3001-3500/3223-minimum-length-of-string-after-operations.cpp) |
| 3224 | [Minimum Array Changes to Make Differences Equal](https://leetcode.com/problems/minimum-array-changes-to-make-differences-equal/) | Medium | [cpp](./solutions/3001-3500/3224-minimum-array-changes-to-make-differences-equal.cpp) |
| 3226 | [Number of Bit Changes to Make Two Integers Equal](https://leetcode.com/problems/number-of-bit-changes-to-make-two-integers-equal/) | Easy | [cpp](./solutions/3001-3500/3226-number-of-bit-changes-to-make-two-integers-equal.cpp) |
| 3227 | [Vowels Game in a String](https://leetcode.com/problems/vowels-game-in-a-string/) | Medium | [cpp](./solutions/3001-3500/3227-vowels-game-in-a-string.cpp) |
| 3228 | [Maximum Number of Operations to Move Ones to the End](https://leetcode.com/problems/maximum-number-of-operations-to-move-ones-to-the-end/) | Medium | [cpp](./solutions/3001-3500/3228-maximum-number-of-operations-to-move-ones-to-the-end.cpp) |
| 3229 | [Minimum Operations to Make Array Equal to Target](https://leetcode.com/problems/minimum-operations-to-make-array-equal-to-target/) | Hard | [cpp](./solutions/3001-3500/3229-minimum-operations-to-make-array-equal-to-target.cpp) |
| 3232 | [Find if Digit Game Can Be Won](https://leetcode.com/problems/find-if-digit-game-can-be-won/) | Easy | [cpp](./solutions/3001-3500/3232-find-if-digit-game-can-be-won.cpp) |
| 3233 | [Find the Count of Numbers Which Are Not Special](https://leetcode.com/problems/find-the-count-of-numbers-which-are-not-special/) | Medium | [cpp](./solutions/3001-3500/3233-find-the-count-of-numbers-which-are-not-special.cpp) |
| 3242 | [Design Neighbor Sum Service](https://leetcode.com/problems/design-neighbor-sum-service/) | Easy | [cpp](./solutions/3001-3500/3242-design-neighbor-sum-service.cpp) |
| 3243 | [Shortest Distance After Road Addition Queries I](https://leetcode.com/problems/shortest-distance-after-road-addition-queries-i/) | Medium | [cpp](./solutions/3001-3500/3243-shortest-distance-after-road-addition-queries-i.cpp) |
| 3244 | [Shortest Distance After Road Addition Queries II](https://leetcode.com/problems/shortest-distance-after-road-addition-queries-ii/) | Hard | [cpp](./solutions/3001-3500/3244-shortest-distance-after-road-addition-queries-ii.cpp) |
| 3248 | [Snake in Matrix](https://leetcode.com/problems/snake-in-matrix/) | Easy | [cpp](./solutions/3001-3500/3248-snake-in-matrix.cpp) |
| 3249 | [Count the Number of Good Nodes](https://leetcode.com/problems/count-the-number-of-good-nodes/) | Medium | [cpp](./solutions/3001-3500/3249-count-the-number-of-good-nodes.cpp) |
| 3250 | [Find the Count of Monotonic Pairs I](https://leetcode.com/problems/find-the-count-of-monotonic-pairs-i/) | Hard | [cpp](./solutions/3001-3500/3250-find-the-count-of-monotonic-pairs-i.cpp) |
| 3251 | [Find the Count of Monotonic Pairs II](https://leetcode.com/problems/find-the-count-of-monotonic-pairs-ii/) | Hard | [cpp](./solutions/3001-3500/3251-find-the-count-of-monotonic-pairs-ii.cpp) |
| 3254 | [Find the Power of K-Size Subarrays I](https://leetcode.com/problems/find-the-power-of-k-size-subarrays-i/) | Medium | [cpp](./solutions/3001-3500/3254-find-the-power-of-k-size-subarrays-i.cpp) |
| 3255 | [Find the Power of K-Size Subarrays II](https://leetcode.com/problems/find-the-power-of-k-size-subarrays-ii/) | Medium | [cpp](./solutions/3001-3500/3255-find-the-power-of-k-size-subarrays-ii.cpp) |
| 3256 | [Maximum Value Sum by Placing Three Rooks I](https://leetcode.com/problems/maximum-value-sum-by-placing-three-rooks-i/) | Hard | [cpp](./solutions/3001-3500/3256-maximum-value-sum-by-placing-three-rooks-i.cpp) |
| 3257 | [Maximum Value Sum by Placing Three Rooks II](https://leetcode.com/problems/maximum-value-sum-by-placing-three-rooks-ii/) | Hard | [cpp](./solutions/3001-3500/3257-maximum-value-sum-by-placing-three-rooks-ii.cpp) |
| 3258 | [Count Substrings That Satisfy K-Constraint I](https://leetcode.com/problems/count-substrings-that-satisfy-k-constraint-i/) | Easy | [cpp](./solutions/3001-3500/3258-count-substrings-that-satisfy-k-constraint-i.cpp) |
| 3259 | [Maximum Energy Boost From Two Drinks](https://leetcode.com/problems/maximum-energy-boost-from-two-drinks/) | Medium | [cpp](./solutions/3001-3500/3259-maximum-energy-boost-from-two-drinks.cpp) |
| 3260 | [Find the Largest Palindrome Divisible by K](https://leetcode.com/problems/find-the-largest-palindrome-divisible-by-k/) | Hard | [cpp](./solutions/3001-3500/3260-find-the-largest-palindrome-divisible-by-k.cpp) |
| 3264 | [Final Array State After K Multiplication Operations I](https://leetcode.com/problems/final-array-state-after-k-multiplication-operations-i/) | Easy | [cpp](./solutions/3001-3500/3264-final-array-state-after-k-multiplication-operations-i.cpp) |
| 3265 | [Count Almost Equal Pairs I](https://leetcode.com/problems/count-almost-equal-pairs-i/) | Medium | [cpp](./solutions/3001-3500/3265-count-almost-equal-pairs-i.cpp) |
| 3266 | [Final Array State After K Multiplication Operations II](https://leetcode.com/problems/final-array-state-after-k-multiplication-operations-ii/) | Hard | [cpp](./solutions/3001-3500/3266-final-array-state-after-k-multiplication-operations-ii.cpp) |
| 3267 | [Count Almost Equal Pairs II](https://leetcode.com/problems/count-almost-equal-pairs-ii/) | Hard | [cpp](./solutions/3001-3500/3267-count-almost-equal-pairs-ii.cpp) |
| 3270 | [Find the Key of the Numbers](https://leetcode.com/problems/find-the-key-of-the-numbers/) | Easy | [cpp](./solutions/3001-3500/3270-find-the-key-of-the-numbers.cpp) |
| 3271 | [Hash Divided String](https://leetcode.com/problems/hash-divided-string/) | Medium | [cpp](./solutions/3001-3500/3271-hash-divided-string.cpp) |
| 3272 | [Find the Count of Good Integers](https://leetcode.com/problems/find-the-count-of-good-integers/) | Hard | [cpp](./solutions/3001-3500/3272-find-the-count-of-good-integers.cpp) |
| 3273 | [Minimum Amount of Damage Dealt to Bob](https://leetcode.com/problems/minimum-amount-of-damage-dealt-to-bob/) | Hard | [cpp](./solutions/3001-3500/3273-minimum-amount-of-damage-dealt-to-bob.cpp) |
| 3274 | [Check if Two Chessboard Squares Have the Same Color](https://leetcode.com/problems/check-if-two-chessboard-squares-have-the-same-color/) | Easy | [cpp](./solutions/3001-3500/3274-check-if-two-chessboard-squares-have-the-same-color.cpp) |
| 3275 | [K-th Nearest Obstacle Queries](https://leetcode.com/problems/k-th-nearest-obstacle-queries/) | Medium | [cpp](./solutions/3001-3500/3275-k-th-nearest-obstacle-queries.cpp) |
| 3276 | [Select Cells in Grid With Maximum Score](https://leetcode.com/problems/select-cells-in-grid-with-maximum-score/) | Hard | [cpp](./solutions/3001-3500/3276-select-cells-in-grid-with-maximum-score.cpp) |
| 3277 | [Maximum XOR Score Subarray Queries](https://leetcode.com/problems/maximum-xor-score-subarray-queries/) | Hard | [cpp](./solutions/3001-3500/3277-maximum-xor-score-subarray-queries.cpp) |
| 3280 | [Convert Date to Binary](https://leetcode.com/problems/convert-date-to-binary/) | Easy | [cpp](./solutions/3001-3500/3280-convert-date-to-binary.cpp) |
| 3281 | [Maximize Score of Numbers in Ranges](https://leetcode.com/problems/maximize-score-of-numbers-in-ranges/) | Medium | [cpp](./solutions/3001-3500/3281-maximize-score-of-numbers-in-ranges.cpp) |
| 3282 | [Reach End of Array With Max Score](https://leetcode.com/problems/reach-end-of-array-with-max-score/) | Medium | [cpp](./solutions/3001-3500/3282-reach-end-of-array-with-max-score.cpp) |
| 3283 | [Maximum Number of Moves to Kill All Pawns](https://leetcode.com/problems/maximum-number-of-moves-to-kill-all-pawns/) | Hard | [cpp](./solutions/3001-3500/3283-maximum-number-of-moves-to-kill-all-pawns.cpp) |
| 3285 | [Find Indices of Stable Mountains](https://leetcode.com/problems/find-indices-of-stable-mountains/) | Easy | [cpp](./solutions/3001-3500/3285-find-indices-of-stable-mountains.cpp) |
| 3286 | [Find a Safe Walk Through a Grid](https://leetcode.com/problems/find-a-safe-walk-through-a-grid/) | Medium | [cpp](./solutions/3001-3500/3286-find-a-safe-walk-through-a-grid.cpp) |
| 3287 | [Find the Maximum Sequence Value of Array](https://leetcode.com/problems/find-the-maximum-sequence-value-of-array/) | Hard | [cpp](./solutions/3001-3500/3287-find-the-maximum-sequence-value-of-array.cpp) |
| 3288 | [Length of the Longest Increasing Path](https://leetcode.com/problems/length-of-the-longest-increasing-path/) | Hard | [cpp](./solutions/3001-3500/3288-length-of-the-longest-increasing-path.cpp) |
| 3289 | [The Two Sneaky Numbers of Digitville](https://leetcode.com/problems/the-two-sneaky-numbers-of-digitville/) | Easy | [cpp](./solutions/3001-3500/3289-the-two-sneaky-numbers-of-digitville.cpp) |
| 3290 | [Maximum Multiplication Score](https://leetcode.com/problems/maximum-multiplication-score/) | Medium | [cpp](./solutions/3001-3500/3290-maximum-multiplication-score.cpp) |
| 3291 | [Minimum Number of Valid Strings to Form Target I](https://leetcode.com/problems/minimum-number-of-valid-strings-to-form-target-i/) | Medium | [cpp](./solutions/3001-3500/3291-minimum-number-of-valid-strings-to-form-target-i.cpp) |
| 3292 | [Minimum Number of Valid Strings to Form Target II](https://leetcode.com/problems/minimum-number-of-valid-strings-to-form-target-ii/) | Hard | [cpp](./solutions/3001-3500/3292-minimum-number-of-valid-strings-to-form-target-ii.cpp) |
| 3295 | [Report Spam Message](https://leetcode.com/problems/report-spam-message/) | Medium | [cpp](./solutions/3001-3500/3295-report-spam-message.cpp) |
| 3296 | [Minimum Number of Seconds to Make Mountain Height Zero](https://leetcode.com/problems/minimum-number-of-seconds-to-make-mountain-height-zero/) | Medium | [cpp](./solutions/3001-3500/3296-minimum-number-of-seconds-to-make-mountain-height-zero.cpp) |
| 3297 | [Count Substrings That Can Be Rearranged to Contain a String I](https://leetcode.com/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-i/) | Medium | [cpp](./solutions/3001-3500/3297-count-substrings-that-can-be-rearranged-to-contain-a-string-i.cpp) |
| 3298 | [Count Substrings That Can Be Rearranged to Contain a String II](https://leetcode.com/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-ii/) | Hard | [cpp](./solutions/3001-3500/3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii.cpp) |
| 3300 | [Minimum Element After Replacement With Digit Sum](https://leetcode.com/problems/minimum-element-after-replacement-with-digit-sum/) | Easy | [cpp](./solutions/3001-3500/3300-minimum-element-after-replacement-with-digit-sum.cpp) |
| 3301 | [Maximize the Total Height of Unique Towers](https://leetcode.com/problems/maximize-the-total-height-of-unique-towers/) | Medium | [cpp](./solutions/3001-3500/3301-maximize-the-total-height-of-unique-towers.cpp) |
| 3303 | [Find the Occurrence of First Almost Equal Substring](https://leetcode.com/problems/find-the-occurrence-of-first-almost-equal-substring/) | Hard | [cpp](./solutions/3001-3500/3303-find-the-occurrence-of-first-almost-equal-substring.cpp) |
| 3304 | [Find the K-th Character in String Game I](https://leetcode.com/problems/find-the-k-th-character-in-string-game-i/) | Easy | [cpp](./solutions/3001-3500/3304-find-the-k-th-character-in-string-game-i.cpp) |
| 3305 | [Count of Substrings Containing Every Vowel and K Consonants I](https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-i/) | Medium | [cpp](./solutions/3001-3500/3305-count-of-substrings-containing-every-vowel-and-k-consonants-i.cpp) |
| 3306 | [Count of Substrings Containing Every Vowel and K Consonants II](https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii/) | Medium | [cpp](./solutions/3001-3500/3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii.cpp) |
| 3309 | [Maximum Possible Number by Binary Concatenation](https://leetcode.com/problems/maximum-possible-number-by-binary-concatenation/) | Medium | [cpp](./solutions/3001-3500/3309-maximum-possible-number-by-binary-concatenation.cpp) |
| 3310 | [Remove Methods From Project](https://leetcode.com/problems/remove-methods-from-project/) | Medium | [cpp](./solutions/3001-3500/3310-remove-methods-from-project.cpp) |
| 3312 | [Sorted GCD Pair Queries](https://leetcode.com/problems/sorted-gcd-pair-queries/) | Hard | [cpp](./solutions/3001-3500/3312-sorted-gcd-pair-queries.cpp) |
| 3314 | [Construct the Minimum Bitwise Array I](https://leetcode.com/problems/construct-the-minimum-bitwise-array-i/) | Easy | [cpp](./solutions/3001-3500/3314-construct-the-minimum-bitwise-array-i.cpp) |
| 3315 | [Construct the Minimum Bitwise Array II](https://leetcode.com/problems/construct-the-minimum-bitwise-array-ii/) | Medium | [cpp](./solutions/3001-3500/3315-construct-the-minimum-bitwise-array-ii.cpp) |
| 3316 | [Find Maximum Removals From Source String](https://leetcode.com/problems/find-maximum-removals-from-source-string/) | Medium | [cpp](./solutions/3001-3500/3316-find-maximum-removals-from-source-string.cpp) |
| 3317 | [Find the Number of Possible Ways for an Event](https://leetcode.com/problems/find-the-number-of-possible-ways-for-an-event/) | Hard | [cpp](./solutions/3001-3500/3317-find-the-number-of-possible-ways-for-an-event.cpp) |
| 3318 | [Find X-Sum of All K-Long Subarrays I](https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-i/) | Easy | [cpp](./solutions/3001-3500/3318-find-x-sum-of-all-k-long-subarrays-i.cpp) |
| 3319 | [K-th Largest Perfect Subtree Size in Binary Tree](https://leetcode.com/problems/k-th-largest-perfect-subtree-size-in-binary-tree/) | Medium | [cpp](./solutions/3001-3500/3319-k-th-largest-perfect-subtree-size-in-binary-tree.cpp) |
| 3320 | [Count The Number of Winning Sequences](https://leetcode.com/problems/count-the-number-of-winning-sequences/) | Hard | [cpp](./solutions/3001-3500/3320-count-the-number-of-winning-sequences.cpp) |
| 3321 | [Find X-Sum of All K-Long Subarrays II](https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-ii/) | Hard | [cpp](./solutions/3001-3500/3321-find-x-sum-of-all-k-long-subarrays-ii.cpp) |
| 3324 | [Find the Sequence of Strings Appeared on the Screen](https://leetcode.com/problems/find-the-sequence-of-strings-appeared-on-the-screen/) | Medium | [cpp](./solutions/3001-3500/3324-find-the-sequence-of-strings-appeared-on-the-screen.cpp) |
| 3325 | [Count Substrings With K-Frequency Characters I](https://leetcode.com/problems/count-substrings-with-k-frequency-characters-i/) | Medium | [cpp](./solutions/3001-3500/3325-count-substrings-with-k-frequency-characters-i.cpp) |
| 3326 | [Minimum Division Operations to Make Array Non Decreasing](https://leetcode.com/problems/minimum-division-operations-to-make-array-non-decreasing/) | Medium | [cpp](./solutions/3001-3500/3326-minimum-division-operations-to-make-array-non-decreasing.cpp) |
| 3327 | [Check if DFS Strings Are Palindromes](https://leetcode.com/problems/check-if-dfs-strings-are-palindromes/) | Hard | [cpp](./solutions/3001-3500/3327-check-if-dfs-strings-are-palindromes.cpp) |
| 3330 | [Find the Original Typed String I](https://leetcode.com/problems/find-the-original-typed-string-i/) | Easy | [cpp](./solutions/3001-3500/3330-find-the-original-typed-string-i.cpp) |
| 3331 | [Find Subtree Sizes After Changes](https://leetcode.com/problems/find-subtree-sizes-after-changes/) | Medium | [cpp](./solutions/3001-3500/3331-find-subtree-sizes-after-changes.cpp) |
| 3332 | [Maximum Points Tourist Can Earn](https://leetcode.com/problems/maximum-points-tourist-can-earn/) | Medium | [cpp](./solutions/3001-3500/3332-maximum-points-tourist-can-earn.cpp) |
| 3333 | [Find the Original Typed String II](https://leetcode.com/problems/find-the-original-typed-string-ii/) | Hard | [cpp](./solutions/3001-3500/3333-find-the-original-typed-string-ii.cpp) |
| 3334 | [Find the Maximum Factor Score of Array](https://leetcode.com/problems/find-the-maximum-factor-score-of-array/) | Medium | [cpp](./solutions/3001-3500/3334-find-the-maximum-factor-score-of-array.cpp) |
| 3335 | [Total Characters in String After Transformations I](https://leetcode.com/problems/total-characters-in-string-after-transformations-i/) | Medium | [cpp](./solutions/3001-3500/3335-total-characters-in-string-after-transformations-i.cpp) |
| 3336 | [Find the Number of Subsequences With Equal GCD](https://leetcode.com/problems/find-the-number-of-subsequences-with-equal-gcd/) | Hard | [cpp](./solutions/3001-3500/3336-find-the-number-of-subsequences-with-equal-gcd.cpp) |
| 3340 | [Check Balanced String](https://leetcode.com/problems/check-balanced-string/) | Easy | [cpp](./solutions/3001-3500/3340-check-balanced-string.cpp) |
| 3341 | [Find Minimum Time to Reach Last Room I](https://leetcode.com/problems/find-minimum-time-to-reach-last-room-i/) | Medium | [cpp](./solutions/3001-3500/3341-find-minimum-time-to-reach-last-room-i.cpp) |
| 3342 | [Find Minimum Time to Reach Last Room II](https://leetcode.com/problems/find-minimum-time-to-reach-last-room-ii/) | Medium | [cpp](./solutions/3001-3500/3342-find-minimum-time-to-reach-last-room-ii.cpp) |
| 3343 | [Count Number of Balanced Permutations](https://leetcode.com/problems/count-number-of-balanced-permutations/) | Hard | [cpp](./solutions/3001-3500/3343-count-number-of-balanced-permutations.cpp) |
| 3345 | [Smallest Divisible Digit Product I](https://leetcode.com/problems/smallest-divisible-digit-product-i/) | Easy | [cpp](./solutions/3001-3500/3345-smallest-divisible-digit-product-i.cpp) |
| 3346 | [Maximum Frequency of an Element After Performing Operations I](https://leetcode.com/problems/maximum-frequency-of-an-element-after-performing-operations-i/) | Medium | [cpp](./solutions/3001-3500/3346-maximum-frequency-of-an-element-after-performing-operations-i.cpp) |
| 3347 | [Maximum Frequency of an Element After Performing Operations II](https://leetcode.com/problems/maximum-frequency-of-an-element-after-performing-operations-ii/) | Hard | [cpp](./solutions/3001-3500/3347-maximum-frequency-of-an-element-after-performing-operations-ii.cpp) |
| 3349 | [Adjacent Increasing Subarrays Detection I](https://leetcode.com/problems/adjacent-increasing-subarrays-detection-i/) | Easy | [cpp](./solutions/3001-3500/3349-adjacent-increasing-subarrays-detection-i.cpp) |
| 3350 | [Adjacent Increasing Subarrays Detection II](https://leetcode.com/problems/adjacent-increasing-subarrays-detection-ii/) | Medium | [cpp](./solutions/3001-3500/3350-adjacent-increasing-subarrays-detection-ii.cpp) |
| 3351 | [Sum of Good Subsequences](https://leetcode.com/problems/sum-of-good-subsequences/) | Hard | [cpp](./solutions/3001-3500/3351-sum-of-good-subsequences.cpp) |
| 3352 | [Count K-Reducible Numbers Less Than N](https://leetcode.com/problems/count-k-reducible-numbers-less-than-n/) | Hard | [cpp](./solutions/3001-3500/3352-count-k-reducible-numbers-less-than-n.cpp) |
| 3354 | [Make Array Elements Equal to Zero](https://leetcode.com/problems/make-array-elements-equal-to-zero/) | Easy | [cpp](./solutions/3001-3500/3354-make-array-elements-equal-to-zero.cpp) |
| 3355 | [Zero Array Transformation I](https://leetcode.com/problems/zero-array-transformation-i/) | Medium | [cpp](./solutions/3001-3500/3355-zero-array-transformation-i.cpp) |
| 3356 | [Zero Array Transformation II](https://leetcode.com/problems/zero-array-transformation-ii/) | Medium | [cpp](./solutions/3001-3500/3356-zero-array-transformation-ii.cpp) |
| 3360 | [Stone Removal Game](https://leetcode.com/problems/stone-removal-game/) | Easy | [cpp](./solutions/3001-3500/3360-stone-removal-game.cpp) |
| 3361 | [Shift Distance Between Two Strings](https://leetcode.com/problems/shift-distance-between-two-strings/) | Medium | [cpp](./solutions/3001-3500/3361-shift-distance-between-two-strings.cpp) |
| 3362 | [Zero Array Transformation III](https://leetcode.com/problems/zero-array-transformation-iii/) | Medium | [cpp](./solutions/3001-3500/3362-zero-array-transformation-iii.cpp) |
| 3363 | [Find the Maximum Number of Fruits Collected](https://leetcode.com/problems/find-the-maximum-number-of-fruits-collected/) | Hard | [cpp](./solutions/3001-3500/3363-find-the-maximum-number-of-fruits-collected.cpp) |
| 3364 | [Minimum Positive Sum Subarray ](https://leetcode.com/problems/minimum-positive-sum-subarray/) | Easy | [cpp](./solutions/3001-3500/3364-minimum-positive-sum-subarray.cpp) |
| 3365 | [Rearrange K Substrings to Form Target String](https://leetcode.com/problems/rearrange-k-substrings-to-form-target-string/) | Medium | [cpp](./solutions/3001-3500/3365-rearrange-k-substrings-to-form-target-string.cpp) |
| 3366 | [Minimum Array Sum](https://leetcode.com/problems/minimum-array-sum/) | Medium | [cpp](./solutions/3001-3500/3366-minimum-array-sum.cpp) |
| 3367 | [Maximize Sum of Weights after Edge Removals](https://leetcode.com/problems/maximize-sum-of-weights-after-edge-removals/) | Hard | [cpp](./solutions/3001-3500/3367-maximize-sum-of-weights-after-edge-removals.cpp) |
| 3370 | [Smallest Number With All Set Bits](https://leetcode.com/problems/smallest-number-with-all-set-bits/) | Easy | [cpp](./solutions/3001-3500/3370-smallest-number-with-all-set-bits.cpp) |
| 3371 | [Identify the Largest Outlier in an Array](https://leetcode.com/problems/identify-the-largest-outlier-in-an-array/) | Medium | [cpp](./solutions/3001-3500/3371-identify-the-largest-outlier-in-an-array.cpp) |
| 3372 | [Maximize the Number of Target Nodes After Connecting Trees I](https://leetcode.com/problems/maximize-the-number-of-target-nodes-after-connecting-trees-i/) | Medium | [cpp](./solutions/3001-3500/3372-maximize-the-number-of-target-nodes-after-connecting-trees-i.cpp) |
| 3373 | [Maximize the Number of Target Nodes After Connecting Trees II](https://leetcode.com/problems/maximize-the-number-of-target-nodes-after-connecting-trees-ii/) | Hard | [cpp](./solutions/3001-3500/3373-maximize-the-number-of-target-nodes-after-connecting-trees-ii.cpp) |
| 3375 | [Minimum Operations to Make Array Values Equal to K](https://leetcode.com/problems/minimum-operations-to-make-array-values-equal-to-k/) | Easy | [cpp](./solutions/3001-3500/3375-minimum-operations-to-make-array-values-equal-to-k.cpp) |
| 3376 | [Minimum Time to Break Locks I](https://leetcode.com/problems/minimum-time-to-break-locks-i/) | Medium | [cpp](./solutions/3001-3500/3376-minimum-time-to-break-locks-i.cpp) |
| 3379 | [Transformed Array](https://leetcode.com/problems/transformed-array/) | Easy | [cpp](./solutions/3001-3500/3379-transformed-array.cpp) |
| 3381 | [Maximum Subarray Sum With Length Divisible by K](https://leetcode.com/problems/maximum-subarray-sum-with-length-divisible-by-k/) | Medium | [cpp](./solutions/3001-3500/3381-maximum-subarray-sum-with-length-divisible-by-k.cpp) |
| 3386 | [Button with Longest Push Time](https://leetcode.com/problems/button-with-longest-push-time/) | Easy | [cpp](./solutions/3001-3500/3386-button-with-longest-push-time.cpp) |
| 3387 | [Maximize Amount After Two Days of Conversions](https://leetcode.com/problems/maximize-amount-after-two-days-of-conversions/) | Medium | [cpp](./solutions/3001-3500/3387-maximize-amount-after-two-days-of-conversions.cpp) |
| 3388 | [Count Beautiful Splits in an Array](https://leetcode.com/problems/count-beautiful-splits-in-an-array/) | Medium | [cpp](./solutions/3001-3500/3388-count-beautiful-splits-in-an-array.cpp) |
| 3392 | [Count Subarrays of Length Three With a Condition](https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition/) | Easy | [cpp](./solutions/3001-3500/3392-count-subarrays-of-length-three-with-a-condition.cpp) |
| 3393 | [Count Paths With the Given XOR Value](https://leetcode.com/problems/count-paths-with-the-given-xor-value/) | Medium | [cpp](./solutions/3001-3500/3393-count-paths-with-the-given-xor-value.cpp) |
| 3394 | [Check if Grid can be Cut into Sections](https://leetcode.com/problems/check-if-grid-can-be-cut-into-sections/) | Medium | [cpp](./solutions/3001-3500/3394-check-if-grid-can-be-cut-into-sections.cpp) |
| 3396 | [Minimum Number of Operations to Make Elements in Array Distinct](https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/) | Easy | [cpp](./solutions/3001-3500/3396-minimum-number-of-operations-to-make-elements-in-array-distinct.cpp) |
| 3397 | [Maximum Number of Distinct Elements After Operations](https://leetcode.com/problems/maximum-number-of-distinct-elements-after-operations/) | Medium | [cpp](./solutions/3001-3500/3397-maximum-number-of-distinct-elements-after-operations.cpp) |
| 3398 | [Smallest Substring With Identical Characters I](https://leetcode.com/problems/smallest-substring-with-identical-characters-i/) | Hard | [cpp](./solutions/3001-3500/3398-smallest-substring-with-identical-characters-i.cpp) |
| 3402 | [Minimum Operations to Make Columns Strictly Increasing](https://leetcode.com/problems/minimum-operations-to-make-columns-strictly-increasing/) | Easy | [cpp](./solutions/3001-3500/3402-minimum-operations-to-make-columns-strictly-increasing.cpp) |
| 3403 | [Find the Lexicographically Largest String From the Box I](https://leetcode.com/problems/find-the-lexicographically-largest-string-from-the-box-i/) | Medium | [cpp](./solutions/3001-3500/3403-find-the-lexicographically-largest-string-from-the-box-i.cpp) |
| 3405 | [Count the Number of Arrays with K Matching Adjacent Elements](https://leetcode.com/problems/count-the-number-of-arrays-with-k-matching-adjacent-elements/) | Hard | [cpp](./solutions/3001-3500/3405-count-the-number-of-arrays-with-k-matching-adjacent-elements.cpp) |
| 3407 | [Substring Matching Pattern](https://leetcode.com/problems/substring-matching-pattern/) | Easy | [cpp](./solutions/3001-3500/3407-substring-matching-pattern.cpp) |
| 3408 | [Design Task Manager](https://leetcode.com/problems/design-task-manager/) | Medium | [cpp](./solutions/3001-3500/3408-design-task-manager.cpp) |
| 3409 | [Longest Subsequence With Decreasing Adjacent Difference](https://leetcode.com/problems/longest-subsequence-with-decreasing-adjacent-difference/) | Medium | [cpp](./solutions/3001-3500/3409-longest-subsequence-with-decreasing-adjacent-difference.cpp) |
| 3411 | [Maximum Subarray With Equal Products](https://leetcode.com/problems/maximum-subarray-with-equal-products/) | Easy | [cpp](./solutions/3001-3500/3411-maximum-subarray-with-equal-products.cpp) |
| 3412 | [Find Mirror Score of a String](https://leetcode.com/problems/find-mirror-score-of-a-string/) | Medium | [cpp](./solutions/3001-3500/3412-find-mirror-score-of-a-string.cpp) |
| 3413 | [Maximum Coins From K Consecutive Bags](https://leetcode.com/problems/maximum-coins-from-k-consecutive-bags/) | Medium | [cpp](./solutions/3001-3500/3413-maximum-coins-from-k-consecutive-bags.cpp) |
| 3414 | [Maximum Score of Non-overlapping Intervals](https://leetcode.com/problems/maximum-score-of-non-overlapping-intervals/) | Hard | [cpp](./solutions/3001-3500/3414-maximum-score-of-non-overlapping-intervals.cpp) |
| 3417 | [Zigzag Grid Traversal With Skip](https://leetcode.com/problems/zigzag-grid-traversal-with-skip/) | Easy | [cpp](./solutions/3001-3500/3417-zigzag-grid-traversal-with-skip.cpp) |
| 3418 | [Maximum Amount of Money Robot Can Earn](https://leetcode.com/problems/maximum-amount-of-money-robot-can-earn/) | Medium | [cpp](./solutions/3001-3500/3418-maximum-amount-of-money-robot-can-earn.cpp) |
| 3419 | [Minimize the Maximum Edge Weight of Graph](https://leetcode.com/problems/minimize-the-maximum-edge-weight-of-graph/) | Medium | [cpp](./solutions/3001-3500/3419-minimize-the-maximum-edge-weight-of-graph.cpp) |
| 3423 | [Maximum Difference Between Adjacent Elements in a Circular Array](https://leetcode.com/problems/maximum-difference-between-adjacent-elements-in-a-circular-array/) | Easy | [cpp](./solutions/3001-3500/3423-maximum-difference-between-adjacent-elements-in-a-circular-array.cpp) |
| 3424 | [Minimum Cost to Make Arrays Identical](https://leetcode.com/problems/minimum-cost-to-make-arrays-identical/) | Medium | [cpp](./solutions/3001-3500/3424-minimum-cost-to-make-arrays-identical.cpp) |
| 3425 | [Longest Special Path](https://leetcode.com/problems/longest-special-path/) | Hard | [cpp](./solutions/3001-3500/3425-longest-special-path.cpp) |
| 3432 | [Count Partitions with Even Sum Difference](https://leetcode.com/problems/count-partitions-with-even-sum-difference/) | Easy | [cpp](./solutions/3001-3500/3432-count-partitions-with-even-sum-difference.cpp) |
| 3433 | [Count Mentions Per User](https://leetcode.com/problems/count-mentions-per-user/) | Medium | [cpp](./solutions/3001-3500/3433-count-mentions-per-user.cpp) |
| 3434 | [Maximum Frequency After Subarray Operation](https://leetcode.com/problems/maximum-frequency-after-subarray-operation/) | Medium | [cpp](./solutions/3001-3500/3434-maximum-frequency-after-subarray-operation.cpp) |
| 3438 | [Find Valid Pair of Adjacent Digits in String](https://leetcode.com/problems/find-valid-pair-of-adjacent-digits-in-string/) | Easy | [cpp](./solutions/3001-3500/3438-find-valid-pair-of-adjacent-digits-in-string.cpp) |
| 3442 | [Maximum Difference Between Even and Odd Frequency I](https://leetcode.com/problems/maximum-difference-between-even-and-odd-frequency-i/) | Easy | [cpp](./solutions/3001-3500/3442-maximum-difference-between-even-and-odd-frequency-i.cpp) |
| 3443 | [Maximum Manhattan Distance After K Changes](https://leetcode.com/problems/maximum-manhattan-distance-after-k-changes/) | Medium | [cpp](./solutions/3001-3500/3443-maximum-manhattan-distance-after-k-changes.cpp) |
| 3446 | [Sort Matrix by Diagonals](https://leetcode.com/problems/sort-matrix-by-diagonals/) | Medium | [cpp](./solutions/3001-3500/3446-sort-matrix-by-diagonals.cpp) |
| 3447 | [Assign Elements to Groups with Constraints](https://leetcode.com/problems/assign-elements-to-groups-with-constraints/) | Medium | [cpp](./solutions/3001-3500/3447-assign-elements-to-groups-with-constraints.cpp) |
| 3507 | [Minimum Pair Removal to Sort Array I](https://leetcode.com/problems/minimum-pair-removal-to-sort-array-i/) | Easy | [cpp](./solutions/3501-4000/3507-minimum-pair-removal-to-sort-array-i.cpp) |
| 3508 | [Implement Router](https://leetcode.com/problems/implement-router/) | Medium | [cpp](./solutions/3501-4000/3508-implement-router.cpp) |
| 3512 | [Minimum Operations to Make Array Sum Divisible by K](https://leetcode.com/problems/minimum-operations-to-make-array-sum-divisible-by-k/) | Easy | [cpp](./solutions/3501-4000/3512-minimum-operations-to-make-array-sum-divisible-by-k.cpp) |
| 3513 | [Number of Unique XOR Triplets I](https://leetcode.com/problems/number-of-unique-xor-triplets-i/) | Medium | [cpp](./solutions/3501-4000/3513-number-of-unique-xor-triplets-i.cpp) |
| 3514 | [Number of Unique XOR Triplets II](https://leetcode.com/problems/number-of-unique-xor-triplets-ii/) | Medium | [cpp](./solutions/3501-4000/3514-number-of-unique-xor-triplets-ii.cpp) |
| 3560 | [Find Minimum Log Transportation Cost](https://leetcode.com/problems/find-minimum-log-transportation-cost/) | Easy | [cpp](./solutions/3501-4000/3560-find-minimum-log-transportation-cost.cpp) |
| 3561 | [Resulting String After Adjacent Removals](https://leetcode.com/problems/resulting-string-after-adjacent-removals/) | Medium | [cpp](./solutions/3501-4000/3561-resulting-string-after-adjacent-removals.cpp) |
| 3566 | [Partition Array into Two Equal Product Subsets](https://leetcode.com/problems/partition-array-into-two-equal-product-subsets/) | Medium | [cpp](./solutions/3501-4000/3566-partition-array-into-two-equal-product-subsets.cpp) |
| 3567 | [Minimum Absolute Difference in Sliding Submatrix](https://leetcode.com/problems/minimum-absolute-difference-in-sliding-submatrix/) | Medium | [cpp](./solutions/3501-4000/3567-minimum-absolute-difference-in-sliding-submatrix.cpp) |
| 3568 | [Minimum Moves to Clean the Classroom](https://leetcode.com/problems/minimum-moves-to-clean-the-classroom/) | Medium | [cpp](./solutions/3501-4000/3568-minimum-moves-to-clean-the-classroom.cpp) |
| 3668 | [Restore Finishing Order](https://leetcode.com/problems/restore-finishing-order/) | Easy | [cpp](./solutions/3501-4000/3668-restore-finishing-order.cpp) |
| 3669 | [Balanced K-Factor Decomposition](https://leetcode.com/problems/balanced-k-factor-decomposition/) | Medium | [cpp](./solutions/3501-4000/3669-balanced-k-factor-decomposition.cpp) |
| 3701 | [Compute Alternating Sum](https://leetcode.com/problems/compute-alternating-sum/) | Easy | [cpp](./solutions/3501-4000/3701-compute-alternating-sum.cpp) |
| 3702 | [Longest Subsequence With Non-Zero Bitwise XOR](https://leetcode.com/problems/longest-subsequence-with-non-zero-bitwise-xor/) | Medium | [cpp](./solutions/3501-4000/3702-longest-subsequence-with-non-zero-bitwise-xor.cpp) |
| 3703 | [Remove K-Balanced Substrings](https://leetcode.com/problems/remove-k-balanced-substrings/) | Medium | [cpp](./solutions/3501-4000/3703-remove-k-balanced-substrings.cpp) |
| 3704 | [Count No-Zero Pairs That Sum to N](https://leetcode.com/problems/count-no-zero-pairs-that-sum-to-n/) | Hard | [cpp](./solutions/3501-4000/3704-count-no-zero-pairs-that-sum-to-n.cpp) |
| 3707 | [Equal Score Substrings](https://leetcode.com/problems/equal-score-substrings/) | Easy | [cpp](./solutions/3501-4000/3707-equal-score-substrings.cpp) |
| 3708 | [Longest Fibonacci Subarray](https://leetcode.com/problems/longest-fibonacci-subarray/) | Medium | [cpp](./solutions/3501-4000/3708-longest-fibonacci-subarray.cpp) |
| 3709 | [Design Exam Scores Tracker](https://leetcode.com/problems/design-exam-scores-tracker/) | Medium | [cpp](./solutions/3501-4000/3709-design-exam-scores-tracker.cpp) |
| 3710 | [Maximum Partition Factor](https://leetcode.com/problems/maximum-partition-factor/) | Hard | [cpp](./solutions/3501-4000/3710-maximum-partition-factor.cpp) |
| 3712 | [Sum of Elements With Frequency Divisible by K](https://leetcode.com/problems/sum-of-elements-with-frequency-divisible-by-k/) | Easy | [cpp](./solutions/3501-4000/3712-sum-of-elements-with-frequency-divisible-by-k.cpp) |
| 3713 | [Longest Balanced Substring I](https://leetcode.com/problems/longest-balanced-substring-i/) | Medium | [cpp](./solutions/3501-4000/3713-longest-balanced-substring-i.cpp) |
| 3718 | [Smallest Missing Multiple of K](https://leetcode.com/problems/smallest-missing-multiple-of-k/) | Easy | [python3](./solutions/3501-4000/3718-smallest-missing-multiple-of-k.py) |
| 3719 | [Longest Balanced Subarray I](https://leetcode.com/problems/longest-balanced-subarray-i/) | Medium | [python3](./solutions/3501-4000/3719-longest-balanced-subarray-i.py) |
| 3726 | [Remove Zeros in Decimal Representation](https://leetcode.com/problems/remove-zeros-in-decimal-representation/) | Easy | [cpp](./solutions/3501-4000/3726-remove-zeros-in-decimal-representation.cpp) |
| 3727 | [Maximum Alternating Sum of Squares](https://leetcode.com/problems/maximum-alternating-sum-of-squares/) | Medium | [cpp](./solutions/3501-4000/3727-maximum-alternating-sum-of-squares.cpp) |
| 3728 | [Stable Subarrays With Equal Boundary and Interior Sum](https://leetcode.com/problems/stable-subarrays-with-equal-boundary-and-interior-sum/) | Medium | [cpp](./solutions/3501-4000/3728-stable-subarrays-with-equal-boundary-and-interior-sum.cpp) |
| 3729 | [Count Distinct Subarrays Divisible by K in Sorted Array](https://leetcode.com/problems/count-distinct-subarrays-divisible-by-k-in-sorted-array/) | Hard | [cpp](./solutions/3501-4000/3729-count-distinct-subarrays-divisible-by-k-in-sorted-array.cpp) |
| 3731 | [Find Missing Elements](https://leetcode.com/problems/find-missing-elements/) | Easy | [cpp](./solutions/3501-4000/3731-find-missing-elements.cpp) |
| 3732 | [Maximum Product of Three Elements After One Replacement](https://leetcode.com/problems/maximum-product-of-three-elements-after-one-replacement/) | Medium | [cpp](./solutions/3501-4000/3732-maximum-product-of-three-elements-after-one-replacement.cpp) |
| 3745 | [Maximize Expression of Three Elements](https://leetcode.com/problems/maximize-expression-of-three-elements/) | Easy | [cpp](./solutions/3501-4000/3745-maximize-expression-of-three-elements.cpp) |
| 3746 | [Minimum String Length After Balanced Removals](https://leetcode.com/problems/minimum-string-length-after-balanced-removals/) | Medium | [cpp](./solutions/3501-4000/3746-minimum-string-length-after-balanced-removals.cpp) |
| 3747 | [Count Distinct Integers After Removing Zeros](https://leetcode.com/problems/count-distinct-integers-after-removing-zeros/) | Medium | [cpp](./solutions/3501-4000/3747-count-distinct-integers-after-removing-zeros.cpp) |
| 3754 | [Concatenate Non-Zero Digits and Multiply by Sum I](https://leetcode.com/problems/concatenate-non-zero-digits-and-multiply-by-sum-i/) | Easy | [cpp](./solutions/3501-4000/3754-concatenate-non-zero-digits-and-multiply-by-sum-i.cpp) |
| 3755 | [Find Maximum Balanced XOR Subarray Length](https://leetcode.com/problems/find-maximum-balanced-xor-subarray-length/) | Medium | [cpp](./solutions/3501-4000/3755-find-maximum-balanced-xor-subarray-length.cpp) |
| 3756 | [Concatenate Non-Zero Digits and Multiply by Sum II](https://leetcode.com/problems/concatenate-non-zero-digits-and-multiply-by-sum-ii/) | Medium | [cpp](./solutions/3501-4000/3756-concatenate-non-zero-digits-and-multiply-by-sum-ii.cpp) |
| 3759 | [Count Elements With at Least K Greater Values](https://leetcode.com/problems/count-elements-with-at-least-k-greater-values/) | Medium | [python3](./solutions/3501-4000/3759-count-elements-with-at-least-k-greater-values.py) |
| 3761 | [Minimum Absolute Distance Between Mirror Pairs](https://leetcode.com/problems/minimum-absolute-distance-between-mirror-pairs/) | Medium | [python3](./solutions/3501-4000/3761-minimum-absolute-distance-between-mirror-pairs.py) |
| 3765 | [Complete Prime Number](https://leetcode.com/problems/complete-prime-number/) | Medium | [cpp](./solutions/3501-4000/3765-complete-prime-number.cpp) |
| 3766 | [Minimum Operations to Make Binary Palindrome](https://leetcode.com/problems/minimum-operations-to-make-binary-palindrome/) | Medium | [cpp](./solutions/3501-4000/3766-minimum-operations-to-make-binary-palindrome.cpp) |
| 3767 | [Maximize Points After Choosing K Tasks](https://leetcode.com/problems/maximize-points-after-choosing-k-tasks/) | Medium | [cpp](./solutions/3501-4000/3767-maximize-points-after-choosing-k-tasks.cpp) |
| 3768 | [Minimum Inversion Count in Subarrays of Fixed Length](https://leetcode.com/problems/minimum-inversion-count-in-subarrays-of-fixed-length/) | Hard | [cpp](./solutions/3501-4000/3768-minimum-inversion-count-in-subarrays-of-fixed-length.cpp) |
| 3769 | [Sort Integers by Binary Reflection](https://leetcode.com/problems/sort-integers-by-binary-reflection/) | Easy | [cpp](./solutions/3501-4000/3769-sort-integers-by-binary-reflection.cpp) |
| 3770 | [Largest Prime from Consecutive Prime Sum](https://leetcode.com/problems/largest-prime-from-consecutive-prime-sum/) | Medium | [cpp](./solutions/3501-4000/3770-largest-prime-from-consecutive-prime-sum.cpp) |
| 3771 | [Total Score of Dungeon Runs](https://leetcode.com/problems/total-score-of-dungeon-runs/) | Medium | [cpp](./solutions/3501-4000/3771-total-score-of-dungeon-runs.cpp) |
| 3772 | [Maximum Subgraph Score in a Tree](https://leetcode.com/problems/maximum-subgraph-score-in-a-tree/) | Hard | [cpp](./solutions/3501-4000/3772-maximum-subgraph-score-in-a-tree.cpp) |
| 3779 | [Minimum Number of Operations to Have Distinct Elements](https://leetcode.com/problems/minimum-number-of-operations-to-have-distinct-elements/) | Medium | [cpp](./solutions/3501-4000/3779-minimum-number-of-operations-to-have-distinct-elements.cpp) |
| 3780 | [Maximum Sum of Three Numbers Divisible by Three](https://leetcode.com/problems/maximum-sum-of-three-numbers-divisible-by-three/) | Medium | [cpp](./solutions/3501-4000/3780-maximum-sum-of-three-numbers-divisible-by-three.cpp) |
| 3783 | [Mirror Distance of an Integer](https://leetcode.com/problems/mirror-distance-of-an-integer/) | Easy | [python3](./solutions/3501-4000/3783-mirror-distance-of-an-integer.py) |
| 3784 | [Minimum Deletion Cost to Make All Characters Equal](https://leetcode.com/problems/minimum-deletion-cost-to-make-all-characters-equal/) | Medium | [cpp](./solutions/3501-4000/3784-minimum-deletion-cost-to-make-all-characters-equal.cpp) |
| 3786 | [Total Sum of Interaction Cost in Tree Groups](https://leetcode.com/problems/total-sum-of-interaction-cost-in-tree-groups/) | Hard | [cpp](./solutions/3501-4000/3786-total-sum-of-interaction-cost-in-tree-groups.cpp) |
| 3788 | [Maximum Score of a Split](https://leetcode.com/problems/maximum-score-of-a-split/) | Medium | [cpp](./solutions/3501-4000/3788-maximum-score-of-a-split.cpp) |
| 3789 | [Minimum Cost to Acquire Required Items](https://leetcode.com/problems/minimum-cost-to-acquire-required-items/) | Medium | [cpp](./solutions/3501-4000/3789-minimum-cost-to-acquire-required-items.cpp) |
| 3790 | [Smallest All-Ones Multiple](https://leetcode.com/problems/smallest-all-ones-multiple/) | Medium | [cpp](./solutions/3501-4000/3790-smallest-all-ones-multiple.cpp) |
| 3791 | [Number of Balanced Integers in a Range](https://leetcode.com/problems/number-of-balanced-integers-in-a-range/) | Hard | [cpp](./solutions/3501-4000/3791-number-of-balanced-integers-in-a-range.cpp) |
| 3793 | [Find Users with High Token Usage](https://leetcode.com/problems/find-users-with-high-token-usage/) | Easy | [postgresql](./solutions/3501-4000/3793-find-users-with-high-token-usage.txt) |
| 3794 | [Reverse String Prefix](https://leetcode.com/problems/reverse-string-prefix/) | Easy | [python3](./solutions/3501-4000/3794-reverse-string-prefix.py) |
| 3795 | [Minimum Subarray Length With Distinct Sum At Least K](https://leetcode.com/problems/minimum-subarray-length-with-distinct-sum-at-least-k/) | Medium | [cpp](./solutions/3501-4000/3795-minimum-subarray-length-with-distinct-sum-at-least-k.cpp) |
| 3796 | [Find Maximum Value in a Constrained Sequence](https://leetcode.com/problems/find-maximum-value-in-a-constrained-sequence/) | Medium | [cpp](./solutions/3501-4000/3796-find-maximum-value-in-a-constrained-sequence.cpp) |
| 3798 | [Largest Even Number](https://leetcode.com/problems/largest-even-number/) | Easy | [cpp](./solutions/3501-4000/3798-largest-even-number.cpp) |
| 3799 | [Word Squares II](https://leetcode.com/problems/word-squares-ii/) | Medium | [cpp](./solutions/3501-4000/3799-word-squares-ii.cpp) |
| 3800 | [Minimum Cost to Make Two Binary Strings Equal](https://leetcode.com/problems/minimum-cost-to-make-two-binary-strings-equal/) | Medium | [cpp](./solutions/3501-4000/3800-minimum-cost-to-make-two-binary-strings-equal.cpp) |
| 3803 | [Count Residue Prefixes](https://leetcode.com/problems/count-residue-prefixes/) | Easy | [cpp](./solutions/3501-4000/3803-count-residue-prefixes.cpp) |
| 3804 | [Number of Centered Subarrays](https://leetcode.com/problems/number-of-centered-subarrays/) | Medium | [python3](./solutions/3501-4000/3804-number-of-centered-subarrays.py) |
| 3805 | [Count Caesar Cipher Pairs](https://leetcode.com/problems/count-caesar-cipher-pairs/) | Medium | [python3](./solutions/3501-4000/3805-count-caesar-cipher-pairs.py) |
| 3806 | [Maximum Bitwise AND After Increment Operations](https://leetcode.com/problems/maximum-bitwise-and-after-increment-operations/) | Hard | [cpp](./solutions/3501-4000/3806-maximum-bitwise-and-after-increment-operations.cpp) |
| 3809 | [Best Reachable Tower](https://leetcode.com/problems/best-reachable-tower/) | Medium | [cpp](./solutions/3501-4000/3809-best-reachable-tower.cpp) |
| 3810 | [Minimum Operations to Reach Target Array](https://leetcode.com/problems/minimum-operations-to-reach-target-array/) | Medium | [cpp](./solutions/3501-4000/3810-minimum-operations-to-reach-target-array.cpp) |
| 3811 | [Number of Alternating XOR Partitions](https://leetcode.com/problems/number-of-alternating-xor-partitions/) | Medium | [cpp](./solutions/3501-4000/3811-number-of-alternating-xor-partitions.cpp) |
| 3812 | [Minimum Edge Toggles on a Tree](https://leetcode.com/problems/minimum-edge-toggles-on-a-tree/) | Hard | [cpp](./solutions/3501-4000/3812-minimum-edge-toggles-on-a-tree.cpp) |
| 3813 | [Vowel-Consonant Score](https://leetcode.com/problems/vowel-consonant-score/) | Easy | [cpp](./solutions/3501-4000/3813-vowel-consonant-score.cpp) |
| 3814 | [Maximum Capacity Within Budget](https://leetcode.com/problems/maximum-capacity-within-budget/) | Medium | [cpp](./solutions/3501-4000/3814-maximum-capacity-within-budget.cpp) |
| 3815 | [Design Auction System](https://leetcode.com/problems/design-auction-system/) | Medium | [cpp](./solutions/3501-4000/3815-design-auction-system.cpp) |
| 3818 | [Minimum Prefix Removal to Make Array Strictly Increasing](https://leetcode.com/problems/minimum-prefix-removal-to-make-array-strictly-increasing/) | Medium | [cpp](./solutions/3501-4000/3818-minimum-prefix-removal-to-make-array-strictly-increasing.cpp) |
| 3819 | [Rotate Non Negative Elements](https://leetcode.com/problems/rotate-non-negative-elements/) | Medium | [cpp](./solutions/3501-4000/3819-rotate-non-negative-elements.cpp) |
| 3820 | [Pythagorean Distance Nodes in a Tree](https://leetcode.com/problems/pythagorean-distance-nodes-in-a-tree/) | Medium | [cpp](./solutions/3501-4000/3820-pythagorean-distance-nodes-in-a-tree.cpp) |
| 3821 | [Find Nth Smallest Integer With K One Bits](https://leetcode.com/problems/find-nth-smallest-integer-with-k-one-bits/) | Hard | [cpp](./solutions/3501-4000/3821-find-nth-smallest-integer-with-k-one-bits.cpp) |
| 3823 | [Reverse Letters Then Special Characters in a String](https://leetcode.com/problems/reverse-letters-then-special-characters-in-a-string/) | Easy | [cpp](./solutions/3501-4000/3823-reverse-letters-then-special-characters-in-a-string.cpp) |
| 3824 | [Minimum K to Reduce Array Within Limit](https://leetcode.com/problems/minimum-k-to-reduce-array-within-limit/) | Medium | [cpp](./solutions/3501-4000/3824-minimum-k-to-reduce-array-within-limit.cpp) |
| 3825 | [Longest Strictly Increasing Subsequence With Non-Zero Bitwise AND](https://leetcode.com/problems/longest-strictly-increasing-subsequence-with-non-zero-bitwise-and/) | Medium | [cpp](./solutions/3501-4000/3825-longest-strictly-increasing-subsequence-with-non-zero-bitwise-and.cpp) |
| 3826 | [Minimum Partition Score](https://leetcode.com/problems/minimum-partition-score/) | Hard | [cpp](./solutions/3501-4000/3826-minimum-partition-score.cpp) |
| 3827 | [Count Monobit Integers](https://leetcode.com/problems/count-monobit-integers/) | Easy | [cpp](./solutions/3501-4000/3827-count-monobit-integers.cpp) |
| 3828 | [Final Element After Subarray Deletions](https://leetcode.com/problems/final-element-after-subarray-deletions/) | Medium | [cpp](./solutions/3501-4000/3828-final-element-after-subarray-deletions.cpp) |
| 3829 | [Design Ride Sharing System](https://leetcode.com/problems/design-ride-sharing-system/) | Medium | [cpp](./solutions/3501-4000/3829-design-ride-sharing-system.cpp) |
| 3830 | [Longest Alternating Subarray After Removing At Most One Element](https://leetcode.com/problems/longest-alternating-subarray-after-removing-at-most-one-element/) | Hard | [cpp](./solutions/3501-4000/3830-longest-alternating-subarray-after-removing-at-most-one-element.cpp) |
| 3835 | [Count Subarrays With Cost Less Than or Equal to K](https://leetcode.com/problems/count-subarrays-with-cost-less-than-or-equal-to-k/) | Medium | [python3](./solutions/3501-4000/3835-count-subarrays-with-cost-less-than-or-equal-to-k.py) |
| 3842 | [Toggle Light Bulbs](https://leetcode.com/problems/toggle-light-bulbs/) | Easy | [cpp](./solutions/3501-4000/3842-toggle-light-bulbs.cpp) |
| 3843 | [First Element with Unique Frequency](https://leetcode.com/problems/first-element-with-unique-frequency/) | Medium | [cpp](./solutions/3501-4000/3843-first-element-with-unique-frequency.cpp) |
| 3844 | [Longest Almost-Palindromic Substring](https://leetcode.com/problems/longest-almost-palindromic-substring/) | Medium | [cpp](./solutions/3501-4000/3844-longest-almost-palindromic-substring.cpp) |
| 3845 | [Maximum Subarray XOR with Bounded Range](https://leetcode.com/problems/maximum-subarray-xor-with-bounded-range/) | Hard | [cpp](./solutions/3501-4000/3845-maximum-subarray-xor-with-bounded-range.cpp) |
| 3852 | [Smallest Pair With Different Frequencies](https://leetcode.com/problems/smallest-pair-with-different-frequencies/) | Easy | [cpp](./solutions/3501-4000/3852-smallest-pair-with-different-frequencies.cpp) |
| 3853 | [Merge Close Characters](https://leetcode.com/problems/merge-close-characters/) | Medium | [cpp](./solutions/3501-4000/3853-merge-close-characters.cpp) |
| 3854 | [Minimum Operations to Make Array Parity Alternating](https://leetcode.com/problems/minimum-operations-to-make-array-parity-alternating/) | Medium | [cpp](./solutions/3501-4000/3854-minimum-operations-to-make-array-parity-alternating.cpp) |
| 3856 | [Trim Trailing Vowels](https://leetcode.com/problems/trim-trailing-vowels/) | Easy | [cpp](./solutions/3501-4000/3856-trim-trailing-vowels.cpp) |
| 3857 | [Minimum Cost to Split into Ones](https://leetcode.com/problems/minimum-cost-to-split-into-ones/) | Medium | [cpp](./solutions/3501-4000/3857-minimum-cost-to-split-into-ones.cpp) |
| 3858 | [Minimum Bitwise OR From Grid](https://leetcode.com/problems/minimum-bitwise-or-from-grid/) | Medium | [cpp](./solutions/3501-4000/3858-minimum-bitwise-or-from-grid.cpp) |
| 3859 | [Count Subarrays With K Distinct Integers](https://leetcode.com/problems/count-subarrays-with-k-distinct-integers/) | Hard | [cpp](./solutions/3501-4000/3859-count-subarrays-with-k-distinct-integers.cpp) |
| 3861 | [Minimum Capacity Box](https://leetcode.com/problems/minimum-capacity-box/) | Easy | [cpp](./solutions/3501-4000/3861-minimum-capacity-box.cpp) |
| 3862 | [Find the Smallest Balanced Index](https://leetcode.com/problems/find-the-smallest-balanced-index/) | Medium | [cpp](./solutions/3501-4000/3862-find-the-smallest-balanced-index.cpp) |
| 3863 | [Minimum Operations to Sort a String](https://leetcode.com/problems/minimum-operations-to-sort-a-string/) | Medium | [cpp](./solutions/3501-4000/3863-minimum-operations-to-sort-a-string.cpp) |
| 3864 | [Minimum Cost to Partition a Binary String](https://leetcode.com/problems/minimum-cost-to-partition-a-binary-string/) | Hard | [cpp](./solutions/3501-4000/3864-minimum-cost-to-partition-a-binary-string.cpp) |
| 3866 | [First Unique Even Element](https://leetcode.com/problems/first-unique-even-element/) | Easy | [cpp](./solutions/3501-4000/3866-first-unique-even-element.cpp) |
| 3867 | [Sum of GCD of Formed Pairs](https://leetcode.com/problems/sum-of-gcd-of-formed-pairs/) | Medium | [cpp](./solutions/3501-4000/3867-sum-of-gcd-of-formed-pairs.cpp) |
| 3868 | [Minimum Cost to Equalize Arrays Using Swaps](https://leetcode.com/problems/minimum-cost-to-equalize-arrays-using-swaps/) | Medium | [cpp](./solutions/3501-4000/3868-minimum-cost-to-equalize-arrays-using-swaps.cpp) |
| 3869 | [Count Fancy Numbers in a Range](https://leetcode.com/problems/count-fancy-numbers-in-a-range/) | Hard | [cpp](./solutions/3501-4000/3869-count-fancy-numbers-in-a-range.cpp) |
| 3870 | [Count Commas in Range](https://leetcode.com/problems/count-commas-in-range/) | Easy | [cpp](./solutions/3501-4000/3870-count-commas-in-range.cpp) |
| 3875 | [Construct Uniform Parity Array I](https://leetcode.com/problems/construct-uniform-parity-array-i/) | Easy | [cpp](./solutions/3501-4000/3875-construct-uniform-parity-array-i.cpp) |
| 3876 | [Construct Uniform Parity Array II](https://leetcode.com/problems/construct-uniform-parity-array-ii/) | Medium | [cpp](./solutions/3501-4000/3876-construct-uniform-parity-array-ii.cpp) |
| 3877 | [Minimum Removals to Achieve Target XOR](https://leetcode.com/problems/minimum-removals-to-achieve-target-xor/) | Medium | [cpp](./solutions/3501-4000/3877-minimum-removals-to-achieve-target-xor.cpp) |
| 3878 | [Count Good Subarrays](https://leetcode.com/problems/count-good-subarrays/) | Hard | [cpp](./solutions/3501-4000/3878-count-good-subarrays.cpp) |
| 3880 | [Minimum Absolute Difference Between Two Values](https://leetcode.com/problems/minimum-absolute-difference-between-two-values/) | Easy | [cpp](./solutions/3501-4000/3880-minimum-absolute-difference-between-two-values.cpp) |
| 3881 | [Direction Assignments with Exactly K Visible People](https://leetcode.com/problems/direction-assignments-with-exactly-k-visible-people/) | Medium | [cpp](./solutions/3501-4000/3881-direction-assignments-with-exactly-k-visible-people.cpp) |
| 3882 | [Minimum XOR Path in a Grid](https://leetcode.com/problems/minimum-xor-path-in-a-grid/) | Medium | [cpp](./solutions/3501-4000/3882-minimum-xor-path-in-a-grid.cpp) |
| 3883 | [Count Non Decreasing Arrays With Given Digit Sums](https://leetcode.com/problems/count-non-decreasing-arrays-with-given-digit-sums/) | Hard | [cpp](./solutions/3501-4000/3883-count-non-decreasing-arrays-with-given-digit-sums.cpp) |
| 3884 | [First Matching Character From Both Ends](https://leetcode.com/problems/first-matching-character-from-both-ends/) | Easy | [cpp](./solutions/3501-4000/3884-first-matching-character-from-both-ends.cpp) |
| 3885 | [Design Event Manager](https://leetcode.com/problems/design-event-manager/) | Medium | [cpp](./solutions/3501-4000/3885-design-event-manager.cpp) |
| 3886 | [Sum of Sortable Integers](https://leetcode.com/problems/sum-of-sortable-integers/) | Hard | [cpp](./solutions/3501-4000/3886-sum-of-sortable-integers.cpp) |
| 3887 | [Incremental Even-Weighted Cycle Queries](https://leetcode.com/problems/incremental-even-weighted-cycle-queries/) | Hard | [cpp](./solutions/3501-4000/3887-incremental-even-weighted-cycle-queries.cpp) |
| 3889 | [Mirror Frequency Distance](https://leetcode.com/problems/mirror-frequency-distance/) | Medium | [cpp](./solutions/3501-4000/3889-mirror-frequency-distance.cpp) |
| 3890 | [Integers With Multiple Sum of Two Cubes](https://leetcode.com/problems/integers-with-multiple-sum-of-two-cubes/) | Medium | [cpp](./solutions/3501-4000/3890-integers-with-multiple-sum-of-two-cubes.cpp) |
| 3894 | [Traffic Signal Color](https://leetcode.com/problems/traffic-signal-color/) | Easy | [cpp](./solutions/3501-4000/3894-traffic-signal-color.cpp) |
| 3895 | [Count Digit Appearances](https://leetcode.com/problems/count-digit-appearances/) | Medium | [cpp](./solutions/3501-4000/3895-count-digit-appearances.cpp) |
| 3896 | [Minimum Operations to Transform Array into Alternating Prime](https://leetcode.com/problems/minimum-operations-to-transform-array-into-alternating-prime/) | Medium | [cpp](./solutions/3501-4000/3896-minimum-operations-to-transform-array-into-alternating-prime.cpp) |
| 3897 | [Maximum Value of Concatenated Binary Segments](https://leetcode.com/problems/maximum-value-of-concatenated-binary-segments/) | Hard | [cpp](./solutions/3501-4000/3897-maximum-value-of-concatenated-binary-segments.cpp) |
| 3898 | [Find the Degree of Each Vertex](https://leetcode.com/problems/find-the-degree-of-each-vertex/) | Easy | [cpp](./solutions/3501-4000/3898-find-the-degree-of-each-vertex.cpp) |
| 3899 | [Angles of a Triangle](https://leetcode.com/problems/angles-of-a-triangle/) | Medium | [cpp](./solutions/3501-4000/3899-angles-of-a-triangle.cpp) |
| 3903 | [Smallest Stable Index I](https://leetcode.com/problems/smallest-stable-index-i/) | Easy | [cpp](./solutions/3501-4000/3903-smallest-stable-index-i.cpp) |
| 3904 | [Smallest Stable Index II](https://leetcode.com/problems/smallest-stable-index-ii/) | Medium | [cpp](./solutions/3501-4000/3904-smallest-stable-index-ii.cpp) |
| 3905 | [Multi Source Flood Fill](https://leetcode.com/problems/multi-source-flood-fill/) | Medium | [cpp](./solutions/3501-4000/3905-multi-source-flood-fill.cpp) |
| 3908 | [Valid Digit Number](https://leetcode.com/problems/valid-digit-number/) | Easy | [cpp](./solutions/3501-4000/3908-valid-digit-number.cpp) |
| 3909 | [Compare Sums of Bitonic Parts](https://leetcode.com/problems/compare-sums-of-bitonic-parts/) | Medium | [cpp](./solutions/3501-4000/3909-compare-sums-of-bitonic-parts.cpp) |
| 3910 | [Count Connected Subgraphs with Even Node Sum](https://leetcode.com/problems/count-connected-subgraphs-with-even-node-sum/) | Hard | [cpp](./solutions/3501-4000/3910-count-connected-subgraphs-with-even-node-sum.cpp) |
| 3917 | [Count Indices With Opposite Parity](https://leetcode.com/problems/count-indices-with-opposite-parity/) | Easy | [cpp](./solutions/3501-4000/3917-count-indices-with-opposite-parity.cpp) |
| 3918 | [Sum of Primes Between Number and Its Reverse](https://leetcode.com/problems/sum-of-primes-between-number-and-its-reverse/) | Medium | [cpp](./solutions/3501-4000/3918-sum-of-primes-between-number-and-its-reverse.cpp) |
| 3919 | [Minimum Cost to Move Between Indices](https://leetcode.com/problems/minimum-cost-to-move-between-indices/) | Medium | [cpp](./solutions/3501-4000/3919-minimum-cost-to-move-between-indices.cpp) |
| 3921 | [Score Validator](https://leetcode.com/problems/score-validator/) | Easy | [cpp](./solutions/3501-4000/3921-score-validator.cpp) |
| 3925 | [Concatenate Array With Reverse](https://leetcode.com/problems/concatenate-array-with-reverse/) | Easy | [cpp](./solutions/3501-4000/3925-concatenate-array-with-reverse.cpp) |
| 3926 | [Count Valid Word Occurrences](https://leetcode.com/problems/count-valid-word-occurrences/) | Medium | [cpp](./solutions/3501-4000/3926-count-valid-word-occurrences.cpp) |
| 3927 | [Minimize Array Sum Using Divisible Replacements](https://leetcode.com/problems/minimize-array-sum-using-divisible-replacements/) | Medium | [cpp](./solutions/3501-4000/3927-minimize-array-sum-using-divisible-replacements.cpp) |
| 3931 | [Check Adjacent Digit Differences](https://leetcode.com/problems/check-adjacent-digit-differences/) | Easy | [cpp](./solutions/3501-4000/3931-check-adjacent-digit-differences.cpp) |
| 3932 | [Count K-th Roots in a Range](https://leetcode.com/problems/count-k-th-roots-in-a-range/) | Medium | [cpp](./solutions/3501-4000/3932-count-k-th-roots-in-a-range.cpp) |
| 3934 | [Smallest Unique Subarray](https://leetcode.com/problems/smallest-unique-subarray/) | Hard | [cpp](./solutions/3501-4000/3934-smallest-unique-subarray.cpp) |
| 3936 | [Minimum Swaps to Move Zeros to End](https://leetcode.com/problems/minimum-swaps-to-move-zeros-to-end/) | Easy | [cpp](./solutions/3501-4000/3936-minimum-swaps-to-move-zeros-to-end.cpp) |
| 3937 | [Minimum Operations to Make Array Modulo Alternating I](https://leetcode.com/problems/minimum-operations-to-make-array-modulo-alternating-i/) | Medium | [cpp](./solutions/3501-4000/3937-minimum-operations-to-make-array-modulo-alternating-i.cpp) |
| 3938 | [Maximum Path Intersection Sum in a Grid](https://leetcode.com/problems/maximum-path-intersection-sum-in-a-grid/) | Medium | [cpp](./solutions/3501-4000/3938-maximum-path-intersection-sum-in-a-grid.cpp) |
| 3939 | [Count Non Adjacent Subsets in a Rooted Tree](https://leetcode.com/problems/count-non-adjacent-subsets-in-a-rooted-tree/) | Hard | [cpp](./solutions/3501-4000/3939-count-non-adjacent-subsets-in-a-rooted-tree.cpp) |
| 3940 | [Limit Occurrences in Sorted Array](https://leetcode.com/problems/limit-occurrences-in-sorted-array/) | Easy | [cpp](./solutions/3501-4000/3940-limit-occurrences-in-sorted-array.cpp) |
| 3941 | [Password Strength](https://leetcode.com/problems/password-strength/) | Medium | [cpp](./solutions/3501-4000/3941-password-strength.cpp) |
| 3942 | [Minimum Operations to Sort a Permutation](https://leetcode.com/problems/minimum-operations-to-sort-a-permutation/) | Medium | [cpp](./solutions/3501-4000/3942-minimum-operations-to-sort-a-permutation.cpp) |
| 3945 | [Digit Frequency Score](https://leetcode.com/problems/digit-frequency-score/) | Easy | [cpp](./solutions/3501-4000/3945-digit-frequency-score.cpp) |
| 3946 | [Maximum Number of Items From Sale I](https://leetcode.com/problems/maximum-number-of-items-from-sale-i/) | Medium | [cpp](./solutions/3501-4000/3946-maximum-number-of-items-from-sale-i.cpp) |
| 3947 | [Maximum Number of Items From Sale II](https://leetcode.com/problems/maximum-number-of-items-from-sale-ii/) | Medium | [cpp](./solutions/3501-4000/3947-maximum-number-of-items-from-sale-ii.cpp) |
| 3950 | [Exactly One Consecutive Set Bits Pair](https://leetcode.com/problems/exactly-one-consecutive-set-bits-pair/) | Easy | [cpp](./solutions/3501-4000/3950-exactly-one-consecutive-set-bits-pair.cpp) |
| 3951 | [Minimum Energy to Maintain Brightness](https://leetcode.com/problems/minimum-energy-to-maintain-brightness/) | Medium | [cpp](./solutions/3501-4000/3951-minimum-energy-to-maintain-brightness.cpp) |
| 3952 | [Maximum Total Value of Covered Indices](https://leetcode.com/problems/maximum-total-value-of-covered-indices/) | Medium | [cpp](./solutions/3501-4000/3952-maximum-total-value-of-covered-indices.cpp) |
| 3959 | [Check Good Integer](https://leetcode.com/problems/check-good-integer/) | Easy | [cpp](./solutions/3501-4000/3959-check-good-integer.cpp) |
| 3960 | [Frequency Balance Subarray](https://leetcode.com/problems/frequency-balance-subarray/) | Medium | [cpp](./solutions/3501-4000/3960-frequency-balance-subarray.cpp) |
| 3961 | [Maximize Sum of Device Ratings](https://leetcode.com/problems/maximize-sum-of-device-ratings/) | Medium | [cpp](./solutions/3501-4000/3961-maximize-sum-of-device-ratings.cpp) |
| 3963 | [Create Grid With Exactly One Path](https://leetcode.com/problems/create-grid-with-exactly-one-path/) | Easy | [cpp](./solutions/3501-4000/3963-create-grid-with-exactly-one-path.cpp) |
| 3964 | [Minimum Lights to Illuminate a Road](https://leetcode.com/problems/minimum-lights-to-illuminate-a-road/) | Medium | [cpp](./solutions/3501-4000/3964-minimum-lights-to-illuminate-a-road.cpp) |
| 3965 | [Finish Time of Tasks I](https://leetcode.com/problems/finish-time-of-tasks-i/) | Medium | [cpp](./solutions/3501-4000/3965-finish-time-of-tasks-i.cpp) |
| 3966 | [Count Good Integers in a Range](https://leetcode.com/problems/count-good-integers-in-a-range/) | Hard | [cpp](./solutions/3501-4000/3966-count-good-integers-in-a-range.cpp) |
| 3968 | [Maximum Manhattan Distance After All Moves](https://leetcode.com/problems/maximum-manhattan-distance-after-all-moves/) | Medium | [cpp](./solutions/3501-4000/3968-maximum-manhattan-distance-after-all-moves.cpp) |
| 3969 | [Valid Subarrays With Matching Sum Digits I](https://leetcode.com/problems/valid-subarrays-with-matching-sum-digits-i/) | Medium | [cpp](./solutions/3501-4000/3969-valid-subarrays-with-matching-sum-digits-i.cpp) |
| 3970 | [Shortest Path With At Most K Consecutive Identical Characters](https://leetcode.com/problems/shortest-path-with-at-most-k-consecutive-identical-characters/) | Medium | [cpp](./solutions/3501-4000/3970-shortest-path-with-at-most-k-consecutive-identical-characters.cpp) |
| 3974 | [Maximum Total Sum of K Selected Elements](https://leetcode.com/problems/maximum-total-sum-of-k-selected-elements/) | Medium | [cpp](./solutions/3501-4000/3974-maximum-total-sum-of-k-selected-elements.cpp) |
| 3975 | [Filter Occupied Intervals](https://leetcode.com/problems/filter-occupied-intervals/) | Medium | [cpp](./solutions/3501-4000/3975-filter-occupied-intervals.cpp) |
| 3978 | [Unique Middle Element](https://leetcode.com/problems/unique-middle-element/) | Easy | [cpp](./solutions/3501-4000/3978-unique-middle-element.cpp) |
| 3979 | [Maximum Valid Pair Sum](https://leetcode.com/problems/maximum-valid-pair-sum/) | Medium | [cpp](./solutions/3501-4000/3979-maximum-valid-pair-sum.cpp) |
| 3980 | [Minimum Operations to Transform Binary String](https://leetcode.com/problems/minimum-operations-to-transform-binary-string/) | Medium | [cpp](./solutions/3501-4000/3980-minimum-operations-to-transform-binary-string.cpp) |
| 3981 | [Count Distinct Ways to Form Target from Two Strings](https://leetcode.com/problems/count-distinct-ways-to-form-target-from-two-strings/) | Hard | [cpp](./solutions/3501-4000/3981-count-distinct-ways-to-form-target-from-two-strings.cpp) |
| 3982 | [Sum of Integers with Maximum Digit Range](https://leetcode.com/problems/sum-of-integers-with-maximum-digit-range/) | Easy | [cpp](./solutions/3501-4000/3982-sum-of-integers-with-maximum-digit-range.cpp) |
| 3986 | [Number of Elapsed Seconds Between Two Times](https://leetcode.com/problems/number-of-elapsed-seconds-between-two-times/) | Easy | [cpp](./solutions/3501-4000/3986-number-of-elapsed-seconds-between-two-times.cpp) |
| 3987 | [Minimum Total Cost to Process All Elements](https://leetcode.com/problems/minimum-total-cost-to-process-all-elements/) | Medium | [cpp](./solutions/3501-4000/3987-minimum-total-cost-to-process-all-elements.cpp) |
| 3996 | [Even Number of Knight Moves](https://leetcode.com/problems/even-number-of-knight-moves/) | Easy | [cpp](./solutions/3501-4000/3996-even-number-of-knight-moves.cpp) |
| 3997 | [Count Dominant Nodes in a Binary Tree](https://leetcode.com/problems/count-dominant-nodes-in-a-binary-tree/) | Medium | [cpp](./solutions/3501-4000/3997-count-dominant-nodes-in-a-binary-tree.cpp) |
| 3998 | [Transform Binary String Using Subsequence Sort](https://leetcode.com/problems/transform-binary-string-using-subsequence-sort/) | Medium | [cpp](./solutions/3501-4000/3998-transform-binary-string-using-subsequence-sort.cpp) |
| 3999 | [Minimum Number of String Groups Through Transformations](https://leetcode.com/problems/minimum-number-of-string-groups-through-transformations/) | Hard | [cpp](./solutions/3501-4000/3999-minimum-number-of-string-groups-through-transformations.cpp) |
| 4000 | [Largest Integer With Given Digit Sum](https://leetcode.com/problems/largest-integer-with-given-digit-sum/) | Easy | [cpp](./solutions/3501-4000/4000-largest-integer-with-given-digit-sum.cpp) |
| 4001 | [Aggregate Two Time Series](https://leetcode.com/problems/aggregate-two-time-series/) | Medium | [cpp](./solutions/4001-4500/4001-aggregate-two-time-series.cpp) |
| 4002 | [Count Valid Sequences](https://leetcode.com/problems/count-valid-sequences/) | Medium | [cpp](./solutions/4001-4500/4002-count-valid-sequences.cpp) |
| 4003 | [Minimum Cost Path with Alternating Directions III](https://leetcode.com/problems/minimum-cost-path-with-alternating-directions-iii/) | Hard | [cpp](./solutions/4001-4500/4003-minimum-cost-path-with-alternating-directions-iii.cpp) |
| 4006 | [Count Valid Prefixes](https://leetcode.com/problems/count-valid-prefixes/) | Easy | [cpp](./solutions/4001-4500/4006-count-valid-prefixes.cpp) |
| 4007 | [Widest Possible Fence](https://leetcode.com/problems/widest-possible-fence/) | Hard | [cpp](./solutions/4001-4500/4007-widest-possible-fence.cpp) |
| 4008 | [Minimum Initial Strength to Defeat All Monsters](https://leetcode.com/problems/minimum-initial-strength-to-defeat-all-monsters/) | Medium | [cpp](./solutions/4001-4500/4008-minimum-initial-strength-to-defeat-all-monsters.cpp) |
| 4010 | [Maximize Pair Strength Using GCD](https://leetcode.com/problems/maximize-pair-strength-using-gcd/) | Easy | [cpp](./solutions/4001-4500/4010-maximize-pair-strength-using-gcd.cpp) |
| 4011 | [Count Subarrays With Even Odd Ratio I](https://leetcode.com/problems/count-subarrays-with-even-odd-ratio-i/) | Medium | [cpp](./solutions/4001-4500/4011-count-subarrays-with-even-odd-ratio-i.cpp) |
| 4012 | [Count of Unfinished Tasks After Each Shift](https://leetcode.com/problems/count-of-unfinished-tasks-after-each-shift/) | Medium | [cpp](./solutions/4001-4500/4012-count-of-unfinished-tasks-after-each-shift.cpp) |
| 4014 | [Minimum Total Price After Applying Discounts](https://leetcode.com/problems/minimum-total-price-after-applying-discounts/) | Medium | [cpp](./solutions/4001-4500/4014-minimum-total-price-after-applying-discounts.cpp) |
| 4015 | [Weighted Sum of a Tree](https://leetcode.com/problems/weighted-sum-of-a-tree/) | Medium | [cpp](./solutions/4001-4500/4015-weighted-sum-of-a-tree.cpp) |
| 4016 | [Maximum Area of Two Non-Overlapping Square Submatrices](https://leetcode.com/problems/maximum-area-of-two-non-overlapping-square-submatrices/) | Medium | [cpp](./solutions/4001-4500/4016-maximum-area-of-two-non-overlapping-square-submatrices.cpp) |
| 4020 | [Elevator Requests I](https://leetcode.com/problems/elevator-requests-i/) | Easy | [cpp](./solutions/4001-4500/4020-elevator-requests-i.cpp) |
| 4021 | [Minimum Operations to Make a Rotated Palindrome I](https://leetcode.com/problems/minimum-operations-to-make-a-rotated-palindrome-i/) | Medium | [cpp](./solutions/4001-4500/4021-minimum-operations-to-make-a-rotated-palindrome-i.cpp) |
| 4022 | [K-th Digit in Infinite String](https://leetcode.com/problems/k-th-digit-in-infinite-string/) | Medium | [cpp](./solutions/4001-4500/4022-k-th-digit-in-infinite-string.cpp) |
| 4023 | [Elevator Requests II](https://leetcode.com/problems/elevator-requests-ii/) | Hard | [cpp](./solutions/4001-4500/4023-elevator-requests-ii.cpp) |
| 4024 | [Nearest Available Drone](https://leetcode.com/problems/nearest-available-drone/) | Easy | [cpp](./solutions/4001-4500/4024-nearest-available-drone.cpp) |
| 4025 | [Minimize the Maximum Waiting Time at Synchronized Traffic Lights](https://leetcode.com/problems/minimize-the-maximum-waiting-time-at-synchronized-traffic-lights/) | Medium | [cpp](./solutions/4001-4500/4025-minimize-the-maximum-waiting-time-at-synchronized-traffic-lights.cpp) |
| 4026 | [Maximum Gap Between Stations](https://leetcode.com/problems/maximum-gap-between-stations/) | Medium | [cpp](./solutions/4001-4500/4026-maximum-gap-between-stations.cpp) |
| 4030 | [Check ASCII Palindromic](https://leetcode.com/problems/check-ascii-palindromic/) | Easy | [cpp](./solutions/4001-4500/4030-check-ascii-palindromic.cpp) |
| 4031 | [Find All Numbers Disappeared in an Array II](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array-ii/) | Medium | [cpp](./solutions/4001-4500/4031-find-all-numbers-disappeared-in-an-array-ii.cpp) |
| 4032 | [Longest Subarray With at Most K Distinct Prime Factors](https://leetcode.com/problems/longest-subarray-with-at-most-k-distinct-prime-factors/) | Medium | [cpp](./solutions/4001-4500/4032-longest-subarray-with-at-most-k-distinct-prime-factors.cpp) |
| 4038 | [Count Integers Appearing in a Single Block](https://leetcode.com/problems/count-integers-appearing-in-a-single-block/) | Easy | [cpp](./solutions/4001-4500/4038-count-integers-appearing-in-a-single-block.cpp) |
| 4039 | [Sum of Decoded Numbers](https://leetcode.com/problems/sum-of-decoded-numbers/) | Medium | [cpp](./solutions/4001-4500/4039-sum-of-decoded-numbers.cpp) |
| 4040 | [Minimum Operations to Form Subset Sum I](https://leetcode.com/problems/minimum-operations-to-form-subset-sum-i/) | Medium | [cpp](./solutions/4001-4500/4040-minimum-operations-to-form-subset-sum-i.cpp) |
| 4041 | [Minimum Operations to Form Subset Sum II](https://leetcode.com/problems/minimum-operations-to-form-subset-sum-ii/) | Hard | [cpp](./solutions/4001-4500/4041-minimum-operations-to-form-subset-sum-ii.cpp) |
| 4043 | [Count Rotations With Exactly K Equal Adjacent Pairs](https://leetcode.com/problems/count-rotations-with-exactly-k-equal-adjacent-pairs/) | Easy | [cpp](./solutions/4001-4500/4043-count-rotations-with-exactly-k-equal-adjacent-pairs.cpp) |
| 4044 | [Count Good Cyclic Rotations](https://leetcode.com/problems/count-good-cyclic-rotations/) | Medium | [cpp](./solutions/4001-4500/4044-count-good-cyclic-rotations.cpp) |
| 4045 | [Count Robot Groups](https://leetcode.com/problems/count-robot-groups/) | Medium | [cpp](./solutions/4001-4500/4045-count-robot-groups.cpp) |
| 4046 | [Minimum Cost Path With At Most K Turns](https://leetcode.com/problems/minimum-cost-path-with-at-most-k-turns/) | Hard | [cpp](./solutions/4001-4500/4046-minimum-cost-path-with-at-most-k-turns.cpp) |
| 4048 | [Count Values With Equally Spaced Occurrences I](https://leetcode.com/problems/count-values-with-equally-spaced-occurrences-i/) | Easy | [cpp](./solutions/4001-4500/4048-count-values-with-equally-spaced-occurrences-i.cpp) |
| 4049 | [Count Values With Equally Spaced Occurrences II](https://leetcode.com/problems/count-values-with-equally-spaced-occurrences-ii/) | Medium | [cpp](./solutions/4001-4500/4049-count-values-with-equally-spaced-occurrences-ii.cpp) |
| 4050 | [Minimum Days to Score Exactly N Points](https://leetcode.com/problems/minimum-days-to-score-exactly-n-points/) | Medium | [cpp](./solutions/4001-4500/4050-minimum-days-to-score-exactly-n-points.cpp) |