Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/jiangshanmeta/meta
leetcode JS/TS/Java实现
https://github.com/jiangshanmeta/meta
algorithm leetcode
Last synced: about 17 hours ago
JSON representation
leetcode JS/TS/Java实现
- Host: GitHub
- URL: https://github.com/jiangshanmeta/meta
- Owner: jiangshanmeta
- License: mit
- Created: 2017-12-28T00:47:17.000Z (about 7 years ago)
- Default Branch: master
- Last Pushed: 2025-01-14T14:20:24.000Z (8 days ago)
- Last Synced: 2025-01-14T15:42:31.821Z (8 days ago)
- Topics: algorithm, leetcode
- Language: JavaScript
- Homepage:
- Size: 7.81 MB
- Stars: 265
- Watchers: 9
- Forks: 42
- Open Issues: 23
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# leetcode 题解
## 相关链接
[LeetCode个人主页](https://leetcode.cn/u/jiangshanmeta/)
[leetcode题解](https://github.com/jiangshanmeta/meta)
[lintcode题解](https://github.com/jiangshanmeta/lintcode)
[scriptoj题解](https://github.com/jiangshanmeta/scriptoj)
[剑指offer题解](https://github.com/jiangshanmeta/coding-interviews)
[LeetCode笔记本](https://github.com/jiangshanmeta/leetcode-notebook)
## 目录
* TS/JS Answer 2243
* Java Answer 460
| index | title | code | Difficulty |
| :--: | :-------------------: | :---: | :--: |
| 0001 | Two Sum | [Go](./src/0001.two-sum.1/solution.go) [Java](./src/0001.two-sum.1/solution.java) [JavaScript](./src/0001.two-sum.1/solution.js) [TypeScript](./src/0001.two-sum.1/solution.ts) | Easy |
| 0002 | Add Two Numbers | [JavaScript](./src/0002.add-two-numbers.2/solution.js) [TypeScript](./src/0002.add-two-numbers.2/solution.ts) | Medium |
| 0003 | Longest Substring Without Repeating Characters | [JavaScript](./src/0003.longest-substring-without-repeating-characters.3/solution.js) [TypeScript](./src/0003.longest-substring-without-repeating-characters.3/solution.ts) | Medium |
| 0004 | Median of Two Sorted Arrays | [JavaScript](./src/0004.median-of-two-sorted-arrays.4/solution.js) | Hard |
| 0005 | Longest Palindromic Substring | [JavaScript](./src/0005.longest-palindromic-substring.5/solution.js) [TypeScript](./src/0005.longest-palindromic-substring.5/solution.ts) | Medium |
| 0006 | Zigzag Conversion | [JavaScript](./src/0006.zigzag-conversion.6/solution.js) | Medium |
| 0007 | Reverse Integer | [JavaScript](./src/0007.reverse-integer.7/solution.js) | Medium |
| 0008 | String to Integer (atoi) | [JavaScript](./src/0008.string-to-integer-atoi.8/solution.js) | Medium |
| 0009 | Palindrome Number | [Java](./src/0009.palindrome-number.9/solution.java) [JavaScript](./src/0009.palindrome-number.9/solution.js) [TypeScript](./src/0009.palindrome-number.9/solution.ts) | Easy |
| 0010 | Regular Expression Matching | [JavaScript](./src/0010.regular-expression-matching.10/solution.js) [TypeScript](./src/0010.regular-expression-matching.10/solution.ts) | Hard |
| 0011 | Container With Most Water | [JavaScript](./src/0011.container-with-most-water.11/solution.js) | Medium |
| 0012 | Integer to Roman | [JavaScript](./src/0012.integer-to-roman.12/solution.js) [TypeScript](./src/0012.integer-to-roman.12/solution.ts) | Medium |
| 0013 | Roman to Integer | [JavaScript](./src/0013.roman-to-integer.13/solution.js) [TypeScript](./src/0013.roman-to-integer.13/solution.ts) | Easy |
| 0014 | Longest Common Prefix | [Java](./src/0014.longest-common-prefix.14/solution.java) [JavaScript](./src/0014.longest-common-prefix.14/solution.js) [TypeScript](./src/0014.longest-common-prefix.14/solution.ts) | Easy |
| 0015 | 3Sum | [JavaScript](./src/0015.3sum.15/solution.js) | Medium |
| 0016 | 3Sum Closest | [JavaScript](./src/0016.3sum-closest.16/solution.js) | Medium |
| 0017 | Letter Combinations of a Phone Number | [Java](./src/0017.letter-combinations-of-a-phone-number.17/solution.java) [JavaScript](./src/0017.letter-combinations-of-a-phone-number.17/solution.js) [TypeScript](./src/0017.letter-combinations-of-a-phone-number.17/solution.ts) | Medium |
| 0018 | 4Sum | [JavaScript](./src/0018.4sum.18/solution.js) | Medium |
| 0019 | Remove Nth Node From End of List | [Java](./src/0019.remove-nth-node-from-end-of-list.19/solution.java) [JavaScript](./src/0019.remove-nth-node-from-end-of-list.19/solution.js) [TypeScript](./src/0019.remove-nth-node-from-end-of-list.19/solution.ts) | Medium |
| 0020 | Valid Parentheses | [Java](./src/0020.valid-parentheses.20/solution.java) [JavaScript](./src/0020.valid-parentheses.20/solution.js) [TypeScript](./src/0020.valid-parentheses.20/solution.ts) | Easy |
| 0021 | Merge Two Sorted Lists | [Go](./src/0021.merge-two-sorted-lists.21/solution.go) [Java](./src/0021.merge-two-sorted-lists.21/solution.java) [JavaScript](./src/0021.merge-two-sorted-lists.21/solution.js) [TypeScript](./src/0021.merge-two-sorted-lists.21/solution.ts) | Easy |
| 0022 | Generate Parentheses | [Java](./src/0022.generate-parentheses.22/solution.java) [JavaScript](./src/0022.generate-parentheses.22/solution.js) [TypeScript](./src/0022.generate-parentheses.22/solution.ts) | Medium |
| 0023 | Merge k Sorted Lists | [JavaScript](./src/0023.merge-k-sorted-lists.23/solution.js) [TypeScript](./src/0023.merge-k-sorted-lists.23/solution.ts) | Hard |
| 0024 | Swap Nodes in Pairs | [Java](./src/0024.swap-nodes-in-pairs.24/solution.java) [JavaScript](./src/0024.swap-nodes-in-pairs.24/solution.js) [TypeScript](./src/0024.swap-nodes-in-pairs.24/solution.ts) | Medium |
| 0025 | Reverse Nodes in k-Group | [JavaScript](./src/0025.reverse-nodes-in-k-group.25/solution.js) [TypeScript](./src/0025.reverse-nodes-in-k-group.25/solution.ts) | Hard |
| 0026 | Remove Duplicates from Sorted Array | [Java](./src/0026.remove-duplicates-from-sorted-array.26/solution.java) [JavaScript](./src/0026.remove-duplicates-from-sorted-array.26/solution.js) [TypeScript](./src/0026.remove-duplicates-from-sorted-array.26/solution.ts) | Easy |
| 0027 | Remove Element | [Java](./src/0027.remove-element.27/solution.java) [JavaScript](./src/0027.remove-element.27/solution.js) [TypeScript](./src/0027.remove-element.27/solution.ts) | Easy |
| 0028 | Find the Index of the First Occurrence in a String | [Java](./src/0028.find-the-index-of-the-first-occurrence-in-a-string.28/solution.java) [JavaScript](./src/0028.find-the-index-of-the-first-occurrence-in-a-string.28/solution.js) | Easy |
| 0029 | Divide Two Integers | [JavaScript](./src/0029.divide-two-integers.29/solution.js) | Medium |
| 0030 | Substring with Concatenation of All Words | | Hard |
| 0031 | Next Permutation | [JavaScript](./src/0031.next-permutation.31/solution.js) | Medium |
| 0032 | Longest Valid Parentheses | [JavaScript](./src/0032.longest-valid-parentheses.32/solution.js) [TypeScript](./src/0032.longest-valid-parentheses.32/solution.ts) | Hard |
| 0033 | Search in Rotated Sorted Array | [JavaScript](./src/0033.search-in-rotated-sorted-array.33/solution.js) | Medium |
| 0034 | Find First and Last Position of Element in Sorted Array | [JavaScript](./src/0034.find-first-and-last-position-of-element-in-sorted-array.34/solution.js) [TypeScript](./src/0034.find-first-and-last-position-of-element-in-sorted-array.34/solution.ts) | Medium |
| 0035 | Search Insert Position | [Java](./src/0035.search-insert-position.35/solution.java) [JavaScript](./src/0035.search-insert-position.35/solution.js) [TypeScript](./src/0035.search-insert-position.35/solution.ts) | Easy |
| 0036 | Valid Sudoku | [JavaScript](./src/0036.valid-sudoku.36/solution.js) | Medium |
| 0037 | Sudoku Solver | | Hard |
| 0038 | Count and Say | [JavaScript](./src/0038.count-and-say.38/solution.js) [TypeScript](./src/0038.count-and-say.38/solution.ts) | Medium |
| 0039 | Combination Sum | [JavaScript](./src/0039.combination-sum.39/solution.js) [TypeScript](./src/0039.combination-sum.39/solution.ts) | Medium |
| 0040 | Combination Sum II | [JavaScript](./src/0040.combination-sum-ii.40/solution.js) [TypeScript](./src/0040.combination-sum-ii.40/solution.ts) | Medium |
| 0041 | First Missing Positive | [JavaScript](./src/0041.first-missing-positive.41/solution.js) [TypeScript](./src/0041.first-missing-positive.41/solution.ts) | Hard |
| 0042 | Trapping Rain Water | [JavaScript](./src/0042.trapping-rain-water.42/solution.js) | Hard |
| 0043 | Multiply Strings | [JavaScript](./src/0043.multiply-strings.43/solution.js) | Medium |
| 0044 | Wildcard Matching | [JavaScript](./src/0044.wildcard-matching.44/solution.js) | Hard |
| 0045 | Jump Game II | [JavaScript](./src/0045.jump-game-ii.45/solution.js) [TypeScript](./src/0045.jump-game-ii.45/solution.ts) | Medium |
| 0046 | Permutations | [Java](./src/0046.permutations.46/solution.java) [JavaScript](./src/0046.permutations.46/solution.js) [TypeScript](./src/0046.permutations.46/solution.ts) | Medium |
| 0047 | Permutations II | [Java](./src/0047.permutations-ii.47/solution.java) [JavaScript](./src/0047.permutations-ii.47/solution.js) [TypeScript](./src/0047.permutations-ii.47/solution.ts) | Medium |
| 0048 | Rotate Image | [JavaScript](./src/0048.rotate-image.48/solution.js) [TypeScript](./src/0048.rotate-image.48/solution.ts) | Medium |
| 0049 | Group Anagrams | [JavaScript](./src/0049.group-anagrams.49/solution.js) [TypeScript](./src/0049.group-anagrams.49/solution.ts) | Medium |
| 0050 | Pow(x, n) | [Java](./src/0050.powx-n.50/solution.java) [JavaScript](./src/0050.powx-n.50/solution.js) [TypeScript](./src/0050.powx-n.50/solution.ts) | Medium |
| 0051 | N-Queens | | Hard |
| 0052 | N-Queens II | | Hard |
| 0053 | Maximum Subarray | [Java](./src/0053.maximum-subarray.53/solution.java) [JavaScript](./src/0053.maximum-subarray.53/solution.js) [TypeScript](./src/0053.maximum-subarray.53/solution.ts) | Medium |
| 0054 | Spiral Matrix | [JavaScript](./src/0054.spiral-matrix.54/solution.js) [TypeScript](./src/0054.spiral-matrix.54/solution.ts) | Medium |
| 0055 | Jump Game | [Java](./src/0055.jump-game.55/solution.java) [JavaScript](./src/0055.jump-game.55/solution.js) [TypeScript](./src/0055.jump-game.55/solution.ts) | Medium |
| 0056 | Merge Intervals | [JavaScript](./src/0056.merge-intervals.56/solution.js) | Medium |
| 0057 | Insert Interval | [JavaScript](./src/0057.insert-interval.57/solution.js) | Medium |
| 0058 | Length of Last Word | [Java](./src/0058.length-of-last-word.58/solution.java) [JavaScript](./src/0058.length-of-last-word.58/solution.js) [TypeScript](./src/0058.length-of-last-word.58/solution.ts) | Easy |
| 0059 | Spiral Matrix II | [JavaScript](./src/0059.spiral-matrix-ii.59/solution.js) [TypeScript](./src/0059.spiral-matrix-ii.59/solution.ts) | Medium |
| 0060 | Permutation Sequence | [JavaScript](./src/0060.permutation-sequence.60/solution.js) | Hard |
| 0061 | Rotate List | [Java](./src/0061.rotate-list.61/solution.java) [JavaScript](./src/0061.rotate-list.61/solution.js) [TypeScript](./src/0061.rotate-list.61/solution.ts) | Medium |
| 0062 | Unique Paths | [Java](./src/0062.unique-paths.62/solution.java) [JavaScript](./src/0062.unique-paths.62/solution.js) [TypeScript](./src/0062.unique-paths.62/solution.ts) | Medium |
| 0063 | Unique Paths II | [Java](./src/0063.unique-paths-ii.63/solution.java) [JavaScript](./src/0063.unique-paths-ii.63/solution.js) [TypeScript](./src/0063.unique-paths-ii.63/solution.ts) | Medium |
| 0064 | Minimum Path Sum | [JavaScript](./src/0064.minimum-path-sum.64/solution.js) [TypeScript](./src/0064.minimum-path-sum.64/solution.ts) | Medium |
| 0065 | Valid Number | [JavaScript](./src/0065.valid-number.65/solution.js) | Hard |
| 0066 | Plus One | [Java](./src/0066.plus-one.66/solution.java) [JavaScript](./src/0066.plus-one.66/solution.js) [TypeScript](./src/0066.plus-one.66/solution.ts) | Easy |
| 0067 | Add Binary | [Java](./src/0067.add-binary.67/solution.java) [JavaScript](./src/0067.add-binary.67/solution.js) [TypeScript](./src/0067.add-binary.67/solution.ts) | Easy |
| 0068 | Text Justification | | Hard |
| 0069 | Sqrt(x) | [Java](./src/0069.sqrtx.69/solution.java) [JavaScript](./src/0069.sqrtx.69/solution.js) [TypeScript](./src/0069.sqrtx.69/solution.ts) | Easy |
| 0070 | Climbing Stairs | [Java](./src/0070.climbing-stairs.70/solution.java) [JavaScript](./src/0070.climbing-stairs.70/solution.js) [TypeScript](./src/0070.climbing-stairs.70/solution.ts) | Easy |
| 0071 | Simplify Path | [JavaScript](./src/0071.simplify-path.71/solution.js) | Medium |
| 0072 | Edit Distance | [JavaScript](./src/0072.edit-distance.72/solution.js) [TypeScript](./src/0072.edit-distance.72/solution.ts) | Medium |
| 0073 | Set Matrix Zeroes | [JavaScript](./src/0073.set-matrix-zeroes.73/solution.js) [TypeScript](./src/0073.set-matrix-zeroes.73/solution.ts) | Medium |
| 0074 | Search a 2D Matrix | [JavaScript](./src/0074.search-a-2d-matrix.74/solution.js) [TypeScript](./src/0074.search-a-2d-matrix.74/solution.ts) | Medium |
| 0075 | Sort Colors | [JavaScript](./src/0075.sort-colors.75/solution.js) [TypeScript](./src/0075.sort-colors.75/solution.ts) | Medium |
| 0076 | Minimum Window Substring | [JavaScript](./src/0076.minimum-window-substring.76/solution.js) | Hard |
| 0077 | Combinations | [Java](./src/0077.combinations.77/solution.java) [JavaScript](./src/0077.combinations.77/solution.js) [TypeScript](./src/0077.combinations.77/solution.ts) | Medium |
| 0078 | Subsets | [Java](./src/0078.subsets.78/solution.java) [JavaScript](./src/0078.subsets.78/solution.js) [TypeScript](./src/0078.subsets.78/solution.ts) | Medium |
| 0079 | Word Search | [JavaScript](./src/0079.word-search.79/solution.js) [TypeScript](./src/0079.word-search.79/solution.ts) | Medium |
| 0080 | Remove Duplicates from Sorted Array II | [Java](./src/0080.remove-duplicates-from-sorted-array-ii.80/solution.java) [JavaScript](./src/0080.remove-duplicates-from-sorted-array-ii.80/solution.js) [TypeScript](./src/0080.remove-duplicates-from-sorted-array-ii.80/solution.ts) | Medium |
| 0081 | Search in Rotated Sorted Array II | [JavaScript](./src/0081.search-in-rotated-sorted-array-ii.81/solution.js) | Medium |
| 0082 | Remove Duplicates from Sorted List II | [JavaScript](./src/0082.remove-duplicates-from-sorted-list-ii.82/solution.js) [TypeScript](./src/0082.remove-duplicates-from-sorted-list-ii.82/solution.ts) | Medium |
| 0083 | Remove Duplicates from Sorted List | [Go](./src/0083.remove-duplicates-from-sorted-list.83/solution.go) [Java](./src/0083.remove-duplicates-from-sorted-list.83/solution.java) [JavaScript](./src/0083.remove-duplicates-from-sorted-list.83/solution.js) [TypeScript](./src/0083.remove-duplicates-from-sorted-list.83/solution.ts) | Easy |
| 0084 | Largest Rectangle in Histogram | [TypeScript](./src/0084.largest-rectangle-in-histogram.84/solution.ts) | Hard |
| 0085 | Maximal Rectangle | [TypeScript](./src/0085.maximal-rectangle.85/solution.ts) | Hard |
| 0086 | Partition List | [Java](./src/0086.partition-list.86/solution.java) [JavaScript](./src/0086.partition-list.86/solution.js) [TypeScript](./src/0086.partition-list.86/solution.ts) | Medium |
| 0087 | Scramble String | | Hard |
| 0088 | Merge Sorted Array | [Go](./src/0088.merge-sorted-array.88/solution.go) [Java](./src/0088.merge-sorted-array.88/solution.java) [JavaScript](./src/0088.merge-sorted-array.88/solution.js) [TypeScript](./src/0088.merge-sorted-array.88/solution.ts) | Easy |
| 0089 | Gray Code | [JavaScript](./src/0089.gray-code.89/solution.js) | Medium |
| 0090 | Subsets II | [JavaScript](./src/0090.subsets-ii.90/solution.js) [TypeScript](./src/0090.subsets-ii.90/solution.ts) | Medium |
| 0091 | Decode Ways | [JavaScript](./src/0091.decode-ways.91/solution.js) [TypeScript](./src/0091.decode-ways.91/solution.ts) | Medium |
| 0092 | Reverse Linked List II | [JavaScript](./src/0092.reverse-linked-list-ii.92/solution.js) [TypeScript](./src/0092.reverse-linked-list-ii.92/solution.ts) | Medium |
| 0093 | Restore IP Addresses | [JavaScript](./src/0093.restore-ip-addresses.93/solution.js) | Medium |
| 0094 | Binary Tree Inorder Traversal | [Go](./src/0094.binary-tree-inorder-traversal.94/solution.go) [Java](./src/0094.binary-tree-inorder-traversal.94/solution.java) [JavaScript](./src/0094.binary-tree-inorder-traversal.94/solution.js) [TypeScript](./src/0094.binary-tree-inorder-traversal.94/solution.ts) | Easy |
| 0095 | Unique Binary Search Trees II | [JavaScript](./src/0095.unique-binary-search-trees-ii.95/solution.js) [TypeScript](./src/0095.unique-binary-search-trees-ii.95/solution.ts) | Medium |
| 0096 | Unique Binary Search Trees | [JavaScript](./src/0096.unique-binary-search-trees.96/solution.js) [TypeScript](./src/0096.unique-binary-search-trees.96/solution.ts) | Medium |
| 0097 | Interleaving String | [JavaScript](./src/0097.interleaving-string.97/solution.js) | Medium |
| 0098 | Validate Binary Search Tree | [JavaScript](./src/0098.validate-binary-search-tree.98/solution.js) [TypeScript](./src/0098.validate-binary-search-tree.98/solution.ts) | Medium |
| 0099 | Recover Binary Search Tree | [JavaScript](./src/0099.recover-binary-search-tree.99/solution.js) [TypeScript](./src/0099.recover-binary-search-tree.99/solution.ts) | Medium |
| 0100 | Same Tree | [Go](./src/0100.same-tree.100/solution.go) [Java](./src/0100.same-tree.100/solution.java) [JavaScript](./src/0100.same-tree.100/solution.js) [TypeScript](./src/0100.same-tree.100/solution.ts) | Easy |
| 0101 | Symmetric Tree | [Go](./src/0101.symmetric-tree.101/solution.go) [Java](./src/0101.symmetric-tree.101/solution.java) [JavaScript](./src/0101.symmetric-tree.101/solution.js) [TypeScript](./src/0101.symmetric-tree.101/solution.ts) | Easy |
| 0102 | Binary Tree Level Order Traversal | [Go](./src/0102.binary-tree-level-order-traversal.102/solution.go) [Java](./src/0102.binary-tree-level-order-traversal.102/solution.java) [JavaScript](./src/0102.binary-tree-level-order-traversal.102/solution.js) [TypeScript](./src/0102.binary-tree-level-order-traversal.102/solution.ts) | Medium |
| 0103 | Binary Tree Zigzag Level Order Traversal | [Java](./src/0103.binary-tree-zigzag-level-order-traversal.103/solution.java) [JavaScript](./src/0103.binary-tree-zigzag-level-order-traversal.103/solution.js) [TypeScript](./src/0103.binary-tree-zigzag-level-order-traversal.103/solution.ts) | Medium |
| 0104 | Maximum Depth of Binary Tree | [Go](./src/0104.maximum-depth-of-binary-tree.104/solution.go) [Java](./src/0104.maximum-depth-of-binary-tree.104/solution.java) [JavaScript](./src/0104.maximum-depth-of-binary-tree.104/solution.js) [TypeScript](./src/0104.maximum-depth-of-binary-tree.104/solution.ts) | Easy |
| 0105 | Construct Binary Tree from Preorder and Inorder Traversal | [JavaScript](./src/0105.construct-binary-tree-from-preorder-and-inorder-traversal.105/solution.js) [TypeScript](./src/0105.construct-binary-tree-from-preorder-and-inorder-traversal.105/solution.ts) | Medium |
| 0106 | Construct Binary Tree from Inorder and Postorder Traversal | [JavaScript](./src/0106.construct-binary-tree-from-inorder-and-postorder-traversal.106/solution.js) [TypeScript](./src/0106.construct-binary-tree-from-inorder-and-postorder-traversal.106/solution.ts) | Medium |
| 0107 | Binary Tree Level Order Traversal II | [Go](./src/0107.binary-tree-level-order-traversal-ii.107/solution.go) [Java](./src/0107.binary-tree-level-order-traversal-ii.107/solution.java) [JavaScript](./src/0107.binary-tree-level-order-traversal-ii.107/solution.js) [TypeScript](./src/0107.binary-tree-level-order-traversal-ii.107/solution.ts) | Medium |
| 0108 | Convert Sorted Array to Binary Search Tree | [Go](./src/0108.convert-sorted-array-to-binary-search-tree.108/solution.go) [Java](./src/0108.convert-sorted-array-to-binary-search-tree.108/solution.java) [JavaScript](./src/0108.convert-sorted-array-to-binary-search-tree.108/solution.js) [TypeScript](./src/0108.convert-sorted-array-to-binary-search-tree.108/solution.ts) | Easy |
| 0109 | Convert Sorted List to Binary Search Tree | [JavaScript](./src/0109.convert-sorted-list-to-binary-search-tree.109/solution.js) [TypeScript](./src/0109.convert-sorted-list-to-binary-search-tree.109/solution.ts) | Medium |
| 0110 | Balanced Binary Tree | [Java](./src/0110.balanced-binary-tree.110/solution.java) [JavaScript](./src/0110.balanced-binary-tree.110/solution.js) [TypeScript](./src/0110.balanced-binary-tree.110/solution.ts) | Easy |
| 0111 | Minimum Depth of Binary Tree | [Java](./src/0111.minimum-depth-of-binary-tree.111/solution.java) [JavaScript](./src/0111.minimum-depth-of-binary-tree.111/solution.js) [TypeScript](./src/0111.minimum-depth-of-binary-tree.111/solution.ts) | Easy |
| 0112 | Path Sum | [Go](./src/0112.path-sum.112/solution.go) [Java](./src/0112.path-sum.112/solution.java) [JavaScript](./src/0112.path-sum.112/solution.js) [TypeScript](./src/0112.path-sum.112/solution.ts) | Easy |
| 0113 | Path Sum II | [Java](./src/0113.path-sum-ii.113/solution.java) [JavaScript](./src/0113.path-sum-ii.113/solution.js) [TypeScript](./src/0113.path-sum-ii.113/solution.ts) | Medium |
| 0114 | Flatten Binary Tree to Linked List | [JavaScript](./src/0114.flatten-binary-tree-to-linked-list.114/solution.js) [TypeScript](./src/0114.flatten-binary-tree-to-linked-list.114/solution.ts) | Medium |
| 0115 | Distinct Subsequences | [JavaScript](./src/0115.distinct-subsequences.115/solution.js) | Hard |
| 0116 | Populating Next Right Pointers in Each Node | [JavaScript](./src/0116.populating-next-right-pointers-in-each-node.116/solution.js) [TypeScript](./src/0116.populating-next-right-pointers-in-each-node.116/solution.ts) | Medium |
| 0117 | Populating Next Right Pointers in Each Node II | [JavaScript](./src/0117.populating-next-right-pointers-in-each-node-ii.117/solution.js) [TypeScript](./src/0117.populating-next-right-pointers-in-each-node-ii.117/solution.ts) | Medium |
| 0118 | Pascal's Triangle | [Java](./src/0118.pascals-triangle.118/solution.java) [JavaScript](./src/0118.pascals-triangle.118/solution.js) [TypeScript](./src/0118.pascals-triangle.118/solution.ts) | Easy |
| 0119 | Pascal's Triangle II | [Java](./src/0119.pascals-triangle-ii.119/solution.java) [JavaScript](./src/0119.pascals-triangle-ii.119/solution.js) [TypeScript](./src/0119.pascals-triangle-ii.119/solution.ts) | Easy |
| 0120 | Triangle | [Java](./src/0120.triangle.120/solution.java) [JavaScript](./src/0120.triangle.120/solution.js) [TypeScript](./src/0120.triangle.120/solution.ts) | Medium |
| 0121 | Best Time to Buy and Sell Stock | [Java](./src/0121.best-time-to-buy-and-sell-stock.121/solution.java) [JavaScript](./src/0121.best-time-to-buy-and-sell-stock.121/solution.js) [TypeScript](./src/0121.best-time-to-buy-and-sell-stock.121/solution.ts) | Easy |
| 0122 | Best Time to Buy and Sell Stock II | [JavaScript](./src/0122.best-time-to-buy-and-sell-stock-ii.122/solution.js) [TypeScript](./src/0122.best-time-to-buy-and-sell-stock-ii.122/solution.ts) | Medium |
| 0123 | Best Time to Buy and Sell Stock III | [JavaScript](./src/0123.best-time-to-buy-and-sell-stock-iii.123/solution.js) | Hard |
| 0124 | Binary Tree Maximum Path Sum | [Java](./src/0124.binary-tree-maximum-path-sum.124/solution.java) [JavaScript](./src/0124.binary-tree-maximum-path-sum.124/solution.js) [TypeScript](./src/0124.binary-tree-maximum-path-sum.124/solution.ts) | Hard |
| 0125 | Valid Palindrome | [Java](./src/0125.valid-palindrome.125/solution.java) [JavaScript](./src/0125.valid-palindrome.125/solution.js) [TypeScript](./src/0125.valid-palindrome.125/solution.ts) | Easy |
| 0126 | Word Ladder II | | Hard |
| 0127 | Word Ladder | [JavaScript](./src/0127.word-ladder.127/solution.js) | Hard |
| 0128 | Longest Consecutive Sequence | [JavaScript](./src/0128.longest-consecutive-sequence.128/solution.js) | Medium |
| 0129 | Sum Root to Leaf Numbers | [Java](./src/0129.sum-root-to-leaf-numbers.129/solution.java) [JavaScript](./src/0129.sum-root-to-leaf-numbers.129/solution.js) [TypeScript](./src/0129.sum-root-to-leaf-numbers.129/solution.ts) | Medium |
| 0130 | Surrounded Regions | [JavaScript](./src/0130.surrounded-regions.130/solution.js) | Medium |
| 0131 | Palindrome Partitioning | [JavaScript](./src/0131.palindrome-partitioning.131/solution.js) | Medium |
| 0132 | Palindrome Partitioning II | [JavaScript](./src/0132.palindrome-partitioning-ii.132/solution.js) [TypeScript](./src/0132.palindrome-partitioning-ii.132/solution.ts) | Hard |
| 0133 | Clone Graph | [JavaScript](./src/0133.clone-graph.133/solution.js) | Medium |
| 0134 | Gas Station | [JavaScript](./src/0134.gas-station.134/solution.js) | Medium |
| 0135 | Candy | [JavaScript](./src/0135.candy.135/solution.js) [TypeScript](./src/0135.candy.135/solution.ts) | Hard |
| 0136 | Single Number | [Java](./src/0136.single-number.136/solution.java) [JavaScript](./src/0136.single-number.136/solution.js) [TypeScript](./src/0136.single-number.136/solution.ts) | Easy |
| 0137 | Single Number II | [JavaScript](./src/0137.single-number-ii.137/solution.js) | Medium |
| 0138 | Copy List with Random Pointer | [JavaScript](./src/0138.copy-list-with-random-pointer.138/solution.js) | Medium |
| 0139 | Word Break | [JavaScript](./src/0139.word-break.139/solution.js) | Medium |
| 0140 | Word Break II | [JavaScript](./src/0140.word-break-ii.140/solution.js) | Hard |
| 0141 | Linked List Cycle | [Java](./src/0141.linked-list-cycle.141/solution.java) [JavaScript](./src/0141.linked-list-cycle.141/solution.js) [TypeScript](./src/0141.linked-list-cycle.141/solution.ts) | Easy |
| 0142 | Linked List Cycle II | [Java](./src/0142.linked-list-cycle-ii.142/solution.java) [JavaScript](./src/0142.linked-list-cycle-ii.142/solution.js) [TypeScript](./src/0142.linked-list-cycle-ii.142/solution.ts) | Medium |
| 0143 | Reorder List | [JavaScript](./src/0143.reorder-list.143/solution.js) [TypeScript](./src/0143.reorder-list.143/solution.ts) | Medium |
| 0144 | Binary Tree Preorder Traversal | [Go](./src/0144.binary-tree-preorder-traversal.144/solution.go) [Java](./src/0144.binary-tree-preorder-traversal.144/solution.java) [JavaScript](./src/0144.binary-tree-preorder-traversal.144/solution.js) [TypeScript](./src/0144.binary-tree-preorder-traversal.144/solution.ts) | Easy |
| 0145 | Binary Tree Postorder Traversal | [Go](./src/0145.binary-tree-postorder-traversal.145/solution.go) [Java](./src/0145.binary-tree-postorder-traversal.145/solution.java) [JavaScript](./src/0145.binary-tree-postorder-traversal.145/solution.js) [TypeScript](./src/0145.binary-tree-postorder-traversal.145/solution.ts) | Easy |
| 0146 | LRU Cache | [JavaScript](./src/0146.lru-cache.146/solution.js) | Medium |
| 0147 | Insertion Sort List | [JavaScript](./src/0147.insertion-sort-list.147/solution.js) | Medium |
| 0148 | Sort List | [JavaScript](./src/0148.sort-list.148/solution.js) | Medium |
| 0149 | Max Points on a Line | | Hard |
| 0150 | Evaluate Reverse Polish Notation | [JavaScript](./src/0150.evaluate-reverse-polish-notation.150/solution.js) [TypeScript](./src/0150.evaluate-reverse-polish-notation.150/solution.ts) | Medium |
| 0151 | Reverse Words in a String | [Java](./src/0151.reverse-words-in-a-string.151/solution.java) [JavaScript](./src/0151.reverse-words-in-a-string.151/solution.js) [TypeScript](./src/0151.reverse-words-in-a-string.151/solution.ts) | Medium |
| 0152 | Maximum Product Subarray | [JavaScript](./src/0152.maximum-product-subarray.152/solution.js) [TypeScript](./src/0152.maximum-product-subarray.152/solution.ts) | Medium |
| 0153 | Find Minimum in Rotated Sorted Array | [JavaScript](./src/0153.find-minimum-in-rotated-sorted-array.153/solution.js) | Medium |
| 0154 | Find Minimum in Rotated Sorted Array II | [JavaScript](./src/0154.find-minimum-in-rotated-sorted-array-ii.154/solution.js) | Hard |
| 0155 | Min Stack | [Java](./src/0155.min-stack.155/solution.java) [JavaScript](./src/0155.min-stack.155/solution.js) [TypeScript](./src/0155.min-stack.155/solution.ts) | Medium |
| 0156 | Binary Tree Upside Down | [JavaScript](./src/0156.binary-tree-upside-down.156/solution.js) [TypeScript](./src/0156.binary-tree-upside-down.156/solution.ts) | Medium |
| 0157 | Read N Characters Given Read4 | [JavaScript](./src/0157.read-n-characters-given-read4.157/solution.js) | Easy |
| 0158 | Read N Characters Given read4 II - Call Multiple Times | | Hard |
| 0159 | Longest Substring with At Most Two Distinct Characters | [JavaScript](./src/0159.longest-substring-with-at-most-two-distinct-characters.159/solution.js) | Medium |
| 0160 | Intersection of Two Linked Lists | [Java](./src/0160.intersection-of-two-linked-lists.160/solution.java) [JavaScript](./src/0160.intersection-of-two-linked-lists.160/solution.js) [TypeScript](./src/0160.intersection-of-two-linked-lists.160/solution.ts) | Easy |
| 0161 | One Edit Distance | [JavaScript](./src/0161.one-edit-distance.161/solution.js) [TypeScript](./src/0161.one-edit-distance.161/solution.ts) | Medium |
| 0162 | Find Peak Element | [JavaScript](./src/0162.find-peak-element.162/solution.js) [TypeScript](./src/0162.find-peak-element.162/solution.ts) | Medium |
| 0163 | Missing Ranges | [JavaScript](./src/0163.missing-ranges.163/solution.js) [TypeScript](./src/0163.missing-ranges.163/solution.ts) | Easy |
| 0164 | Maximum Gap | [TypeScript](./src/0164.maximum-gap.164/solution.ts) | Medium |
| 0165 | Compare Version Numbers | [JavaScript](./src/0165.compare-version-numbers.165/solution.js) [TypeScript](./src/0165.compare-version-numbers.165/solution.ts) | Medium |
| 0166 | Fraction to Recurring Decimal | [JavaScript](./src/0166.fraction-to-recurring-decimal.166/solution.js) | Medium |
| 0167 | Two Sum II - Input Array Is Sorted | [JavaScript](./src/0167.two-sum-ii-input-array-is-sorted.167/solution.js) [TypeScript](./src/0167.two-sum-ii-input-array-is-sorted.167/solution.ts) | Medium |
| 0168 | Excel Sheet Column Title | [JavaScript](./src/0168.excel-sheet-column-title.168/solution.js) [TypeScript](./src/0168.excel-sheet-column-title.168/solution.ts) | Easy |
| 0169 | Majority Element | [Java](./src/0169.majority-element.169/solution.java) [JavaScript](./src/0169.majority-element.169/solution.js) [TypeScript](./src/0169.majority-element.169/solution.ts) | Easy |
| 0170 | Two Sum III - Data structure design | [JavaScript](./src/0170.two-sum-iii-data-structure-design.170/solution.js) [TypeScript](./src/0170.two-sum-iii-data-structure-design.170/solution.ts) | Easy |
| 0171 | Excel Sheet Column Number | [JavaScript](./src/0171.excel-sheet-column-number.171/solution.js) [TypeScript](./src/0171.excel-sheet-column-number.171/solution.ts) | Easy |
| 0172 | Factorial Trailing Zeroes | [JavaScript](./src/0172.factorial-trailing-zeroes.172/solution.js) [TypeScript](./src/0172.factorial-trailing-zeroes.172/solution.ts) | Medium |
| 0173 | Binary Search Tree Iterator | [Java](./src/0173.binary-search-tree-iterator.173/solution.java) [JavaScript](./src/0173.binary-search-tree-iterator.173/solution.js) [TypeScript](./src/0173.binary-search-tree-iterator.173/solution.ts) | Medium |
| 0174 | Dungeon Game | | Hard |
| 0175 | Combine Two Tables | [Mysql](./src/0175.combine-two-tables.175/solution.sql) | Easy |
| 0176 | Second Highest Salary | [Mysql](./src/0176.second-highest-salary.176/solution.sql) | Medium |
| 0177 | Nth Highest Salary | [Mysql](./src/0177.nth-highest-salary.177/solution.sql) | Medium |
| 0178 | Rank Scores | [Mysql](./src/0178.rank-scores.178/solution.sql) | Medium |
| 0179 | Largest Number | [JavaScript](./src/0179.largest-number.179/solution.js) | Medium |
| 0180 | Consecutive Numbers | [Mysql](./src/0180.consecutive-numbers.180/solution.sql) | Medium |
| 0181 | Employees Earning More Than Their Managers | [Mysql](./src/0181.employees-earning-more-than-their-managers.181/solution.sql) | Easy |
| 0182 | Duplicate Emails | [Mysql](./src/0182.duplicate-emails.182/solution.sql) | Easy |
| 0183 | Customers Who Never Order | [Mysql](./src/0183.customers-who-never-order.183/solution.sql) | Easy |
| 0184 | Department Highest Salary | [Mysql](./src/0184.department-highest-salary.184/solution.sql) | Medium |
| 0185 | Department Top Three Salaries | | Hard |
| 0186 | Reverse Words in a String II | [JavaScript](./src/0186.reverse-words-in-a-string-ii.186/solution.js) [TypeScript](./src/0186.reverse-words-in-a-string-ii.186/solution.ts) | Medium |
| 0187 | Repeated DNA Sequences | [JavaScript](./src/0187.repeated-dna-sequences.187/solution.js) | Medium |
| 0188 | Best Time to Buy and Sell Stock IV | [JavaScript](./src/0188.best-time-to-buy-and-sell-stock-iv.188/solution.js) | Hard |
| 0189 | Rotate Array | [JavaScript](./src/0189.rotate-array.189/solution.js) [TypeScript](./src/0189.rotate-array.189/solution.ts) | Medium |
| 0190 | Reverse Bits | [JavaScript](./src/0190.reverse-bits.190/solution.js) [TypeScript](./src/0190.reverse-bits.190/solution.ts) | Easy |
| 0191 | Number of 1 Bits | [Java](./src/0191.number-of-1-bits.191/solution.java) [JavaScript](./src/0191.number-of-1-bits.191/solution.js) [TypeScript](./src/0191.number-of-1-bits.191/solution.ts) | Easy |
| 0192 | Word Frequency | | Medium |
| 0193 | Valid Phone Numbers | | Easy |
| 0194 | Transpose File | | Medium |
| 0195 | Tenth Line | | Easy |
| 0196 | Delete Duplicate Emails | [Mysql](./src/0196.delete-duplicate-emails.196/solution.sql) | Easy |
| 0197 | Rising Temperature | [Mysql](./src/0197.rising-temperature.197/solution.sql) | Easy |
| 0198 | House Robber | [JavaScript](./src/0198.house-robber.198/solution.js) [TypeScript](./src/0198.house-robber.198/solution.ts) | Medium |
| 0199 | Binary Tree Right Side View | [Java](./src/0199.binary-tree-right-side-view.199/solution.java) [JavaScript](./src/0199.binary-tree-right-side-view.199/solution.js) [TypeScript](./src/0199.binary-tree-right-side-view.199/solution.ts) | Medium |
| 0200 | Number of Islands | [JavaScript](./src/0200.number-of-islands.200/solution.js) [TypeScript](./src/0200.number-of-islands.200/solution.ts) | Medium |
| 0201 | Bitwise AND of Numbers Range | [JavaScript](./src/0201.bitwise-and-of-numbers-range.201/solution.js) | Medium |
| 0202 | Happy Number | [Java](./src/0202.happy-number.202/solution.java) [JavaScript](./src/0202.happy-number.202/solution.js) [TypeScript](./src/0202.happy-number.202/solution.ts) | Easy |
| 0203 | Remove Linked List Elements | [Go](./src/0203.remove-linked-list-elements.203/solution.go) [Java](./src/0203.remove-linked-list-elements.203/solution.java) [JavaScript](./src/0203.remove-linked-list-elements.203/solution.js) [TypeScript](./src/0203.remove-linked-list-elements.203/solution.ts) | Easy |
| 0204 | Count Primes | [JavaScript](./src/0204.count-primes.204/solution.js) [TypeScript](./src/0204.count-primes.204/solution.ts) | Medium |
| 0205 | Isomorphic Strings | [JavaScript](./src/0205.isomorphic-strings.205/solution.js) [TypeScript](./src/0205.isomorphic-strings.205/solution.ts) | Easy |
| 0206 | Reverse Linked List | [Go](./src/0206.reverse-linked-list.206/solution.go) [Java](./src/0206.reverse-linked-list.206/solution.java) [JavaScript](./src/0206.reverse-linked-list.206/solution.js) [TypeScript](./src/0206.reverse-linked-list.206/solution.ts) | Easy |
| 0207 | Course Schedule | [JavaScript](./src/0207.course-schedule.207/solution.js) [TypeScript](./src/0207.course-schedule.207/solution.ts) | Medium |
| 0208 | Implement Trie (Prefix Tree) | [JavaScript](./src/0208.implement-trie-prefix-tree.208/solution.js) | Medium |
| 0209 | Minimum Size Subarray Sum | [JavaScript](./src/0209.minimum-size-subarray-sum.209/solution.js) [TypeScript](./src/0209.minimum-size-subarray-sum.209/solution.ts) | Medium |
| 0210 | Course Schedule II | [JavaScript](./src/0210.course-schedule-ii.210/solution.js) [TypeScript](./src/0210.course-schedule-ii.210/solution.ts) | Medium |
| 0211 | Design Add and Search Words Data Structure | [JavaScript](./src/0211.design-add-and-search-words-data-structure.211/solution.js) | Medium |
| 0212 | Word Search II | | Hard |
| 0213 | House Robber II | [JavaScript](./src/0213.house-robber-ii.213/solution.js) [TypeScript](./src/0213.house-robber-ii.213/solution.ts) | Medium |
| 0214 | Shortest Palindrome | [TypeScript](./src/0214.shortest-palindrome.214/solution.ts) | Hard |
| 0215 | Kth Largest Element in an Array | [JavaScript](./src/0215.kth-largest-element-in-an-array.215/solution.js) | Medium |
| 0216 | Combination Sum III | [JavaScript](./src/0216.combination-sum-iii.216/solution.js) [TypeScript](./src/0216.combination-sum-iii.216/solution.ts) | Medium |
| 0217 | Contains Duplicate | [Java](./src/0217.contains-duplicate.217/solution.java) [JavaScript](./src/0217.contains-duplicate.217/solution.js) [TypeScript](./src/0217.contains-duplicate.217/solution.ts) | Easy |
| 0218 | The Skyline Problem | | Hard |
| 0219 | Contains Duplicate II | [JavaScript](./src/0219.contains-duplicate-ii.219/solution.js) [TypeScript](./src/0219.contains-duplicate-ii.219/solution.ts) | Easy |
| 0220 | Contains Duplicate III | [JavaScript](./src/0220.contains-duplicate-iii.220/solution.js) | Hard |
| 0221 | Maximal Square | [JavaScript](./src/0221.maximal-square.221/solution.js) [TypeScript](./src/0221.maximal-square.221/solution.ts) | Medium |
| 0222 | Count Complete Tree Nodes | [JavaScript](./src/0222.count-complete-tree-nodes.222/solution.js) [TypeScript](./src/0222.count-complete-tree-nodes.222/solution.ts) | Easy |
| 0223 | Rectangle Area | [JavaScript](./src/0223.rectangle-area.223/solution.js) | Medium |
| 0224 | Basic Calculator | | Hard |
| 0225 | Implement Stack using Queues | [JavaScript](./src/0225.implement-stack-using-queues.225/solution.js) [TypeScript](./src/0225.implement-stack-using-queues.225/solution.ts) | Easy |
| 0226 | Invert Binary Tree | [Go](./src/0226.invert-binary-tree.226/solution.go) [Java](./src/0226.invert-binary-tree.226/solution.java) [JavaScript](./src/0226.invert-binary-tree.226/solution.js) [TypeScript](./src/0226.invert-binary-tree.226/solution.ts) | Easy |
| 0227 | Basic Calculator II | | Medium |
| 0228 | Summary Ranges | [Java](./src/0228.summary-ranges.228/solution.java) [JavaScript](./src/0228.summary-ranges.228/solution.js) [TypeScript](./src/0228.summary-ranges.228/solution.ts) | Easy |
| 0229 | Majority Element II | [JavaScript](./src/0229.majority-element-ii.229/solution.js) | Medium |
| 0230 | Kth Smallest Element in a BST | [JavaScript](./src/0230.kth-smallest-element-in-a-bst.230/solution.js) [TypeScript](./src/0230.kth-smallest-element-in-a-bst.230/solution.ts) | Medium |
| 0231 | Power of Two | [Java](./src/0231.power-of-two.231/solution.java) [JavaScript](./src/0231.power-of-two.231/solution.js) [TypeScript](./src/0231.power-of-two.231/solution.ts) | Easy |
| 0232 | Implement Queue using Stacks | [JavaScript](./src/0232.implement-queue-using-stacks.232/solution.js) [TypeScript](./src/0232.implement-queue-using-stacks.232/solution.ts) | Easy |
| 0233 | Number of Digit One | [JavaScript](./src/0233.number-of-digit-one.233/solution.js) | Hard |
| 0234 | Palindrome Linked List | [Java](./src/0234.palindrome-linked-list.234/solution.java) [JavaScript](./src/0234.palindrome-linked-list.234/solution.js) [TypeScript](./src/0234.palindrome-linked-list.234/solution.ts) | Easy |
| 0235 | Lowest Common Ancestor of a Binary Search Tree | [Go](./src/0235.lowest-common-ancestor-of-a-binary-search-tree.235/solution.go) [Java](./src/0235.lowest-common-ancestor-of-a-binary-search-tree.235/solution.java) [JavaScript](./src/0235.lowest-common-ancestor-of-a-binary-search-tree.235/solution.js) [TypeScript](./src/0235.lowest-common-ancestor-of-a-binary-search-tree.235/solution.ts) | Medium |
| 0236 | Lowest Common Ancestor of a Binary Tree | [Java](./src/0236.lowest-common-ancestor-of-a-binary-tree.236/solution.java) [JavaScript](./src/0236.lowest-common-ancestor-of-a-binary-tree.236/solution.js) [TypeScript](./src/0236.lowest-common-ancestor-of-a-binary-tree.236/solution.ts) | Medium |
| 0237 | Delete Node in a Linked List | [Java](./src/0237.delete-node-in-a-linked-list.237/solution.java) [JavaScript](./src/0237.delete-node-in-a-linked-list.237/solution.js) [TypeScript](./src/0237.delete-node-in-a-linked-list.237/solution.ts) | Medium |
| 0238 | Product of Array Except Self | [JavaScript](./src/0238.product-of-array-except-self.238/solution.js) [TypeScript](./src/0238.product-of-array-except-self.238/solution.ts) | Medium |
| 0239 | Sliding Window Maximum | [JavaScript](./src/0239.sliding-window-maximum.239/solution.js) [TypeScript](./src/0239.sliding-window-maximum.239/solution.ts) | Hard |
| 0240 | Search a 2D Matrix II | [JavaScript](./src/0240.search-a-2d-matrix-ii.240/solution.js) [TypeScript](./src/0240.search-a-2d-matrix-ii.240/solution.ts) | Medium |
| 0241 | Different Ways to Add Parentheses | | Medium |
| 0242 | Valid Anagram | [Java](./src/0242.valid-anagram.242/solution.java) [JavaScript](./src/0242.valid-anagram.242/solution.js) [TypeScript](./src/0242.valid-anagram.242/solution.ts) | Easy |
| 0243 | Shortest Word Distance | [JavaScript](./src/0243.shortest-word-distance.243/solution.js) [TypeScript](./src/0243.shortest-word-distance.243/solution.ts) | Easy |
| 0244 | Shortest Word Distance II | [JavaScript](./src/0244.shortest-word-distance-ii.244/solution.js) [TypeScript](./src/0244.shortest-word-distance-ii.244/solution.ts) | Medium |
| 0245 | Shortest Word Distance III | [JavaScript](./src/0245.shortest-word-distance-iii.245/solution.js) [TypeScript](./src/0245.shortest-word-distance-iii.245/solution.ts) | Medium |
| 0246 | Strobogrammatic Number | [JavaScript](./src/0246.strobogrammatic-number.246/solution.js) [TypeScript](./src/0246.strobogrammatic-number.246/solution.ts) | Easy |
| 0247 | Strobogrammatic Number II | [JavaScript](./src/0247.strobogrammatic-number-ii.247/solution.js) [TypeScript](./src/0247.strobogrammatic-number-ii.247/solution.ts) | Medium |
| 0248 | Strobogrammatic Number III | | Hard |
| 0249 | Group Shifted Strings | | Medium |
| 0250 | Count Univalue Subtrees | [JavaScript](./src/0250.count-univalue-subtrees.250/solution.js) [TypeScript](./src/0250.count-univalue-subtrees.250/solution.ts) | Medium |
| 0251 | Flatten 2D Vector | [JavaScript](./src/0251.flatten-2d-vector.251/solution.js) [TypeScript](./src/0251.flatten-2d-vector.251/solution.ts) | Medium |
| 0252 | Meeting Rooms | [JavaScript](./src/0252.meeting-rooms.252/solution.js) [TypeScript](./src/0252.meeting-rooms.252/solution.ts) | Easy |
| 0253 | Meeting Rooms II | | Medium |
| 0254 | Factor Combinations | | Medium |
| 0255 | Verify Preorder Sequence in Binary Search Tree | [JavaScript](./src/0255.verify-preorder-sequence-in-binary-search-tree.255/solution.js) | Medium |
| 0256 | Paint House | | Medium |
| 0257 | Binary Tree Paths | [Java](./src/0257.binary-tree-paths.257/solution.java) [JavaScript](./src/0257.binary-tree-paths.257/solution.js) [TypeScript](./src/0257.binary-tree-paths.257/solution.ts) | Easy |
| 0258 | Add Digits | [Java](./src/0258.add-digits.258/solution.java) [JavaScript](./src/0258.add-digits.258/solution.js) [TypeScript](./src/0258.add-digits.258/solution.ts) | Easy |
| 0259 | 3Sum Smaller | [JavaScript](./src/0259.3sum-smaller.259/solution.js) [TypeScript](./src/0259.3sum-smaller.259/solution.ts) | Medium |
| 0260 | Single Number III | [JavaScript](./src/0260.single-number-iii.260/solution.js) [TypeScript](./src/0260.single-number-iii.260/solution.ts) | Medium |
| 0261 | Graph Valid Tree | | Medium |
| 0262 | Trips and Users | | Hard |
| 0263 | Ugly Number | [Java](./src/0263.ugly-number.263/solution.java) [JavaScript](./src/0263.ugly-number.263/solution.js) [TypeScript](./src/0263.ugly-number.263/solution.ts) | Easy |
| 0264 | Ugly Number II | [JavaScript](./src/0264.ugly-number-ii.264/solution.js) | Medium |
| 0265 | Paint House II | | Hard |
| 0266 | Palindrome Permutation | [JavaScript](./src/0266.palindrome-permutation.266/solution.js) [TypeScript](./src/0266.palindrome-permutation.266/solution.ts) | Easy |
| 0267 | Palindrome Permutation II | [JavaScript](./src/0267.palindrome-permutation-ii.267/solution.js) [TypeScript](./src/0267.palindrome-permutation-ii.267/solution.ts) | Medium |
| 0268 | Missing Number | [Java](./src/0268.missing-number.268/solution.java) [JavaScript](./src/0268.missing-number.268/solution.js) [TypeScript](./src/0268.missing-number.268/solution.ts) | Easy |
| 0269 | Alien Dictionary | | Hard |
| 0270 | Closest Binary Search Tree Value | [JavaScript](./src/0270.closest-binary-search-tree-value.270/solution.js) [TypeScript](./src/0270.closest-binary-search-tree-value.270/solution.ts) | Easy |
| 0271 | Encode and Decode Strings | [JavaScript](./src/0271.encode-and-decode-strings.271/solution.js) | Medium |
| 0272 | Closest Binary Search Tree Value II | [JavaScript](./src/0272.closest-binary-search-tree-value-ii.272/solution.js) [TypeScript](./src/0272.closest-binary-search-tree-value-ii.272/solution.ts) | Hard |
| 0273 | Integer to English Words | [JavaScript](./src/0273.integer-to-english-words.273/solution.js) | Hard |
| 0274 | H-Index | [JavaScript](./src/0274.h-index.274/solution.js) [TypeScript](./src/0274.h-index.274/solution.ts) | Medium |
| 0275 | H-Index II | [JavaScript](./src/0275.h-index-ii.275/solution.js) [TypeScript](./src/0275.h-index-ii.275/solution.ts) | Medium |
| 0276 | Paint Fence | | Medium |
| 0277 | Find the Celebrity | | Medium |
| 0278 | First Bad Version | [JavaScript](./src/0278.first-bad-version.278/solution.js) [TypeScript](./src/0278.first-bad-version.278/solution.ts) | Easy |
| 0279 | Perfect Squares | [JavaScript](./src/0279.perfect-squares.279/solution.js) [TypeScript](./src/0279.perfect-squares.279/solution.ts) | Medium |
| 0280 | Wiggle Sort | [JavaScript](./src/0280.wiggle-sort.280/solution.js) [TypeScript](./src/0280.wiggle-sort.280/solution.ts) | Medium |
| 0281 | Zigzag Iterator | [JavaScript](./src/0281.zigzag-iterator.281/solution.js) [TypeScript](./src/0281.zigzag-iterator.281/solution.ts) | Medium |
| 0282 | Expression Add Operators | | Hard |
| 0283 | Move Zeroes | [Java](./src/0283.move-zeroes.283/solution.java) [JavaScript](./src/0283.move-zeroes.283/solution.js) [TypeScript](./src/0283.move-zeroes.283/solution.ts) | Easy |
| 0284 | Peeking Iterator | [Java](./src/0284.peeking-iterator.284/solution.java) [JavaScript](./src/0284.peeking-iterator.284/solution.js) [Python3](./src/0284.peeking-iterator.284/solution.py) [TypeScript](./src/0284.peeking-iterator.284/solution.ts) | Medium |
| 0285 | Inorder Successor in BST | [JavaScript](./src/0285.inorder-successor-in-bst.285/solution.js) [TypeScript](./src/0285.inorder-successor-in-bst.285/solution.ts) | Medium |
| 0286 | Walls and Gates | | Medium |
| 0287 | Find the Duplicate Number | [JavaScript](./src/0287.find-the-duplicate-number.287/solution.js) [TypeScript](./src/0287.find-the-duplicate-number.287/solution.ts) | Medium |
| 0288 | Unique Word Abbreviation | [JavaScript](./src/0288.unique-word-abbreviation.288/solution.js) [TypeScript](./src/0288.unique-word-abbreviation.288/solution.ts) | Medium |
| 0289 | Game of Life | [JavaScript](./src/0289.game-of-life.289/solution.js) | Medium |
| 0290 | Word Pattern | [JavaScript](./src/0290.word-pattern.290/solution.js) [TypeScript](./src/0290.word-pattern.290/solution.ts) | Easy |
| 0291 | Word Pattern II | | Medium |
| 0292 | Nim Game | [JavaScript](./src/0292.nim-game.292/solution.js) [TypeScript](./src/0292.nim-game.292/solution.ts) | Easy |
| 0293 | Flip Game | [JavaScript](./src/0293.flip-game.293/solution.js) [TypeScript](./src/0293.flip-game.293/solution.ts) | Easy |
| 0294 | Flip Game II | | Medium |
| 0295 | Find Median from Data Stream | [JavaScript](./src/0295.find-median-from-data-stream.295/solution.js) | Hard |
| 0296 | Best Meeting Point | | Hard |
| 0297 | Serialize and Deserialize Binary Tree | [JavaScript](./src/0297.serialize-and-deserialize-binary-tree.297/solution.js) [TypeScript](./src/0297.serialize-and-deserialize-binary-tree.297/solution.ts) | Hard |
| 0298 | Binary Tree Longest Consecutive Sequence | [JavaScript](./src/0298.binary-tree-longest-consecutive-sequence.298/solution.js) [TypeScript](./src/0298.binary-tree-longest-consecutive-sequence.298/solution.ts) | Medium |
| 0299 | Bulls and Cows | [JavaScript](./src/0299.bulls-and-cows.299/solution.js) | Medium |
| 0300 | Longest Increasing Subsequence | [JavaScript](./src/0300.longest-increasing-subsequence.300/solution.js) [TypeScript](./src/0300.longest-increasing-subsequence.300/solution.ts) | Medium |
| 0301 | Remove Invalid Parentheses | | Hard |
| 0302 | Smallest Rectangle Enclosing Black Pixels | | Hard |
| 0303 | Range Sum Query - Immutable | [Java](./src/0303.range-sum-query-immutable.303/solution.java) [JavaScript](./src/0303.range-sum-query-immutable.303/solution.js) [TypeScript](./src/0303.range-sum-query-immutable.303/solution.ts) | Easy |
| 0304 | Range Sum Query 2D - Immutable | [JavaScript](./src/0304.range-sum-query-2d-immutable.304/solution.js) [TypeScript](./src/0304.range-sum-query-2d-immutable.304/solution.ts) | Medium |
| 0305 | Number of Islands II | | Hard |
| 0306 | Additive Number | [JavaScript](./src/0306.additive-number.306/solution.js) | Medium |
| 0307 | Range Sum Query - Mutable | [JavaScript](./src/0307.range-sum-query-mutable.307/solution.js) [TypeScript](./src/0307.range-sum-query-mutable.307/solution.ts) | Medium |
| 0308 | Range Sum Query 2D - Mutable | | Medium |
| 0309 | Best Time to Buy and Sell Stock with Cooldown | [JavaScript](./src/0309.best-time-to-buy-and-sell-stock-with-cooldown.309/solution.js) | Medium |
| 0310 | Minimum Height Trees | [JavaScript](./src/0310.minimum-height-trees.310/solution.js) | Medium |
| 0311 | Sparse Matrix Multiplication | [JavaScript](./src/0311.sparse-matrix-multiplication.311/solution.js) [TypeScript](./src/0311.sparse-matrix-multiplication.311/solution.ts) | Medium |
| 0312 | Burst Balloons | | Hard |
| 0313 | Super Ugly Number | [JavaScript](./src/0313.super-ugly-number.313/solution.js) | Medium |
| 0314 | Binary Tree Vertical Order Traversal | [JavaScript](./src/0314.binary-tree-vertical-order-traversal.314/solution.js) [TypeScript](./src/0314.binary-tree-vertical-order-traversal.314/solution.ts) | Medium |
| 0315 | Count of Smaller Numbers After Self | [JavaScript](./src/0315.count-of-smaller-numbers-after-self.315/solution.js) | Hard |
| 0316 | Remove Duplicate Letters | [JavaScript](./src/0316.remove-duplicate-letters.316/solution.js) [TypeScript](./src/0316.remove-duplicate-letters.316/solution.ts) | Medium |
| 0317 | Shortest Distance from All Buildings | | Hard |
| 0318 | Maximum Product of Word Lengths | [Java](./src/0318.maximum-product-of-word-lengths.318/solution.java) [JavaScript](./src/0318.maximum-product-of-word-lengths.318/solution.js) [TypeScript](./src/0318.maximum-product-of-word-lengths.318/solution.ts) | Medium |
| 0319 | Bulb Switcher | [JavaScript](./src/0319.bulb-switcher.319/solution.js) [TypeScript](./src/0319.bulb-switcher.319/solution.ts) | Medium |
| 0320 | Generalized Abbreviation | [JavaScript](./src/0320.generalized-abbreviation.320/solution.js) [TypeScript](./src/0320.generalized-abbreviation.320/solution.ts) | Medium |
| 0321 | Create Maximum Number | | Hard |
| 0322 | Coin Change | [JavaScript](./src/0322.coin-change.322/solution.js) [TypeScript](./src/0322.coin-change.322/solution.ts) | Medium |
| 0323 | Number of Connected Components in an Undirected Graph | [JavaScript](./src/0323.number-of-connected-components-in-an-undirected-graph.323/solution.js) [TypeScript](./src/0323.number-of-connected-components-in-an-undirected-graph.323/solution.ts) | Medium |
| 0324 | Wiggle Sort II | | Medium |
| 0325 | Maximum Size Subarray Sum Equals k | [JavaScript](./src/0325.maximum-size-subarray-sum-equals-k.325/solution.js) [TypeScript](./src/0325.maximum-size-subarray-sum-equals-k.325/solution.ts) | Medium |
| 0326 | Power of Three | [Java](./src/0326.power-of-three.326/solution.java) [JavaScript](./src/0326.power-of-three.326/solution.js) [TypeScript](./src/0326.power-of-three.326/solution.ts) | Easy |
| 0327 | Count of Range Sum | [TypeScript](./src/0327.count-of-range-sum.327/solution.ts) | Hard |
| 0328 | Odd Even Linked List | [Java](./src/0328.odd-even-linked-list.328/solution.java) [JavaScript](./src/0328.odd-even-linked-list.328/solution.js) [TypeScript](./src/0328.odd-even-linked-list.328/solution.ts) | Medium |
| 0329 | Longest Increasing Path in a Matrix | [JavaScript](./src/0329.longest-increasing-path-in-a-matrix.329/solution.js) | Hard |
| 0330 | Patching Array | | Hard |
| 0331 | Verify Preorder Serialization of a Binary Tree | [JavaScript](./src/0331.verify-preorder-serialization-of-a-binary-tree.331/solution.js) | Medium |
| 0332 | Reconstruct Itinerary | | Hard |
| 0333 | Largest BST Subtree | [JavaScript](./src/0333.largest-bst-subtree.333/solution.js) [TypeScript](./src/0333.largest-bst-subtree.333/solution.ts) | Medium |
| 0334 | Increasing Triplet Subsequence | [JavaScript](./src/0334.increasing-triplet-subsequence.334/solution.js) | Medium |
| 0335 | Self Crossing | | Hard |
| 0336 | Palindrome Pairs | | Hard |
| 0337 | House Robber III | [JavaScript](./src/0337.house-robber-iii.337/solution.js) | Medium |
| 0338 | Counting Bits | [Java](./src/0338.counting-bits.338/solution.java) [JavaScript](./src/0338.counting-bits.338/solution.js) [TypeScript](./src/0338.counting-bits.338/solution.ts) | Easy |
| 0339 | Nested List Weight Sum | [JavaScript](./src/0339.nested-list-weight-sum.339/solution.js) [TypeScript](./src/0339.nested-list-weight-sum.339/solution.ts) | Medium |
| 0340 | Longest Substring with At Most K Distinct Characters | | Medium |
| 0341 | Flatten Nested List Iterator | [JavaScript](./src/0341.flatten-nested-list-iterator.341/solution.js) | Medium |
| 0342 | Power of Four | [Java](./src/0342.power-of-four.342/solution.java) [JavaScript](./src/0342.power-of-four.342/solution.js) [TypeScript](./src/0342.power-of-four.342/solution.ts) | Easy |
| 0343 | Integer Break | [JavaScript](./src/0343.integer-break.343/solution.js) [TypeScript](./src/0343.integer-break.343/solution.ts) | Medium |
| 0344 | Reverse String | [Java](./src/0344.reverse-string.344/solution.java) [JavaScript](./src/0344.reverse-string.344/solution.js) [TypeScript](./src/0344.reverse-string.344/solution.ts) | Easy |
| 0345 | Reverse Vowels of a String | [Java](./src/0345.reverse-vowels-of-a-string.345/solution.java) [JavaScript](./src/0345.reverse-vowels-of-a-string.345/solution.js) [TypeScript](./src/0345.reverse-vowels-of-a-string.345/solution.ts) | Easy |
| 0346 | Moving Average from Data Stream | [JavaScript](./src/0346.moving-average-from-data-stream.346/solution.js) [TypeScript](./src/0346.moving-average-from-data-stream.346/solution.ts) | Easy |
| 0347 | Top K Frequent Elements | [JavaScript](./src/0347.top-k-frequent-elements.347/solution.js) | Medium |
| 0348 | Design Tic-Tac-Toe | | Medium |
| 0349 | Intersection of Two Arrays | [Java](./src/0349.intersection-of-two-arrays.349/solution.java) [JavaScript](./src/0349.intersection-of-two-arrays.349/solution.js) [TypeScript](./src/0349.intersection-of-two-arrays.349/solution.ts) | Easy |
| 0350 | Intersection of Two Arrays II | [JavaScript](./src/0350.intersection-of-two-arrays-ii.350/solution.js) [TypeScript](./src/0350.intersection-of-two-arrays-ii.350/solution.ts) | Easy |
| 0351 | Android Unlock Patterns | | Medium |
| 0352 | Data Stream as Disjoint Intervals | [JavaScript](./src/0352.data-stream-as-disjoint-intervals.352/solution.js) | Hard |
| 0353 | Design Snake Game | | Medium |
| 0354 | Russian Doll Envelopes | [JavaScript](./src/0354.russian-doll-envelopes.354/solution.js) | Hard |
| 0355 | Design Twitter | | Medium |
| 0356 | Line Reflection | | Medium |
| 0357 | Count Numbers with Unique Digits | [JavaScript](./src/0357.count-numbers-with-unique-digits.357/solution.js) | Medium |
| 0358 | Rearrange String k Distance Apart | | Hard |
| 0359 | Logger Rate Limiter | [JavaScript](./src/0359.logger-rate-limiter.359/solution.js) [TypeScript](./src/0359.logger-rate-limiter.359/solution.ts) | Easy |
| 0360 | Sort Transformed Array | [JavaScript](./src/0360.sort-transformed-array.360/solution.js) | Medium |
| 0361 | Bomb Enemy | | Medium |
| 0362 | Design Hit Counter | [JavaScript](./src/0362.design-hit-counter.362/solution.js) [TypeScript](./src/0362.design-hit-counter.362/solution.ts) | Medium |
| 0363 | Max Sum of Rectangle No Larger Than K | | Hard |
| 0364 | Nested List Weight Sum II | [JavaScript](./src/0364.nested-list-weight-sum-ii.364/solution.js) [TypeScript](./src/0364.nested-list-weight-sum-ii.364/solution.ts) | Medium |
| 0365 | Water and Jug Problem | | Medium |
| 0366 | Find Leaves of Binary Tree | [JavaScript](./src/0366.find-leaves-of-binary-tree.366/solution.js) [TypeScript](./src/0366.find-leaves-of-binary-tree.366/solution.ts) | Medium |
| 0367 | Valid Perfect Square | [Java](./src/0367.valid-perfect-square.367/solution.java) [JavaScript](./src/0367.valid-perfect-square.367/solution.js) [TypeScript](./src/0367.valid-perfect-square.367/solution.ts) | Easy |
| 0368 | Largest Divisible Subset | | Medium |
| 0369 | Plus One Linked List | [JavaScript](./src/0369.plus-one-linked-list.369/solution.js) [TypeScript](./src/0369.plus-one-linked-list.369/solution.ts) | Medium |
| 0370 | Range Addition | [JavaScript](./src/0370.range-addition.370/solution.js) [TypeScript](./src/0370.range-addition.370/solution.ts) | Medium |
| 0371 | Sum of Two Integers | [JavaScript](./src/0371.sum-of-two-integers.371/solution.js) [TypeScript](./src/0371.sum-of-two-integers.371/solution.ts) | Medium |
| 0372 | Super Pow | [JavaScript](./src/0372.super-pow.372/solution.js) | Medium |
| 0373 | Find K Pairs with Smallest Sums | [JavaScript](./src/0373.find-k-pairs-with-smallest-sums.373/solution.js) | Medium |
| 0374 | Guess Number Higher or Lower | [Java](./src/0374.guess-number-higher-or-lower.374/solution.java) [JavaScript](./src/0374.guess-number-higher-or-lower.374/solution.js) [Python3](./src/0374.guess-number-higher-or-lower.374/solution.py) [TypeScript](./src/0374.guess-number-higher-or-lower.374/solution.ts) | Easy |
| 0375 | Guess Number Higher or Lower II | [JavaScript](./src/0375.guess-number-higher-or-lower-ii.375/solution.js) | Medium |
| 0376 | Wiggle Subsequence | [JavaScript](./src/0376.wiggle-subsequence.376/solution.js) | Medium |
| 0377 | Combination Sum IV | [JavaScript](./src/0377.combination-sum-iv.377/solution.js) [TypeScript](./src/0377.combination-sum-iv.377/solution.ts) | Medium |
| 0378 | Kth Smallest Element in a Sorted Matrix | [JavaScript](./src/0378.kth-smallest-element-in-a-sorted-matrix.378/solution.js) | Medium |
| 0379 | Design Phone Directory | [JavaScript](./src/0379.design-phone-directory.379/solution.js) [TypeScript](./src/0379.design-phone-directory.379/solution.ts) | Medium |
| 0380 | Insert Delete GetRandom O(1) | [JavaScript](./src/0380.insert-delete-getrandom-o1.380/solution.js) | Medium |
| 0381 | Insert Delete GetRandom O(1) - Duplicates allowed | [JavaScript](./src/0381.insert-delete-getrandom-o1-duplicates-allowed.381/solution.js) | Hard |
| 0382 | Linked List Random Node | [JavaScript](./src/0382.linked-list-random-node.382/solution.js) | Medium |
| 0383 | Ransom Note | [Java](./src/0383.ransom-note.383/solution.java) [JavaScript](./src/0383.ransom-note.383/solution.js) [TypeScript](./src/0383.ransom-note.383/solution.ts) | Easy |
| 0384 | Shuffle an Array | [Java](./src/0384.shuffle-an-array.384/solution.java) [JavaScript](./src/0384.shuffle-an-array.384/solution.js) [TypeScript](./src/0384.shuffle-an-array.384/solution.ts) | Medium |
| 0385 | Mini Parser | [JavaScript](./src/0385.mini-parser.385/solution.js) | Medium |
| 0386 | Lexicographical Numbers | [JavaScript](./src/0386.lexicographical-numbers.386/solution.js) [TypeScript](./src/0386.lexicographical-numbers.386/solution.ts) | Medium |
| 0387 | First Unique Character in a String | [Java](./src/0387.first-unique-character-in-a-string.387/solution.java) [JavaScript](./src/0387.first-unique-character-in-a-string.387/solution.js) [TypeScript](./src/0387.first-unique-character-in-a-string.387/solution.ts) | Easy |
| 0388 | Longest Absolute File Path | [JavaScript](./src/0388.longest-absolute-file-path.388/solution.js) | Medium |
| 0389 | Find the Difference | [Java](./src/0389.find-the-difference.389/solution.java) [JavaScript](./src/0389.find-the-difference.389/solution.js) [TypeScript](./src/0389.find-the-difference.389/solution.ts) | Easy |
| 0390 | Elimination Game | | Medium |
| 0391 | Perfect Rectangle | | Hard |
| 0392 | Is Subsequence | [Java](./src/0392.is-subsequence.392/solution.java) [JavaScript](./src/0392.is-subsequence.392/solution.js) [TypeScript](./src/0392.is-subsequence.392/solution.ts) | Easy |
| 0393 | UTF-8 Validation | [JavaScript](./src/0393.utf-8-validation.393/solution.js) | Medium |
| 0394 | Decode String | [JavaScript](./src/0394.decode-string.394/solution.js) | Medium |
| 0395 | Longest Substring with At Least K Repeating Characters | [JavaScript](./src/0395.longest-substring-with-at-least-k-repeating-characters.395/solution.js) | Medium |
| 0396 | Rotate Function | [JavaScript](./src/0396.rotate-function.396/solution.js) | Medium |
| 0397 | Integer Replacement | [JavaScript](./src/0397.integer-replacement.397/solution.js) | Medium |
| 0398 | Random Pick Index | [JavaScript](./src/0398.random-pick-index.398/solution.js) | Medium |
| 0399 | Evaluate Division | [JavaScript](./src/0399.evaluate-division.399/solution.js) [TypeScript](./src/0399.evaluate-division.399/solution.ts) | Medium |
| 0400 | Nth Digit | [JavaScript](./src/0400.nth-digit.400/solution.js) | Medium |
| 0401 | Binary Watch | [JavaScript](./src/0401.binary-watch.401/solution.js) [TypeScript](./src/0401.binary-watch.401/solution.ts) | Easy |
| 0402 | Remove K Digits | [TypeScript](./src/0402.remove-k-digits.402/solution.ts) | Medium |
| 0403 | Frog Jump | [JavaScript](./src/0403.frog-jump.403/solution.js) | Hard |
| 0404 | Sum of Left Leaves | [Java](./src/0404.sum-of-left-leaves.404/solution.java) [JavaScript](./src/0404.sum-of-left-leaves.404/solution.js) [TypeScript](./src/0404.sum-of-left-leaves.404/solution.ts) | Easy |
| 0405 | Convert a Number to Hexadecimal | [Java](./src/0405.convert-a-number-to-hexadecimal.405/solution.java) [JavaScript](./src/0405.convert-a-number-to-hexadecimal.405/solution.js) [TypeScript](./src/0405.convert-a-number-to-hexadecimal.405/solution.ts) | Easy |
| 0406 | Queue Reconstruction by Height | | Medium |
| 0407 | Trapping Rain Water II | | Hard |
| 0408 | Valid Word Abbreviation | [JavaScript](./src/0408.valid-word-abbreviation.408/solution.js) [TypeScript](./src/0408.valid-word-abbreviation.408/solution.ts) | Easy |
| 0409 | Longest Palindrome | [Java](./src/0409.longest-palindrome.409/solution.java) [JavaScript](./src/0409.longest-palindrome.409/solution.js) [TypeScript](./src/0409.longest-palindrome.409/solution.ts) | Easy |
| 0410 | Split Array Largest Sum | [JavaScript](./src/0410.split-array-largest-sum.410/solution.js) [TypeScript](./src/0410.split-array-largest-sum.410/solution.ts) | Hard |
| 0411 | Minimum Unique Word Abbreviation | | Hard |
| 0412 | Fizz Buzz | [Java](./src/0412.fizz-buzz.412/solution.java) [JavaScript](./src/0412.fizz-buzz.412/solution.js) [TypeScript](./src/0412.fizz-buzz.412/solution.ts) | Easy |
| 0413 | Arithmetic Slices | [JavaScript](./src/0413.arithmetic-slices.413/solution.js) | Medium |
| 0414 | Third Maximum Number | [Java](./src/0414.third-maximum-number.414/solution.java) [JavaScript](./src/0414.third-maximum-number.414/solution.js) [TypeScript](./src/0414.third-maximum-number.414/solution.ts) | Easy |
| 0415 | Add Strings | [JavaScript](./src/0415.add-strings.415/solution.js) [TypeScript](./src/0415.add-strings.415/solution.ts) | Easy |
| 0416 | Partition Equal Subset Sum | [Java](./src/0416.partition-equal-subset-sum.416/solution.java) [JavaScript](./src/0416.partition-equal-subset-sum.416/solution.js) [TypeScript](./src/0416.partition-equal-subset-sum.416/solution.ts) | Medium |
| 0417 | Pacific Atlantic Water Flow | [JavaScript](./src/0417.pacific-atlantic-water-flow.417/solution.js) | Medium |
| 0418 | Sentence Screen Fitting | | Medium |
| 0419 | Battleships in a Board | [JavaScript](./src/0419.battleships-in-a-board.419/solution.js) | Medium |
| 0420 | Strong Password Checker | | Hard |
| 0421 | Maximum XOR of Two Numbers in an Array | [JavaScript](./src/0421.maximum-xor-of-two-numbers-in-an-array.421/solution.js) | Medium |
| 0422 | Valid Word Square | [JavaScript](./src/0422.valid-word-square.422/solution.js) | Easy |
| 0423 | Reconstruct Original Digits from English | [JavaScript](./src/0423.reconstruct-original-digits-from-english.423/solution.js) | Medium |
| 0424 | Longest Repeating Character Replacement | | Medium |
| 0425 | Word Squares | | Hard |
| 0426 | Convert Binary Search Tree to Sorted Doubly Linked List | [JavaScript](./src/0426.convert-binary-search-tree-to-sorted-doubly-linked-list.758/solution.js) | Medium |
| 0427 | Construct Quad Tree | [JavaScript](./src/0427.construct-quad-tree.772/solution.js) | Medium |
| 0428 | Serialize and Deserialize N-ary Tree | [JavaScript](./src/0428.serialize-and-deserialize-n-ary-tree.765/solution.js) | Hard |
| 0429 | N-ary Tree Level Order Traversal | [Java](./src/0429.n-ary-tree-level-order-traversal.764/solution.java) [JavaScript](./src/0429.n-ary-tree-level-order-traversal.764/solution.js) [TypeScript](./src/0429.n-ary-tree-level-order-traversal.764/solution.ts) | Medium |
| 0430 | Flatten a Multilevel Doubly Linked List | [JavaScript](./src/0430.flatten-a-multilevel-doubly-linked-list.766/solution.js) | Medium |
| 0431 | Encode N-ary Tree to Binary Tree | [JavaScript](./src/0431.encode-n-ary-tree-to-binary-tree.771/solution.js) [TypeScript](./src/0431.encode-n-ary-tree-to-binary-tree.771/solution.ts) | Hard |
| 0432 | All O`one Data Structure | [JavaScript](./src/0432.all-oone-data-structure.432/solution.js) | Hard |
| 0433 | Minimum Genetic Mutation | [JavaScript](./src/0433.minimum-genetic-mutation.433/solution.js) | Medium |
| 0434 | Number of Segments in a String | [Java](./src/0434.number-of-segments-in-a-string.434/solution.java) [JavaScript](./src/0434.number-of-segments-in-a-string.434/solution.js) [TypeScript](./src/0434.number-of-segments-in-a-string.434/solution.ts) | Easy |
| 0435 | Non-overlapping Intervals | [JavaScript](./src/0435.non-overlapping-intervals.435/solution.js) | Medium |
| 0436 | Find Right Interval | [JavaScript](./src/0436.find-right-interval.436/solution.js) | Medium |
| 0437 | Path Sum III | [JavaScript](./src/0437.path-sum-iii.437/solution.js) [TypeScript](./src/0437.path-sum-iii.437/solution.ts) | Medium |
| 0438 | Find All Anagrams in a String | [JavaScript](./src/0438.find-all-anagrams-in-a-string.438/solution.js) [TypeScript](./src/0438.find-all-anagrams-in-a-string.438/solution.ts) | Medium |
| 0439 | Ternary Expression Parser | | Medium |
| 0440 | K-th Smallest in Lexicographical Order | | Hard |
| 0441 | Arranging Coins | [Java](./src/0441.arranging-coins.441/solution.java) [JavaScript](./src/0441.arranging-coins.441/solution.js) [TypeScript](./src/0441.arranging-coins.441/solution.ts) | Easy |
| 0442 | Find All Duplicates in an Array | [JavaScript](./src/0442.find-all-duplicates-in-an-array.442/solution.js) [TypeScript](./src/0442.find-all-duplicates-in-an-array.442/solution.ts) | Medium |
| 0443 | String Compression | [Java](./src/0443.string-compression.443/solution.java) [JavaScript](./src/0443.string-compression.443/solution.js) | Medium |
| 0444 | Sequence Reconstruction | | Medium |
| 0445 | Add Two Numbers II | [JavaScript](./src/0445.add-two-numbers-ii.445/solution.js) [TypeScript](./src/0445.add-two-numbers-ii.445/solution.ts) | Medium |
| 0446 | Arithmetic Slices II - Subsequence | [JavaScript](./src/0446.arithmetic-slices-ii-subsequence.446/solution.js) | Hard |
| 0447 | Number of Boomerangs | [JavaScript](./src/0447.number-of-boomerangs.447/solution.js) | Medium |
| 0448 | Find All Numbers Disappeared in an Array | [JavaScript](./src/0448.find-all-numbers-disappeared-in-an-array.448/solution.js) [TypeScript](./src/0448.find-all-numbers-disappeared-in-an-array.448/solution.ts) | Easy |
| 0449 | Serialize and Deserialize BST | [JavaScript](./src/0449.serialize-and-deserialize-bst.449/solution.js) [TypeScript](./src/0449.serialize-and-deserialize-bst.449/solution.ts) | Medium |
| 0450 | Delete Node in a BST | [JavaScript](./src/0450.delete-node-in-a-bst.450/solution.js) [TypeScript](./src/0450.delete-node-in-a-bst.450/solution.ts) | Medium |
| 0451 | Sort Characters By Frequency | [JavaScript](./src/0451.sort-characters-by-frequency.451/solution.js) [TypeScript](./src/0451.sort-characters-by-frequency.451/solution.ts) | Medium |
| 0452 | Minimum Number of Arrows to Burst Balloons | | Medium |
| 0453 | Minimum Moves to Equal Array Elements | | Medium |
| 0454 | 4Sum II | [JavaScript](./src/0454.4sum-ii.454/solution.js) | Medium |
| 0455 | Assign Cookies | [JavaScript](./src/0455.assign-cookies.455/solution.js) [TypeScript](./src/0455.assign-cookies.455/solution.ts) | Easy |
| 0456 | 132 Pattern | [JavaScript](./src/0456.132-pattern.456/solution.js) | Medium |
| 0457 | Circular Array Loop | | Medium |
| 0458 | Poor Pigs | | Hard |
| 0459 | Repeated Substring Pattern | [JavaScript](./src/0459.repeated-substring-pattern.459/solution.js) [TypeScript](./src/0459.repeated-substring-pattern.459/solution.ts) | Easy |
| 0460 | LFU Cache | [JavaScript](./src/0460.lfu-cache.460/solution.js) | Hard |
| 0461 | Hamming Distance | [JavaScript](./src/0461.hamming-distance.461/solution.js) [TypeScript](./src/0461.hamming-distance.461/solution.ts) | Easy |
| 0462 | Minimum Moves to Equal Array Elements II | [TypeScript](./src/0462.minimum-moves-to-equal-array-elements-ii.462/solution.ts) | Medium |
| 0463 | Island Perimeter | [JavaScript](./src/0463.island-perimeter.463/solution.js) [TypeScript](./src/0463.island-perimeter.463/solution.ts) | Easy |
| 0464 | Can I Win | | Medium |
| 0465 | Optimal Account Balancing | | Hard |
| 0466 | Count The Repetitions | | Hard |
| 0467 | Unique Substrings in Wraparound String | [TypeScript](./src/0467.unique-substrings-in-wraparound-string.467/solution.ts) | Medium |
| 0468 | Validate IP Address | [JavaScript](./src/0468.validate-ip-address.468/solution.js) | Medium |
| 0469 | Convex Polygon | | Medium |
| 0470 | Implement Rand10() Using Rand7() | [Java](./src/0470.implement-rand10-using-rand7.903/solution.java) [JavaScript](./src/0470.implement-rand10-using-rand7.903/solution.js) [TypeScript](./src/0470.implement-rand10-using-rand7.903/solution.ts) | Medium |
| 0471 | Encode String with Shortest Length | | Hard |
| 0472 | Concatenated Words | | Hard |
| 0473 | Matchsticks to Square | [JavaScript](./src/0473.matchsticks-to-square.473/solution.js) | Medium |
| 0474 | Ones and Zeroes | [JavaScript](./src/0474.ones-and-zeroes.474/solution.js) | Medium |
| 0475 | Heaters | [JavaScript](./src/0475.heaters.475/solution.js) | Medium |
| 0476 | Number Complement | [JavaScript](./src/0476.number-complement.476/solution.js) [TypeScript](./src/0476.number-complement.476/solution.ts) | Easy |
| 0477 | Total Hamming Distance | [JavaScript](./src/0477.total-hamming-distance.477/solution.js) | Medium |
| 0478 | Generate Random Point in a Circle | [JavaScript](./src/0478.generate-random-point-in-a-circle.915/solution.js) [TypeScript](./src/0478.generate-random-point-in-a-circle.915/solution.ts) | Medium |
| 0479 | Largest Palindrome Product | [JavaScript](./src/0479.largest-palindrome-product.479/solution.js) [TypeScript](./src/0479.largest-palindrome-product.479/solution.ts) | Hard |
| 0480 | Sliding Window Median | [JavaScript](./src/0480.sliding-window-median.480/solution.js) | Hard |
| 0481 | Magical String | [TypeScript](./src/0481.magical-string.481/solution.ts) | Medium |
| 0482 | License Key Formatting | [JavaScript](./src/0482.license-key-formatting.482/solution.js) [TypeScript](./src/0482.license-key-formatting.482/solution.ts) | Easy |
| 0483 | Smallest Good Base | | Hard |
| 0484 | Find Permutation | | Medium |
| 0485 | Max Consecutive Ones | [Java](./src/0485.max-consecutive-ones.485/solution.java) [JavaScript](./src/0485.max-consecutive-ones.485/solution.js) [TypeScript](./src/0485.max-consecutive-ones.485/solution.ts) | Easy |
| 0486 | Predict the Winner | [JavaScript](./src/0486.predict-the-winner.486/solution.js) | Medium |
| 0487 | Max Consecutive Ones II | [JavaScript](./src/0487.max-consecutive-ones-ii.487/solution.js) | Medium |
| 0488 | Zuma Game | | Hard |
| 0489 | Robot Room Cleaner | | Hard |
| 0490 | The Maze | | Medium |
| 0491 | Non-decreasing Subsequences | [JavaScript](./src/0491.non-decreasing-subsequences.491/solution.js) | Medium |
| 0492 | Construct the Rectangle | [JavaScript](./src/0492.construct-the-rectangle.492/solution.js) [TypeScript](./src/0492.construct-the-rectangle.492/solution.ts) | Easy |
| 0493 | Reverse Pairs | [JavaScript](./src/0493.reverse-pairs.493/solution.js) | Hard |
| 0494 | Target Sum | [JavaScript](./src/0494.target-sum.494/solution.js) | Medium |
| 0495 | Teemo Attacking | [JavaScript](./src/0495.teemo-attacking.495/solution.js) [TypeScript](./src/0495.teemo-attacking.495/solution.ts) | Easy |
| 0496 | Next Greater Element I | [JavaScript](./src/0496.next-greater-element-i.496/solution.js) [TypeScript](./src/0496.next-greater-element-i.496/solution.ts) | Easy |
| 0497 | Random Point in Non-overlapping Rectangles | [JavaScript](./src/0497.random-point-in-non-overlapping-rectangles.914/solution.js) | Medium |
| 0498 | Diagonal Traverse | [JavaScript](./src/0498.diagonal-traverse.498/solution.js) | Medium |
| 0499 | The Maze III | | Hard |
| 0500 | Keyboard Row | [Java](./src/0500.keyboard-row.500/solution.java) [JavaScript](./src/0500.keyboard-row.500/solution.js) [TypeScript](./src/0500.keyboard-row.500/solution.ts) | Easy |
| 0501 | Find Mode in Binary Search Tree | [JavaScript](./src/0501.find-mode-in-binary-search-tree.501/solution.js) [TypeScript](./src/0501.find-mode-in-binary-search-tree.501/solution.ts) | Easy |
| 0502 | IPO | [TypeScript](./src/0502.ipo.502/solution.ts) | Hard |
| 0503 | Next Greater Element II | [JavaScript](./src/0503.next-greater-element-ii.503/solution.js) [TypeScript](./src/0503.next-greater-element-ii.503/solution.ts) | Medium |
| 0504 | Base 7 | [Java](./src/0504.base-7.504/solution.java) [JavaScript](./src/0504.base-7.504/solution.js) [TypeScript](./src/0504.base-7.504/solution.ts) | Easy |
| 0505 | The Maze II | | Medium |
| 0506 | Relative Ranks | [JavaScript](./src/0506.relative-ranks.506/solution.js) [TypeScript](./src/0506.relative-ranks.506/solution.ts) | Easy |
| 0507 | Perfect Number | [JavaScript](./src/0507.perfect-number.507/solution.js) [TypeScript](./src/0507.perfect-number.507/solution.ts) | Easy |
| 0508 | Most Frequent Subtree Sum | [JavaScript](./src/0508.most-frequent-subtree-sum.508/solution.js) [TypeScript](./src/0508.most-frequent-subtree-sum.508/solution.ts) | Medium |
| 0509 | Fibonacci Number | [Java](./src/0509.fibonacci-number.1013/solution.java) [JavaScript](./src/0509.fibonacci-number.1013/solution.js) [TypeScript](./src/0509.fibonacci-number.1013/solution.ts) | Easy |
| 0510 | Inorder Successor in BST II | [JavaScript](./src/0510.inorder-successor-in-bst-ii.509/solution.js) [TypeScript](./src/0510.inorder-successor-in-bst-ii.509/solution.ts) | Medium |
| 0511 | Game Play Analysis I | | Easy |
| 0512 | Game Play Analysis II | | Easy |
| 0513 | Find Bottom Left Tree Value | [JavaScript](./src/0513.find-bottom-left-tree-value.513/solution.js) [TypeScript](./src/0513.find-bottom-left-tree-value.513/solution.ts) | Medium |
| 0514 | Freedom Trail | | Hard |
| 0515 | Find Largest Value in Each Tree Row | [Java](./src/0515.find-largest-value-in-each-tree-row.515/solution.java) [JavaScript](./src/0515.find-largest-value-in-each-tree-row.515/solution.js) [TypeScript](./src/0515.find-largest-value-in-each-tree-row.515/solution.ts) | Medium |
| 0516 | Longest Palindromic Subsequence | [TypeScript](./src/0516.longest-palindromic-subsequence.516/solution.ts) | Medium |
| 0517 | Super Washing Machines | | Hard |
| 0518 | Coin Change II | [JavaScript](./src/0518.coin-change-ii.518/solution.js) [TypeScript](./src/0518.coin-change-ii.518/solution.ts) | Medium |
| 0519 | Random Flip Matrix | [JavaScript](./src/0519.random-flip-matrix.913/solution.js) | Medium |
| 0520 | Detect Capital | [Java](./src/0520.detect-capital.520/solution.java) [JavaScript](./src/0520.detect-capital.520/solution.js) [TypeScript](./src/0520.detect-capital.520/solution.ts) | Easy |
| 0521 | Longest Uncommon Subsequence I | [Java](./src/0521.longest-uncommon-subsequence-i.521/solution.java) [JavaScript](./src/0521.longest-uncommon-subsequence-i.521/solution.js) [TypeScript](./src/0521.longest-uncommon-subsequence-i.521/solution.ts) | Easy |
| 0522 | Longest Uncommon Subsequence II | [JavaScript](./src/0522.longest-uncommon-subsequence-ii.522/solution.js) | Medium |
| 0523 | Continuous Subarray Sum | [JavaScript](./src/0523.continuous-subarray-sum.523/solution.js) | Medium |
| 0524 | Longest Word in Dictionary through Deleting | [JavaScript](./src/0524.longest-word-in-dictionary-through-deleting.524/solution.js) | Medium |
| 0525 | Contiguous Array | [JavaScript](./src/0525.contiguous-array.525/solution.js) | Medium |
| 0526 | Beautiful Arrangement | [JavaScript](./src/0526.beautiful-arrangement.526/solution.js) | Medium |
| 0527 | Word Abbreviation | | Hard |
| 0528 | Random Pick with Weight | [JavaScript](./src/0528.random-pick-with-weight.912/solution.js) | Medium |
| 0529 | Minesweeper | [JavaScript](./src/0529.minesweeper.529/solution.js) | Medium |
| 0530 | Minimum Absolute Difference in BST | [Java](./src/0530.minimum-absolute-difference-in-bst.530/solution.java) [JavaScript](./src/0530.minimum-absolute-difference-in-bst.530/solution.js) [TypeScript](./src/0530.minimum-absolute-difference-in-bst.530/solution.ts) | Easy |
| 0531 | Lonely Pixel I | [JavaScript](./src/0531.lonely-pixel-i.531/solution.js) | Medium |
| 0532 | K-diff Pairs in an Array | [JavaScript](./src/0532.k-diff-pairs-in-an-array.532/solution.js) | Medium |
| 0533 | Lonely Pixel II | | Medium |
| 0534 | Game Play Analysis III | | Medium |
| 0535 | Encode and Decode TinyURL | [JavaScript](./src/0535.encode-and-decode-tinyurl.535/solution.js) [TypeScript](./src/0535.encode-and-decode-tinyurl.535/solution.ts) | Medium |
| 0536 | Construct Binary Tree from String | [JavaScript](./src/0536.construct-binary-tree-from-string.536/solution.js) | Medium |
| 0537 | Complex Number Multiplication | [JavaScript](./src/0537.complex-number-multiplication.537/solution.js) [TypeScript](./src/0537.complex-number-multiplication.537/solution.ts) | Medium |
| 0538 | Convert BST to Greater Tree | [Java](./src/0538.convert-bst-to-greater-tree.538/solution.java) [JavaScript](./src/0538.convert-bst-to-greater-tree.538/solution.js) [TypeScript](./src/0538.convert-bst-to-greater-tree.538/solution.ts) | Medium |
| 0539 | Minimum Time Difference | [Java](./src/0539.minimum-time-difference.539/solution.java) [JavaScript](./src/0539.minimum-time-difference.539/solution.js) [TypeScript](./src/0539.minimum-time-difference.539/solution.ts) | Medium |
| 0540 | Single Element in a Sorted Array | [JavaScript](./src/0540.single-element-in-a-sorted-array.540/solution.js) [TypeScript](./src/0540.single-element-in-a-sorted-array.540/solution.ts) | Medium |
| 0541 | Reverse String II | [Java](./src/0541.reverse-string-ii.541/solution.java) [JavaScript](./src/0541.reverse-string-ii.541/solution.js) [TypeScript](./src/0541.reverse-string-ii.541/solution.ts) | Easy |
| 0542 | 01 Matrix | [JavaScript](./src/0542.01-matrix.542/solution.js) | Medium |
| 0543 | Diameter of Binary Tree | [JavaScript](./src/0543.diameter-of-binary-tree.543/solution.js) [TypeScript](./src/0543.diameter-of-binary-tree.543/solution.ts) | Easy |
| 0544 | Output Contest Matches | | Medium |
| 0545 | Boundary of Binary Tree | | Medium |
| 0546 | Remove Boxes | | Hard |
| 0547 | Number of Provinces | [JavaScript](./src/0547.number-of-provinces.547/solution.js) [TypeScript](./src/0547.number-of-provinces.547/solution.ts) | Medium |
| 0548 | Split Array with Equal Sum | | Hard |
| 0549 | Binary Tree Longest Consecutive Sequence II | [JavaScript](./src/0549.binary-tree-longest-consecutive-sequence-ii.549/solution.js) | Medium |
| 0550 | Game Play Analysis IV | | Medium |
| 0551 | Student Attendance Record I | [JavaScript](./src/0551.student-attendance-record-i.551/solution.js) [TypeScript](./src/0551.student-attendance-record-i.551/solution.ts) | Easy |
| 0552 | Student Attendance Record II | [JavaScript](./src/0552.student-attendance-record-ii.552/solution.js) | Hard |
| 0553 | Optimal Division | | Medium |
| 0554 | Brick Wall | [JavaScript](./src/0554.brick-wall.554/solution.js) | Medium |
| 0555 | Split Concatenated Strings | | Medium |
| 0556 | Next Greater Element III | [JavaScript](./src/0556.next-greater-element-iii.556/solution.js) | Medium |
| 0557 | Reverse Words in a String III | [Java](./src/0557.reverse-words-in-a-string-iii.557/solution.java) [JavaScript](./src/0557.reverse-words-in-a-string-iii.557/solution.js) [TypeScript](./src/0557.reverse-words-in-a-string-iii.557/solution.ts) | Easy |
| 0558 | Logical OR of Two Binary Grids Represented as Quad-Trees | [JavaScript](./src/0558.logical-or-of-two-binary-grids-represented-as-quad-trees.773/solution.js) | Medium |
| 0559 | Maximum Depth of N-ary Tree | [Java](./src/0559.maximum-depth-of-n-ary-tree.774/solution.java) [JavaScript](./src/0559.maximum-depth-of-n-ary-tree.774/solution.js) [TypeScript](./src/0559.maximum-depth-of-n-ary-tree.774/solution.ts) | Easy |
| 0560 | Subarray Sum Equals K | [JavaScript](./src/0560.subarray-sum-equals-k.560/solution.js) [TypeScript](./src/0560.subarray-sum-equals-k.560/solution.ts) | Medium |
| 0561 | Array Partition | [Java](./src/0561.array-partition.561/solution.java) [JavaScript](./src/0561.array-partition.561/solution.js) [TypeScript](./src/0561.array-partition.561/solution.ts) | Easy |
| 0562 | Longest Line of Consecutive One in Matrix | | Medium |
| 0563 | Binary Tree Tilt | [JavaScript](./src/0563.binary-tree-tilt.563/solution.js) [TypeScript](./src/0563.binary-tree-tilt.563/solution.ts) | Easy |
| 0564 | Find the Closest Palindrome | | Hard |
| 0565 | Array Nesting | [JavaScript](./src/0565.array-nesting.565/solution.js) | Medium |
| 0566 | Reshape the Matrix | [Java](./src/0566.reshape-the-matrix.566/solution.java) [JavaScript](./src/0566.reshape-the-matrix.566/solution.js) [TypeScript](./src/0566.reshape-the-matrix.566/solution.ts) | Easy |
| 0567 | Permutation in String | [JavaScript](./src/0567.permutation-in-string.567/solution.js) [TypeScript](./src/0567.permutation-in-string.567/solution.ts) | Medium |
| 0568 | Maximum Vacation Days | | Hard |
| 0569 | Median Employee Salary | | Hard |
| 0570 | Managers with at Least 5 Direct Reports | | Medium |
| 0571 | Find Median Given Frequency of Numbers | | Hard |
| 0572 | Subtree of Another Tree | [JavaScript](./src/0572.subtree-of-another-tree.572/solution.js) [TypeScript](./src/0572.subtree-of-another-tree.572/solution.ts) | Easy |
| 0573 | Squirrel Simulation | | Medium |
| 0574 | Winning Candidate | | Medium |
| 0575 | Distribute Candies | [JavaScript](./src/0575.distribute-candies.575/solution.js) [TypeScript](./src/0575.distribute-candies.575/solution.ts) | Easy |
| 0576 | Out of Boundary Paths | [JavaScript](./src/0576.out-of-boundary-paths.576/solution.js) | Medium |
| 0577 | Employee Bonus | | Easy |
| 0578 | Get Highest Answer Rate Question | | Medium |
| 0579 | Find Cumulative Salary of an Employee | | Hard |
| 0580 | Count Student Number in Departments | | Medium |
| 0581 | Shortest Unsorted Continuous Subarray | [JavaScript](./src/0581.shortest-unsorted-continuous-subarray.581/solution.js) | Medium |
| 0582 | Kill Process | [JavaScript](./src/0582.kill-process.582/solution.js) | Medium |
| 0583 | Delete Operation for Two Strings | [JavaScript](./src/0583.delete-operation-for-two-strings.583/solution.js) | Medium |
| 0584 | Find Customer Referee | | Easy |
| 0585 | Investments in 2016 | | Medium |
| 0586 | Customer Placing the Largest Number of Orders | | Easy |
| 0587 | Erect the Fence | | Hard |
| 0588 | Design In-Memory File System | | Hard |
| 0589 | N-ary Tree Preorder Traversal | [Java](./src/0589.n-ary-tree-preorder-traversal.775/solution.java) [JavaScript](./src/0589.n-ary-tree-preorder-traversal.775/solution.js) [TypeScript](./src/0589.n-ary-tree-preorder-traversal.775/solution.ts) | Easy |
| 0590 | N-ary Tree Postorder Traversal | [Java](./src/0590.n-ary-tree-postorder-traversal.776/solution.java) [JavaScript](./src/0590.n-ary-tree-postorder-traversal.776/solution.js) [TypeScript](./src/0590.n-ary-tree-postorder-traversal.776/solution.ts) | Easy |
| 0591 | Tag Validator | | Hard |
| 0592 | Fraction Addition and Subtraction | [JavaScript](./src/0592.fraction-addition-and-subtraction.592/solution.js) | Medium |
| 0593 | Valid Square | [JavaScript](./src/0593.valid-square.593/solution.js) [TypeScript](./src/0593.valid-square.593/solution.ts) | Medium |
| 0594 | Longest Harmonious Subsequence | [JavaScript](./src/0594.longest-harmonious-subsequence.594/solution.js) [TypeScript](./src/0594.longest-harmonious-subsequence.594/solution.ts) | Easy |
| 0595 | Big Countries | [Mysql](./src/0595.big-countries.595/solution.sql) | Easy |
| 0596 | Classes More Than 5 Students | [Mysql](./src/0596.classes-more-than-5-students.596/solution.sql) | Easy |
| 0597 | Friend Requests I: Overall Acceptance Rate | | Easy |
| 0598 | Range Addition II | [JavaScript](./src/0598.range-addition-ii.598/solution.js) [TypeScript](./src/0598.range-addition-ii.598/solution.ts) | Easy |
| 0599 | Minimum Index Sum of Two Lists | [JavaScript](./src/0599.minimum-index-sum-of-two-lists.599/solution.js) [TypeScript](./src/0599.minimum-index-sum-of-two-lists.599/solution.ts) | Easy |
| 0600 | Non-negative Integers without Consecutive Ones | | Hard |
| 0601 | Human Traffic of Stadium | | Hard |
| 0602 | Friend Requests II: Who Has the Most Friends | | Medium |
| 0603 | Consecutive Available Seats | | Easy |
| 0604 | Design Compressed String Iterator | [JavaScript](./src/0604.design-compressed-string-iterator.604/solution.js) [TypeScript](./src/0604.design-compressed-string-iterator.604/solution.ts) | Easy |
| 0605 | Can Place Flowers | [JavaScript](./src/0605.can-place-flowers.605/solution.js) [TypeScript](./src/0605.can-place-flowers.605/solution.ts) | Easy |
| 0606 | Construct String from Binary Tree | [JavaScript](./src/0606.construct-string-from-binary-tree.606/solution.js) [TypeScript](./src/0606.construct-string-from-binary-tree.606/solution.ts) | Medium |
| 0607 | Sales Person | | Easy |
| 0608 | Tree Node | | Medium |
| 0609 | Find Duplicate File in System | [JavaScript](./src/0609.find-duplicate-file-in-system.609/solution.js) | Medium |
| 0610 | Triangle Judgement | | Easy |
| 0611 | Valid Triangle Number | [JavaScript](./src/0611.valid-triangle-number.611/solution.js) | Medium |
| 0612 | Shortest Distance in a Plane | | Medium |
| 0613 | Shortest Distance in a Line | | Easy |
| 0614 | Second Degree Follower | | Medium |
| 0615 | Average Salary: Departments VS Company | | Hard |
| 0616 | Add Bold Tag in String | [JavaScript](./src/0616.add-bold-tag-in-string.616/solution.js) | Medium |
| 0617 | Merge Two Binary Trees | [Java](./src/0617.merge-two-binary-trees.617/solution.java) [JavaScript](./src/0617.merge-two-binary-trees.617/solution.js) [TypeScript](./src/0617.merge-two-binary-trees.617/solution.ts) | Easy |
| 0618 | Students Report By Geography | | Hard |
| 0619 | Biggest Single Number | | Easy |
| 0620 | Not Boring Movies | [Mysql](./src/0620.not-boring-movies.620/solution.sql) | Easy |
| 0621 | Task Scheduler | | Medium |
| 0622 | Design Circular Queue | [JavaScript](./src/0622.design-circular-queue.860/solution.js) | Medium |
| 0623 | Add One Row to Tree | [JavaScript](./src/0623.add-one-row-to-tree.623/solution.js) [TypeScript](./src/0623.add-one-row-to-tree.623/solution.ts) | Medium |
| 0624 | Maximum Distance in Arrays | [JavaScript](./src/0624.maximum-distance-in-arrays.624/solution.js) | Medium |
| 0625 | Minimum Factorization | | Medium |
| 0626 | Exchange Seats | [Mysql](./src/0626.exchange-seats.626/solution.sql) | Medium |
| 0627 | Swap Salary | [Mysql](./src/0627.swap-salary.627/solution.sql) | Easy |
| 0628 | Maximum Product of Three Numbers | [Java](./src/0628.maximum-product-of-three-numbers.628/solution.java) [JavaScript](./src/0628.maximum-product-of-three-numbers.628/solution.js) [TypeScript](./src/0628.maximum-product-of-three-numbers.628/solution.ts) | Easy |
| 0629 | K Inverse Pairs Array | | Hard |
| 0630 | Course Schedule III | | Hard |
| 0631 | Design Excel Sum Formula | | Hard |
| 0632 | Smallest Range Covering Elements from K Lists | | Hard |
| 0633 | Sum of Square Numbers | [JavaScript](./src/0633.sum-of-square-numbers.633/solution.js) [TypeScript](./src/0633.sum-of-square-numbers.633/solution.ts) | Medium |
| 0634 | Find the Derangement of An Array | | Medium |
| 0635 | Design Log Storage System | | Medium |
| 0636 | Exclusive Time of Functions | [JavaScript](./src/0636.exclusive-time-of-functions.636/solution.js) | Medium |
| 0637 | Average of Levels in Binary Tree | [Java](./src/0637.average-of-levels-in-binary-tree.637/solution.java) [JavaScript](./src/0637.average-of-levels-in-binary-tree.637/solution.js) [TypeScript](./src/0637.average-of-levels-in-binary-tree.637/solution.ts) | Easy |
| 0638 | Shopping Offers | | Medium |
| 0639 | Decode Ways II | [TypeScript](./src/0639.decode-ways-ii.639/solution.ts) | Hard |
| 0640 | Solve the Equation | [JavaScript](./src/0640.solve-the-equation.640/solution.js) | Medium |
| 0641 | Design Circular Deque | [JavaScript](./src/0641.design-circular-deque.859/solution.js) | Medium |
| 0642 | Design Search Autocomplete System | | Hard |
| 0643 | Maximum Average Subarray I | [JavaScript](./src/0643.maximum-average-subarray-i.643/solution.js) [TypeScript](./src/0643.maximum-average-subarray-i.643/solution.ts) | Easy |
| 0644 | Maximum Average Subarray II | | Hard |
| 0645 | Set Mismatch | [JavaScript](./src/0645.set-mismatch.645/solution.js) [TypeScript](./src/0645.set-mismatch.645/solution.ts) | Easy |
| 0646 | Maximum Length of Pair Chain | [JavaScript](./src/0646.maximum-length-of-pair-chain.646/solution.js) [TypeScript](./src/0646.maximum-length-of-pair-chain.646/solution.ts) | Medium |
| 0647 | Palindromic Substrings | [JavaScript](./src/0647.palindromic-substrings.647/solution.js) | Medium |
| 0648 | Replace Words | [JavaScript](./src/0648.replace-words.648/solution.js) | Medium |
| 0649 | Dota2 Senate | | Medium |
| 0650 | 2 Keys Keyboard | [JavaScript](./src/0650.2-keys-keyboard.650/solution.js) | Medium |
| 0651 | 4 Keys Keyboard | | Medium |
| 0652 | Find Duplicate Subtrees | [JavaScript](./src/0652.find-duplicate-subtrees.652/solution.js) | Medium |
| 0653 | Two Sum IV - Input is a BST | [JavaScript](./src/0653.two-sum-iv-input-is-a-bst.653/solution.js) [TypeScript](./src/0653.two-sum-iv-input-is-a-bst.653/solution.ts) | Easy |
| 0654 | Maximum Binary Tree | [JavaScript](./src/0654.maximum-binary-tree.654/solution.js) [TypeScript](./src/0654.maximum-binary-tree.654/solution.ts) | Medium |
| 0655 | Print Binary Tree | [JavaScript](./src/0655.print-binary-tree.655/solution.js) [TypeScript](./src/0655.print-binary-tree.655/solution.ts) | Medium |
| 0656 | Coin Path | | Hard |
| 0657 | Robot Return to Origin | [Java](./src/0657.robot-return-to-origin.657/solution.java) [JavaScript](./src/0657.robot-return-to-origin.657/solution.js) [TypeScript](./src/0657.robot-return-to-origin.657/solution.ts) | Easy |
| 0658 | Find K Closest Elements | [JavaScript](./src/0658.find-k-closest-elements.658/solution.js) [TypeScript](./src/0658.find-k-closest-elements.658/solution.ts) | Medium |
| 0659 | Split Array into Consecutive Subsequences | | Medium |
| 0660 | Remove 9 | | Hard |
| 0661 | Image Smoother | [Java](./src/0661.image-smoother.661/solution.java) [JavaScript](./src/0661.image-smoother.661/solution.js) [TypeScript](./src/0661.image-smoother.661/solution.ts) | Easy |
| 0662 | Maximum Width of Binary Tree | [JavaScript](./src/0662.maximum-width-of-binary-tree.662/solution.js) [TypeScript](./src/0662.maximum-width-of-binary-tree.662/solution.ts) | Medium |
| 0663 | Equal Tree Partition | | Medium |
| 0664 | Strange Printer | | Hard |
| 0665 | Non-decreasing Array | [JavaScript](./src/0665.non-decreasing-array.665/solution.js) [TypeScript](./src/0665.non-decreasing-array.665/solution.ts) | Medium |
| 0666 | Path Sum IV | [JavaScript](./src/0666.path-sum-iv.666/solution.js) | Medium |
| 0667 | Beautiful Arrangement II | | Medium |
| 0668 | Kth Smallest Number in Multiplication Table | | Hard |
| 0669 | Trim a Binary Search Tree | [Java](./src/0669.trim-a-binary-search-tree.669/solution.java) [JavaScript](./src/0669.trim-a-binary-search-tree.669/solution.js) [TypeScript](./src/0669.trim-a-binary-search-tree.669/solution.ts) | Medium |
| 0670 | Maximum Swap | [JavaScript](./src/0670.maximum-swap.670/solution.js) | Medium |
| 0671 | Second Minimum Node In a Binary Tree | [JavaScript](./src/0671.second-minimum-node-in-a-binary-tree.671/solution.js) [TypeScript](./src/0671.second-minimum-node-in-a-binary-tree.671/solution.ts) | Easy |
| 0672 | Bulb Switcher II | | Medium |
| 0673 | Number of Longest Increasing Subsequence | [JavaScript](./src/0673.number-of-longest-increasing-subsequence.673/solution.js) | Medium |
| 0674 | Longest Continuous Increasing Subsequence | [Java](./src/0674.longest-continuous-increasing-subsequence.674/solution.java) [JavaScript](./src/0674.longest-continuous-increasing-subsequence.674/solution.js) [TypeScript](./src/0674.longest-continuous-increasing-subsequence.674/solution.ts) | Easy |
| 0675 | Cut Off Trees for Golf Event | | Hard |
| 0676 | Implement Magic Dictionary | [JavaScript](./src/0676.implement-magic-dictionary.676/solution.js) | Medium |
| 0677 | Map Sum Pairs | [JavaScript](./src/0677.map-sum-pairs.677/solution.js) | Medium |
| 0678 | Valid Parenthesis String | [JavaScript](./src/0678.valid-parenthesis-string.678/solution.js) | Medium |
| 0679 | 24 Game | | Hard |
| 0680 | Valid Palindrome II | [Java](./src/0680.valid-palindrome-ii.680/solution.java) [JavaScript](./src/0680.valid-palindrome-ii.680/solution.js) [TypeScript](./src/0680.valid-palindrome-ii.680/solution.ts) | Easy |
| 0681 | Next Closest Time | [JavaScript](./src/0681.next-closest-time.681/solution.js) | Medium |
| 0682 | Baseball Game | [Java](./src/0682.baseball-game.682/solution.java) [JavaScript](./src/0682.baseball-game.682/solution.js) [TypeScript](./src/0682.baseball-game.682/solution.ts) | Easy |
| 0683 | K Empty Slots | | Hard |
| 0684 | Redundant Connection | [JavaScript](./src/0684.redundant-connection.684/solution.js) | Medium |
| 0685 | Redundant Connection II | | Hard |
| 0686 | Repeated String Match | [JavaScript](./src/0686.repeated-string-match.686/solution.js) | Medium |
| 0687 | Longest Univalue Path | [JavaScript](./src/0687.longest-univalue-path.687/solution.js) [TypeScript](./src/0687.longest-univalue-path.687/solution.ts) | Medium |
| 0688 | Knight Probability in Chessboard | | Medium |
| 0689 | Maximum Sum of 3 Non-Overlapping Subarrays | | Hard |
| 0690 | Employee Importance | [JavaScript](./src/0690.employee-importance.690/solution.js) [Python3](./src/0690.employee-importance.690/solution.py) [TypeScript](./src/0690.employee-importance.690/solution.ts) | Medium |
| 0691 | Stickers to Spell Word | | Hard |
| 0692 | Top K Frequent Words | [JavaScript](./src/0692.top-k-frequent-words.692/solution.js) | Medium |
| 0693 | Binary Number with Alternating Bits | [Java](./src/0693.binary-number-with-alternating-bits.693/solution.java) [JavaScript](./src/0693.binary-number-with-alternating-bits.693/solution.js) [TypeScript](./src/0693.binary-number-with-alternating-bits.693/solution.ts) | Easy |
| 0694 | Number of Distinct Islands | | Medium |
| 0695 | Max Area of Island | [Java](./src/0695.max-area-of-island.695/solution.java) [JavaScript](./src/0695.max-area-of-island.695/solution.js) [TypeScript](./src/0695.max-area-of-island.695/solution.ts) | Medium |
| 0696 | Count Binary Substrings | [JavaScript](./src/0696.count-binary-substrings.696/solution.js) [TypeScript](./src/0696.count-binary-substrings.696/solution.ts) | Easy |
| 0697 | Degree of an Array | [JavaScript](./src/0697.degree-of-an-array.697/solution.js) [TypeScript](./src/0697.degree-of-an-array.697/solution.ts) | Easy |
| 0698 | Partition to K Equal Sum Subsets | | Medium |
| 0699 | Falling Squares | [TypeScript](./src/0699.falling-squares.699/solution.ts) | Hard |
| 0700 | Search in a Binary Search Tree | [Go](./src/0700.search-in-a-binary-search-tree.783/solution.go) [Java](./src/0700.search-in-a-binary-search-tree.783/solution.java) [JavaScript](./src/0700.search-in-a-binary-search-tree.783/solution.js) [TypeScript](./src/0700.search-in-a-binary-search-tree.783/solution.ts) | Easy |
| 0701 | Insert into a Binary Search Tree | [Java](./src/0701.insert-into-a-binary-search-tree.784/solution.java) [JavaScript](./src/0701.insert-into-a-binary-search-tree.784/solution.js) [TypeScript](./src/0701.insert-into-a-binary-search-tree.784/solution.ts) | Medium |
| 0702 | Search in a Sorted Array of Unknown Size | [JavaScript](./src/0702.search-in-a-sorted-array-of-unknown-size.786/solution.js) [TypeScript](./src/0702.search-in-a-sorted-array-of-unknown-size.786/solution.ts) | Medium |
| 0703 | Kth Largest Element in a Stream | [JavaScript](./src/0703.kth-largest-element-in-a-stream.789/solution.js) [TypeScript](./src/0703.kth-largest-element-in-a-stream.789/solution.ts) | Easy |
| 0704 | Binary Search | [Java](./src/0704.binary-search.792/solution.java) [JavaScript](./src/0704.binary-search.792/solution.js) [TypeScript](./src/0704.binary-search.792/solution.ts) | Easy |
| 0705 | Design HashSet | [JavaScript](./src/0705.design-hashset.816/solution.js) | Easy |
| 0706 | Design HashMap | [JavaScript](./src/0706.design-hashmap.817/solution.js) | Easy |
| 0707 | Design Linked List | [JavaScript](./src/0707.design-linked-list.838/solution.js) [TypeScript](./src/0707.design-linked-list.838/solution.ts) | Medium |
| 0708 | Insert into a Sorted Circular Linked List | [JavaScript](./src/0708.insert-into-a-sorted-circular-linked-list.850/solution.js) | Medium |
| 0709 | To Lower Case | [Java](./src/0709.to-lower-case.742/solution.java) [JavaScript](./src/0709.to-lower-case.742/solution.js) [TypeScript](./src/0709.to-lower-case.742/solution.ts) | Easy |
| 0710 | Random Pick with Blacklist | [JavaScript](./src/0710.random-pick-with-blacklist.894/solution.js) | Hard |
| 0711 | Number of Distinct Islands II | | Hard |
| 0712 | Minimum ASCII Delete Sum for Two Strings | [JavaScript](./src/0712.minimum-ascii-delete-sum-for-two-strings.712/solution.js) | Medium |
| 0713 | Subarray Product Less Than K | [JavaScript](./src/0713.subarray-product-less-than-k.713/solution.js) | Medium |
| 0714 | Best Time to Buy and Sell Stock with Transaction Fee | [JavaScript](./src/0714.best-time-to-buy-and-sell-stock-with-transaction-fee.714/solution.js) | Medium |
| 0715 | Range Module | [JavaScript](./src/0715.range-module.715/solution.js) | Hard |
| 0716 | Max Stack | [JavaScript](./src/0716.max-stack.716/solution.js) [TypeScript](./src/0716.max-stack.716/solution.ts) | Hard |
| 0717 | 1-bit and 2-bit Characters | [JavaScript](./src/0717.1-bit-and-2-bit-characters.717/solution.js) [TypeScript](./src/0717.1-bit-and-2-bit-characters.717/solution.ts) | Easy |
| 0718 | Maximum Length of Repeated Subarray | [JavaScript](./src/0718.maximum-length-of-repeated-subarray.718/solution.js) | Medium |
| 0719 | Find K-th Smallest Pair Distance | | Hard |
| 0720 | Longest Word in Dictionary | [JavaScript](./src/0720.longest-word-in-dictionary.720/solution.js) | Medium |
| 0721 | Accounts Merge | [JavaScript](./src/0721.accounts-merge.721/solution.js) | Medium |
| 0722 | Remove Comments | [JavaScript](./src/0722.remove-comments.722/solution.js) | Medium |
| 0723 | Candy Crush | | Medium |
| 0724 | Find Pivot Index | [JavaScript](./src/0724.find-pivot-index.724/solution.js) [TypeScript](./src/0724.find-pivot-index.724/solution.ts) | Easy |
| 0725 | Split Linked List in Parts | [JavaScript](./src/0725.split-linked-list-in-parts.725/solution.js) | Medium |
| 0726 | Number of Atoms | [JavaScript](./src/0726.number-of-atoms.726/solution.js) | Hard |
| 0727 | Minimum Window Subsequence | | Hard |
| 0728 | Self Dividing Numbers | [Java](./src/0728.self-dividing-numbers.728/solution.java) [JavaScript](./src/0728.self-dividing-numbers.728/solution.js) [TypeScript](./src/0728.self-dividing-numbers.728/solution.ts) | Easy |
| 0729 | My Calendar I | [JavaScript](./src/0729.my-calendar-i.729/solution.js) | Medium |
| 0730 | Count Different Palindromic Subsequences | | Hard |
| 0731 | My Calendar II | [TypeScript](./src/0731.my-calendar-ii.731/solution.ts) | Medium |
| 0732 | My Calendar III | [TypeScript](./src/0732.my-calendar-iii.732/solution.ts) | Hard |
| 0733 | Flood Fill | [JavaScript](./src/0733.flood-fill.733/solution.js) [TypeScript](./src/0733.flood-fill.733/solution.ts) | Easy |
| 0734 | Sentence Similarity | [JavaScript](./src/0734.sentence-similarity.734/solution.js) [TypeScript](./src/0734.sentence-similarity.734/solution.ts) | Easy |
| 0735 | Asteroid Collision | [Java](./src/0735.asteroid-collision.735/solution.java) [JavaScript](./src/0735.asteroid-collision.735/solution.js) [TypeScript](./src/0735.asteroid-collision.735/solution.ts) | Medium |
| 0736 | Parse Lisp Expression | | Hard |
| 0737 | Sentence Similarity II | [JavaScript](./src/0737.sentence-similarity-ii.737/solution.js) [TypeScript](./src/0737.sentence-similarity-ii.737/solution.ts) | Medium |
| 0738 | Monotone Increasing Digits | [JavaScript](./src/0738.monotone-increasing-digits.738/solution.js) | Medium |
| 0739 | Daily Temperatures | [JavaScript](./src/0739.daily-temperatures.739/solution.js) [TypeScript](./src/0739.daily-temperatures.739/solution.ts) | Medium |
| 0740 | Delete and Earn | [JavaScript](./src/0740.delete-and-earn.740/solution.js) | Medium |
| 0741 | Cherry Pickup | | Hard |
| 0742 | Closest Leaf in a Binary Tree | [JavaScript](./src/0742.closest-leaf-in-a-binary-tree.743/solution.js) [TypeScript](./src/0742.closest-leaf-in-a-binary-tree.743/solution.ts) | Medium |
| 0743 | Network Delay Time | [JavaScript](./src/0743.network-delay-time.744/solution.js) | Medium |
| 0744 | Find Smallest Letter Greater Than Target | [Java](./src/0744.find-smallest-letter-greater-than-target.745/solution.java) [JavaScript](./src/0744.find-smallest-letter-greater-than-target.745/solution.js) [TypeScript](./src/0744.find-smallest-letter-greater-than-target.745/solution.ts) | Easy |
| 0745 | Prefix and Suffix Search | [TypeScript](./src/0745.prefix-and-suffix-search.746/solution.ts) | Hard |
| 0746 | Min Cost Climbing Stairs | [Java](./src/0746.min-cost-climbing-stairs.747/solution.java) [JavaScript](./src/0746.min-cost-climbing-stairs.747/solution.js) [TypeScript](./src/0746.min-cost-climbing-stairs.747/solution.ts) | Easy |
| 0747 | Largest Number At Least Twice of Others | [Java](./src/0747.largest-number-at-least-twice-of-others.748/solution.java) [JavaScript](./src/0747.largest-number-at-least-twice-of-others.748/solution.js) [TypeScript](./src/0747.largest-number-at-least-twice-of-others.748/solution.ts) | Easy |
| 0748 | Shortest Completing Word | [JavaScript](./src/0748.shortest-completing-word.749/solution.js) [TypeScript](./src/0748.shortest-completing-word.749/solution.ts) | Easy |
| 0749 | Contain Virus | | Hard |
| 0750 | Number Of Corner Rectangles | | Medium |
| 0751 | IP to CIDR | | Medium |
| 0752 | Open the Lock | [JavaScript](./src/0752.open-the-lock.753/solution.js) | Medium |
| 0753 | Cracking the Safe | | Hard |
| 0754 | Reach a Number | | Medium |
| 0755 | Pour Water | | Medium |
| 0756 | Pyramid Transition Matrix | [JavaScript](./src/0756.pyramid-transition-matrix.757/solution.js) | Medium |
| 0757 | Set Intersection Size At Least Two | | Hard |
| 0758 | Bold Words in String | [JavaScript](./src/0758.bold-words-in-string.760/solution.js) | Medium |
| 0759 | Employee Free Time | | Hard |
| 0760 | Find Anagram Mappings | [JavaScript](./src/0760.find-anagram-mappings.762/solution.js) [TypeScript](./src/0760.find-anagram-mappings.762/solution.ts) | Easy |
| 0761 | Special Binary String | | Hard |
| 0762 | Prime Number of Set Bits in Binary Representation | [JavaScript](./src/0762.prime-number-of-set-bits-in-binary-representation.767/solution.js) [TypeScript](./src/0762.prime-number-of-set-bits-in-binary-representation.767/solution.ts) | Easy |
| 0763 | Partition Labels | [JavaScript](./src/0763.partition-labels.768/solution.js) [TypeScript](./src/0763.partition-labels.768/solution.ts) | Medium |
| 0764 | Largest Plus Sign | [TypeScript](./src/0764.largest-plus-sign.769/solution.ts) | Medium |
| 0765 | Couples Holding Hands | | Hard |
| 0766 | Toeplitz Matrix | [Java](./src/0766.toeplitz-matrix.777/solution.java) [JavaScript](./src/0766.toeplitz-matrix.777/solution.js) [TypeScript](./src/0766.toeplitz-matrix.777/solution.ts) | Easy |
| 0767 | Reorganize String | [JavaScript](./src/0767.reorganize-string.778/solution.js) | Medium |
| 0768 | Max Chunks To Make Sorted II | [JavaScript](./src/0768.max-chunks-to-make-sorted-ii.779/solution.js) | Hard |
| 0769 | Max Chunks To Make Sorted | [JavaScript](./src/0769.max-chunks-to-make-sorted.780/solution.js) | Medium |
| 0770 | Basic Calculator IV | | Hard |
| 0771 | Jewels and Stones | [Java](./src/0771.jewels-and-stones.782/solution.java) [JavaScript](./src/0771.jewels-and-stones.782/solution.js) [TypeScript](./src/0771.jewels-and-stones.782/solution.ts) | Easy |
| 0772 | Basic Calculator III | | Hard |
| 0773 | Sliding Puzzle | | Hard |
| 0774 | Minimize Max Distance to Gas Station | | Hard |
| 0775 | Global and Local Inversions | [JavaScript](./src/0775.global-and-local-inversions.790/solution.js) | Medium |
| 0776 | Split BST | | Medium |
| 0777 | Swap Adjacent in LR String | [JavaScript](./src/0777.swap-adjacent-in-lr-string.793/solution.js) | Medium |
| 0778 | Swim in Rising Water | | Hard |
| 0779 | K-th Symbol in Grammar | [JavaScript](./src/0779.k-th-symbol-in-grammar.795/solution.js) [TypeScript](./src/0779.k-th-symbol-in-grammar.795/solution.ts) | Medium |
| 0780 | Reaching Points | | Hard |
| 0781 | Rabbits in Forest | [JavaScript](./src/0781.rabbits-in-forest.797/solution.js) | Medium |
| 0782 | Transform to Chessboard | | Hard |
| 0783 | Minimum Distance Between BST Nodes | [Java](./src/0783.minimum-distance-between-bst-nodes.799/solution.java) [JavaScript](./src/0783.minimum-distance-between-bst-nodes.799/solution.js) [TypeScript](./src/0783.minimum-distance-between-bst-nodes.799/solution.ts) | Easy |
| 0784 | Letter Case Permutation | [Java](./src/0784.letter-case-permutation.800/solution.java) [JavaScript](./src/0784.letter-case-permutation.800/solution.js) [TypeScript](./src/0784.letter-case-permutation.800/solution.ts) | Medium |
| 0785 | Is Graph Bipartite? | [JavaScript](./src/0785.is-graph-bipartite.801/solution.js) [TypeScript](./src/0785.is-graph-bipartite.801/solution.ts) | Medium |
| 0786 | K-th Smallest Prime Fraction | | Medium |
| 0787 | Cheapest Flights Within K Stops | | Medium |
| 0788 | Rotated Digits | [JavaScript](./src/0788.rotated-digits.804/solution.js) | Medium |
| 0789 | Escape The Ghosts | [JavaScript](./src/0789.escape-the-ghosts.805/solution.js) [TypeScript](./src/0789.escape-the-ghosts.805/solution.ts) | Medium |
| 0790 | Domino and Tromino Tiling | | Medium |
| 0791 | Custom Sort String | [JavaScript](./src/0791.custom-sort-string.807/solution.js) [TypeScript](./src/0791.custom-sort-string.807/solution.ts) | Medium |
| 0792 | Number of Matching Subsequences | [JavaScript](./src/0792.number-of-matching-subsequences.808/solution.js) [TypeScript](./src/0792.number-of-matching-subsequences.808/solution.ts) | Medium |
| 0793 | Preimage Size of Factorial Zeroes Function | [TypeScript](./src/0793.preimage-size-of-factorial-zeroes-function.809/solution.ts) | Hard |
| 0794 | Valid Tic-Tac-Toe State | [JavaScript](./src/0794.valid-tic-tac-toe-state.810/solution.js) | Medium |
| 0795 | Number of Subarrays with Bounded Maximum | [JavaScript](./src/0795.number-of-subarrays-with-bounded-maximum.811/solution.js) | Medium |
| 0796 | Rotate String | [Java](./src/0796.rotate-string.812/solution.java) [JavaScript](./src/0796.rotate-string.812/solution.js) [TypeScript](./src/0796.rotate-string.812/solution.ts) | Easy |
| 0797 | All Paths From Source to Target | [JavaScript](./src/0797.all-paths-from-source-to-target.813/solution.js) [TypeScript](./src/0797.all-paths-from-source-to-target.813/solution.ts) | Medium |
| 0798 | Smallest Rotation with Highest Score | | Hard |
| 0799 | Champagne Tower | [JavaScript](./src/0799.champagne-tower.815/solution.js) | Medium |
| 0800 | Similar RGB Color | [JavaScript](./src/0800.similar-rgb-color.818/solution.js) [TypeScript](./src/0800.similar-rgb-color.818/solution.ts) | Easy |
| 0801 | Minimum Swaps To Make Sequences Increasing | | Hard |
| 0802 | Find Eventual Safe States | [JavaScript](./src/0802.find-eventual-safe-states.820/solution.js) | Medium |
| 0803 | Bricks Falling When Hit | | Hard |
| 0804 | Unique Morse Code Words | [Java](./src/0804.unique-morse-code-words.822/solution.java) [JavaScript](./src/0804.unique-morse-code-words.822/solution.js) [TypeScript](./src/0804.unique-morse-code-words.822/solution.ts) | Easy |
| 0805 | Split Array With Same Average | | Hard |
| 0806 | Number of Lines To Write String | [Java](./src/0806.number-of-lines-to-write-string.824/solution.java) [JavaScript](./src/0806.number-of-lines-to-write-string.824/solution.js) [TypeScript](./src/0806.number-of-lines-to-write-string.824/solution.ts) | Easy |
| 0807 | Max Increase to Keep City Skyline | [JavaScript](./src/0807.max-increase-to-keep-city-skyline.825/solution.js) [TypeScript](./src/0807.max-increase-to-keep-city-skyline.825/solution.ts) | Medium |
| 0808 | Soup Servings | | Medium |
| 0809 | Expressive Words | [JavaScript](./src/0809.expressive-words.827/solution.js) | Medium |
| 0810 | Chalkboard XOR Game | | Hard |
| 0811 | Subdomain Visit Count | [JavaScript](./src/0811.subdomain-visit-count.829/solution.js) [TypeScript](./src/0811.subdomain-visit-count.829/solution.ts) | Medium |
| 0812 | Largest Triangle Area | [JavaScript](./src/0812.largest-triangle-area.830/solution.js) | Easy |
| 0813 | Largest Sum of Averages | [JavaScript](./src/0813.largest-sum-of-averages.831/solution.js) | Medium |
| 0814 | Binary Tree Pruning | [Java](./src/0814.binary-tree-pruning.832/solution.java) [JavaScript](./src/0814.binary-tree-pruning.832/solution.js) [TypeScript](./src/0814.binary-tree-pruning.832/solution.ts) | Medium |
| 0815 | Bus Routes | | Hard |
| 0816 | Ambiguous Coordinates | [JavaScript](./src/0816.ambiguous-coordinates.834/solution.js) | Medium |
| 0817 | Linked List Components | [JavaScript](./src/0817.linked-list-components.835/solution.js) | Medium |
| 0818 | Race Car | | Hard |
| 0819 | Most Common Word | [JavaScript](./src/0819.most-common-word.837/solution.js) [TypeScript](./src/0819.most-common-word.837/solution.ts) | Easy |
| 0820 | Short Encoding of Words | [JavaScript](./src/0820.short-encoding-of-words.839/solution.js) | Medium |
| 0821 | Shortest Distance to a Character | [Java](./src/0821.shortest-distance-to-a-character.841/solution.java) [JavaScript](./src/0821.shortest-distance-to-a-character.841/solution.js) [TypeScript](./src/0821.shortest-distance-to-a-character.841/solution.ts) | Easy |
| 0822 | Card Flipping Game | [JavaScript](./src/0822.card-flipping-game.842/solution.js) | Medium |
| 0823 | Binary Trees With Factors | [JavaScript](./src/0823.binary-trees-with-factors.843/solution.js) | Medium |
| 0824 | Goat Latin | [JavaScript](./src/0824.goat-latin.851/solution.js) [TypeScript](./src/0824.goat-latin.851/solution.ts) | Easy |
| 0825 | Friends Of Appropriate Ages | [JavaScript](./src/0825.friends-of-appropriate-ages.852/solution.js) | Medium |
| 0826 | Most Profit Assigning Work | [JavaScript](./src/0826.most-profit-assigning-work.853/solution.js) | Medium |
| 0827 | Making A Large Island | | Hard |
| 0828 | Count Unique Characters of All Substrings of a Given String | | Hard |
| 0829 | Consecutive Numbers Sum | [TypeScript](./src/0829.consecutive-numbers-sum.856/solution.ts) | Hard |
| 0830 | Positions of Large Groups | [Java](./src/0830.positions-of-large-groups.857/solution.java) [JavaScript](./src/0830.positions-of-large-groups.857/solution.js) [TypeScript](./src/0830.positions-of-large-groups.857/solution.ts) | Easy |
| 0831 | Masking Personal Information | [JavaScript](./src/0831.masking-personal-information.858/solution.js) | Medium |
| 0832 | Flipping an Image | [Java](./src/0832.flipping-an-image.861/solution.java) [JavaScript](./src/0832.flipping-an-image.861/solution.js) [TypeScript](./src/0832.flipping-an-image.861/solution.ts) | Easy |
| 0833 | Find And Replace in String | [JavaScript](./src/0833.find-and-replace-in-string.862/solution.js) | Medium |
| 0834 | Sum of Distances in Tree | [JavaScript](./src/0834.sum-of-distances-in-tree.863/solution.js) | Hard |
| 0835 | Image Overlap | | Medium |
| 0836 | Rectangle Overlap | [JavaScript](./src/0836.rectangle-overlap.866/solution.js) | Easy |
| 0837 | New 21 Game | | Medium |
| 0838 | Push Dominoes | [JavaScript](./src/0838.push-dominoes.868/solution.js) | Medium |
| 0839 | Similar String Groups | | Hard |
| 0840 | Magic Squares In Grid | [JavaScript](./src/0840.magic-squares-in-grid.870/solution.js) | Medium |
| 0841 | Keys and Rooms | [JavaScript](./src/0841.keys-and-rooms.871/solution.js) | Medium |
| 0842 | Split Array into Fibonacci Sequence | [JavaScript](./src/0842.split-array-into-fibonacci-sequence.872/solution.js) | Medium |
| 0843 | Guess the Word | | Hard |
| 0844 | Backspace String Compare | [Java](./src/0844.backspace-string-compare.874/solution.java) [JavaScript](./src/0844.backspace-string-compare.874/solution.js) [TypeScript](./src/0844.backspace-string-compare.874/solution.ts) | Easy |
| 0845 | Longest Mountain in Array | [JavaScript](./src/0845.longest-mountain-in-array.875/solution.js) | Medium |
| 0846 | Hand of Straights | [JavaScript](./src/0846.hand-of-straights.876/solution.js) [TypeScript](./src/0846.hand-of-straights.876/solution.ts) | Medium |
| 0847 | Shortest Path Visiting All Nodes | | Hard |
| 0848 | Shifting Letters | [JavaScript](./src/0848.shifting-letters.878/solution.js) [TypeScript](./src/0848.shifting-letters.878/solution.ts) | Medium |
| 0849 | Maximize Distance to Closest Person | [JavaScript](./src/0849.maximize-distance-to-closest-person.879/solution.js) [TypeScript](./src/0849.maximize-distance-to-closest-person.879/solution.ts) | Medium |
| 0850 | Rectangle Area II | | Hard |
| 0851 | Loud and Rich | [JavaScript](./src/0851.loud-and-rich.881/solution.js) | Medium |
| 0852 | Peak Index in a Mountain Array | [JavaScript](./src/0852.peak-index-in-a-mountain-array.882/solution.js) [TypeScript](./src/0852.peak-index-in-a-mountain-array.882/solution.ts) | Medium |
| 0853 | Car Fleet | [JavaScript](./src/0853.car-fleet.883/solution.js) | Medium |
| 0854 | K-Similar Strings | | Hard |
| 0855 | Exam Room | | Medium |
| 0856 | Score of Parentheses | [JavaScript](./src/0856.score-of-parentheses.886/solution.js) [TypeScript](./src/0856.score-of-parentheses.886/solution.ts) | Medium |
| 0857 | Minimum Cost to Hire K Workers | | Hard |
| 0858 | Mirror Reflection | | Medium |
| 0859 | Buddy Strings | [JavaScript](./src/0859.buddy-strings.889/solution.js) [TypeScript](./src/0859.buddy-strings.889/solution.ts) | Easy |
| 0860 | Lemonade Change | [Java](./src/0860.lemonade-change.890/solution.java) [JavaScript](./src/0860.lemonade-change.890/solution.js) [TypeScript](./src/0860.lemonade-change.890/solution.ts) | Easy |
| 0861 | Score After Flipping Matrix | [JavaScript](./src/0861.score-after-flipping-matrix.891/solution.js) [TypeScript](./src/0861.score-after-flipping-matrix.891/solution.ts) | Medium |
| 0862 | Shortest Subarray with Sum at Least K | [JavaScript](./src/0862.shortest-subarray-with-sum-at-least-k.892/solution.js) | Hard |
| 0863 | All Nodes Distance K in Binary Tree | [JavaScript](./src/0863.all-nodes-distance-k-in-binary-tree.893/solution.js) [TypeScript](./src/0863.all-nodes-distance-k-in-binary-tree.893/solution.ts) | Medium |
| 0864 | Shortest Path to Get All Keys | | Hard |
| 0865 | Smallest Subtree with all the Deepest Nodes | [JavaScript](./src/0865.smallest-subtree-with-all-the-deepest-nodes.896/solution.js) [TypeScript](./src/0865.smallest-subtree-with-all-the-deepest-nodes.896/solution.ts) | Medium |
| 0866 | Prime Palindrome | [JavaScript](./src/0866.prime-palindrome.897/solution.js) [TypeScript](./src/0866.prime-palindrome.897/solution.ts) | Medium |
| 0867 | Transpose Matrix | [Java](./src/0867.transpose-matrix.898/solution.java) [JavaScript](./src/0867.transpose-matrix.898/solution.js) [TypeScript](./src/0867.transpose-matrix.898/solution.ts) | Easy |
| 0868 | Binary Gap | [Java](./src/0868.binary-gap.899/solution.java) [JavaScript](./src/0868.binary-gap.899/solution.js) [TypeScript](./src/0868.binary-gap.899/solution.ts) | Easy |
| 0869 | Reordered Power of 2 | [JavaScript](./src/0869.reordered-power-of-2.900/solution.js) [TypeScript](./src/0869.reordered-power-of-2.900/solution.ts) | Medium |
| 0870 | Advantage Shuffle | [JavaScript](./src/0870.advantage-shuffle.901/solution.js) | Medium |
| 0871 | Minimum Number of Refueling Stops | | Hard |
| 0872 | Leaf-Similar Trees | [JavaScript](./src/0872.leaf-similar-trees.904/solution.js) [TypeScript](./src/0872.leaf-similar-trees.904/solution.ts) | Easy |
| 0873 | Length of Longest Fibonacci Subsequence | [JavaScript](./src/0873.length-of-longest-fibonacci-subsequence.905/solution.js) | Medium |
| 0874 | Walking Robot Simulation | [JavaScript](./src/0874.walking-robot-simulation.906/solution.js) | Medium |
| 0875 | Koko Eating Bananas | [Java](./src/0875.koko-eating-bananas.907/solution.java) [JavaScript](./src/0875.koko-eating-bananas.907/solution.js) | Medium |
| 0876 | Middle of the Linked List | [Go](./src/0876.middle-of-the-linked-list.908/solution.go) [Java](./src/0876.middle-of-the-linked-list.908/solution.java) [JavaScript](./src/0876.middle-of-the-linked-list.908/solution.js) [TypeScript](./src/0876.middle-of-the-linked-list.908/solution.ts) | Easy |
| 0877 | Stone Game | [JavaScript](./src/0877.stone-game.909/solution.js) | Medium |
| 0878 | Nth Magical Number | [TypeScript](./src/0878.nth-magical-number.910/solution.ts) | Hard |
| 0879 | Profitable Schemes | | Hard |
| 0880 | Decoded String at Index | [TypeScript](./src/0880.decoded-string-at-index.916/solution.ts) | Medium |
| 0881 | Boats to Save People | [JavaScript](./src/0881.boats-to-save-people.917/solution.js) | Medium |
| 0882 | Reachable Nodes In Subdivided Graph | | Hard |
| 0883 | Projection Area of 3D Shapes | [JavaScript](./src/0883.projection-area-of-3d-shapes.919/solution.js) | Easy |
| 0884 | Uncommon Words from Two Sentences | [Java](./src/0884.uncommon-words-from-two-sentences.920/solution.java) [JavaScript](./src/0884.uncommon-words-from-two-sentences.920/solution.js) [TypeScript](./src/0884.uncommon-words-from-two-sentences.920/solution.ts) | Easy |
| 0885 | Spiral Matrix III | [JavaScript](./src/0885.spiral-matrix-iii.921/solution.js) | Medium |
| 0886 | Possible Bipartition | [JavaScript](./src/0886.possible-bipartition.922/solution.js) | Medium |
| 0887 | Super Egg Drop | | Hard |
| 0888 | Fair Candy Swap | [JavaScript](./src/0888.fair-candy-swap.924/solution.js) [TypeScript](./src/0888.fair-candy-swap.924/solution.ts) | Easy |
| 0889 | Construct Binary Tree from Preorder and Postorder Traversal | [JavaScript](./src/0889.construct-binary-tree-from-preorder-and-postorder-traversal.925/solution.js) | Medium |
| 0890 | Find and Replace Pattern | [JavaScript](./src/0890.find-and-replace-pattern.926/solution.js) | Medium |
| 0891 | Sum of Subsequence Widths | [TypeScript](./src/0891.sum-of-subsequence-widths.927/solution.ts) | Hard |
| 0892 | Surface Area of 3D Shapes | [JavaScript](./src/0892.surface-area-of-3d-shapes.928/solution.js) | Easy |
| 0893 | Groups of Special-Equivalent Strings | [JavaScript](./src/0893.groups-of-special-equivalent-strings.929/solution.js) [TypeScript](./src/0893.groups-of-special-equivalent-strings.929/solution.ts) | Medium |
| 0894 | All Possible Full Binary Trees | [JavaScript](./src/0894.all-possible-full-binary-trees.930/solution.js) | Medium |
| 0895 | Maximum Frequency Stack | [JavaScript](./src/0895.maximum-frequency-stack.931/solution.js) [TypeScript](./src/0895.maximum-frequency-stack.931/solution.ts) | Hard |
| 0896 | Monotonic Array | [JavaScript](./src/0896.monotonic-array.932/solution.js) [TypeScript](./src/0896.monotonic-array.932/solution.ts) | Easy |
| 0897 | Increasing Order Search Tree | [JavaScript](./src/0897.increasing-order-search-tree.933/solution.js) [TypeScript](./src/0897.increasing-order-search-tree.933/solution.ts) | Easy |
| 0898 | Bitwise ORs of Subarrays | [TypeScript](./src/0898.bitwise-ors-of-subarrays.934/solution.ts) | Medium |
| 0899 | Orderly Queue | | Hard |
| 0900 | RLE Iterator | [JavaScript](./src/0900.rle-iterator.936/solution.js) [TypeScript](./src/0900.rle-iterator.936/solution.ts) | Medium |
| 0901 | Online Stock Span | [JavaScript](./src/0901.online-stock-span.937/solution.js) [TypeScript](./src/0901.online-stock-span.937/solution.ts) | Medium |
| 0902 | Numbers At Most N Given Digit Set | | Hard |
| 0903 | Valid Permutations for DI Sequence | | Hard |
| 0904 | Fruit Into Baskets | [JavaScript](./src/0904.fruit-into-baskets.940/solution.js) [TypeScript](./src/0904.fruit-into-baskets.940/solution.ts) | Medium |
| 0905 | Sort Array By Parity | [JavaScript](./src/0905.sort-array-by-parity.941/solution.js) [TypeScript](./src/0905.sort-array-by-parity.941/solution.ts) | Easy |
| 0906 | Super Palindromes | [TypeScript](./src/0906.super-palindromes.942/solution.ts) | Hard |
| 0907 | Sum of Subarray Minimums | [JavaScript](./src/0907.sum-of-subarray-minimums.943/solution.js) [TypeScript](./src/0907.sum-of-subarray-minimums.943/solution.ts) | Medium |
| 0908 | Smallest Range I | [JavaScript](./src/0908.smallest-range-i.944/solution.js) [TypeScript](./src/0908.smallest-range-i.944/solution.ts) | Easy |
| 0909 | Snakes and Ladders | | Medium |
| 0910 | Smallest Range II | | Medium |
| 0911 | Online Election | | Medium |
| 0912 | Sort an Array | [JavaScript](./src/0912.sort-an-array.948/solution.js) [TypeScript](./src/0912.sort-an-array.948/solution.ts) | Medium |
| 0913 | Cat and Mouse | | Hard |
| 0914 | X of a Kind in a Deck of Cards | [JavaScript](./src/0914.x-of-a-kind-in-a-deck-of-cards.950/solution.js) [TypeScript](./src/0914.x-of-a-kind-in-a-deck-of-cards.950/solution.ts) | Easy |
| 0915 | Partition Array into Disjoint Intervals | [JavaScript](./src/0915.partition-array-into-disjoint-intervals.951/solution.js) | Medium |
| 0916 | Word Subsets | [JavaScript](./src/0916.word-subsets.952/solution.js) | Medium |
| 0917 | Reverse Only Letters | [Java](./src/0917.reverse-only-letters.953/solution.java) [JavaScript](./src/0917.reverse-only-letters.953/solution.js) [TypeScript](./src/0917.reverse-only-letters.953/solution.ts) | Easy |
| 0918 | Maximum Sum Circular Subarray | [JavaScript](./src/0918.maximum-sum-circular-subarray.954/solution.js) | Medium |
| 0919 | Complete Binary Tree Inserter | [JavaScript](./src/0919.complete-binary-tree-inserter.955/solution.js) [TypeScript](./src/0919.complete-binary-tree-inserter.955/solution.ts) | Medium |
| 0920 | Number of Music Playlists | | Hard |
| 0921 | Minimum Add to Make Parentheses Valid | [JavaScript](./src/0921.minimum-add-to-make-parentheses-valid.957/solution.js) | Medium |
| 0922 | Sort Array By Parity II | [JavaScript](./src/0922.sort-array-by-parity-ii.958/solution.js) [TypeScript](./src/0922.sort-array-by-parity-ii.958/solution.ts) | Easy |
| 0923 | 3Sum With Multiplicity | [JavaScript](./src/0923.3sum-with-multiplicity.959/solution.js) | Medium |
| 0924 | Minimize Malware Spread | | Hard |
| 0925 | Long Pressed Name | [Java](./src/0925.long-pressed-name.961/solution.java) [JavaScript](./src/0925.long-pressed-name.961/solution.js) [TypeScript](./src/0925.long-pressed-name.961/solution.ts) | Easy |
| 0926 | Flip String to Monotone Increasing | [JavaScript](./src/0926.flip-string-to-monotone-increasing.962/solution.js) | Medium |
| 0927 | Three Equal Parts | | Hard |
| 0928 | Minimize Malware Spread II | | Hard |
| 0929 | Unique Email Addresses | [JavaScript](./src/0929.unique-email-addresses.965/solution.js) [TypeScript](./src/0929.unique-email-addresses.965/solution.ts) | Easy |
| 0930 | Binary Subarrays With Sum | [JavaScript](./src/0930.binary-subarrays-with-sum.966/solution.js) | Medium |
| 0931 | Minimum Falling Path Sum | [JavaScript](./src/0931.minimum-falling-path-sum.967/solution.js) [TypeScript](./src/0931.minimum-falling-path-sum.967/solution.ts) | Medium |
| 0932 | Beautiful Array | | Medium |
| 0933 | Number of Recent Calls | [JavaScript](./src/0933.number-of-recent-calls.969/solution.js) [TypeScript](./src/0933.number-of-recent-calls.969/solution.ts) | Easy |
| 0934 | Shortest Bridge | [JavaScript](./src/0934.shortest-bridge.971/solution.js) | Medium |
| 0935 | Knight Dialer | [JavaScript](./src/0935.knight-dialer.972/solution.js) | Medium |
| 0936 | Stamping The Sequence | | Hard |
| 0937 | Reorder Data in Log Files | [JavaScript](./src/0937.reorder-data-in-log-files.974/solution.js) | Medium |
| 0938 | Range Sum of BST | [Java](./src/0938.range-sum-of-bst.975/solution.java) [JavaScript](./src/0938.range-sum-of-bst.975/solution.js) [TypeScript](./src/0938.range-sum-of-bst.975/solution.ts) | Easy |
| 0939 | Minimum Area Rectangle | [JavaScript](./src/0939.minimum-area-rectangle.976/solution.js) | Medium |
| 0940 | Distinct Subsequences II | [JavaScript](./src/0940.distinct-subsequences-ii.977/solution.js) | Hard |
| 0941 | Valid Mountain Array | [Java](./src/0941.valid-mountain-array.978/solution.java) [JavaScript](./src/0941.valid-mountain-array.978/solution.js) [TypeScript](./src/0941.valid-mountain-array.978/solution.ts) | Easy |
| 0942 | DI String Match | [JavaScript](./src/0942.di-string-match.979/solution.js) | Easy |
| 0943 | Find the Shortest Superstring | | Hard |
| 0944 | Delete Columns to Make Sorted | [JavaScript](./src/0944.delete-columns-to-make-sorted.981/solution.js) [TypeScript](./src/0944.delete-columns-to-make-sorted.981/solution.ts) | Easy |
| 0945 | Minimum Increment to Make Array Unique | [JavaScript](./src/0945.minimum-increment-to-make-array-unique.982/solution.js) | Medium |
| 0946 | Validate Stack Sequences | [JavaScript](./src/0946.validate-stack-sequences.983/solution.js) [TypeScript](./src/0946.validate-stack-sequences.983/solution.ts) | Medium |
| 0947 | Most Stones Removed with Same Row or Column | [JavaScript](./src/0947.most-stones-removed-with-same-row-or-column.984/solution.js) | Medium |
| 0948 | Bag of Tokens | [JavaScript](./src/0948.bag-of-tokens.985/solution.js) | Medium |
| 0949 | Largest Time for Given Digits | [JavaScript](./src/0949.largest-time-for-given-digits.986/solution.js) | Medium |
| 0950 | Reveal Cards In Increasing Order | [JavaScript](./src/0950.reveal-cards-in-increasing-order.987/solution.js) | Medium |
| 0951 | Flip Equivalent Binary Trees | [Java](./src/0951.flip-equivalent-binary-trees.988/solution.java) [JavaScript](./src/0951.flip-equivalent-binary-trees.988/solution.js) [TypeScript](./src/0951.flip-equivalent-binary-trees.988/solution.ts) | Medium |
| 0952 | Largest Component Size by Common Factor | [TypeScript](./src/0952.largest-component-size-by-common-factor.989/solution.ts) | Hard |
| 0953 | Verifying an Alien Dictionary | [JavaScript](./src/0953.verifying-an-alien-dictionary.990/solution.js) [TypeScript](./src/0953.verifying-an-alien-dictionary.990/solution.ts) | Easy |
| 0954 | Array of Doubled Pairs | [JavaScript](./src/0954.array-of-doubled-pairs.991/solution.js) | Medium |
| 0955 | Delete Columns to Make Sorted II | [JavaScript](./src/0955.delete-columns-to-make-sorted-ii.992/solution.js) | Medium |
| 0956 | Tallest Billboard | | Hard |
| 0957 | Prison Cells After N Days | [JavaScript](./src/0957.prison-cells-after-n-days.994/solution.js) | Medium |
| 0958 | Check Completeness of a Binary Tree | [JavaScript](./src/0958.check-completeness-of-a-binary-tree.998/solution.js) [TypeScript](./src/0958.check-completeness-of-a-binary-tree.998/solution.ts) | Medium |
| 0959 | Regions Cut By Slashes | [JavaScript](./src/0959.regions-cut-by-slashes.999/solution.js) | Medium |
| 0960 | Delete Columns to Make Sorted III | | Hard |
| 0961 | N-Repeated Element in Size 2N Array | [JavaScript](./src/0961.n-repeated-element-in-size-2n-array.1001/solution.js) [TypeScript](./src/0961.n-repeated-element-in-size-2n-array.1001/solution.ts) | Easy |
| 0962 | Maximum Width Ramp | [JavaScript](./src/0962.maximum-width-ramp.1002/solution.js) [TypeScript](./src/0962.maximum-width-ramp.1002/solution.ts) | Medium |
| 0963 | Minimum Area Rectangle II | | Medium |
| 0964 | Least Operators to Express Number | | Hard |
| 0965 | Univalued Binary Tree | [Go](./src/0965.univalued-binary-tree.1005/solution.go) [Java](./src/0965.univalued-binary-tree.1005/solution.java) [JavaScript](./src/0965.univalued-binary-tree.1005/solution.js) [TypeScript](./src/0965.univalued-binary-tree.1005/solution.ts) | Easy |
| 0966 | Vowel Spellchecker | [JavaScript](./src/0966.vowel-spellchecker.1006/solution.js) | Medium |
| 0967 | Numbers With Same Consecutive Differences | [JavaScript](./src/0967.numbers-with-same-consecutive-differences.1007/solution.js) | Medium |
| 0968 | Binary Tree Cameras | [JavaScript](./src/0968.binary-tree-cameras.1008/solution.js) | Hard |
| 0969 | Pancake Sorting | [JavaScript](./src/0969.pancake-sorting.1009/solution.js) | Medium |
| 0970 | Powerful Integers | [JavaScript](./src/0970.powerful-integers.1010/solution.js) [TypeScript](./src/0970.powerful-integers.1010/solution.ts) | Medium |
| 0971 | Flip Binary Tree To Match Preorder Traversal | [JavaScript](./src/0971.flip-binary-tree-to-match-preorder-traversal.1011/solution.js) | Medium |
| 0972 | Equal Rational Numbers | [JavaScript](./src/0972.equal-rational-numbers.1012/solution.js) | Hard |
| 0973 | K Closest Points to Origin | [JavaScript](./src/0973.k-closest-points-to-origin.1014/solution.js) | Medium |
| 0974 | Subarray Sums Divisible by K | [JavaScript](./src/0974.subarray-sums-divisible-by-k.1016/solution.js) | Medium |
| 0975 | Odd Even Jump | [JavaScript](./src/0975.odd-even-jump.1017/solution.js) | Hard |
| 0976 | Largest Perimeter Triangle | [JavaScript](./src/0976.largest-perimeter-triangle.1018/solution.js) | Easy |
| 0977 | Squares of a Sorted Array | [JavaScript](./src/0977.squares-of-a-sorted-array.1019/solution.js) [TypeScript](./src/0977.squares-of-a-sorted-array.1019/solution.ts) | Easy |
| 0978 | Longest Turbulent Subarray | [JavaScript](./src/0978.longest-turbulent-subarray.1020/solution.js) [TypeScript](./src/0978.longest-turbulent-subarray.1020/solution.ts) | Medium |
| 0979 | Distribute Coins in Binary Tree | [JavaScript](./src/0979.distribute-coins-in-binary-tree.1021/solution.js) [TypeScript](./src/0979.distribute-coins-in-binary-tree.1021/solution.ts) | Medium |
| 0980 | Unique Paths III | | Hard |
| 0981 | Time Based Key-Value Store | [JavaScript](./src/0981.time-based-key-value-store.1023/solution.js) | Medium |
| 0982 | Triples with Bitwise AND Equal To Zero | | Hard |
| 0983 | Minimum Cost For Tickets | [JavaScript](./src/0983.minimum-cost-for-tickets.1025/solution.js) | Medium |
| 0984 | String Without AAA or BBB | [JavaScript](./src/0984.string-without-aaa-or-bbb.1026/solution.js) | Medium |
| 0985 | Sum of Even Numbers After Queries | [JavaScript](./src/0985.sum-of-even-numbers-after-queries.1027/solution.js) [TypeScript](./src/0985.sum-of-even-numbers-after-queries.1027/solution.ts) | Medium |
| 0986 | Interval List Intersections | [JavaScript](./src/0986.interval-list-intersections.1028/solution.js) | Medium |
| 0987 | Vertical Order Traversal of a Binary Tree | [JavaScript](./src/0987.vertical-order-traversal-of-a-binary-tree.1029/solution.js) [TypeScript](./src/0987.vertical-order-traversal-of-a-binary-tree.1029/solution.ts) | Hard |
| 0988 | Smallest String Starting From Leaf | [JavaScript](./src/0988.smallest-string-starting-from-leaf.1030/solution.js) [TypeScript](./src/0988.smallest-string-starting-from-leaf.1030/solution.ts) | Medium |
| 0989 | Add to Array-Form of Integer | [JavaScript](./src/0989.add-to-array-form-of-integer.1031/solution.js) [TypeScript](./src/0989.add-to-array-form-of-integer.1031/solution.ts) | Easy |
| 0990 | Satisfiability of Equality Equations | [JavaScript](./src/0990.satisfiability-of-equality-equations.1032/solution.js) | Medium |
| 0991 | Broken Calculator | | Medium |
| 0992 | Subarrays with K Different Integers | [JavaScript](./src/0992.subarrays-with-k-different-integers.1034/solution.js) | Hard |
| 0993 | Cousins in Binary Tree | [Go](./src/0993.cousins-in-binary-tree.1035/solution.go) [JavaScript](./src/0993.cousins-in-binary-tree.1035/solution.js) [TypeScript](./src/0993.cousins-in-binary-tree.1035/solution.ts) | Easy |
| 0994 | Rotting Oranges | [JavaScript](./src/0994.rotting-oranges.1036/solution.js) | Medium |
| 0995 | Minimum Number of K Consecutive Bit Flips | | Hard |
| 0996 | Number of Squareful Arrays | [TypeScript](./src/0996.number-of-squareful-arrays.1038/solution.ts) | Hard |
| 0997 | Find the Town Judge | [JavaScript](./src/0997.find-the-town-judge.1039/solution.js) [TypeScript](./src/0997.find-the-town-judge.1039/solution.ts) | Easy |
| 0998 | Maximum Binary Tree II | [JavaScript](./src/0998.maximum-binary-tree-ii.1040/solution.js) [TypeScript](./src/0998.maximum-binary-tree-ii.1040/solution.ts) | Medium |
| 0999 | Available Captures for Rook | [JavaScript](./src/0999.available-captures-for-rook.1041/solution.js) | Easy |
| 1000 | Minimum Cost to Merge Stones | | Hard |
| 1001 | Grid Illumination | [JavaScript](./src/1001.grid-illumination.1043/solution.js) | Hard |
| 1002 | Find Common Characters | [Java](./src/1002.find-common-characters.1044/solution.java) [JavaScript](./src/1002.find-common-characters.1044/solution.js) [TypeScript](./src/1002.find-common-characters.1044/solution.ts) | Easy |
| 1003 | Check If Word Is Valid After Substitutions | [JavaScript](./src/1003.check-if-word-is-valid-after-substitutions.1045/solution.js) [TypeScript](./src/1003.check-if-word-is-valid-after-substitutions.1045/solution.ts) | Medium |
| 1004 | Max Consecutive Ones III | [JavaScript](./src/1004.max-consecutive-ones-iii.1046/solution.js) | Medium |
| 1005 | Maximize Sum Of Array After K Negations | [JavaScript](./src/1005.maximize-sum-of-array-after-k-negations.1047/solution.js) [TypeScript](./src/1005.maximize-sum-of-array-after-k-negations.1047/solution.ts) | Easy |
| 1006 | Clumsy Factorial | [JavaScript](./src/1006.clumsy-factorial.1048/solution.js) [TypeScript](./src/1006.clumsy-factorial.1048/solution.ts) | Medium |
| 1007 | Minimum Domino Rotations For Equal Row | [JavaScript](./src/1007.minimum-domino-rotations-for-equal-row.1049/solution.js) | Medium |
| 1008 | Construct Binary Search Tree from Preorder Traversal | [JavaScript](./src/1008.construct-binary-search-tree-from-preorder-traversal.1050/solution.js) [TypeScript](./src/1008.construct-binary-search-tree-from-preorder-traversal.1050/solution.ts) | Medium |
| 1009 | Complement of Base 10 Integer | [JavaScript](./src/1009.complement-of-base-10-integer.1054/solution.js) [TypeScript](./src/1009.complement-of-base-10-integer.1054/solution.ts) | Easy |
| 1010 | Pairs of Songs With Total Durations Divisible by 60 | [JavaScript](./src/1010.pairs-of-songs-with-total-durations-divisible-by-60.1055/solution.js) [TypeScript](./src/1010.pairs-of-songs-with-total-durations-divisible-by-60.1055/solution.ts) | Medium |
| 1011 | Capacity To Ship Packages Within D Days | [JavaScript](./src/1011.capacity-to-ship-packages-within-d-days.1056/solution.js) | Medium |
| 1012 | Numbers With Repeated Digits | | Hard |
| 1013 | Partition Array Into Three Parts With Equal Sum | [JavaScript](./src/1013.partition-array-into-three-parts-with-equal-sum.1062/solution.js) [TypeScript](./src/1013.partition-array-into-three-parts-with-equal-sum.1062/solution.ts) | Easy |
| 1014 | Best Sightseeing Pair | [JavaScript](./src/1014.best-sightseeing-pair.1063/solution.js) | Medium |
| 1015 | Smallest Integer Divisible by K | [JavaScript](./src/1015.smallest-integer-divisible-by-k.1064/solution.js) [TypeScript](./src/1015.smallest-integer-divisible-by-k.1064/solution.ts) | Medium |
| 1016 | Binary String With Substrings Representing 1 To N | [JavaScript](./src/1016.binary-string-with-substrings-representing-1-to-n.1065/solution.js) [TypeScript](./src/1016.binary-string-with-substrings-representing-1-to-n.1065/solution.ts) | Medium |
| 1017 | Convert to Base -2 | [JavaScript](./src/1017.convert-to-base-2.1070/solution.js) | Medium |
| 1018 | Binary Prefix Divisible By 5 | [Java](./src/1018.binary-prefix-divisible-by-5.1071/solution.java) [JavaScript](./src/1018.binary-prefix-divisible-by-5.1071/solution.js) [TypeScript](./src/1018.binary-prefix-divisible-by-5.1071/solution.ts) | Easy |
| 1019 | Next Greater Node In Linked List | [JavaScript](./src/1019.next-greater-node-in-linked-list.1072/solution.js) [TypeScript](./src/1019.next-greater-node-in-linked-list.1072/solution.ts) | Medium |
| 1020 | Number of Enclaves | [JavaScript](./src/1020.number-of-enclaves.1073/solution.js) [TypeScript](./src/1020.number-of-enclaves.1073/solution.ts) | Medium |
| 1021 | Remove Outermost Parentheses | [JavaScript](./src/1021.remove-outermost-parentheses.1078/solution.js) [TypeScript](./src/1021.remove-outermost-parentheses.1078/solution.ts) | Easy |
| 1022 | Sum of Root To Leaf Binary Numbers | [Go](./src/1022.sum-of-root-to-leaf-binary-numbers.1079/solution.go) [Java](./src/1022.sum-of-root-to-leaf-binary-numbers.1079/solution.java) [JavaScript](./src/1022.sum-of-root-to-leaf-binary-numbers.1079/solution.js) [TypeScript](./src/1022.sum-of-root-to-leaf-binary-numbers.1079/solution.ts) | Easy |
| 1023 | Camelcase Matching | [JavaScript](./src/1023.camelcase-matching.1080/solution.js) | Medium |
| 1024 | Video Stitching | [JavaScript](./src/1024.video-stitching.1081/solution.js) | Medium |
| 1025 | Divisor Game | [JavaScript](./src/1025.divisor-game.1086/solution.js) [TypeScript](./src/1025.divisor-game.1086/solution.ts) | Easy |
| 1026 | Maximum Difference Between Node and Ancestor | [JavaScript](./src/1026.maximum-difference-between-node-and-ancestor.1092/solution.js) [TypeScript](./src/1026.maximum-difference-between-node-and-ancestor.1092/solution.ts) | Medium |
| 1027 | Longest Arithmetic Subsequence | [JavaScript](./src/1027.longest-arithmetic-subsequence.1087/solution.js) | Medium |
| 1028 | Recover a Tree From Preorder Traversal | [JavaScript](./src/1028.recover-a-tree-from-preorder-traversal.1093/solution.js) | Hard |
| 1029 | Two City Scheduling | [JavaScript](./src/1029.two-city-scheduling.1095/solution.js) [TypeScript](./src/1029.two-city-scheduling.1095/solution.ts) | Medium |
| 1030 | Matrix Cells in Distance Order | [JavaScript](./src/1030.matrix-cells-in-distance-order.1094/solution.js) [TypeScript](./src/1030.matrix-cells-in-distance-order.1094/solution.ts) | Easy |
| 1031 | Maximum Sum of Two Non-Overlapping Subarrays | [JavaScript](./src/1031.maximum-sum-of-two-non-overlapping-subarrays.1096/solution.js) | Medium |
| 1032 | Stream of Characters | [JavaScript](./src/1032.stream-of-characters.1097/solution.js) | Hard |
| 1033 | Moving Stones Until Consecutive | [JavaScript](./src/1033.moving-stones-until-consecutive.1103/solution.js) [TypeScript](./src/1033.moving-stones-until-consecutive.1103/solution.ts) | Medium |
| 1034 | Coloring A Border | [JavaScript](./src/1034.coloring-a-border.1104/solution.js) | Medium |
| 1035 | Uncrossed Lines | | Medium |
| 1036 | Escape a Large Maze | | Hard |
| 1037 | Valid Boomerang | [JavaScript](./src/1037.valid-boomerang.1115/solution.js) [TypeScript](./src/1037.valid-boomerang.1115/solution.ts) | Easy |
| 1038 | Binary Search Tree to Greater Sum Tree | [Java](./src/1038.binary-search-tree-to-greater-sum-tree.1114/solution.java) [JavaScript](./src/1038.binary-search-tree-to-greater-sum-tree.1114/solution.js) [TypeScript](./src/1038.binary-search-tree-to-greater-sum-tree.1114/solution.ts) | Medium |
| 1039 | Minimum Score Triangulation of Polygon | | Medium |
| 1040 | Moving Stones Until Consecutive II | | Medium |
| 1041 | Robot Bounded In Circle | [JavaScript](./src/1041.robot-bounded-in-circle.1119/solution.js) | Medium |
| 1042 | Flower Planting With No Adjacent | | Medium |
| 1043 | Partition Array for Maximum Sum | [JavaScript](./src/1043.partition-array-for-maximum-sum.1121/solution.js) | Medium |
| 1044 | Longest Duplicate Substring | | Hard |
| 1045 | Customers Who Bought All Products | | Medium |
| 1046 | Last Stone Weight | [JavaScript](./src/1046.last-stone-weight.1127/solution.js) [TypeScript](./src/1046.last-stone-weight.1127/solution.ts) | Easy |
| 1047 | Remove All Adjacent Duplicates In String | [Java](./src/1047.remove-all-adjacent-duplicates-in-string.1128/solution.java) [JavaScript](./src/1047.remove-all-adjacent-duplicates-in-string.1128/solution.js) [TypeScript](./src/1047.remove-all-adjacent-duplicates-in-string.1128/solution.ts) | Easy |
| 1048 | Longest String Chain | [JavaScript](./src/1048.longest-string-chain.1129/solution.js) | Medium |
| 1049 | Last Stone Weight II | [JavaScript](./src/1049.last-stone-weight-ii.1130/solution.js) | Medium |
| 1050 | Actors and Directors Who Cooperated At Least Three Times | | Easy |
| 1051 | Height Checker | [Java](./src/1051.height-checker.1137/solution.java) [JavaScript](./src/1051.height-checker.1137/solution.js) [TypeScript](./src/1051.height-checker.1137/solution.ts) | Easy |
| 1052 | Grumpy Bookstore Owner | [JavaScript](./src/1052.grumpy-bookstore-owner.1138/solution.js) | Medium |
| 1053 | Previous Permutation With One Swap | [JavaScript](./src/1053.previous-permutation-with-one-swap.1139/solution.js) | Medium |
| 1054 | Distant Barcodes | [JavaScript](./src/1054.distant-barcodes.1140/solution.js) | Medium |
| 1055 | Shortest Way to Form String | | Medium |
| 1056 | Confusing Number | [JavaScript](./src/1056.confusing-number.1069/solution.js) [TypeScript](./src/1056.confusing-number.1069/solution.ts) | Easy |
| 1057 | Campus Bikes | | Medium |
| 1058 | Minimize Rounding Error to Meet Target | | Medium |
| 1059 | All Paths from Source Lead to Destination | | Medium |
| 1060 | Missing Element in Sorted Array | [JavaScript](./src/1060.missing-element-in-sorted-array.1059/solution.js) [TypeScript](./src/1060.missing-element-in-sorted-array.1059/solution.ts) | Medium |
| 1061 | Lexicographically Smallest Equivalent String | [TypeScript](./src/1061.lexicographically-smallest-equivalent-string.1058/solution.ts) | Medium |
| 1062 | Longest Repeating Substring | | Medium |
| 1063 | Number of Valid Subarrays | | Hard |
| 1064 | Fixed Point | [JavaScript](./src/1064.fixed-point.1066/solution.js) [TypeScript](./src/1064.fixed-point.1066/solution.ts) | Easy |
| 1065 | Index Pairs of a String | [JavaScript](./src/1065.index-pairs-of-a-string.1075/solution.js) [TypeScript](./src/1065.index-pairs-of-a-string.1075/solution.ts) | Easy |
| 1066 | Campus Bikes II | | Medium |
| 1067 | Digit Count in Range | | Hard |
| 1068 | Product Sales Analysis I | | Easy |
| 1069 | Product Sales Analysis II | | Easy |
| 1070 | Product Sales Analysis III | | Medium |
| 1071 | Greatest Common Divisor of Strings | [Java](./src/1071.greatest-common-divisor-of-strings.1146/solution.java) [JavaScript](./src/1071.greatest-common-divisor-of-strings.1146/solution.js) | Easy |
| 1072 | Flip Columns For Maximum Number of Equal Rows | | Medium |
| 1073 | Adding Two Negabinary Numbers | | Medium |
| 1074 | Number of Submatrices That Sum to Target | | Hard |
| 1075 | Project Employees I | | Easy |
| 1076 | Project Employees II | | Easy |
| 1077 | Project Employees III | | Medium |
| 1078 | Occurrences After Bigram | [Java](./src/1078.occurrences-after-bigram.1156/solution.java) [JavaScript](./src/1078.occurrences-after-bigram.1156/solution.js) [TypeScript](./src/1078.occurrences-after-bigram.1156/solution.ts) | Easy |
| 1079 | Letter Tile Possibilities | [JavaScript](./src/1079.letter-tile-possibilities.1160/solution.js) | Medium |
| 1080 | Insufficient Nodes in Root to Leaf Paths | [JavaScript](./src/1080.insufficient-nodes-in-root-to-leaf-paths.1157/solution.js) | Medium |
| 1081 | Smallest Subsequence of Distinct Characters | [JavaScript](./src/1081.smallest-subsequence-of-distinct-characters.1159/solution.js) [TypeScript](./src/1081.smallest-subsequence-of-distinct-characters.1159/solution.ts) | Medium |
| 1082 | Sales Analysis I | | Easy |
| 1083 | Sales Analysis II | | Easy |
| 1084 | Sales Analysis III | | Easy |
| 1085 | Sum of Digits in the Minimum Number | [JavaScript](./src/1085.sum-of-digits-in-the-minimum-number.1082/solution.js) [TypeScript](./src/1085.sum-of-digits-in-the-minimum-number.1082/solution.ts) | Easy |
| 1086 | High Five | [JavaScript](./src/1086.high-five.1074/solution.js) | Easy |
| 1087 | Brace Expansion | [JavaScript](./src/1087.brace-expansion.1076/solution.js) | Medium |
| 1088 | Confusing Number II | | Hard |
| 1089 | Duplicate Zeros | [Java](./src/1089.duplicate-zeros.1168/solution.java) [JavaScript](./src/1089.duplicate-zeros.1168/solution.js) [TypeScript](./src/1089.duplicate-zeros.1168/solution.ts) | Easy |
| 1090 | Largest Values From Labels | [JavaScript](./src/1090.largest-values-from-labels.1169/solution.js) | Medium |
| 1091 | Shortest Path in Binary Matrix | [JavaScript](./src/1091.shortest-path-in-binary-matrix.1171/solution.js) | Medium |
| 1092 | Shortest Common Supersequence | [JavaScript](./src/1092.shortest-common-supersequence.1170/solution.js) | Hard |
| 1093 | Statistics from a Large Sample | [JavaScript](./src/1093.statistics-from-a-large-sample.1183/solution.js) | Medium |
| 1094 | Car Pooling | [JavaScript](./src/1094.car-pooling.1184/solution.js) | Medium |
| 1095 | Find in Mountain Array | [JavaScript](./src/1095.find-in-mountain-array.1185/solution.js) [Python3](./src/1095.find-in-mountain-array.1185/solution.py) | Hard |
| 1096 | Brace Expansion II | [JavaScript](./src/1096.brace-expansion-ii.1188/solution.js) | Hard |
| 1097 | Game Play Analysis V | | Hard |
| 1098 | Unpopular Books | | Medium |
| 1099 | Two Sum Less Than K | [JavaScript](./src/1099.two-sum-less-than-k.1083/solution.js) [TypeScript](./src/1099.two-sum-less-than-k.1083/solution.ts) | Easy |
| 1100 | Find K-Length Substrings With No Repeated Characters | [JavaScript](./src/1100.find-k-length-substrings-with-no-repeated-characters.1084/solution.js) | Medium |
| 1101 | The Earliest Moment When Everyone Become Friends | [JavaScript](./src/1101.the-earliest-moment-when-everyone-become-friends.1085/solution.js) | Medium |
| 1102 | Path With Maximum Minimum Value | | Medium |
| 1103 | Distribute Candies to People | [JavaScript](./src/1103.distribute-candies-to-people.1195/solution.js) | Easy |
| 1104 | Path In Zigzag Labelled Binary Tree | [JavaScript](./src/1104.path-in-zigzag-labelled-binary-tree.1194/solution.js) | Medium |
| 1105 | Filling Bookcase Shelves | | Medium |
| 1106 | Parsing A Boolean Expression | [JavaScript](./src/1106.parsing-a-boolean-expression.1197/solution.js) | Hard |
| 1107 | New Users Daily Count | | Medium |
| 1108 | Defanging an IP Address | [Java](./src/1108.defanging-an-ip-address.1205/solution.java) [JavaScript](./src/1108.defanging-an-ip-address.1205/solution.js) [TypeScript](./src/1108.defanging-an-ip-address.1205/solution.ts) | Easy |
| 1109 | Corporate Flight Bookings | [JavaScript](./src/1109.corporate-flight-bookings.1206/solution.js) [TypeScript](./src/1109.corporate-flight-bookings.1206/solution.ts) | Medium |
| 1110 | Delete Nodes And Return Forest | [JavaScript](./src/1110.delete-nodes-and-return-forest.1207/solution.js) [TypeScript](./src/1110.delete-nodes-and-return-forest.1207/solution.ts) | Medium |
| 1111 | Maximum Nesting Depth of Two Valid Parentheses Strings | | Medium |
| 1112 | Highest Grade For Each Student | | Medium |
| 1113 | Reported Posts | | Easy |
| 1114 | Print in Order | | Easy |
| 1115 | Print FooBar Alternately | | Medium |
| 1116 | Print Zero Even Odd | | Medium |
| 1117 | Building H2O | | Medium |
| 1118 | Number of Days in a Month | [JavaScript](./src/1118.number-of-days-in-a-month.1088/solution.js) [TypeScript](./src/1118.number-of-days-in-a-month.1088/solution.ts) | Easy |
| 1119 | Remove Vowels from a String | [JavaScript](./src/1119.remove-vowels-from-a-string.1089/solution.js) [TypeScript](./src/1119.remove-vowels-from-a-string.1089/solution.ts) | Easy |
| 1120 | Maximum Average Subtree | [JavaScript](./src/1120.maximum-average-subtree.1091/solution.js) [TypeScript](./src/1120.maximum-average-subtree.1091/solution.ts) | Medium |
| 1121 | Divide Array Into Increasing Sequences | | Hard |
| 1122 | Relative Sort Array | [Java](./src/1122.relative-sort-array.1217/solution.java) [JavaScript](./src/1122.relative-sort-array.1217/solution.js) [TypeScript](./src/1122.relative-sort-array.1217/solution.ts) | Easy |
| 1123 | Lowest Common Ancestor of Deepest Leaves | [JavaScript](./src/1123.lowest-common-ancestor-of-deepest-leaves.1218/solution.js) [TypeScript](./src/1123.lowest-common-ancestor-of-deepest-leaves.1218/solution.ts) | Medium |
| 1124 | Longest Well-Performing Interval | [JavaScript](./src/1124.longest-well-performing-interval.1219/solution.js) [TypeScript](./src/1124.longest-well-performing-interval.1219/solution.ts) | Medium |
| 1125 | Smallest Sufficient Team | | Hard |
| 1126 | Active Businesses | | Medium |
| 1127 | User Purchase Platform | | Hard |
| 1128 | Number of Equivalent Domino Pairs | [JavaScript](./src/1128.number-of-equivalent-domino-pairs.1227/solution.js) [TypeScript](./src/1128.number-of-equivalent-domino-pairs.1227/solution.ts) | Easy |
| 1129 | Shortest Path with Alternating Colors | [JavaScript](./src/1129.shortest-path-with-alternating-colors.1229/solution.js) | Medium |
| 1130 | Minimum Cost Tree From Leaf Values | [JavaScript](./src/1130.minimum-cost-tree-from-leaf-values.1228/solution.js) | Medium |
| 1131 | Maximum of Absolute Value Expression | [JavaScript](./src/1131.maximum-of-absolute-value-expression.1230/solution.js) | Medium |
| 1132 | Reported Posts II | | Medium |
| 1133 | Largest Unique Number | [JavaScript](./src/1133.largest-unique-number.1098/solution.js) [TypeScript](./src/1133.largest-unique-number.1098/solution.ts) | Easy |
| 1134 | Armstrong Number | [JavaScript](./src/1134.armstrong-number.1090/solution.js) [TypeScript](./src/1134.armstrong-number.1090/solution.ts) | Easy |
| 1135 | Connecting Cities With Minimum Cost | | Medium |
| 1136 | Parallel Courses | | Medium |
| 1137 | N-th Tribonacci Number | [Java](./src/1137.n-th-tribonacci-number.1236/solution.java) [JavaScript](./src/1137.n-th-tribonacci-number.1236/solution.js) [TypeScript](./src/1137.n-th-tribonacci-number.1236/solution.ts) | Easy |
| 1138 | Alphabet Board Path | [JavaScript](./src/1138.alphabet-board-path.1238/solution.js) | Medium |
| 1139 | Largest 1-Bordered Square | [JavaScript](./src/1139.largest-1-bordered-square.1239/solution.js) | Medium |
| 1140 | Stone Game II | | Medium |
| 1141 | User Activity for the Past 30 Days I | | Easy |
| 1142 | User Activity for the Past 30 Days II | | Easy |
| 1143 | Longest Common Subsequence | [JavaScript](./src/1143.longest-common-subsequence.1250/solution.js) | Medium |
| 1144 | Decrease Elements To Make Array Zigzag | [JavaScript](./src/1144.decrease-elements-to-make-array-zigzag.1247/solution.js) | Medium |
| 1145 | Binary Tree Coloring Game | [JavaScript](./src/1145.binary-tree-coloring-game.1248/solution.js) | Medium |
| 1146 | Snapshot Array | [JavaScript](./src/1146.snapshot-array.1249/solution.js) | Medium |
| 1147 | Longest Chunked Palindrome Decomposition | | Hard |
| 1148 | Article Views I | | Easy |
| 1149 | Article Views II | | Medium |
| 1150 | Check If a Number Is Majority Element in a Sorted Array | [JavaScript](./src/1150.check-if-a-number-is-majority-element-in-a-sorted-array.1102/solution.js) | Easy |
| 1151 | Minimum Swaps to Group All 1's Together | | Medium |
| 1152 | Analyze User Website Visit Pattern | [JavaScript](./src/1152.analyze-user-website-visit-pattern.1108/solution.js) | Medium |
| 1153 | String Transforms Into Another String | | Hard |
| 1154 | Day of the Year | [Java](./src/1154.day-of-the-year.1260/solution.java) [JavaScript](./src/1154.day-of-the-year.1260/solution.js) [TypeScript](./src/1154.day-of-the-year.1260/solution.ts) | Easy |
| 1155 | Number of Dice Rolls With Target Sum | [JavaScript](./src/1155.number-of-dice-rolls-with-target-sum.1263/solution.js) | Medium |
| 1156 | Swap For Longest Repeated Character Substring | [JavaScript](./src/1156.swap-for-longest-repeated-character-substring.1261/solution.js) | Medium |
| 1157 | Online Majority Element In Subarray | | Hard |
| 1158 | Market Analysis I | | Medium |
| 1159 | Market Analysis II | | Hard |
| 1160 | Find Words That Can Be Formed by Characters | [Java](./src/1160.find-words-that-can-be-formed-by-characters.1112/solution.java) [JavaScript](./src/1160.find-words-that-can-be-formed-by-characters.1112/solution.js) [TypeScript](./src/1160.find-words-that-can-be-formed-by-characters.1112/solution.ts) | Easy |
| 1161 | Maximum Level Sum of a Binary Tree | [JavaScript](./src/1161.maximum-level-sum-of-a-binary-tree.1116/solution.js) [TypeScript](./src/1161.maximum-level-sum-of-a-binary-tree.1116/solution.ts) | Medium |
| 1162 | As Far from Land as Possible | [JavaScript](./src/1162.as-far-from-land-as-possible.1117/solution.js) | Medium |
| 1163 | Last Substring in Lexicographical Order | | Hard |
| 1164 | Product Price at a Given Date | | Medium |
| 1165 | Single-Row Keyboard | [JavaScript](./src/1165.single-row-keyboard.1123/solution.js) | Easy |
| 1166 | Design File System | [JavaScript](./src/1166.design-file-system.1125/solution.js) | Medium |
| 1167 | Minimum Cost to Connect Sticks | [JavaScript](./src/1167.minimum-cost-to-connect-sticks.1126/solution.js) | Medium |
| 1168 | Optimize Water Distribution in a Village | | Hard |
| 1169 | Invalid Transactions | [JavaScript](./src/1169.invalid-transactions.1272/solution.js) | Medium |
| 1170 | Compare Strings by Frequency of the Smallest Character | [JavaScript](./src/1170.compare-strings-by-frequency-of-the-smallest-character.1273/solution.js) [TypeScript](./src/1170.compare-strings-by-frequency-of-the-smallest-character.1273/solution.ts) | Medium |
| 1171 | Remove Zero Sum Consecutive Nodes from Linked List | [JavaScript](./src/1171.remove-zero-sum-consecutive-nodes-from-linked-list.1267/solution.js) | Medium |
| 1172 | Dinner Plate Stacks | [JavaScript](./src/1172.dinner-plate-stacks.1270/solution.js) | Hard |
| 1173 | Immediate Food Delivery I | | Easy |
| 1174 | Immediate Food Delivery II | | Medium |
| 1175 | Prime Arrangements | [Java](./src/1175.prime-arrangements.1279/solution.java) [JavaScript](./src/1175.prime-arrangements.1279/solution.js) [TypeScript](./src/1175.prime-arrangements.1279/solution.ts) | Easy |
| 1176 | Diet Plan Performance | [JavaScript](./src/1176.diet-plan-performance.1280/solution.js) [TypeScript](./src/1176.diet-plan-performance.1280/solution.ts) | Easy |
| 1177 | Can Make Palindrome from Substring | [JavaScript](./src/1177.can-make-palindrome-from-substring.1281/solution.js) | Medium |
| 1178 | Number of Valid Words for Each Puzzle | | Hard |
| 1179 | Reformat Department Table | | Easy |
| 1180 | Count Substrings with Only One Distinct Letter | [JavaScript](./src/1180.count-substrings-with-only-one-distinct-letter.1131/solution.js) [TypeScript](./src/1180.count-substrings-with-only-one-distinct-letter.1131/solution.ts) | Easy |
| 1181 | Before and After Puzzle | [JavaScript](./src/1181.before-and-after-puzzle.1132/solution.js) | Medium |
| 1182 | Shortest Distance to Target Color | [JavaScript](./src/1182.shortest-distance-to-target-color.1134/solution.js) | Medium |
| 1183 | Maximum Number of Ones | | Hard |
| 1184 | Distance Between Bus Stops | [JavaScript](./src/1184.distance-between-bus-stops.1287/solution.js) [TypeScript](./src/1184.distance-between-bus-stops.1287/solution.ts) | Easy |
| 1185 | Day of the Week | [Java](./src/1185.day-of-the-week.1289/solution.java) [JavaScript](./src/1185.day-of-the-week.1289/solution.js) [TypeScript](./src/1185.day-of-the-week.1289/solution.ts) | Easy |
| 1186 | Maximum Subarray Sum with One Deletion | [JavaScript](./src/1186.maximum-subarray-sum-with-one-deletion.1288/solution.js) | Medium |
| 1187 | Make Array Strictly Increasing | | Hard |
| 1188 | Design Bounded Blocking Queue | | Medium |
| 1189 | Maximum Number of Balloons | [Java](./src/1189.maximum-number-of-balloons.1297/solution.java) [JavaScript](./src/1189.maximum-number-of-balloons.1297/solution.js) [TypeScript](./src/1189.maximum-number-of-balloons.1297/solution.ts) | Easy |
| 1190 | Reverse Substrings Between Each Pair of Parentheses | [JavaScript](./src/1190.reverse-substrings-between-each-pair-of-parentheses.1298/solution.js) | Medium |
| 1191 | K-Concatenation Maximum Sum | [JavaScript](./src/1191.k-concatenation-maximum-sum.1299/solution.js) | Medium |
| 1192 | Critical Connections in a Network | | Hard |
| 1193 | Monthly Transactions I | | Medium |
| 1194 | Tournament Winners | | Hard |
| 1195 | Fizz Buzz Multithreaded | | Medium |
| 1196 | How Many Apples Can You Put into the Basket | [JavaScript](./src/1196.how-many-apples-can-you-put-into-the-basket.1141/solution.js) [TypeScript](./src/1196.how-many-apples-can-you-put-into-the-basket.1141/solution.ts) | Easy |
| 1197 | Minimum Knight Moves | [JavaScript](./src/1197.minimum-knight-moves.1142/solution.js) | Medium |
| 1198 | Find Smallest Common Element in All Rows | [JavaScript](./src/1198.find-smallest-common-element-in-all-rows.1143/solution.js) | Medium |
| 1199 | Minimum Time to Build Blocks | | Hard |
| 1200 | Minimum Absolute Difference | [Java](./src/1200.minimum-absolute-difference.1306/solution.java) [JavaScript](./src/1200.minimum-absolute-difference.1306/solution.js) [TypeScript](./src/1200.minimum-absolute-difference.1306/solution.ts) | Easy |
| 1201 | Ugly Number III | [JavaScript](./src/1201.ugly-number-iii.1307/solution.js) | Medium |
| 1202 | Smallest String With Swaps | [JavaScript](./src/1202.smallest-string-with-swaps.1308/solution.js) [TypeScript](./src/1202.smallest-string-with-swaps.1308/solution.ts) | Medium |
| 1203 | Sort Items by Groups Respecting Dependencies | | Hard |
| 1204 | Last Person to Fit in the Bus | | Medium |
| 1205 | Monthly Transactions II | | Medium |
| 1206 | Design Skiplist | [TypeScript](./src/1206.design-skiplist.1337/solution.ts) | Hard |
| 1207 | Unique Number of Occurrences | [Java](./src/1207.unique-number-of-occurrences.1319/solution.java) [JavaScript](./src/1207.unique-number-of-occurrences.1319/solution.js) [TypeScript](./src/1207.unique-number-of-occurrences.1319/solution.ts) | Easy |
| 1208 | Get Equal Substrings Within Budget | [JavaScript](./src/1208.get-equal-substrings-within-budget.1321/solution.js) [TypeScript](./src/1208.get-equal-substrings-within-budget.1321/solution.ts) | Medium |
| 1209 | Remove All Adjacent Duplicates in String II | [JavaScript](./src/1209.remove-all-adjacent-duplicates-in-string-ii.1320/solution.js) | Medium |
| 1210 | Minimum Moves to Reach Target with Rotations | [JavaScript](./src/1210.minimum-moves-to-reach-target-with-rotations.1322/solution.js) | Hard |
| 1211 | Queries Quality and Percentage | | Easy |
| 1212 | Team Scores in Football Tournament | | Medium |
| 1213 | Intersection of Three Sorted Arrays | [JavaScript](./src/1213.intersection-of-three-sorted-arrays.1149/solution.js) | Easy |
| 1214 | Two Sum BSTs | [JavaScript](./src/1214.two-sum-bsts.1150/solution.js) | Medium |
| 1215 | Stepping Numbers | | Medium |
| 1216 | Valid Palindrome III | | Hard |
| 1217 | Minimum Cost to Move Chips to The Same Position | [Java](./src/1217.minimum-cost-to-move-chips-to-the-same-position.1329/solution.java) [JavaScript](./src/1217.minimum-cost-to-move-chips-to-the-same-position.1329/solution.js) [TypeScript](./src/1217.minimum-cost-to-move-chips-to-the-same-position.1329/solution.ts) | Easy |
| 1218 | Longest Arithmetic Subsequence of Given Difference | [JavaScript](./src/1218.longest-arithmetic-subsequence-of-given-difference.1330/solution.js) | Medium |
| 1219 | Path with Maximum Gold | [JavaScript](./src/1219.path-with-maximum-gold.1331/solution.js) | Medium |
| 1220 | Count Vowels Permutation | [JavaScript](./src/1220.count-vowels-permutation.1332/solution.js) | Hard |
| 1221 | Split a String in Balanced Strings | [Java](./src/1221.split-a-string-in-balanced-strings.1341/solution.java) [JavaScript](./src/1221.split-a-string-in-balanced-strings.1341/solution.js) [TypeScript](./src/1221.split-a-string-in-balanced-strings.1341/solution.ts) | Easy |
| 1222 | Queens That Can Attack the King | [JavaScript](./src/1222.queens-that-can-attack-the-king.1342/solution.js) | Medium |
| 1223 | Dice Roll Simulation | | Hard |
| 1224 | Maximum Equal Frequency | | Hard |
| 1225 | Report Contiguous Dates | | Hard |
| 1226 | The Dining Philosophers | | Medium |
| 1227 | Airplane Seat Assignment Probability | [JavaScript](./src/1227.airplane-seat-assignment-probability.1362/solution.js) [TypeScript](./src/1227.airplane-seat-assignment-probability.1362/solution.ts) | Medium |
| 1228 | Missing Number In Arithmetic Progression | [JavaScript](./src/1228.missing-number-in-arithmetic-progression.1164/solution.js) [TypeScript](./src/1228.missing-number-in-arithmetic-progression.1164/solution.ts) | Easy |
| 1229 | Meeting Scheduler | [JavaScript](./src/1229.meeting-scheduler.1165/solution.js) | Medium |
| 1230 | Toss Strange Coins | [JavaScript](./src/1230.toss-strange-coins.1166/solution.js) | Medium |
| 1231 | Divide Chocolate | | Hard |
| 1232 | Check If It Is a Straight Line | [JavaScript](./src/1232.check-if-it-is-a-straight-line.1349/solution.js) [TypeScript](./src/1232.check-if-it-is-a-straight-line.1349/solution.ts) | Easy |
| 1233 | Remove Sub-Folders from the Filesystem | [JavaScript](./src/1233.remove-sub-folders-from-the-filesystem.1350/solution.js) | Medium |
| 1234 | Replace the Substring for Balanced String | [TypeScript](./src/1234.replace-the-substring-for-balanced-string.1351/solution.ts) | Medium |
| 1235 | Maximum Profit in Job Scheduling | [JavaScript](./src/1235.maximum-profit-in-job-scheduling.1352/solution.js) | Hard |
| 1236 | Web Crawler | [JavaScript](./src/1236.web-crawler.1271/solution.js) [TypeScript](./src/1236.web-crawler.1271/solution.ts) | Medium |
| 1237 | Find Positive Integer Solution for a Given Equation | [JavaScript](./src/1237.find-positive-integer-solution-for-a-given-equation.1358/solution.js) | Medium |
| 1238 | Circular Permutation in Binary Representation | [TypeScript](./src/1238.circular-permutation-in-binary-representation.1359/solution.ts) | Medium |
| 1239 | Maximum Length of a Concatenated String with Unique Characters | [JavaScript](./src/1239.maximum-length-of-a-concatenated-string-with-unique-characters.1360/solution.js) | Medium |
| 1240 | Tiling a Rectangle with the Fewest Squares | | Hard |
| 1241 | Number of Comments per Post | | Easy |
| 1242 | Web Crawler Multithreaded | | Medium |
| 1243 | Array Transformation | [JavaScript](./src/1243.array-transformation.1175/solution.js) [TypeScript](./src/1243.array-transformation.1175/solution.ts) | Easy |
| 1244 | Design A Leaderboard | [JavaScript](./src/1244.design-a-leaderboard.1176/solution.js) | Medium |
| 1245 | Tree Diameter | | Medium |
| 1246 | Palindrome Removal | | Hard |
| 1247 | Minimum Swaps to Make Strings Equal | [JavaScript](./src/1247.minimum-swaps-to-make-strings-equal.1369/solution.js) | Medium |
| 1248 | Count Number of Nice Subarrays | [JavaScript](./src/1248.count-number-of-nice-subarrays.1370/solution.js) | Medium |
| 1249 | Minimum Remove to Make Valid Parentheses | [JavaScript](./src/1249.minimum-remove-to-make-valid-parentheses.1371/solution.js) | Medium |
| 1250 | Check If It Is a Good Array | | Hard |
| 1251 | Average Selling Price | | Easy |
| 1252 | Cells with Odd Values in a Matrix | [JavaScript](./src/1252.cells-with-odd-values-in-a-matrix.1378/solution.js) [TypeScript](./src/1252.cells-with-odd-values-in-a-matrix.1378/solution.ts) | Easy |
| 1253 | Reconstruct a 2-Row Binary Matrix | [JavaScript](./src/1253.reconstruct-a-2-row-binary-matrix.1379/solution.js) | Medium |
| 1254 | Number of Closed Islands | [JavaScript](./src/1254.number-of-closed-islands.1380/solution.js) | Medium |
| 1255 | Maximum Score Words Formed by Letters | [JavaScript](./src/1255.maximum-score-words-formed-by-letters.1381/solution.js) | Hard |
| 1256 | Encode Number | [JavaScript](./src/1256.encode-number.1189/solution.js) | Medium |
| 1257 | Smallest Common Region | [JavaScript](./src/1257.smallest-common-region.1190/solution.js) | Medium |
| 1258 | Synonymous Sentences | [Python3](./src/1258.synonymous-sentences.1191/solution.py) | Medium |
| 1259 | Handshakes That Don't Cross | | Hard |
| 1260 | Shift 2D Grid | [JavaScript](./src/1260.shift-2d-grid.1386/solution.js) | Easy |
| 1261 | Find Elements in a Contaminated Binary Tree | [Python3](./src/1261.find-elements-in-a-contaminated-binary-tree.1387/solution.py) | Medium |
| 1262 | Greatest Sum Divisible by Three | [JavaScript](./src/1262.greatest-sum-divisible-by-three.1388/solution.js) [TypeScript](./src/1262.greatest-sum-divisible-by-three.1388/solution.ts) | Medium |
| 1263 | Minimum Moves to Move a Box to Their Target Location | | Hard |
| 1264 | Page Recommendations | | Medium |
| 1265 | Print Immutable Linked List in Reverse | [JavaScript](./src/1265.print-immutable-linked-list-in-reverse.1404/solution.js) [TypeScript](./src/1265.print-immutable-linked-list-in-reverse.1404/solution.ts) | Medium |
| 1266 | Minimum Time Visiting All Points | [Java](./src/1266.minimum-time-visiting-all-points.1395/solution.java) [JavaScript](./src/1266.minimum-time-visiting-all-points.1395/solution.js) [TypeScript](./src/1266.minimum-time-visiting-all-points.1395/solution.ts) | Easy |
| 1267 | Count Servers that Communicate | [JavaScript](./src/1267.count-servers-that-communicate.1396/solution.js) | Medium |
| 1268 | Search Suggestions System | [Python3](./src/1268.search-suggestions-system.1397/solution.py) | Medium |
| 1269 | Number of Ways to Stay in the Same Place After Some Steps | [JavaScript](./src/1269.number-of-ways-to-stay-in-the-same-place-after-some-steps.1398/solution.js) | Hard |
| 1270 | All People Report to the Given Manager | | Medium |
| 1271 | Hexspeak | [Python3](./src/1271.hexspeak.1199/solution.py) | Easy |
| 1272 | Remove Interval | [Python3](./src/1272.remove-interval.1200/solution.py) | Medium |
| 1273 | Delete Tree Nodes | [JavaScript](./src/1273.delete-tree-nodes.1201/solution.js) | Medium |
| 1274 | Number of Ships in a Rectangle | | Hard |
| 1275 | Find Winner on a Tic Tac Toe Game | [JavaScript](./src/1275.find-winner-on-a-tic-tac-toe-game.1400/solution.js) | Easy |
| 1276 | Number of Burgers with No Waste of Ingredients | [JavaScript](./src/1276.number-of-burgers-with-no-waste-of-ingredients.1401/solution.js) [TypeScript](./src/1276.number-of-burgers-with-no-waste-of-ingredients.1401/solution.ts) | Medium |
| 1277 | Count Square Submatrices with All Ones | [JavaScript](./src/1277.count-square-submatrices-with-all-ones.1402/solution.js) | Medium |
| 1278 | Palindrome Partitioning III | | Hard |
| 1279 | Traffic Light Controlled Intersection | | Easy |
| 1280 | Students and Examinations | | Easy |
| 1281 | Subtract the Product and Sum of Digits of an Integer | [Java](./src/1281.subtract-the-product-and-sum-of-digits-of-an-integer.1406/solution.java) [JavaScript](./src/1281.subtract-the-product-and-sum-of-digits-of-an-integer.1406/solution.js) [TypeScript](./src/1281.subtract-the-product-and-sum-of-digits-of-an-integer.1406/solution.ts) | Easy |
| 1282 | Group the People Given the Group Size They Belong To | [JavaScript](./src/1282.group-the-people-given-the-group-size-they-belong-to.1407/solution.js) [TypeScript](./src/1282.group-the-people-given-the-group-size-they-belong-to.1407/solution.ts) | Medium |
| 1283 | Find the Smallest Divisor Given a Threshold | [JavaScript](./src/1283.find-the-smallest-divisor-given-a-threshold.1408/solution.js) | Medium |
| 1284 | Minimum Number of Flips to Convert Binary Matrix to Zero Matrix | | Hard |
| 1285 | Find the Start and End Number of Continuous Ranges | | Medium |
| 1286 | Iterator for Combination | [Python3](./src/1286.iterator-for-combination.1211/solution.py) | Medium |
| 1287 | Element Appearing More Than 25% In Sorted Array | [JavaScript](./src/1287.element-appearing-more-than-25-in-sorted-array.1221/solution.js) | Easy |
| 1288 | Remove Covered Intervals | [JavaScript](./src/1288.remove-covered-intervals.1222/solution.js) | Medium |
| 1289 | Minimum Falling Path Sum II | [JavaScript](./src/1289.minimum-falling-path-sum-ii.1224/solution.js) | Hard |
| 1290 | Convert Binary Number in a Linked List to Integer | [Go](./src/1290.convert-binary-number-in-a-linked-list-to-integer.1411/solution.go) [Java](./src/1290.convert-binary-number-in-a-linked-list-to-integer.1411/solution.java) [JavaScript](./src/1290.convert-binary-number-in-a-linked-list-to-integer.1411/solution.js) [TypeScript](./src/1290.convert-binary-number-in-a-linked-list-to-integer.1411/solution.ts) | Easy |
| 1291 | Sequential Digits | [JavaScript](./src/1291.sequential-digits.1212/solution.js) | Medium |
| 1292 | Maximum Side Length of a Square with Sum Less than or Equal to Threshold | | Medium |
| 1293 | Shortest Path in a Grid with Obstacles Elimination | | Hard |
| 1294 | Weather Type in Each Country | | Easy |
| 1295 | Find Numbers with Even Number of Digits | [Java](./src/1295.find-numbers-with-even-number-of-digits.1421/solution.java) [JavaScript](./src/1295.find-numbers-with-even-number-of-digits.1421/solution.js) [TypeScript](./src/1295.find-numbers-with-even-number-of-digits.1421/solution.ts) | Easy |
| 1296 | Divide Array in Sets of K Consecutive Numbers | [JavaScript](./src/1296.divide-array-in-sets-of-k-consecutive-numbers.1422/solution.js) [TypeScript](./src/1296.divide-array-in-sets-of-k-consecutive-numbers.1422/solution.ts) | Medium |
| 1297 | Maximum Number of Occurrences of a Substring | | Medium |
| 1298 | Maximum Candies You Can Get from Boxes | | Hard |
| 1299 | Replace Elements with Greatest Element on Right Side | [Java](./src/1299.replace-elements-with-greatest-element-on-right-side.1231/solution.java) [JavaScript](./src/1299.replace-elements-with-greatest-element-on-right-side.1231/solution.js) [TypeScript](./src/1299.replace-elements-with-greatest-element-on-right-side.1231/solution.ts) | Easy |
| 1300 | Sum of Mutated Array Closest to Target | [JavaScript](./src/1300.sum-of-mutated-array-closest-to-target.1232/solution.js) | Medium |
| 1301 | Number of Paths with Max Score | [Python3](./src/1301.number-of-paths-with-max-score.1234/solution.py) | Hard |
| 1302 | Deepest Leaves Sum | [Java](./src/1302.deepest-leaves-sum.1254/solution.java) [JavaScript](./src/1302.deepest-leaves-sum.1254/solution.js) [TypeScript](./src/1302.deepest-leaves-sum.1254/solution.ts) | Medium |
| 1303 | Find the Team Size | | Easy |
| 1304 | Find N Unique Integers Sum up to Zero | [JavaScript](./src/1304.find-n-unique-integers-sum-up-to-zero.1426/solution.js) [TypeScript](./src/1304.find-n-unique-integers-sum-up-to-zero.1426/solution.ts) | Easy |
| 1305 | All Elements in Two Binary Search Trees | [Python3](./src/1305.all-elements-in-two-binary-search-trees.1427/solution.py) [TypeScript](./src/1305.all-elements-in-two-binary-search-trees.1427/solution.ts) | Medium |
| 1306 | Jump Game III | [JavaScript](./src/1306.jump-game-iii.1428/solution.js) | Medium |
| 1307 | Verbal Arithmetic Puzzle | | Hard |
| 1308 | Running Total for Different Genders | | Medium |
| 1309 | Decrypt String from Alphabet to Integer Mapping | [Java](./src/1309.decrypt-string-from-alphabet-to-integer-mapping.1434/solution.java) [JavaScript](./src/1309.decrypt-string-from-alphabet-to-integer-mapping.1434/solution.js) [TypeScript](./src/1309.decrypt-string-from-alphabet-to-integer-mapping.1434/solution.ts) | Easy |
| 1310 | XOR Queries of a Subarray | [JavaScript](./src/1310.xor-queries-of-a-subarray.1435/solution.js) [TypeScript](./src/1310.xor-queries-of-a-subarray.1435/solution.ts) | Medium |
| 1311 | Get Watched Videos by Your Friends | [JavaScript](./src/1311.get-watched-videos-by-your-friends.1436/solution.js) | Medium |
| 1312 | Minimum Insertion Steps to Make a String Palindrome | [JavaScript](./src/1312.minimum-insertion-steps-to-make-a-string-palindrome.1437/solution.js) | Hard |
| 1313 | Decompress Run-Length Encoded List | [Java](./src/1313.decompress-run-length-encoded-list.1241/solution.java) [JavaScript](./src/1313.decompress-run-length-encoded-list.1241/solution.js) [TypeScript](./src/1313.decompress-run-length-encoded-list.1241/solution.ts) | Easy |
| 1314 | Matrix Block Sum | [JavaScript](./src/1314.matrix-block-sum.1242/solution.js) | Medium |
| 1315 | Sum of Nodes with Even-Valued Grandparent | [JavaScript](./src/1315.sum-of-nodes-with-even-valued-grandparent.1243/solution.js) | Medium |
| 1316 | Distinct Echo Substrings | | Hard |
| 1317 | Convert Integer to the Sum of Two No-Zero Integers | [JavaScript](./src/1317.convert-integer-to-the-sum-of-two-no-zero-integers.1440/solution.js) [TypeScript](./src/1317.convert-integer-to-the-sum-of-two-no-zero-integers.1440/solution.ts) | Easy |
| 1318 | Minimum Flips to Make a OR b Equal to c | [JavaScript](./src/1318.minimum-flips-to-make-a-or-b-equal-to-c.1441/solution.js) | Medium |
| 1319 | Number of Operations to Make Network Connected | [TypeScript](./src/1319.number-of-operations-to-make-network-connected.1442/solution.ts) | Medium |
| 1320 | Minimum Distance to Type a Word Using Two Fingers | | Hard |
| 1321 | Restaurant Growth | | Medium |
| 1322 | Ads Performance | | Easy |
| 1323 | Maximum 69 Number | [Java](./src/1323.maximum-69-number.1448/solution.java) [JavaScript](./src/1323.maximum-69-number.1448/solution.js) [TypeScript](./src/1323.maximum-69-number.1448/solution.ts) | Easy |
| 1324 | Print Words Vertically | [JavaScript](./src/1324.print-words-vertically.1449/solution.js) [TypeScript](./src/1324.print-words-vertically.1449/solution.ts) | Medium |
| 1325 | Delete Leaves With a Given Value | [Java](./src/1325.delete-leaves-with-a-given-value.1450/solution.java) [JavaScript](./src/1325.delete-leaves-with-a-given-value.1450/solution.js) [TypeScript](./src/1325.delete-leaves-with-a-given-value.1450/solution.ts) | Medium |
| 1326 | Minimum Number of Taps to Open to Water a Garden | [JavaScript](./src/1326.minimum-number-of-taps-to-open-to-water-a-garden.1451/solution.js) | Hard |
| 1327 | List the Products Ordered in a Period | | Easy |
| 1328 | Break a Palindrome | [JavaScript](./src/1328.break-a-palindrome.1252/solution.js) | Medium |
| 1329 | Sort the Matrix Diagonally | [JavaScript](./src/1329.sort-the-matrix-diagonally.1253/solution.js) | Medium |
| 1330 | Reverse Subarray To Maximize Array Value | | Hard |
| 1331 | Rank Transform of an Array | [JavaScript](./src/1331.rank-transform-of-an-array.1256/solution.js) [TypeScript](./src/1331.rank-transform-of-an-array.1256/solution.ts) | Easy |
| 1332 | Remove Palindromic Subsequences | [JavaScript](./src/1332.remove-palindromic-subsequences.1454/solution.js) [TypeScript](./src/1332.remove-palindromic-subsequences.1454/solution.ts) | Easy |
| 1333 | Filter Restaurants by Vegan-Friendly, Price and Distance | [JavaScript](./src/1333.filter-restaurants-by-vegan-friendly-price-and-distance.1455/solution.js) | Medium |
| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | [JavaScript](./src/1334.find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.1456/solution.js) | Medium |
| 1335 | Minimum Difficulty of a Job Schedule | [JavaScript](./src/1335.minimum-difficulty-of-a-job-schedule.1457/solution.js) | Hard |
| 1336 | Number of Transactions per Visit | | Hard |
| 1337 | The K Weakest Rows in a Matrix | [JavaScript](./src/1337.the-k-weakest-rows-in-a-matrix.1463/solution.js) [TypeScript](./src/1337.the-k-weakest-rows-in-a-matrix.1463/solution.ts) | Easy |
| 1338 | Reduce Array Size to The Half | [Java](./src/1338.reduce-array-size-to-the-half.1464/solution.java) [JavaScript](./src/1338.reduce-array-size-to-the-half.1464/solution.js) [TypeScript](./src/1338.reduce-array-size-to-the-half.1464/solution.ts) | Medium |
| 1339 | Maximum Product of Splitted Binary Tree | [JavaScript](./src/1339.maximum-product-of-splitted-binary-tree.1465/solution.js) | Medium |
| 1340 | Jump Game V | [JavaScript](./src/1340.jump-game-v.1466/solution.js) | Hard |
| 1341 | Movie Rating | | Medium |
| 1342 | Number of Steps to Reduce a Number to Zero | [Java](./src/1342.number-of-steps-to-reduce-a-number-to-zero.1444/solution.java) [JavaScript](./src/1342.number-of-steps-to-reduce-a-number-to-zero.1444/solution.js) [TypeScript](./src/1342.number-of-steps-to-reduce-a-number-to-zero.1444/solution.ts) | Easy |
| 1343 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | [JavaScript](./src/1343.number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.1445/solution.js) | Medium |
| 1344 | Angle Between Hands of a Clock | [JavaScript](./src/1344.angle-between-hands-of-a-clock.1446/solution.js) [TypeScript](./src/1344.angle-between-hands-of-a-clock.1446/solution.ts) | Medium |
| 1345 | Jump Game IV | [JavaScript](./src/1345.jump-game-iv.1447/solution.js) | Hard |
| 1346 | Check If N and Its Double Exist | [Java](./src/1346.check-if-n-and-its-double-exist.1468/solution.java) [JavaScript](./src/1346.check-if-n-and-its-double-exist.1468/solution.js) [TypeScript](./src/1346.check-if-n-and-its-double-exist.1468/solution.ts) | Easy |
| 1347 | Minimum Number of Steps to Make Two Strings Anagram | [JavaScript](./src/1347.minimum-number-of-steps-to-make-two-strings-anagram.1469/solution.js) [TypeScript](./src/1347.minimum-number-of-steps-to-make-two-strings-anagram.1469/solution.ts) | Medium |
| 1348 | Tweet Counts Per Frequency | [JavaScript](./src/1348.tweet-counts-per-frequency.1470/solution.js) | Medium |
| 1349 | Maximum Students Taking Exam | | Hard |
| 1350 | Students With Invalid Departments | | Easy |
| 1351 | Count Negative Numbers in a Sorted Matrix | [JavaScript](./src/1351.count-negative-numbers-in-a-sorted-matrix.1476/solution.js) [TypeScript](./src/1351.count-negative-numbers-in-a-sorted-matrix.1476/solution.ts) | Easy |
| 1352 | Product of the Last K Numbers | [JavaScript](./src/1352.product-of-the-last-k-numbers.1477/solution.js) [TypeScript](./src/1352.product-of-the-last-k-numbers.1477/solution.ts) | Medium |
| 1353 | Maximum Number of Events That Can Be Attended | | Medium |
| 1354 | Construct Target Array With Multiple Sums | | Hard |
| 1355 | Activity Participants | | Medium |
| 1356 | Sort Integers by The Number of 1 Bits | [JavaScript](./src/1356.sort-integers-by-the-number-of-1-bits.1458/solution.js) [TypeScript](./src/1356.sort-integers-by-the-number-of-1-bits.1458/solution.ts) | Easy |
| 1357 | Apply Discount Every n Orders | [JavaScript](./src/1357.apply-discount-every-n-orders.1459/solution.js) [TypeScript](./src/1357.apply-discount-every-n-orders.1459/solution.ts) | Medium |
| 1358 | Number of Substrings Containing All Three Characters | [JavaScript](./src/1358.number-of-substrings-containing-all-three-characters.1460/solution.js) | Medium |
| 1359 | Count All Valid Pickup and Delivery Options | [JavaScript](./src/1359.count-all-valid-pickup-and-delivery-options.1461/solution.js) | Hard |
| 1360 | Number of Days Between Two Dates | [Java](./src/1360.number-of-days-between-two-dates.1274/solution.java) [JavaScript](./src/1360.number-of-days-between-two-dates.1274/solution.js) [TypeScript](./src/1360.number-of-days-between-two-dates.1274/solution.ts) | Easy |
| 1361 | Validate Binary Tree Nodes | [JavaScript](./src/1361.validate-binary-tree-nodes.1275/solution.js) | Medium |
| 1362 | Closest Divisors | [JavaScript](./src/1362.closest-divisors.1276/solution.js) [TypeScript](./src/1362.closest-divisors.1276/solution.ts) | Medium |
| 1363 | Largest Multiple of Three | [JavaScript](./src/1363.largest-multiple-of-three.1277/solution.js) [TypeScript](./src/1363.largest-multiple-of-three.1277/solution.ts) | Hard |
| 1364 | Number of Trusted Contacts of a Customer | | Medium |
| 1365 | How Many Numbers Are Smaller Than the Current Number | [Java](./src/1365.how-many-numbers-are-smaller-than-the-current-number.1482/solution.java) [JavaScript](./src/1365.how-many-numbers-are-smaller-than-the-current-number.1482/solution.js) [TypeScript](./src/1365.how-many-numbers-are-smaller-than-the-current-number.1482/solution.ts) | Easy |
| 1366 | Rank Teams by Votes | [JavaScript](./src/1366.rank-teams-by-votes.1483/solution.js) | Medium |
| 1367 | Linked List in Binary Tree | [JavaScript](./src/1367.linked-list-in-binary-tree.1484/solution.js) | Medium |
| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | | Hard |
| 1369 | Get the Second Most Recent Activity | | Hard |
| 1370 | Increasing Decreasing String | [JavaScript](./src/1370.increasing-decreasing-string.1472/solution.js) | Easy |
| 1371 | Find the Longest Substring Containing Vowels in Even Counts | [JavaScript](./src/1371.find-the-longest-substring-containing-vowels-in-even-counts.1473/solution.js) | Medium |
| 1372 | Longest ZigZag Path in a Binary Tree | [JavaScript](./src/1372.longest-zigzag-path-in-a-binary-tree.1474/solution.js) | Medium |
| 1373 | Maximum Sum BST in Binary Tree | [JavaScript](./src/1373.maximum-sum-bst-in-binary-tree.1475/solution.js) [TypeScript](./src/1373.maximum-sum-bst-in-binary-tree.1475/solution.ts) | Hard |
| 1374 | Generate a String With Characters That Have Odd Counts | [Java](./src/1374.generate-a-string-with-characters-that-have-odd-counts.1490/solution.java) [JavaScript](./src/1374.generate-a-string-with-characters-that-have-odd-counts.1490/solution.js) [TypeScript](./src/1374.generate-a-string-with-characters-that-have-odd-counts.1490/solution.ts) | Easy |
| 1375 | Number of Times Binary String Is Prefix-Aligned | [JavaScript](./src/1375.number-of-times-binary-string-is-prefix-aligned.1491/solution.js) | Medium |
| 1376 | Time Needed to Inform All Employees | [JavaScript](./src/1376.time-needed-to-inform-all-employees.1492/solution.js) | Medium |
| 1377 | Frog Position After T Seconds | [JavaScript](./src/1377.frog-position-after-t-seconds.1493/solution.js) | Hard |
| 1378 | Replace Employee ID With The Unique Identifier | | Easy |
| 1379 | Find a Corresponding Node of a Binary Tree in a Clone of That Tree | [Java](./src/1379.find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.1498/solution.java) [JavaScript](./src/1379.find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.1498/solution.js) [TypeScript](./src/1379.find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.1498/solution.ts) | Easy |
| 1380 | Lucky Numbers in a Matrix | [JavaScript](./src/1380.lucky-numbers-in-a-matrix.1496/solution.js) [TypeScript](./src/1380.lucky-numbers-in-a-matrix.1496/solution.ts) | Easy |
| 1381 | Design a Stack With Increment Operation | [JavaScript](./src/1381.design-a-stack-with-increment-operation.1497/solution.js) [TypeScript](./src/1381.design-a-stack-with-increment-operation.1497/solution.ts) | Medium |
| 1382 | Balance a Binary Search Tree | [JavaScript](./src/1382.balance-a-binary-search-tree.1285/solution.js) [TypeScript](./src/1382.balance-a-binary-search-tree.1285/solution.ts) | Medium |
| 1383 | Maximum Performance of a Team | | Hard |
| 1384 | Total Sales Amount by Year | | Hard |
| 1385 | Find the Distance Value Between Two Arrays | [JavaScript](./src/1385.find-the-distance-value-between-two-arrays.1486/solution.js) [TypeScript](./src/1385.find-the-distance-value-between-two-arrays.1486/solution.ts) | Easy |
| 1386 | Cinema Seat Allocation | [JavaScript](./src/1386.cinema-seat-allocation.1487/solution.js) | Medium |
| 1387 | Sort Integers by The Power Value | [JavaScript](./src/1387.sort-integers-by-the-power-value.1488/solution.js) | Medium |
| 1388 | Pizza With 3n Slices | | Hard |
| 1389 | Create Target Array in the Given Order | [Java](./src/1389.create-target-array-in-the-given-order.1505/solution.java) [JavaScript](./src/1389.create-target-array-in-the-given-order.1505/solution.js) [TypeScript](./src/1389.create-target-array-in-the-given-order.1505/solution.ts) | Easy |
| 1390 | Four Divisors | [JavaScript](./src/1390.four-divisors.1284/solution.js) | Medium |
| 1391 | Check if There is a Valid Path in a Grid | [JavaScript](./src/1391.check-if-there-is-a-valid-path-in-a-grid.1507/solution.js) | Medium |
| 1392 | Longest Happy Prefix | [TypeScript](./src/1392.longest-happy-prefix.1508/solution.ts) | Hard |
| 1393 | Capital Gain/Loss | | Medium |
| 1394 | Find Lucky Integer in an Array | [Java](./src/1394.find-lucky-integer-in-an-array.1510/solution.java) [JavaScript](./src/1394.find-lucky-integer-in-an-array.1510/solution.js) [TypeScript](./src/1394.find-lucky-integer-in-an-array.1510/solution.ts) | Easy |
| 1395 | Count Number of Teams | [JavaScript](./src/1395.count-number-of-teams.1511/solution.js) | Medium |
| 1396 | Design Underground System | [JavaScript](./src/1396.design-underground-system.1512/solution.js) | Medium |
| 1397 | Find All Good Strings | | Hard |
| 1398 | Customers Who Bought Products A and B but Not C | | Medium |
| 1399 | Count Largest Group | [JavaScript](./src/1399.count-largest-group.1500/solution.js) [TypeScript](./src/1399.count-largest-group.1500/solution.ts) | Easy |
| 1400 | Construct K Palindrome Strings | [JavaScript](./src/1400.construct-k-palindrome-strings.1502/solution.js) | Medium |
| 1401 | Circle and Rectangle Overlapping | [JavaScript](./src/1401.circle-and-rectangle-overlapping.1501/solution.js) | Medium |
| 1402 | Reducing Dishes | [JavaScript](./src/1402.reducing-dishes.1503/solution.js) | Hard |
| 1403 | Minimum Subsequence in Non-Increasing Order | [JavaScript](./src/1403.minimum-subsequence-in-non-increasing-order.1519/solution.js) | Easy |
| 1404 | Number of Steps to Reduce a Number in Binary Representation to One | [JavaScript](./src/1404.number-of-steps-to-reduce-a-number-in-binary-representation-to-one.1520/solution.js) | Medium |
| 1405 | Longest Happy String | | Medium |
| 1406 | Stone Game III | [JavaScript](./src/1406.stone-game-iii.1522/solution.js) | Hard |
| 1407 | Top Travellers | | Easy |
| 1408 | String Matching in an Array | [JavaScript](./src/1408.string-matching-in-an-array.1524/solution.js) [TypeScript](./src/1408.string-matching-in-an-array.1524/solution.ts) | Easy |
| 1409 | Queries on a Permutation With Key | [JavaScript](./src/1409.queries-on-a-permutation-with-key.1525/solution.js) | Medium |
| 1410 | HTML Entity Parser | [JavaScript](./src/1410.html-entity-parser.1526/solution.js) | Medium |
| 1411 | Number of Ways to Paint N × 3 Grid | | Hard |
| 1412 | Find the Quiet Students in All Exams | | Hard |
| 1413 | Minimum Value to Get Positive Step by Step Sum | [Java](./src/1413.minimum-value-to-get-positive-step-by-step-sum.1514/solution.java) [JavaScript](./src/1413.minimum-value-to-get-positive-step-by-step-sum.1514/solution.js) [TypeScript](./src/1413.minimum-value-to-get-positive-step-by-step-sum.1514/solution.ts) | Easy |
| 1414 | Find the Minimum Number of Fibonacci Numbers Whose Sum Is K | [JavaScript](./src/1414.find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k.1515/solution.js) | Medium |
| 1415 | The k-th Lexicographical String of All Happy Strings of Length n | [JavaScript](./src/1415.the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.1516/solution.js) | Medium |
| 1416 | Restore The Array | [JavaScript](./src/1416.restore-the-array.1517/solution.js) | Hard |
| 1417 | Reformat The String | [JavaScript](./src/1417.reformat-the-string.1532/solution.js) [TypeScript](./src/1417.reformat-the-string.1532/solution.ts) | Easy |
| 1418 | Display Table of Food Orders in a Restaurant | [JavaScript](./src/1418.display-table-of-food-orders-in-a-restaurant.1533/solution.js) | Medium |
| 1419 | Minimum Number of Frogs Croaking | [JavaScript](./src/1419.minimum-number-of-frogs-croaking.1534/solution.js) | Medium |
| 1420 | Build Array Where You Can Find The Maximum Exactly K Comparisons | | Hard |
| 1421 | NPV Queries | | Easy |
| 1422 | Maximum Score After Splitting a String | [Java](./src/1422.maximum-score-after-splitting-a-string.1537/solution.java) [JavaScript](./src/1422.maximum-score-after-splitting-a-string.1537/solution.js) [TypeScript](./src/1422.maximum-score-after-splitting-a-string.1537/solution.ts) | Easy |
| 1423 | Maximum Points You Can Obtain from Cards | [JavaScript](./src/1423.maximum-points-you-can-obtain-from-cards.1538/solution.js) | Medium |
| 1424 | Diagonal Traverse II | [JavaScript](./src/1424.diagonal-traverse-ii.1539/solution.js) | Medium |
| 1425 | Constrained Subsequence Sum | [JavaScript](./src/1425.constrained-subsequence-sum.1286/solution.js) | Hard |
| 1426 | Counting Elements | [JavaScript](./src/1426.counting-elements.1391/solution.js) [TypeScript](./src/1426.counting-elements.1391/solution.ts) | Easy |
| 1427 | Perform String Shifts | [JavaScript](./src/1427.perform-string-shifts.1345/solution.js) [TypeScript](./src/1427.perform-string-shifts.1345/solution.ts) | Easy |
| 1428 | Leftmost Column with at Least a One | [JavaScript](./src/1428.leftmost-column-with-at-least-a-one.1374/solution.js) | Medium |
| 1429 | First Unique Number | [JavaScript](./src/1429.first-unique-number.1366/solution.js) | Medium |
| 1430 | Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree | [JavaScript](./src/1430.check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree.1432/solution.js) | Medium |
| 1431 | Kids With the Greatest Number of Candies | [Java](./src/1431.kids-with-the-greatest-number-of-candies.1528/solution.java) [JavaScript](./src/1431.kids-with-the-greatest-number-of-candies.1528/solution.js) [TypeScript](./src/1431.kids-with-the-greatest-number-of-candies.1528/solution.ts) | Easy |
| 1432 | Max Difference You Can Get From Changing an Integer | [JavaScript](./src/1432.max-difference-you-can-get-from-changing-an-integer.1529/solution.js) | Medium |
| 1433 | Check If a String Can Break Another String | [JavaScript](./src/1433.check-if-a-string-can-break-another-string.1530/solution.js) | Medium |
| 1434 | Number of Ways to Wear Different Hats to Each Other | | Hard |
| 1435 | Create a Session Bar Chart | | Easy |
| 1436 | Destination City | [JavaScript](./src/1436.destination-city.1547/solution.js) [TypeScript](./src/1436.destination-city.1547/solution.ts) | Easy |
| 1437 | Check If All 1's Are at Least Length K Places Away | [JavaScript](./src/1437.check-if-all-1s-are-at-least-length-k-places-away.1548/solution.js) [TypeScript](./src/1437.check-if-all-1s-are-at-least-length-k-places-away.1548/solution.ts) | Easy |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | [JavaScript](./src/1438.longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.1549/solution.js) | Medium |
| 1439 | Find the Kth Smallest Sum of a Matrix With Sorted Rows | | Hard |
| 1440 | Evaluate Boolean Expression | | Medium |
| 1441 | Build an Array With Stack Operations | [JavaScript](./src/1441.build-an-array-with-stack-operations.1552/solution.js) [TypeScript](./src/1441.build-an-array-with-stack-operations.1552/solution.ts) | Medium |
| 1442 | Count Triplets That Can Form Two Arrays of Equal XOR | [JavaScript](./src/1442.count-triplets-that-can-form-two-arrays-of-equal-xor.1553/solution.js) | Medium |
| 1443 | Minimum Time to Collect All Apples in a Tree | [JavaScript](./src/1443.minimum-time-to-collect-all-apples-in-a-tree.1554/solution.js) | Medium |
| 1444 | Number of Ways of Cutting a Pizza | | Hard |
| 1445 | Apples & Oranges | | Medium |
| 1446 | Consecutive Characters | [Java](./src/1446.consecutive-characters.1542/solution.java) [JavaScript](./src/1446.consecutive-characters.1542/solution.js) [TypeScript](./src/1446.consecutive-characters.1542/solution.ts) | Easy |
| 1447 | Simplified Fractions | [JavaScript](./src/1447.simplified-fractions.1543/solution.js) | Medium |
| 1448 | Count Good Nodes in Binary Tree | [JavaScript](./src/1448.count-good-nodes-in-binary-tree.1544/solution.js) [TypeScript](./src/1448.count-good-nodes-in-binary-tree.1544/solution.ts) | Medium |
| 1449 | Form Largest Integer With Digits That Add up to Target | | Hard |
| 1450 | Number of Students Doing Homework at a Given Time | [Java](./src/1450.number-of-students-doing-homework-at-a-given-time.1560/solution.java) [JavaScript](./src/1450.number-of-students-doing-homework-at-a-given-time.1560/solution.js) [TypeScript](./src/1450.number-of-students-doing-homework-at-a-given-time.1560/solution.ts) | Easy |
| 1451 | Rearrange Words in a Sentence | [JavaScript](./src/1451.rearrange-words-in-a-sentence.1561/solution.js) | Medium |
| 1452 | People Whose List of Favorite Companies Is Not a Subset of Another List | [JavaScript](./src/1452.people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list.1562/solution.js) | Medium |
| 1453 | Maximum Number of Darts Inside of a Circular Dartboard | | Hard |
| 1454 | Active Users | | Medium |
| 1455 | Check If a Word Occurs As a Prefix of Any Word in a Sentence | [Java](./src/1455.check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence.1566/solution.java) [JavaScript](./src/1455.check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence.1566/solution.js) [TypeScript](./src/1455.check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence.1566/solution.ts) | Easy |
| 1456 | Maximum Number of Vowels in a Substring of Given Length | [JavaScript](./src/1456.maximum-number-of-vowels-in-a-substring-of-given-length.1567/solution.js) | Medium |
| 1457 | Pseudo-Palindromic Paths in a Binary Tree | [JavaScript](./src/1457.pseudo-palindromic-paths-in-a-binary-tree.1568/solution.js) [Python3](./src/1457.pseudo-palindromic-paths-in-a-binary-tree.1568/solution.py) [TypeScript](./src/1457.pseudo-palindromic-paths-in-a-binary-tree.1568/solution.ts) | Medium |
| 1458 | Max Dot Product of Two Subsequences | [JavaScript](./src/1458.max-dot-product-of-two-subsequences.1569/solution.js) | Hard |
| 1459 | Rectangles Area | | Medium |
| 1460 | Make Two Arrays Equal by Reversing Subarrays | [JavaScript](./src/1460.make-two-arrays-equal-by-reversing-subarrays.1556/solution.js) | Easy |
| 1461 | Check If a String Contains All Binary Codes of Size K | [JavaScript](./src/1461.check-if-a-string-contains-all-binary-codes-of-size-k.1557/solution.js) | Medium |
| 1462 | Course Schedule IV | [TypeScript](./src/1462.course-schedule-iv.1558/solution.ts) | Medium |
| 1463 | Cherry Pickup II | | Hard |
| 1464 | Maximum Product of Two Elements in an Array | [Java](./src/1464.maximum-product-of-two-elements-in-an-array.1574/solution.java) [JavaScript](./src/1464.maximum-product-of-two-elements-in-an-array.1574/solution.js) [TypeScript](./src/1464.maximum-product-of-two-elements-in-an-array.1574/solution.ts) | Easy |
| 1465 | Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | [JavaScript](./src/1465.maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts.1575/solution.js) | Medium |
| 1466 | Reorder Routes to Make All Paths Lead to the City Zero | [JavaScript](./src/1466.reorder-routes-to-make-all-paths-lead-to-the-city-zero.1576/solution.js) | Medium |
| 1467 | Probability of a Two Boxes Having The Same Number of Distinct Balls | | Hard |
| 1468 | Calculate Salaries | | Medium |
| 1469 | Find All The Lonely Nodes | [JavaScript](./src/1469.find-all-the-lonely-nodes.1609/solution.js) [TypeScript](./src/1469.find-all-the-lonely-nodes.1609/solution.ts) | Easy |
| 1470 | Shuffle the Array | [Java](./src/1470.shuffle-the-array.1580/solution.java) [JavaScript](./src/1470.shuffle-the-array.1580/solution.js) [TypeScript](./src/1470.shuffle-the-array.1580/solution.ts) | Easy |
| 1471 | The k Strongest Values in an Array | [JavaScript](./src/1471.the-k-strongest-values-in-an-array.1581/solution.js) | Medium |
| 1472 | Design Browser History | [JavaScript](./src/1472.design-browser-history.1582/solution.js) [TypeScript](./src/1472.design-browser-history.1582/solution.ts) | Medium |
| 1473 | Paint House III | | Hard |
| 1474 | Delete N Nodes After M Nodes of a Linked List | [JavaScript](./src/1474.delete-n-nodes-after-m-nodes-of-a-linked-list.1618/solution.js) [TypeScript](./src/1474.delete-n-nodes-after-m-nodes-of-a-linked-list.1618/solution.ts) | Easy |
| 1475 | Final Prices With a Special Discount in a Shop | [JavaScript](./src/1475.final-prices-with-a-special-discount-in-a-shop.1570/solution.js) [TypeScript](./src/1475.final-prices-with-a-special-discount-in-a-shop.1570/solution.ts) | Easy |
| 1476 | Subrectangle Queries | [JavaScript](./src/1476.subrectangle-queries.1572/solution.js) | Medium |
| 1477 | Find Two Non-overlapping Sub-arrays Each With Target Sum | [JavaScript](./src/1477.find-two-non-overlapping-sub-arrays-each-with-target-sum.1573/solution.js) | Medium |
| 1478 | Allocate Mailboxes | | Hard |
| 1479 | Sales by Day of the Week | | Hard |
| 1480 | Running Sum of 1d Array | [Java](./src/1480.running-sum-of-1d-array.1603/solution.java) [JavaScript](./src/1480.running-sum-of-1d-array.1603/solution.js) [TypeScript](./src/1480.running-sum-of-1d-array.1603/solution.ts) | Easy |
| 1481 | Least Number of Unique Integers after K Removals | [JavaScript](./src/1481.least-number-of-unique-integers-after-k-removals.1604/solution.js) | Medium |
| 1482 | Minimum Number of Days to Make m Bouquets | [TypeScript](./src/1482.minimum-number-of-days-to-make-m-bouquets.1605/solution.ts) | Medium |
| 1483 | Kth Ancestor of a Tree Node | | Hard |
| 1484 | Group Sold Products By The Date | | Easy |
| 1485 | Clone Binary Tree With Random Pointer | [JavaScript](./src/1485.clone-binary-tree-with-random-pointer.1624/solution.js) [TypeScript](./src/1485.clone-binary-tree-with-random-pointer.1624/solution.ts) | Medium |
| 1486 | XOR Operation in an Array | [JavaScript](./src/1486.xor-operation-in-an-array.1610/solution.js) [TypeScript](./src/1486.xor-operation-in-an-array.1610/solution.ts) | Easy |
| 1487 | Making File Names Unique | [JavaScript](./src/1487.making-file-names-unique.1611/solution.js) | Medium |
| 1488 | Avoid Flood in The City | | Medium |
| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | | Hard |
| 1490 | Clone N-ary Tree | [JavaScript](./src/1490.clone-n-ary-tree.1634/solution.js) [TypeScript](./src/1490.clone-n-ary-tree.1634/solution.ts) | Medium |
| 1491 | Average Salary Excluding the Minimum and Maximum Salary | [Java](./src/1491.average-salary-excluding-the-minimum-and-maximum-salary.1584/solution.java) [JavaScript](./src/1491.average-salary-excluding-the-minimum-and-maximum-salary.1584/solution.js) [TypeScript](./src/1491.average-salary-excluding-the-minimum-and-maximum-salary.1584/solution.ts) | Easy |
| 1492 | The kth Factor of n | [JavaScript](./src/1492.the-kth-factor-of-n.1585/solution.js) | Medium |
| 1493 | Longest Subarray of 1's After Deleting One Element | [JavaScript](./src/1493.longest-subarray-of-1s-after-deleting-one-element.1586/solution.js) | Medium |
| 1494 | Parallel Courses II | | Hard |
| 1495 | Friendly Movies Streamed Last Month | | Easy |
| 1496 | Path Crossing | [JavaScript](./src/1496.path-crossing.1619/solution.js) [TypeScript](./src/1496.path-crossing.1619/solution.ts) | Easy |
| 1497 | Check If Array Pairs Are Divisible by k | [JavaScript](./src/1497.check-if-array-pairs-are-divisible-by-k.1620/solution.js) | Medium |
| 1498 | Number of Subsequences That Satisfy the Given Sum Condition | [JavaScript](./src/1498.number-of-subsequences-that-satisfy-the-given-sum-condition.1621/solution.js) | Medium |
| 1499 | Max Value of Equation | | Hard |
| 1500 | Design a File Sharing System | | Medium |
| 1501 | Countries You Can Safely Invest In | | Medium |
| 1502 | Can Make Arithmetic Progression From Sequence | [Java](./src/1502.can-make-arithmetic-progression-from-sequence.1626/solution.java) [JavaScript](./src/1502.can-make-arithmetic-progression-from-sequence.1626/solution.js) [TypeScript](./src/1502.can-make-arithmetic-progression-from-sequence.1626/solution.ts) | Easy |
| 1503 | Last Moment Before All Ants Fall Out of a Plank | [TypeScript](./src/1503.last-moment-before-all-ants-fall-out-of-a-plank.1627/solution.ts) | Medium |
| 1504 | Count Submatrices With All Ones | [TypeScript](./src/1504.count-submatrices-with-all-ones.1628/solution.ts) | Medium |
| 1505 | Minimum Possible Integer After at Most K Adjacent Swaps On Digits | | Hard |
| 1506 | Find Root of N-Ary Tree | [JavaScript](./src/1506.find-root-of-n-ary-tree.1650/solution.js) | Medium |
| 1507 | Reformat Date | [Java](./src/1507.reformat-date.1283/solution.java) [JavaScript](./src/1507.reformat-date.1283/solution.js) [TypeScript](./src/1507.reformat-date.1283/solution.ts) | Easy |
| 1508 | Range Sum of Sorted Subarray Sums | [JavaScript](./src/1508.range-sum-of-sorted-subarray-sums.1615/solution.js) | Medium |
| 1509 | Minimum Difference Between Largest and Smallest Value in Three Moves | [JavaScript](./src/1509.minimum-difference-between-largest-and-smallest-value-in-three-moves.1616/solution.js) | Medium |
| 1510 | Stone Game IV | [JavaScript](./src/1510.stone-game-iv.1617/solution.js) | Hard |
| 1511 | Customer Order Frequency | | Easy |
| 1512 | Number of Good Pairs | [Java](./src/1512.number-of-good-pairs.1635/solution.java) [JavaScript](./src/1512.number-of-good-pairs.1635/solution.js) [TypeScript](./src/1512.number-of-good-pairs.1635/solution.ts) | Easy |
| 1513 | Number of Substrings With Only 1s | [JavaScript](./src/1513.number-of-substrings-with-only-1s.1636/solution.js) [TypeScript](./src/1513.number-of-substrings-with-only-1s.1636/solution.ts) | Medium |
| 1514 | Path with Maximum Probability | [JavaScript](./src/1514.path-with-maximum-probability.1325/solution.js) | Medium |
| 1515 | Best Position for a Service Centre | | Hard |
| 1516 | Move Sub-Tree of N-Ary Tree | | Hard |
| 1517 | Find Users With Valid E-Mails | | Easy |
| 1518 | Water Bottles | [Java](./src/1518.water-bottles.1642/solution.java) [JavaScript](./src/1518.water-bottles.1642/solution.js) [TypeScript](./src/1518.water-bottles.1642/solution.ts) | Easy |
| 1519 | Number of Nodes in the Sub-Tree With the Same Label | [JavaScript](./src/1519.number-of-nodes-in-the-sub-tree-with-the-same-label.1643/solution.js) | Medium |
| 1520 | Maximum Number of Non-Overlapping Substrings | | Hard |
| 1521 | Find a Value of a Mysterious Function Closest to Target | | Hard |
| 1522 | Diameter of N-Ary Tree | [JavaScript](./src/1522.diameter-of-n-ary-tree.1665/solution.js) [TypeScript](./src/1522.diameter-of-n-ary-tree.1665/solution.ts) | Medium |
| 1523 | Count Odd Numbers in an Interval Range | [Java](./src/1523.count-odd-numbers-in-an-interval-range.1630/solution.java) [JavaScript](./src/1523.count-odd-numbers-in-an-interval-range.1630/solution.js) [TypeScript](./src/1523.count-odd-numbers-in-an-interval-range.1630/solution.ts) | Easy |
| 1524 | Number of Sub-arrays With Odd Sum | [JavaScript](./src/1524.number-of-sub-arrays-with-odd-sum.1631/solution.js) [TypeScript](./src/1524.number-of-sub-arrays-with-odd-sum.1631/solution.ts) | Medium |
| 1525 | Number of Good Ways to Split a String | [JavaScript](./src/1525.number-of-good-ways-to-split-a-string.1632/solution.js) | Medium |
| 1526 | Minimum Number of Increments on Subarrays to Form a Target Array | [JavaScript](./src/1526.minimum-number-of-increments-on-subarrays-to-form-a-target-array.1633/solution.js) | Hard |
| 1527 | Patients With a Condition | | Easy |
| 1528 | Shuffle String | [Java](./src/1528.shuffle-string.1651/solution.java) [JavaScript](./src/1528.shuffle-string.1651/solution.js) [TypeScript](./src/1528.shuffle-string.1651/solution.ts) | Easy |
| 1529 | Minimum Suffix Flips | [JavaScript](./src/1529.minimum-suffix-flips.1652/solution.js) | Medium |
| 1530 | Number of Good Leaf Nodes Pairs | [JavaScript](./src/1530.number-of-good-leaf-nodes-pairs.1653/solution.js) | Medium |
| 1531 | String Compression II | | Hard |
| 1532 | The Most Recent Three Orders | | Medium |
| 1533 | Find the Index of the Large Integer | | Medium |
| 1534 | Count Good Triplets | [JavaScript](./src/1534.count-good-triplets.1656/solution.js) [TypeScript](./src/1534.count-good-triplets.1656/solution.ts) | Easy |
| 1535 | Find the Winner of an Array Game | [JavaScript](./src/1535.find-the-winner-of-an-array-game.1657/solution.js) | Medium |
| 1536 | Minimum Swaps to Arrange a Binary Grid | | Medium |
| 1537 | Get the Maximum Score | [JavaScript](./src/1537.get-the-maximum-score.1659/solution.js) | Hard |
| 1538 | Guess the Majority in a Hidden Array | | Medium |
| 1539 | Kth Missing Positive Number | [JavaScript](./src/1539.kth-missing-positive-number.1646/solution.js) | Easy |
| 1540 | Can Convert String in K Moves | [JavaScript](./src/1540.can-convert-string-in-k-moves.1647/solution.js) | Medium |
| 1541 | Minimum Insertions to Balance a Parentheses String | [JavaScript](./src/1541.minimum-insertions-to-balance-a-parentheses-string.1648/solution.js) | Medium |
| 1542 | Find Longest Awesome Substring | [JavaScript](./src/1542.find-longest-awesome-substring.1668/solution.js) | Hard |
| 1543 | Fix Product Name Format | | Easy |
| 1544 | Make The String Great | [JavaScript](./src/1544.make-the-string-great.1666/solution.js) [TypeScript](./src/1544.make-the-string-great.1666/solution.ts) | Easy |
| 1545 | Find Kth Bit in Nth Binary String | [JavaScript](./src/1545.find-kth-bit-in-nth-binary-string.1667/solution.js) | Medium |
| 1546 | Maximum Number of Non-Overlapping Subarrays With Sum Equals Target | [TypeScript](./src/1546.maximum-number-of-non-overlapping-subarrays-with-sum-equals-target.1649/solution.ts) | Medium |
| 1547 | Minimum Cost to Cut a Stick | | Hard |
| 1548 | The Most Similar Path in a Graph | | Hard |
| 1549 | The Most Recent Orders for Each Product | | Medium |
| 1550 | Three Consecutive Odds | [Java](./src/1550.three-consecutive-odds.1293/solution.java) [JavaScript](./src/1550.three-consecutive-odds.1293/solution.js) [TypeScript](./src/1550.three-consecutive-odds.1293/solution.ts) | Easy |
| 1551 | Minimum Operations to Make Array Equal | [JavaScript](./src/1551.minimum-operations-to-make-array-equal.1674/solution.js) | Medium |
| 1552 | Magnetic Force Between Two Balls | [TypeScript](./src/1552.magnetic-force-between-two-balls.1675/solution.ts) | Medium |
| 1553 | Minimum Number of Days to Eat N Oranges | [JavaScript](./src/1553.minimum-number-of-days-to-eat-n-oranges.1676/solution.js) | Hard |
| 1554 | Strings Differ by One Character | [JavaScript](./src/1554.strings-differ-by-one-character.1697/solution.js) | Medium |
| 1555 | Bank Account Summary | | Medium |
| 1556 | Thousand Separator | [Java](./src/1556.thousand-separator.1660/solution.java) [JavaScript](./src/1556.thousand-separator.1660/solution.js) [TypeScript](./src/1556.thousand-separator.1660/solution.ts) | Easy |
| 1557 | Minimum Number of Vertices to Reach All Nodes | [JavaScript](./src/1557.minimum-number-of-vertices-to-reach-all-nodes.1661/solution.js) | Medium |
| 1558 | Minimum Numbers of Function Calls to Make Target Array | [JavaScript](./src/1558.minimum-numbers-of-function-calls-to-make-target-array.1662/solution.js) | Medium |
| 1559 | Detect Cycles in 2D Grid | | Medium |
| 1560 | Most Visited Sector in a Circular Track | [JavaScript](./src/1560.most-visited-sector-in-a-circular-track.1682/solution.js) | Easy |
| 1561 | Maximum Number of Coins You Can Get | [JavaScript](./src/1561.maximum-number-of-coins-you-can-get.1683/solution.js) [TypeScript](./src/1561.maximum-number-of-coins-you-can-get.1683/solution.ts) | Medium |
| 1562 | Find Latest Group of Size M | | Medium |
| 1563 | Stone Game V | | Hard |
| 1564 | Put Boxes Into the Warehouse I | | Medium |
| 1565 | Unique Orders and Customers Per Month | | Easy |
| 1566 | Detect Pattern of Length M Repeated K or More Times | [JavaScript](./src/1566.detect-pattern-of-length-m-repeated-k-or-more-times.1689/solution.js) [TypeScript](./src/1566.detect-pattern-of-length-m-repeated-k-or-more-times.1689/solution.ts) | Easy |
| 1567 | Maximum Length of Subarray With Positive Product | [JavaScript](./src/1567.maximum-length-of-subarray-with-positive-product.1690/solution.js) [TypeScript](./src/1567.maximum-length-of-subarray-with-positive-product.1690/solution.ts) | Medium |
| 1568 | Minimum Number of Days to Disconnect Island | | Hard |
| 1569 | Number of Ways to Reorder Array to Get Same BST | | Hard |
| 1570 | Dot Product of Two Sparse Vectors | [JavaScript](./src/1570.dot-product-of-two-sparse-vectors.1713/solution.js) [TypeScript](./src/1570.dot-product-of-two-sparse-vectors.1713/solution.ts) | Medium |
| 1571 | Warehouse Manager | | Easy |
| 1572 | Matrix Diagonal Sum | [Java](./src/1572.matrix-diagonal-sum.1677/solution.java) [JavaScript](./src/1572.matrix-diagonal-sum.1677/solution.js) [TypeScript](./src/1572.matrix-diagonal-sum.1677/solution.ts) | Easy |
| 1573 | Number of Ways to Split a String | [TypeScript](./src/1573.number-of-ways-to-split-a-string.1678/solution.ts) | Medium |
| 1574 | Shortest Subarray to be Removed to Make Array Sorted | [TypeScript](./src/1574.shortest-subarray-to-be-removed-to-make-array-sorted.1679/solution.ts) | Medium |
| 1575 | Count All Possible Routes | | Hard |
| 1576 | Replace All ?'s to Avoid Consecutive Repeating Characters | [JavaScript](./src/1576.replace-all-s-to-avoid-consecutive-repeating-characters.1698/solution.js) | Easy |
| 1577 | Number of Ways Where Square of Number Is Equal to Product of Two Numbers | [JavaScript](./src/1577.number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers.1699/solution.js) | Medium |
| 1578 | Minimum Time to Make Rope Colorful | [JavaScript](./src/1578.minimum-time-to-make-rope-colorful.1700/solution.js) | Medium |
| 1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | | Hard |
| 1580 | Put Boxes Into the Warehouse II | | Medium |
| 1581 | Customer Who Visited but Did Not Make Any Transactions | | Easy |
| 1582 | Special Positions in a Binary Matrix | [JavaScript](./src/1582.special-positions-in-a-binary-matrix.1704/solution.js) [TypeScript](./src/1582.special-positions-in-a-binary-matrix.1704/solution.ts) | Easy |
| 1583 | Count Unhappy Friends | | Medium |
| 1584 | Min Cost to Connect All Points | | Medium |
| 1585 | Check If String Is Transformable With Substring Sort Operations | | Hard |
| 1586 | Binary Search Tree Iterator II | [JavaScript](./src/1586.binary-search-tree-iterator-ii.1729/solution.js) | Medium |
| 1587 | Bank Account Summary II | | Easy |
| 1588 | Sum of All Odd Length Subarrays | [JavaScript](./src/1588.sum-of-all-odd-length-subarrays.1693/solution.js) [TypeScript](./src/1588.sum-of-all-odd-length-subarrays.1693/solution.ts) | Easy |
| 1589 | Maximum Sum Obtained of Any Permutation | [JavaScript](./src/1589.maximum-sum-obtained-of-any-permutation.1695/solution.js) [TypeScript](./src/1589.maximum-sum-obtained-of-any-permutation.1695/solution.ts) | Medium |
| 1590 | Make Sum Divisible by P | [TypeScript](./src/1590.make-sum-divisible-by-p.1694/solution.ts) | Medium |
| 1591 | Strange Printer II | | Hard |
| 1592 | Rearrange Spaces Between Words | [JavaScript](./src/1592.rearrange-spaces-between-words.1714/solution.js) [TypeScript](./src/1592.rearrange-spaces-between-words.1714/solution.ts) | Easy |
| 1593 | Split a String Into the Max Number of Unique Substrings | [JavaScript](./src/1593.split-a-string-into-the-max-number-of-unique-substrings.1715/solution.js) [TypeScript](./src/1593.split-a-string-into-the-max-number-of-unique-substrings.1715/solution.ts) | Medium |
| 1594 | Maximum Non Negative Product in a Matrix | [TypeScript](./src/1594.maximum-non-negative-product-in-a-matrix.1716/solution.ts) | Medium |
| 1595 | Minimum Cost to Connect Two Groups of Points | | Hard |
| 1596 | The Most Frequently Ordered Products for Each Customer | | Medium |
| 1597 | Build Binary Expression Tree From Infix Expression | | Hard |
| 1598 | Crawler Log Folder | [JavaScript](./src/1598.crawler-log-folder.1720/solution.js) [TypeScript](./src/1598.crawler-log-folder.1720/solution.ts) | Easy |
| 1599 | Maximum Profit of Operating a Centennial Wheel | | Medium |
| 1600 | Throne Inheritance | [TypeScript](./src/1600.throne-inheritance.1722/solution.ts) | Medium |
| 1601 | Maximum Number of Achievable Transfer Requests | | Hard |
| 1602 | Find Nearest Right Node in Binary Tree | [JavaScript](./src/1602.find-nearest-right-node-in-binary-tree.1745/solution.js) [TypeScript](./src/1602.find-nearest-right-node-in-binary-tree.1745/solution.ts) | Medium |
| 1603 | Design Parking System | [Java](./src/1603.design-parking-system.1708/solution.java) [JavaScript](./src/1603.design-parking-system.1708/solution.js) [TypeScript](./src/1603.design-parking-system.1708/solution.ts) | Easy |
| 1604 | Alert Using Same Key-Card Three or More Times in a One Hour Period | [JavaScript](./src/1604.alert-using-same-key-card-three-or-more-times-in-a-one-hour-period.1709/solution.js) [TypeScript](./src/1604.alert-using-same-key-card-three-or-more-times-in-a-one-hour-period.1709/solution.ts) | Medium |
| 1605 | Find Valid Matrix Given Row and Column Sums | | Medium |
| 1606 | Find Servers That Handled Most Number of Requests | | Hard |
| 1607 | Sellers With No Sales | | Easy |
| 1608 | Special Array With X Elements Greater Than or Equal X | [JavaScript](./src/1608.special-array-with-x-elements-greater-than-or-equal-x.1730/solution.js) [TypeScript](./src/1608.special-array-with-x-elements-greater-than-or-equal-x.1730/solution.ts) | Easy |
| 1609 | Even Odd Tree | [JavaScript](./src/1609.even-odd-tree.1731/solution.js) [TypeScript](./src/1609.even-odd-tree.1731/solution.ts) | Medium |
| 1610 | Maximum Number of Visible Points | | Hard |
| 1611 | Minimum One Bit Operations to Make Integers Zero | | Hard |
| 1612 | Check If Two Expression Trees are Equivalent | [JavaScript](./src/1612.check-if-two-expression-trees-are-equivalent.1750/solution.js) | Medium |
| 1613 | Find the Missing IDs | | Medium |
| 1614 | Maximum Nesting Depth of the Parentheses | [JavaScript](./src/1614.maximum-nesting-depth-of-the-parentheses.1737/solution.js) [TypeScript](./src/1614.maximum-nesting-depth-of-the-parentheses.1737/solution.ts) | Easy |
| 1615 | Maximal Network Rank | [TypeScript](./src/1615.maximal-network-rank.1738/solution.ts) | Medium |
| 1616 | Split Two Strings to Make Palindrome | [JavaScript](./src/1616.split-two-strings-to-make-palindrome.1739/solution.js) | Medium |
| 1617 | Count Subtrees With Max Distance Between Cities | | Hard |
| 1618 | Maximum Font to Fit a Sentence in a Screen | [JavaScript](./src/1618.maximum-font-to-fit-a-sentence-in-a-screen.1384/solution.js) | Medium |
| 1619 | Mean of Array After Removing Some Elements | [Java](./src/1619.mean-of-array-after-removing-some-elements.1210/solution.java) [JavaScript](./src/1619.mean-of-array-after-removing-some-elements.1210/solution.js) [TypeScript](./src/1619.mean-of-array-after-removing-some-elements.1210/solution.ts) | Easy |
| 1620 | Coordinate With Maximum Network Quality | [TypeScript](./src/1620.coordinate-with-maximum-network-quality.1726/solution.ts) | Medium |
| 1621 | Number of Sets of K Non-Overlapping Line Segments | | Medium |
| 1622 | Fancy Sequence | | Hard |
| 1623 | All Valid Triplets That Can Represent a Country | | Easy |
| 1624 | Largest Substring Between Two Equal Characters | [Java](./src/1624.largest-substring-between-two-equal-characters.1746/solution.java) [JavaScript](./src/1624.largest-substring-between-two-equal-characters.1746/solution.js) | Easy |
| 1625 | Lexicographically Smallest String After Applying Operations | | Medium |
| 1626 | Best Team With No Conflicts | | Medium |
| 1627 | Graph Connectivity With Threshold | | Hard |
| 1628 | Design an Expression Tree With Evaluate Function | | Medium |
| 1629 | Slowest Key | [Java](./src/1629.slowest-key.1751/solution.java) [JavaScript](./src/1629.slowest-key.1751/solution.js) [TypeScript](./src/1629.slowest-key.1751/solution.ts) | Easy |
| 1630 | Arithmetic Subarrays | [JavaScript](./src/1630.arithmetic-subarrays.1752/solution.js) | Medium |
| 1631 | Path With Minimum Effort | | Medium |
| 1632 | Rank Transform of a Matrix | | Hard |
| 1633 | Percentage of Users Attended a Contest | | Easy |
| 1634 | Add Two Polynomials Represented as Linked Lists | [JavaScript](./src/1634.add-two-polynomials-represented-as-linked-lists.1774/solution.js) | Medium |
| 1635 | Hopper Company Queries I | | Hard |
| 1636 | Sort Array by Increasing Frequency | [Java](./src/1636.sort-array-by-increasing-frequency.1741/solution.java) [JavaScript](./src/1636.sort-array-by-increasing-frequency.1741/solution.js) [TypeScript](./src/1636.sort-array-by-increasing-frequency.1741/solution.ts) | Easy |
| 1637 | Widest Vertical Area Between Two Points Containing No Points | [JavaScript](./src/1637.widest-vertical-area-between-two-points-containing-no-points.1742/solution.js) | Easy |
| 1638 | Count Substrings That Differ by One Character | | Medium |
| 1639 | Number of Ways to Form a Target String Given a Dictionary | | Hard |
| 1640 | Check Array Formation Through Concatenation | [JavaScript](./src/1640.check-array-formation-through-concatenation.1760/solution.js) [TypeScript](./src/1640.check-array-formation-through-concatenation.1760/solution.ts) | Easy |
| 1641 | Count Sorted Vowel Strings | [JavaScript](./src/1641.count-sorted-vowel-strings.1761/solution.js) [TypeScript](./src/1641.count-sorted-vowel-strings.1761/solution.ts) | Medium |
| 1642 | Furthest Building You Can Reach | | Medium |
| 1643 | Kth Smallest Instructions | | Hard |
| 1644 | Lowest Common Ancestor of a Binary Tree II | [JavaScript](./src/1644.lowest-common-ancestor-of-a-binary-tree-ii.1780/solution.js) | Medium |
| 1645 | Hopper Company Queries II | | Hard |
| 1646 | Get Maximum in Generated Array | [Java](./src/1646.get-maximum-in-generated-array.1769/solution.java) [JavaScript](./src/1646.get-maximum-in-generated-array.1769/solution.js) [TypeScript](./src/1646.get-maximum-in-generated-array.1769/solution.ts) | Easy |
| 1647 | Minimum Deletions to Make Character Frequencies Unique | [JavaScript](./src/1647.minimum-deletions-to-make-character-frequencies-unique.1770/solution.js) [TypeScript](./src/1647.minimum-deletions-to-make-character-frequencies-unique.1770/solution.ts) | Medium |
| 1648 | Sell Diminishing-Valued Colored Balls | [TypeScript](./src/1648.sell-diminishing-valued-colored-balls.1771/solution.ts) | Medium |
| 1649 | Create Sorted Array through Instructions | | Hard |
| 1650 | Lowest Common Ancestor of a Binary Tree III | [JavaScript](./src/1650.lowest-common-ancestor-of-a-binary-tree-iii.1790/solution.js) [TypeScript](./src/1650.lowest-common-ancestor-of-a-binary-tree-iii.1790/solution.ts) | Medium |
| 1651 | Hopper Company Queries III | | Hard |
| 1652 | Defuse the Bomb | [JavaScript](./src/1652.defuse-the-bomb.1755/solution.js) [TypeScript](./src/1652.defuse-the-bomb.1755/solution.ts) | Easy |
| 1653 | Minimum Deletions to Make String Balanced | [JavaScript](./src/1653.minimum-deletions-to-make-string-balanced.1756/solution.js) | Medium |
| 1654 | Minimum Jumps to Reach Home | | Medium |
| 1655 | Distribute Repeating Integers | | Hard |
| 1656 | Design an Ordered Stream | [JavaScript](./src/1656.design-an-ordered-stream.1775/solution.js) [TypeScript](./src/1656.design-an-ordered-stream.1775/solution.ts) | Easy |
| 1657 | Determine if Two Strings Are Close | [JavaScript](./src/1657.determine-if-two-strings-are-close.1777/solution.js) [TypeScript](./src/1657.determine-if-two-strings-are-close.1777/solution.ts) | Medium |
| 1658 | Minimum Operations to Reduce X to Zero | [TypeScript](./src/1658.minimum-operations-to-reduce-x-to-zero.1776/solution.ts) | Medium |
| 1659 | Maximize Grid Happiness | | Hard |
| 1660 | Correct a Binary Tree | [JavaScript](./src/1660.correct-a-binary-tree.1796/solution.js) | Medium |
| 1661 | Average Time of Process per Machine | | Easy |
| 1662 | Check If Two String Arrays are Equivalent | [Java](./src/1662.check-if-two-string-arrays-are-equivalent.1781/solution.java) [JavaScript](./src/1662.check-if-two-string-arrays-are-equivalent.1781/solution.js) [TypeScript](./src/1662.check-if-two-string-arrays-are-equivalent.1781/solution.ts) | Easy |
| 1663 | Smallest String With A Given Numeric Value | [JavaScript](./src/1663.smallest-string-with-a-given-numeric-value.1782/solution.js) [TypeScript](./src/1663.smallest-string-with-a-given-numeric-value.1782/solution.ts) | Medium |
| 1664 | Ways to Make a Fair Array | [JavaScript](./src/1664.ways-to-make-a-fair-array.1783/solution.js) | Medium |
| 1665 | Minimum Initial Energy to Finish Tasks | | Hard |
| 1666 | Change the Root of a Binary Tree | | Medium |
| 1667 | Fix Names in a Table | | Easy |
| 1668 | Maximum Repeating Substring | [JavaScript](./src/1668.maximum-repeating-substring.1764/solution.js) [TypeScript](./src/1668.maximum-repeating-substring.1764/solution.ts) | Easy |
| 1669 | Merge In Between Linked Lists | [JavaScript](./src/1669.merge-in-between-linked-lists.1765/solution.js) [TypeScript](./src/1669.merge-in-between-linked-lists.1765/solution.ts) | Medium |
| 1670 | Design Front Middle Back Queue | [JavaScript](./src/1670.design-front-middle-back-queue.1767/solution.js) [TypeScript](./src/1670.design-front-middle-back-queue.1767/solution.ts) | Medium |
| 1671 | Minimum Number of Removals to Make Mountain Array | | Hard |
| 1672 | Richest Customer Wealth | [Java](./src/1672.richest-customer-wealth.1791/solution.java) [JavaScript](./src/1672.richest-customer-wealth.1791/solution.js) [TypeScript](./src/1672.richest-customer-wealth.1791/solution.ts) | Easy |
| 1673 | Find the Most Competitive Subsequence | [JavaScript](./src/1673.find-the-most-competitive-subsequence.1792/solution.js) [TypeScript](./src/1673.find-the-most-competitive-subsequence.1792/solution.ts) | Medium |
| 1674 | Minimum Moves to Make Array Complementary | | Medium |
| 1675 | Minimize Deviation in Array | | Hard |
| 1676 | Lowest Common Ancestor of a Binary Tree IV | [JavaScript](./src/1676.lowest-common-ancestor-of-a-binary-tree-iv.1816/solution.js) | Medium |
| 1677 | Product's Worth Over Invoices | | Easy |
| 1678 | Goal Parser Interpretation | [Java](./src/1678.goal-parser-interpretation.1797/solution.java) [JavaScript](./src/1678.goal-parser-interpretation.1797/solution.js) [TypeScript](./src/1678.goal-parser-interpretation.1797/solution.ts) | Easy |
| 1679 | Max Number of K-Sum Pairs | [JavaScript](./src/1679.max-number-of-k-sum-pairs.1798/solution.js) [TypeScript](./src/1679.max-number-of-k-sum-pairs.1798/solution.ts) | Medium |
| 1680 | Concatenation of Consecutive Binary Numbers | [JavaScript](./src/1680.concatenation-of-consecutive-binary-numbers.1800/solution.js) [TypeScript](./src/1680.concatenation-of-consecutive-binary-numbers.1800/solution.ts) | Medium |
| 1681 | Minimum Incompatibility | | Hard |
| 1682 | Longest Palindromic Subsequence II | | Medium |
| 1683 | Invalid Tweets | | Easy |
| 1684 | Count the Number of Consistent Strings | [Java](./src/1684.count-the-number-of-consistent-strings.1786/solution.java) [JavaScript](./src/1684.count-the-number-of-consistent-strings.1786/solution.js) [TypeScript](./src/1684.count-the-number-of-consistent-strings.1786/solution.ts) | Easy |
| 1685 | Sum of Absolute Differences in a Sorted Array | [JavaScript](./src/1685.sum-of-absolute-differences-in-a-sorted-array.1787/solution.js) [TypeScript](./src/1685.sum-of-absolute-differences-in-a-sorted-array.1787/solution.ts) | Medium |
| 1686 | Stone Game VI | | Medium |
| 1687 | Delivering Boxes from Storage to Ports | | Hard |
| 1688 | Count of Matches in Tournament | [Java](./src/1688.count-of-matches-in-tournament.1806/solution.java) [JavaScript](./src/1688.count-of-matches-in-tournament.1806/solution.js) [TypeScript](./src/1688.count-of-matches-in-tournament.1806/solution.ts) | Easy |
| 1689 | Partitioning Into Minimum Number Of Deci-Binary Numbers | [JavaScript](./src/1689.partitioning-into-minimum-number-of-deci-binary-numbers.1807/solution.js) [TypeScript](./src/1689.partitioning-into-minimum-number-of-deci-binary-numbers.1807/solution.ts) | Medium |
| 1690 | Stone Game VII | | Medium |
| 1691 | Maximum Height by Stacking Cuboids | | Hard |
| 1692 | Count Ways to Distribute Candies | | Hard |
| 1693 | Daily Leads and Partners | | Easy |
| 1694 | Reformat Phone Number | [Java](./src/1694.reformat-phone-number.1812/solution.java) [JavaScript](./src/1694.reformat-phone-number.1812/solution.js) [TypeScript](./src/1694.reformat-phone-number.1812/solution.ts) | Easy |
| 1695 | Maximum Erasure Value | [JavaScript](./src/1695.maximum-erasure-value.1813/solution.js) | Medium |
| 1696 | Jump Game VI | [JavaScript](./src/1696.jump-game-vi.1814/solution.js) | Medium |
| 1697 | Checking Existence of Edge Length Limited Paths | | Hard |
| 1698 | Number of Distinct Substrings in a String | | Medium |
| 1699 | Number of Calls Between Two Persons | | Medium |
| 1700 | Number of Students Unable to Eat Lunch | [JavaScript](./src/1700.number-of-students-unable-to-eat-lunch.1802/solution.js) [TypeScript](./src/1700.number-of-students-unable-to-eat-lunch.1802/solution.ts) | Easy |
| 1701 | Average Waiting Time | [JavaScript](./src/1701.average-waiting-time.1803/solution.js) [TypeScript](./src/1701.average-waiting-time.1803/solution.ts) | Medium |
| 1702 | Maximum Binary String After Change | [JavaScript](./src/1702.maximum-binary-string-after-change.1804/solution.js) [TypeScript](./src/1702.maximum-binary-string-after-change.1804/solution.ts) | Medium |
| 1703 | Minimum Adjacent Swaps for K Consecutive Ones | | Hard |
| 1704 | Determine if String Halves Are Alike | [Java](./src/1704.determine-if-string-halves-are-alike.1823/solution.java) [JavaScript](./src/1704.determine-if-string-halves-are-alike.1823/solution.js) [TypeScript](./src/1704.determine-if-string-halves-are-alike.1823/solution.ts) | Easy |
| 1705 | Maximum Number of Eaten Apples | [JavaScript](./src/1705.maximum-number-of-eaten-apples.1824/solution.js) [TypeScript](./src/1705.maximum-number-of-eaten-apples.1824/solution.ts) | Medium |
| 1706 | Where Will the Ball Fall | | Medium |
| 1707 | Maximum XOR With an Element From Array | | Hard |
| 1708 | Largest Subarray Length K | [JavaScript](./src/1708.largest-subarray-length-k.1847/solution.js) [TypeScript](./src/1708.largest-subarray-length-k.1847/solution.ts) | Easy |
| 1709 | Biggest Window Between Visits | | Medium |
| 1710 | Maximum Units on a Truck | [Java](./src/1710.maximum-units-on-a-truck.1829/solution.java) [JavaScript](./src/1710.maximum-units-on-a-truck.1829/solution.js) [TypeScript](./src/1710.maximum-units-on-a-truck.1829/solution.ts) | Easy |
| 1711 | Count Good Meals | [JavaScript](./src/1711.count-good-meals.1830/solution.js) [TypeScript](./src/1711.count-good-meals.1830/solution.ts) | Medium |
| 1712 | Ways to Split Array Into Three Subarrays | [JavaScript](./src/1712.ways-to-split-array-into-three-subarrays.1831/solution.js) [TypeScript](./src/1712.ways-to-split-array-into-three-subarrays.1831/solution.ts) | Medium |
| 1713 | Minimum Operations to Make a Subsequence | | Hard |
| 1714 | Sum Of Special Evenly-Spaced Elements In Array | | Hard |
| 1715 | Count Apples and Oranges | | Medium |
| 1716 | Calculate Money in Leetcode Bank | [JavaScript](./src/1716.calculate-money-in-leetcode-bank.1817/solution.js) [TypeScript](./src/1716.calculate-money-in-leetcode-bank.1817/solution.ts) | Easy |
| 1717 | Maximum Score From Removing Substrings | | Medium |
| 1718 | Construct the Lexicographically Largest Valid Sequence | | Medium |
| 1719 | Number Of Ways To Reconstruct A Tree | | Hard |
| 1720 | Decode XORed Array | [Java](./src/1720.decode-xored-array.1839/solution.java) [JavaScript](./src/1720.decode-xored-array.1839/solution.js) [TypeScript](./src/1720.decode-xored-array.1839/solution.ts) | Easy |
| 1721 | Swapping Nodes in a Linked List | [JavaScript](./src/1721.swapping-nodes-in-a-linked-list.528/solution.js) [TypeScript](./src/1721.swapping-nodes-in-a-linked-list.528/solution.ts) | Medium |
| 1722 | Minimize Hamming Distance After Swap Operations | [JavaScript](./src/1722.minimize-hamming-distance-after-swap-operations.1840/solution.js) [TypeScript](./src/1722.minimize-hamming-distance-after-swap-operations.1840/solution.ts) | Medium |
| 1723 | Find Minimum Time to Finish All Jobs | | Hard |
| 1724 | Checking Existence of Edge Length Limited Paths II | | Hard |
| 1725 | Number Of Rectangles That Can Form The Largest Square | [JavaScript](./src/1725.number-of-rectangles-that-can-form-the-largest-square.1843/solution.js) [TypeScript](./src/1725.number-of-rectangles-that-can-form-the-largest-square.1843/solution.ts) | Easy |
| 1726 | Tuple with Same Product | [JavaScript](./src/1726.tuple-with-same-product.1364/solution.js) [TypeScript](./src/1726.tuple-with-same-product.1364/solution.ts) | Medium |
| 1727 | Largest Submatrix With Rearrangements | | Medium |
| 1728 | Cat and Mouse II | | Hard |
| 1729 | Find Followers Count | | Easy |
| 1730 | Shortest Path to Get Food | | Medium |
| 1731 | The Number of Employees Which Report to Each Employee | | Easy |
| 1732 | Find the Highest Altitude | [Java](./src/1732.find-the-highest-altitude.1833/solution.java) [JavaScript](./src/1732.find-the-highest-altitude.1833/solution.js) [TypeScript](./src/1732.find-the-highest-altitude.1833/solution.ts) | Easy |
| 1733 | Minimum Number of People to Teach | [JavaScript](./src/1733.minimum-number-of-people-to-teach.1834/solution.js) [TypeScript](./src/1733.minimum-number-of-people-to-teach.1834/solution.ts) | Medium |
| 1734 | Decode XORed Permutation | [JavaScript](./src/1734.decode-xored-permutation.1835/solution.js) [TypeScript](./src/1734.decode-xored-permutation.1835/solution.ts) | Medium |
| 1735 | Count Ways to Make Array With Product | | Hard |
| 1736 | Latest Time by Replacing Hidden Digits | [JavaScript](./src/1736.latest-time-by-replacing-hidden-digits.1858/solution.js) [TypeScript](./src/1736.latest-time-by-replacing-hidden-digits.1858/solution.ts) | Easy |
| 1737 | Change Minimum Characters to Satisfy One of Three Conditions | [JavaScript](./src/1737.change-minimum-characters-to-satisfy-one-of-three-conditions.1859/solution.js) [TypeScript](./src/1737.change-minimum-characters-to-satisfy-one-of-three-conditions.1859/solution.ts) | Medium |
| 1738 | Find Kth Largest XOR Coordinate Value | [JavaScript](./src/1738.find-kth-largest-xor-coordinate-value.1860/solution.js) [TypeScript](./src/1738.find-kth-largest-xor-coordinate-value.1860/solution.ts) | Medium |
| 1739 | Building Boxes | | Hard |
| 1740 | Find Distance in a Binary Tree | [JavaScript](./src/1740.find-distance-in-a-binary-tree.1883/solution.js) [TypeScript](./src/1740.find-distance-in-a-binary-tree.1883/solution.ts) | Medium |
| 1741 | Find Total Time Spent by Each Employee | | Easy |
| 1742 | Maximum Number of Balls in a Box | [JavaScript](./src/1742.maximum-number-of-balls-in-a-box.1844/solution.js) [TypeScript](./src/1742.maximum-number-of-balls-in-a-box.1844/solution.ts) | Easy |
| 1743 | Restore the Array From Adjacent Pairs | [JavaScript](./src/1743.restore-the-array-from-adjacent-pairs.1866/solution.js) [TypeScript](./src/1743.restore-the-array-from-adjacent-pairs.1866/solution.ts) | Medium |
| 1744 | Can You Eat Your Favorite Candy on Your Favorite Day? | [JavaScript](./src/1744.can-you-eat-your-favorite-candy-on-your-favorite-day.1872/solution.js) [TypeScript](./src/1744.can-you-eat-your-favorite-candy-on-your-favorite-day.1872/solution.ts) | Medium |
| 1745 | Palindrome Partitioning IV | [JavaScript](./src/1745.palindrome-partitioning-iv.1871/solution.js) [TypeScript](./src/1745.palindrome-partitioning-iv.1871/solution.ts) | Hard |
| 1746 | Maximum Subarray Sum After One Operation | | Medium |
| 1747 | Leetflex Banned Accounts | | Medium |
| 1748 | Sum of Unique Elements | [Java](./src/1748.sum-of-unique-elements.1848/solution.java) [JavaScript](./src/1748.sum-of-unique-elements.1848/solution.js) [TypeScript](./src/1748.sum-of-unique-elements.1848/solution.ts) | Easy |
| 1749 | Maximum Absolute Sum of Any Subarray | [JavaScript](./src/1749.maximum-absolute-sum-of-any-subarray.1849/solution.js) [TypeScript](./src/1749.maximum-absolute-sum-of-any-subarray.1849/solution.ts) | Medium |
| 1750 | Minimum Length of String After Deleting Similar Ends | [JavaScript](./src/1750.minimum-length-of-string-after-deleting-similar-ends.1850/solution.js) [TypeScript](./src/1750.minimum-length-of-string-after-deleting-similar-ends.1850/solution.ts) | Medium |
| 1751 | Maximum Number of Events That Can Be Attended II | | Hard |
| 1752 | Check if Array Is Sorted and Rotated | [JavaScript](./src/1752.check-if-array-is-sorted-and-rotated.1878/solution.js) [TypeScript](./src/1752.check-if-array-is-sorted-and-rotated.1878/solution.ts) | Easy |
| 1753 | Maximum Score From Removing Stones | [JavaScript](./src/1753.maximum-score-from-removing-stones.1879/solution.js) [TypeScript](./src/1753.maximum-score-from-removing-stones.1879/solution.ts) | Medium |
| 1754 | Largest Merge Of Two Strings | [JavaScript](./src/1754.largest-merge-of-two-strings.1880/solution.js) [TypeScript](./src/1754.largest-merge-of-two-strings.1880/solution.ts) | Medium |
| 1755 | Closest Subsequence Sum | | Hard |
| 1756 | Design Most Recently Used Queue | [JavaScript](./src/1756.design-most-recently-used-queue.1903/solution.js) | Medium |
| 1757 | Recyclable and Low Fat Products | | Easy |
| 1758 | Minimum Changes To Make Alternating Binary String | [Java](./src/1758.minimum-changes-to-make-alternating-binary-string.1884/solution.java) [JavaScript](./src/1758.minimum-changes-to-make-alternating-binary-string.1884/solution.js) [TypeScript](./src/1758.minimum-changes-to-make-alternating-binary-string.1884/solution.ts) | Easy |
| 1759 | Count Number of Homogenous Substrings | [JavaScript](./src/1759.count-number-of-homogenous-substrings.1885/solution.js) [TypeScript](./src/1759.count-number-of-homogenous-substrings.1885/solution.ts) | Medium |
| 1760 | Minimum Limit of Balls in a Bag | [JavaScript](./src/1760.minimum-limit-of-balls-in-a-bag.1886/solution.js) [TypeScript](./src/1760.minimum-limit-of-balls-in-a-bag.1886/solution.ts) | Medium |
| 1761 | Minimum Degree of a Connected Trio in a Graph | | Hard |
| 1762 | Buildings With an Ocean View | [JavaScript](./src/1762.buildings-with-an-ocean-view.1909/solution.js) [TypeScript](./src/1762.buildings-with-an-ocean-view.1909/solution.ts) | Medium |
| 1763 | Longest Nice Substring | [JavaScript](./src/1763.longest-nice-substring.1873/solution.js) [TypeScript](./src/1763.longest-nice-substring.1873/solution.ts) | Easy |
| 1764 | Form Array by Concatenating Subarrays of Another Array | [JavaScript](./src/1764.form-array-by-concatenating-subarrays-of-another-array.1874/solution.js) [TypeScript](./src/1764.form-array-by-concatenating-subarrays-of-another-array.1874/solution.ts) | Medium |
| 1765 | Map of Highest Peak | | Medium |
| 1766 | Tree of Coprimes | | Hard |
| 1767 | Find the Subtasks That Did Not Execute | | Hard |
| 1768 | Merge Strings Alternately | [Java](./src/1768.merge-strings-alternately.1894/solution.java) [JavaScript](./src/1768.merge-strings-alternately.1894/solution.js) [TypeScript](./src/1768.merge-strings-alternately.1894/solution.ts) | Easy |
| 1769 | Minimum Number of Operations to Move All Balls to Each Box | [JavaScript](./src/1769.minimum-number-of-operations-to-move-all-balls-to-each-box.1895/solution.js) [TypeScript](./src/1769.minimum-number-of-operations-to-move-all-balls-to-each-box.1895/solution.ts) | Medium |
| 1770 | Maximum Score from Performing Multiplication Operations | | Hard |
| 1771 | Maximize Palindrome Length From Subsequences | | Hard |
| 1772 | Sort Features by Popularity | [JavaScript](./src/1772.sort-features-by-popularity.1919/solution.js) | Medium |
| 1773 | Count Items Matching a Rule | [Java](./src/1773.count-items-matching-a-rule.1899/solution.java) [JavaScript](./src/1773.count-items-matching-a-rule.1899/solution.js) [TypeScript](./src/1773.count-items-matching-a-rule.1899/solution.ts) | Easy |
| 1774 | Closest Dessert Cost | [JavaScript](./src/1774.closest-dessert-cost.1900/solution.js) [TypeScript](./src/1774.closest-dessert-cost.1900/solution.ts) | Medium |
| 1775 | Equal Sum Arrays With Minimum Number of Operations | | Medium |
| 1776 | Car Fleet II | | Hard |
| 1777 | Product's Price for Each Store | | Easy |
| 1778 | Shortest Path in a Hidden Grid | | Medium |
| 1779 | Find Nearest Point That Has the Same X or Y Coordinate | [JavaScript](./src/1779.find-nearest-point-that-has-the-same-x-or-y-coordinate.1888/solution.js) [TypeScript](./src/1779.find-nearest-point-that-has-the-same-x-or-y-coordinate.1888/solution.ts) | Easy |
| 1780 | Check if Number is a Sum of Powers of Three | [JavaScript](./src/1780.check-if-number-is-a-sum-of-powers-of-three.1889/solution.js) [TypeScript](./src/1780.check-if-number-is-a-sum-of-powers-of-three.1889/solution.ts) | Medium |
| 1781 | Sum of Beauty of All Substrings | [JavaScript](./src/1781.sum-of-beauty-of-all-substrings.1890/solution.js) [TypeScript](./src/1781.sum-of-beauty-of-all-substrings.1890/solution.ts) | Medium |
| 1782 | Count Pairs Of Nodes | | Hard |
| 1783 | Grand Slam Titles | | Medium |
| 1784 | Check if Binary String Has at Most One Segment of Ones | [Java](./src/1784.check-if-binary-string-has-at-most-one-segment-of-ones.1910/solution.java) [JavaScript](./src/1784.check-if-binary-string-has-at-most-one-segment-of-ones.1910/solution.js) [TypeScript](./src/1784.check-if-binary-string-has-at-most-one-segment-of-ones.1910/solution.ts) | Easy |
| 1785 | Minimum Elements to Add to Form a Given Sum | [JavaScript](./src/1785.minimum-elements-to-add-to-form-a-given-sum.1911/solution.js) [TypeScript](./src/1785.minimum-elements-to-add-to-form-a-given-sum.1911/solution.ts) | Medium |
| 1786 | Number of Restricted Paths From First to Last Node | | Medium |
| 1787 | Make the XOR of All Segments Equal to Zero | | Hard |
| 1788 | Maximize the Beauty of the Garden | | Hard |
| 1789 | Primary Department for Each Employee | | Easy |
| 1790 | Check if One String Swap Can Make Strings Equal | [JavaScript](./src/1790.check-if-one-string-swap-can-make-strings-equal.1915/solution.js) [TypeScript](./src/1790.check-if-one-string-swap-can-make-strings-equal.1915/solution.ts) | Easy |
| 1791 | Find Center of Star Graph | [JavaScript](./src/1791.find-center-of-star-graph.1916/solution.js) [TypeScript](./src/1791.find-center-of-star-graph.1916/solution.ts) | Easy |
| 1792 | Maximum Average Pass Ratio | | Medium |
| 1793 | Maximum Score of a Good Subarray | [TypeScript](./src/1793.maximum-score-of-a-good-subarray.1918/solution.ts) | Hard |
| 1794 | Count Pairs of Equal Substrings With Minimum Difference | | Medium |
| 1795 | Rearrange Products Table | | Easy |
| 1796 | Second Largest Digit in a String | [Java](./src/1796.second-largest-digit-in-a-string.1904/solution.java) [JavaScript](./src/1796.second-largest-digit-in-a-string.1904/solution.js) [TypeScript](./src/1796.second-largest-digit-in-a-string.1904/solution.ts) | Easy |
| 1797 | Design Authentication Manager | [JavaScript](./src/1797.design-authentication-manager.1905/solution.js) [TypeScript](./src/1797.design-authentication-manager.1905/solution.ts) | Medium |
| 1798 | Maximum Number of Consecutive Values You Can Make | [JavaScript](./src/1798.maximum-number-of-consecutive-values-you-can-make.1930/solution.js) [TypeScript](./src/1798.maximum-number-of-consecutive-values-you-can-make.1930/solution.ts) | Medium |
| 1799 | Maximize Score After N Operations | | Hard |
| 1800 | Maximum Ascending Subarray Sum | [Java](./src/1800.maximum-ascending-subarray-sum.1927/solution.java) [JavaScript](./src/1800.maximum-ascending-subarray-sum.1927/solution.js) [TypeScript](./src/1800.maximum-ascending-subarray-sum.1927/solution.ts) | Easy |
| 1801 | Number of Orders in the Backlog | [JavaScript](./src/1801.number-of-orders-in-the-backlog.1928/solution.js) [TypeScript](./src/1801.number-of-orders-in-the-backlog.1928/solution.ts) | Medium |
| 1802 | Maximum Value at a Given Index in a Bounded Array | [JavaScript](./src/1802.maximum-value-at-a-given-index-in-a-bounded-array.1929/solution.js) [TypeScript](./src/1802.maximum-value-at-a-given-index-in-a-bounded-array.1929/solution.ts) | Medium |
| 1803 | Count Pairs With XOR in a Range | [JavaScript](./src/1803.count-pairs-with-xor-in-a-range.1907/solution.js) [TypeScript](./src/1803.count-pairs-with-xor-in-a-range.1907/solution.ts) | Hard |
| 1804 | Implement Trie II (Prefix Tree) | | Medium |
| 1805 | Number of Different Integers in a String | [Java](./src/1805.number-of-different-integers-in-a-string.1933/solution.java) [JavaScript](./src/1805.number-of-different-integers-in-a-string.1933/solution.js) [TypeScript](./src/1805.number-of-different-integers-in-a-string.1933/solution.ts) | Easy |
| 1806 | Minimum Number of Operations to Reinitialize a Permutation | [JavaScript](./src/1806.minimum-number-of-operations-to-reinitialize-a-permutation.1935/solution.js) [TypeScript](./src/1806.minimum-number-of-operations-to-reinitialize-a-permutation.1935/solution.ts) | Medium |
| 1807 | Evaluate the Bracket Pairs of a String | [JavaScript](./src/1807.evaluate-the-bracket-pairs-of-a-string.1934/solution.js) [TypeScript](./src/1807.evaluate-the-bracket-pairs-of-a-string.1934/solution.ts) | Medium |
| 1808 | Maximize Number of Nice Divisors | | Hard |
| 1809 | Ad-Free Sessions | | Easy |
| 1810 | Minimum Path Cost in a Hidden Grid | | Medium |
| 1811 | Find Interview Candidates | | Medium |
| 1812 | Determine Color of a Chessboard Square | [Java](./src/1812.determine-color-of-a-chessboard-square.1920/solution.java) [JavaScript](./src/1812.determine-color-of-a-chessboard-square.1920/solution.js) [TypeScript](./src/1812.determine-color-of-a-chessboard-square.1920/solution.ts) | Easy |
| 1813 | Sentence Similarity III | [JavaScript](./src/1813.sentence-similarity-iii.1923/solution.js) | Medium |
| 1814 | Count Nice Pairs in an Array | [JavaScript](./src/1814.count-nice-pairs-in-an-array.1925/solution.js) [TypeScript](./src/1814.count-nice-pairs-in-an-array.1925/solution.ts) | Medium |
| 1815 | Maximum Number of Groups Getting Fresh Donuts | | Hard |
| 1816 | Truncate Sentence | [Java](./src/1816.truncate-sentence.1944/solution.java) [JavaScript](./src/1816.truncate-sentence.1944/solution.js) [TypeScript](./src/1816.truncate-sentence.1944/solution.ts) | Easy |
| 1817 | Finding the Users Active Minutes | [JavaScript](./src/1817.finding-the-users-active-minutes.1945/solution.js) [TypeScript](./src/1817.finding-the-users-active-minutes.1945/solution.ts) | Medium |
| 1818 | Minimum Absolute Sum Difference | [JavaScript](./src/1818.minimum-absolute-sum-difference.1946/solution.js) | Medium |
| 1819 | Number of Different Subsequences GCDs | | Hard |
| 1820 | Maximum Number of Accepted Invitations | | Medium |
| 1821 | Find Customers With Positive Revenue this Year | | Easy |
| 1822 | Sign of the Product of an Array | [Java](./src/1822.sign-of-the-product-of-an-array.1950/solution.java) [JavaScript](./src/1822.sign-of-the-product-of-an-array.1950/solution.js) [TypeScript](./src/1822.sign-of-the-product-of-an-array.1950/solution.ts) | Easy |
| 1823 | Find the Winner of the Circular Game | | Medium |
| 1824 | Minimum Sideway Jumps | [JavaScript](./src/1824.minimum-sideway-jumps.1952/solution.js) [TypeScript](./src/1824.minimum-sideway-jumps.1952/solution.ts) | Medium |
| 1825 | Finding MK Average | | Hard |
| 1826 | Faulty Sensor | | Easy |
| 1827 | Minimum Operations to Make the Array Increasing | [JavaScript](./src/1827.minimum-operations-to-make-the-array-increasing.1938/solution.js) [TypeScript](./src/1827.minimum-operations-to-make-the-array-increasing.1938/solution.ts) | Easy |
| 1828 | Queries on Number of Points Inside a Circle | [JavaScript](./src/1828.queries-on-number-of-points-inside-a-circle.1939/solution.js) [TypeScript](./src/1828.queries-on-number-of-points-inside-a-circle.1939/solution.ts) | Medium |
| 1829 | Maximum XOR for Each Query | [JavaScript](./src/1829.maximum-xor-for-each-query.1940/solution.js) [TypeScript](./src/1829.maximum-xor-for-each-query.1940/solution.ts) | Medium |
| 1830 | Minimum Number of Operations to Make String Sorted | | Hard |
| 1831 | Maximum Transaction Each Day | | Medium |
| 1832 | Check if the Sentence Is Pangram | [Java](./src/1832.check-if-the-sentence-is-pangram.1960/solution.java) [JavaScript](./src/1832.check-if-the-sentence-is-pangram.1960/solution.js) [TypeScript](./src/1832.check-if-the-sentence-is-pangram.1960/solution.ts) | Easy |
| 1833 | Maximum Ice Cream Bars | [JavaScript](./src/1833.maximum-ice-cream-bars.1961/solution.js) [TypeScript](./src/1833.maximum-ice-cream-bars.1961/solution.ts) | Medium |
| 1834 | Single-Threaded CPU | [JavaScript](./src/1834.single-threaded-cpu.1962/solution.js) [TypeScript](./src/1834.single-threaded-cpu.1962/solution.ts) | Medium |
| 1835 | Find XOR Sum of All Pairs Bitwise AND | [JavaScript](./src/1835.find-xor-sum-of-all-pairs-bitwise-and.1963/solution.js) [TypeScript](./src/1835.find-xor-sum-of-all-pairs-bitwise-and.1963/solution.ts) | Hard |
| 1836 | Remove Duplicates From an Unsorted Linked List | | Medium |
| 1837 | Sum of Digits in Base K | [JavaScript](./src/1837.sum-of-digits-in-base-k.1965/solution.js) [TypeScript](./src/1837.sum-of-digits-in-base-k.1965/solution.ts) | Easy |
| 1838 | Frequency of the Most Frequent Element | [JavaScript](./src/1838.frequency-of-the-most-frequent-element.1966/solution.js) | Medium |
| 1839 | Longest Substring Of All Vowels in Order | [JavaScript](./src/1839.longest-substring-of-all-vowels-in-order.1967/solution.js) | Medium |
| 1840 | Maximum Building Height | | Hard |
| 1841 | League Statistics | | Medium |
| 1842 | Next Palindrome Using Same Digits | | Hard |
| 1843 | Suspicious Bank Accounts | | Medium |
| 1844 | Replace All Digits with Characters | [Java](./src/1844.replace-all-digits-with-characters.1954/solution.java) [JavaScript](./src/1844.replace-all-digits-with-characters.1954/solution.js) [TypeScript](./src/1844.replace-all-digits-with-characters.1954/solution.ts) | Easy |
| 1845 | Seat Reservation Manager | [JavaScript](./src/1845.seat-reservation-manager.1955/solution.js) | Medium |
| 1846 | Maximum Element After Decreasing and Rearranging | [JavaScript](./src/1846.maximum-element-after-decreasing-and-rearranging.1956/solution.js) | Medium |
| 1847 | Closest Room | [TypeScript](./src/1847.closest-room.1957/solution.ts) | Hard |
| 1848 | Minimum Distance to the Target Element | [Java](./src/1848.minimum-distance-to-the-target-element.1975/solution.java) [JavaScript](./src/1848.minimum-distance-to-the-target-element.1975/solution.js) [TypeScript](./src/1848.minimum-distance-to-the-target-element.1975/solution.ts) | Easy |
| 1849 | Splitting a String Into Descending Consecutive Values | [JavaScript](./src/1849.splitting-a-string-into-descending-consecutive-values.1976/solution.js) | Medium |
| 1850 | Minimum Adjacent Swaps to Reach the Kth Smallest Number | | Medium |
| 1851 | Minimum Interval to Include Each Query | | Hard |
| 1852 | Distinct Numbers in Each Subarray | | Medium |
| 1853 | Convert Date Format | | Easy |
| 1854 | Maximum Population Year | [JavaScript](./src/1854.maximum-population-year.1983/solution.js) [TypeScript](./src/1854.maximum-population-year.1983/solution.ts) | Easy |
| 1855 | Maximum Distance Between a Pair of Values | [JavaScript](./src/1855.maximum-distance-between-a-pair-of-values.1984/solution.js) [TypeScript](./src/1855.maximum-distance-between-a-pair-of-values.1984/solution.ts) | Medium |
| 1856 | Maximum Subarray Min-Product | [TypeScript](./src/1856.maximum-subarray-min-product.1985/solution.ts) | Medium |
| 1857 | Largest Color Value in a Directed Graph | | Hard |
| 1858 | Longest Word With All Prefixes | | Medium |
| 1859 | Sorting the Sentence | [Java](./src/1859.sorting-the-sentence.1970/solution.java) [JavaScript](./src/1859.sorting-the-sentence.1970/solution.js) [TypeScript](./src/1859.sorting-the-sentence.1970/solution.ts) | Easy |
| 1860 | Incremental Memory Leak | [JavaScript](./src/1860.incremental-memory-leak.1971/solution.js) [TypeScript](./src/1860.incremental-memory-leak.1971/solution.ts) | Medium |
| 1861 | Rotating the Box | | Medium |
| 1862 | Sum of Floored Pairs | [TypeScript](./src/1862.sum-of-floored-pairs.1326/solution.ts) | Hard |
| 1863 | Sum of All Subset XOR Totals | [JavaScript](./src/1863.sum-of-all-subset-xor-totals.1993/solution.js) [TypeScript](./src/1863.sum-of-all-subset-xor-totals.1993/solution.ts) | Easy |
| 1864 | Minimum Number of Swaps to Make the Binary String Alternating | | Medium |
| 1865 | Finding Pairs With a Certain Sum | [JavaScript](./src/1865.finding-pairs-with-a-certain-sum.1995/solution.js) [TypeScript](./src/1865.finding-pairs-with-a-certain-sum.1995/solution.ts) | Medium |
| 1866 | Number of Ways to Rearrange Sticks With K Sticks Visible | | Hard |
| 1867 | Orders With Maximum Quantity Above Average | | Medium |
| 1868 | Product of Two Run-Length Encoded Arrays | | Medium |
| 1869 | Longer Contiguous Segments of Ones than Zeros | [Java](./src/1869.longer-contiguous-segments-of-ones-than-zeros.1999/solution.java) [JavaScript](./src/1869.longer-contiguous-segments-of-ones-than-zeros.1999/solution.js) [TypeScript](./src/1869.longer-contiguous-segments-of-ones-than-zeros.1999/solution.ts) | Easy |
| 1870 | Minimum Speed to Arrive on Time | [JavaScript](./src/1870.minimum-speed-to-arrive-on-time.2000/solution.js) [TypeScript](./src/1870.minimum-speed-to-arrive-on-time.2000/solution.ts) | Medium |
| 1871 | Jump Game VII | [TypeScript](./src/1871.jump-game-vii.2001/solution.ts) | Medium |
| 1872 | Stone Game VIII | | Hard |
| 1873 | Calculate Special Bonus | | Easy |
| 1874 | Minimize Product Sum of Two Arrays | | Medium |
| 1875 | Group Employees of the Same Salary | | Medium |
| 1876 | Substrings of Size Three with Distinct Characters | [Java](./src/1876.substrings-of-size-three-with-distinct-characters.1987/solution.java) [JavaScript](./src/1876.substrings-of-size-three-with-distinct-characters.1987/solution.js) [TypeScript](./src/1876.substrings-of-size-three-with-distinct-characters.1987/solution.ts) | Easy |
| 1877 | Minimize Maximum Pair Sum in Array | [TypeScript](./src/1877.minimize-maximum-pair-sum-in-array.1988/solution.ts) | Medium |
| 1878 | Get Biggest Three Rhombus Sums in a Grid | | Medium |
| 1879 | Minimum XOR Sum of Two Arrays | | Hard |
| 1880 | Check if Word Equals Summation of Two Words | [JavaScript](./src/1880.check-if-word-equals-summation-of-two-words.2010/solution.js) [TypeScript](./src/1880.check-if-word-equals-summation-of-two-words.2010/solution.ts) | Easy |
| 1881 | Maximum Value after Insertion | [TypeScript](./src/1881.maximum-value-after-insertion.2011/solution.ts) | Medium |
| 1882 | Process Tasks Using Servers | | Medium |
| 1883 | Minimum Skips to Arrive at Meeting On Time | | Hard |
| 1884 | Egg Drop With 2 Eggs and N Floors | | Medium |
| 1885 | Count Pairs in Two Arrays | | Medium |
| 1886 | Determine Whether Matrix Can Be Obtained By Rotation | [TypeScript](./src/1886.determine-whether-matrix-can-be-obtained-by-rotation.2015/solution.ts) | Easy |
| 1887 | Reduction Operations to Make the Array Elements Equal | [JavaScript](./src/1887.reduction-operations-to-make-the-array-elements-equal.2016/solution.js) [TypeScript](./src/1887.reduction-operations-to-make-the-array-elements-equal.2016/solution.ts) | Medium |
| 1888 | Minimum Number of Flips to Make the Binary String Alternating | | Medium |
| 1889 | Minimum Space Wasted From Packaging | [TypeScript](./src/1889.minimum-space-wasted-from-packaging.2018/solution.ts) | Hard |
| 1890 | The Latest Login in 2020 | | Easy |
| 1891 | Cutting Ribbons | | Medium |
| 1892 | Page Recommendations II | | Hard |
| 1893 | Check if All the Integers in a Range Are Covered | [JavaScript](./src/1893.check-if-all-the-integers-in-a-range-are-covered.2005/solution.js) [TypeScript](./src/1893.check-if-all-the-integers-in-a-range-are-covered.2005/solution.ts) | Easy |
| 1894 | Find the Student that Will Replace the Chalk | [TypeScript](./src/1894.find-the-student-that-will-replace-the-chalk.2006/solution.ts) | Medium |
| 1895 | Largest Magic Square | | Medium |
| 1896 | Minimum Cost to Change the Final Value of Expression | | Hard |
| 1897 | Redistribute Characters to Make All Strings Equal | [JavaScript](./src/1897.redistribute-characters-to-make-all-strings-equal.2025/solution.js) [TypeScript](./src/1897.redistribute-characters-to-make-all-strings-equal.2025/solution.ts) | Easy |
| 1898 | Maximum Number of Removable Characters | [TypeScript](./src/1898.maximum-number-of-removable-characters.2027/solution.ts) | Medium |
| 1899 | Merge Triplets to Form Target Triplet | [TypeScript](./src/1899.merge-triplets-to-form-target-triplet.2026/solution.ts) | Medium |
| 1900 | The Earliest and Latest Rounds Where Players Compete | | Hard |
| 1901 | Find a Peak Element II | | Medium |
| 1902 | Depth of BST Given Insertion Order | | Medium |
| 1903 | Largest Odd Number in String | [Java](./src/1903.largest-odd-number-in-string.2032/solution.java) [JavaScript](./src/1903.largest-odd-number-in-string.2032/solution.js) [TypeScript](./src/1903.largest-odd-number-in-string.2032/solution.ts) | Easy |
| 1904 | The Number of Full Rounds You Have Played | [JavaScript](./src/1904.the-number-of-full-rounds-you-have-played.2033/solution.js) [TypeScript](./src/1904.the-number-of-full-rounds-you-have-played.2033/solution.ts) | Medium |
| 1905 | Count Sub Islands | [JavaScript](./src/1905.count-sub-islands.2035/solution.js) [TypeScript](./src/1905.count-sub-islands.2035/solution.ts) | Medium |
| 1906 | Minimum Absolute Difference Queries | [JavaScript](./src/1906.minimum-absolute-difference-queries.2034/solution.js) [TypeScript](./src/1906.minimum-absolute-difference-queries.2034/solution.ts) | Medium |
| 1907 | Count Salary Categories | | Medium |
| 1908 | Game of Nim | | Medium |
| 1909 | Remove One Element to Make the Array Strictly Increasing | [TypeScript](./src/1909.remove-one-element-to-make-the-array-strictly-increasing.2020/solution.ts) | Easy |
| 1910 | Remove All Occurrences of a Substring | [TypeScript](./src/1910.remove-all-occurrences-of-a-substring.2021/solution.ts) | Medium |
| 1911 | Maximum Alternating Subsequence Sum | | Medium |
| 1912 | Design Movie Rental System | | Hard |
| 1913 | Maximum Product Difference Between Two Pairs | [Java](./src/1913.maximum-product-difference-between-two-pairs.2042/solution.java) [JavaScript](./src/1913.maximum-product-difference-between-two-pairs.2042/solution.js) [TypeScript](./src/1913.maximum-product-difference-between-two-pairs.2042/solution.ts) | Easy |
| 1914 | Cyclically Rotating a Grid | | Medium |
| 1915 | Number of Wonderful Substrings | | Medium |
| 1916 | Count Ways to Build Rooms in an Ant Colony | | Hard |
| 1917 | Leetcodify Friends Recommendations | | Hard |
| 1918 | Kth Smallest Subarray Sum | | Medium |
| 1919 | Leetcodify Similar Friends | | Hard |
| 1920 | Build Array from Permutation | [Java](./src/1920.build-array-from-permutation.2048/solution.java) [JavaScript](./src/1920.build-array-from-permutation.2048/solution.js) [TypeScript](./src/1920.build-array-from-permutation.2048/solution.ts) | Easy |
| 1921 | Eliminate Maximum Number of Monsters | [TypeScript](./src/1921.eliminate-maximum-number-of-monsters.2049/solution.ts) | Medium |
| 1922 | Count Good Numbers | [TypeScript](./src/1922.count-good-numbers.2050/solution.ts) | Medium |
| 1923 | Longest Common Subpath | | Hard |
| 1924 | Erect the Fence II | | Hard |
| 1925 | Count Square Sum Triples | [JavaScript](./src/1925.count-square-sum-triples.2037/solution.js) [TypeScript](./src/1925.count-square-sum-triples.2037/solution.ts) | Easy |
| 1926 | Nearest Exit from Entrance in Maze | [JavaScript](./src/1926.nearest-exit-from-entrance-in-maze.2038/solution.js) [TypeScript](./src/1926.nearest-exit-from-entrance-in-maze.2038/solution.ts) | Medium |
| 1927 | Sum Game | | Medium |
| 1928 | Minimum Cost to Reach Destination in Time | | Hard |
| 1929 | Concatenation of Array | [Java](./src/1929.concatenation-of-array.2058/solution.java) [JavaScript](./src/1929.concatenation-of-array.2058/solution.js) [TypeScript](./src/1929.concatenation-of-array.2058/solution.ts) | Easy |
| 1930 | Unique Length-3 Palindromic Subsequences | [JavaScript](./src/1930.unique-length-3-palindromic-subsequences.2059/solution.js) [TypeScript](./src/1930.unique-length-3-palindromic-subsequences.2059/solution.ts) | Medium |
| 1931 | Painting a Grid With Three Different Colors | | Hard |
| 1932 | Merge BSTs to Create Single BST | | Hard |
| 1933 | Check if String Is Decomposable Into Value-Equal Substrings | | Easy |
| 1934 | Confirmation Rate | | Medium |
| 1935 | Maximum Number of Words You Can Type | [Java](./src/1935.maximum-number-of-words-you-can-type.1264/solution.java) [JavaScript](./src/1935.maximum-number-of-words-you-can-type.1264/solution.js) [TypeScript](./src/1935.maximum-number-of-words-you-can-type.1264/solution.ts) | Easy |
| 1936 | Add Minimum Number of Rungs | [JavaScript](./src/1936.add-minimum-number-of-rungs.2066/solution.js) [TypeScript](./src/1936.add-minimum-number-of-rungs.2066/solution.ts) | Medium |
| 1937 | Maximum Number of Points with Cost | [JavaScript](./src/1937.maximum-number-of-points-with-cost.2067/solution.js) [TypeScript](./src/1937.maximum-number-of-points-with-cost.2067/solution.ts) | Medium |
| 1938 | Maximum Genetic Difference Query | | Hard |
| 1939 | Users That Actively Request Confirmation Messages | | Easy |
| 1940 | Longest Common Subsequence Between Sorted Arrays | | Medium |
| 1941 | Check if All Characters Have Equal Number of Occurrences | [Java](./src/1941.check-if-all-characters-have-equal-number-of-occurrences.2053/solution.java) [JavaScript](./src/1941.check-if-all-characters-have-equal-number-of-occurrences.2053/solution.js) [TypeScript](./src/1941.check-if-all-characters-have-equal-number-of-occurrences.2053/solution.ts) | Easy |
| 1942 | The Number of the Smallest Unoccupied Chair | [TypeScript](./src/1942.the-number-of-the-smallest-unoccupied-chair.2054/solution.ts) | Medium |
| 1943 | Describe the Painting | | Medium |
| 1944 | Number of Visible People in a Queue | [TypeScript](./src/1944.number-of-visible-people-in-a-queue.1305/solution.ts) | Hard |
| 1945 | Sum of Digits of String After Convert | [Java](./src/1945.sum-of-digits-of-string-after-convert.2076/solution.java) [JavaScript](./src/1945.sum-of-digits-of-string-after-convert.2076/solution.js) [TypeScript](./src/1945.sum-of-digits-of-string-after-convert.2076/solution.ts) | Easy |
| 1946 | Largest Number After Mutating Substring | [JavaScript](./src/1946.largest-number-after-mutating-substring.2077/solution.js) [TypeScript](./src/1946.largest-number-after-mutating-substring.2077/solution.ts) | Medium |
| 1947 | Maximum Compatibility Score Sum | [JavaScript](./src/1947.maximum-compatibility-score-sum.2078/solution.js) [TypeScript](./src/1947.maximum-compatibility-score-sum.2078/solution.ts) | Medium |
| 1948 | Delete Duplicate Folders in System | | Hard |
| 1949 | Strong Friendship | | Medium |
| 1950 | Maximum of Minimum Values in All Subarrays | | Medium |
| 1951 | All the Pairs With the Maximum Number of Common Followers | | Medium |
| 1952 | Three Divisors | [Java](./src/1952.three-divisors.2083/solution.java) [JavaScript](./src/1952.three-divisors.2083/solution.js) [TypeScript](./src/1952.three-divisors.2083/solution.ts) | Easy |
| 1953 | Maximum Number of Weeks for Which You Can Work | [JavaScript](./src/1953.maximum-number-of-weeks-for-which-you-can-work.2084/solution.js) [TypeScript](./src/1953.maximum-number-of-weeks-for-which-you-can-work.2084/solution.ts) | Medium |
| 1954 | Minimum Garden Perimeter to Collect Enough Apples | [JavaScript](./src/1954.minimum-garden-perimeter-to-collect-enough-apples.1295/solution.js) [TypeScript](./src/1954.minimum-garden-perimeter-to-collect-enough-apples.1295/solution.ts) | Medium |
| 1955 | Count Number of Special Subsequences | [TypeScript](./src/1955.count-number-of-special-subsequences.2086/solution.ts) | Hard |
| 1956 | Minimum Time For K Virus Variants to Spread | | Hard |
| 1957 | Delete Characters to Make Fancy String | [Java](./src/1957.delete-characters-to-make-fancy-string.1302/solution.java) [JavaScript](./src/1957.delete-characters-to-make-fancy-string.1302/solution.js) [TypeScript](./src/1957.delete-characters-to-make-fancy-string.1302/solution.ts) | Easy |
| 1958 | Check if Move is Legal | [TypeScript](./src/1958.check-if-move-is-legal.2080/solution.ts) | Medium |
| 1959 | Minimum Total Space Wasted With K Resizing Operations | | Medium |
| 1960 | Maximum Product of the Length of Two Palindromic Substrings | | Hard |
| 1961 | Check If String Is a Prefix of Array | [Java](./src/1961.check-if-string-is-a-prefix-of-array.2093/solution.java) [JavaScript](./src/1961.check-if-string-is-a-prefix-of-array.2093/solution.js) [TypeScript](./src/1961.check-if-string-is-a-prefix-of-array.2093/solution.ts) | Easy |
| 1962 | Remove Stones to Minimize the Total | [JavaScript](./src/1962.remove-stones-to-minimize-the-total.2094/solution.js) [TypeScript](./src/1962.remove-stones-to-minimize-the-total.2094/solution.ts) | Medium |
| 1963 | Minimum Number of Swaps to Make the String Balanced | | Medium |
| 1964 | Find the Longest Valid Obstacle Course at Each Position | | Hard |
| 1965 | Employees With Missing Information | | Easy |
| 1966 | Binary Searchable Numbers in an Unsorted Array | | Medium |
| 1967 | Number of Strings That Appear as Substrings in Word | [Java](./src/1967.number-of-strings-that-appear-as-substrings-in-word.2099/solution.java) [JavaScript](./src/1967.number-of-strings-that-appear-as-substrings-in-word.2099/solution.js) [TypeScript](./src/1967.number-of-strings-that-appear-as-substrings-in-word.2099/solution.ts) | Easy |
| 1968 | Array With Elements Not Equal to Average of Neighbors | [JavaScript](./src/1968.array-with-elements-not-equal-to-average-of-neighbors.2085/solution.js) | Medium |
| 1969 | Minimum Non-Zero Product of the Array Elements | | Medium |
| 1970 | Last Day Where You Can Still Cross | | Hard |
| 1971 | Find if Path Exists in Graph | [JavaScript](./src/1971.find-if-path-exists-in-graph.2121/solution.js) [TypeScript](./src/1971.find-if-path-exists-in-graph.2121/solution.ts) | Easy |
| 1972 | First and Last Call On the Same Day | | Hard |
| 1973 | Count Nodes Equal to Sum of Descendants | | Medium |
| 1974 | Minimum Time to Type Word Using Special Typewriter | [Java](./src/1974.minimum-time-to-type-word-using-special-typewriter.2088/solution.java) [JavaScript](./src/1974.minimum-time-to-type-word-using-special-typewriter.2088/solution.js) [TypeScript](./src/1974.minimum-time-to-type-word-using-special-typewriter.2088/solution.ts) | Easy |
| 1975 | Maximum Matrix Sum | [TypeScript](./src/1975.maximum-matrix-sum.2089/solution.ts) | Medium |
| 1976 | Number of Ways to Arrive at Destination | | Medium |
| 1977 | Number of Ways to Separate Numbers | | Hard |
| 1978 | Employees Whose Manager Left the Company | | Easy |
| 1979 | Find Greatest Common Divisor of Array | [Java](./src/1979.find-greatest-common-divisor-of-array.2106/solution.java) [JavaScript](./src/1979.find-greatest-common-divisor-of-array.2106/solution.js) [TypeScript](./src/1979.find-greatest-common-divisor-of-array.2106/solution.ts) | Easy |
| 1980 | Find Unique Binary String | [JavaScript](./src/1980.find-unique-binary-string.2107/solution.js) [TypeScript](./src/1980.find-unique-binary-string.2107/solution.ts) | Medium |
| 1981 | Minimize the Difference Between Target and Chosen Elements | | Medium |
| 1982 | Find Array Given Subset Sums | | Hard |
| 1983 | Widest Pair of Indices With Equal Range Sum | | Medium |
| 1984 | Minimum Difference Between Highest and Lowest of K Scores | [Java](./src/1984.minimum-difference-between-highest-and-lowest-of-k-scores.2112/solution.java) [JavaScript](./src/1984.minimum-difference-between-highest-and-lowest-of-k-scores.2112/solution.js) [TypeScript](./src/1984.minimum-difference-between-highest-and-lowest-of-k-scores.2112/solution.ts) | Easy |
| 1985 | Find the Kth Largest Integer in the Array | [TypeScript](./src/1985.find-the-kth-largest-integer-in-the-array.2113/solution.ts) | Medium |
| 1986 | Minimum Number of Work Sessions to Finish the Tasks | | Medium |
| 1987 | Number of Unique Good Subsequences | | Hard |
| 1988 | Find Cutoff Score for Each School | | Medium |
| 1989 | Maximum Number of People That Can Be Caught in Tag | | Medium |
| 1990 | Count the Number of Experiments | | Medium |
| 1991 | Find the Middle Index in Array | [JavaScript](./src/1991.find-the-middle-index-in-array.2102/solution.js) [TypeScript](./src/1991.find-the-middle-index-in-array.2102/solution.ts) | Easy |
| 1992 | Find All Groups of Farmland | [TypeScript](./src/1992.find-all-groups-of-farmland.2103/solution.ts) | Medium |
| 1993 | Operations on Tree | | Medium |
| 1994 | The Number of Good Subsets | | Hard |
| 1995 | Count Special Quadruplets | [JavaScript](./src/1995.count-special-quadruplets.2122/solution.js) [TypeScript](./src/1995.count-special-quadruplets.2122/solution.ts) | Easy |
| 1996 | The Number of Weak Characters in the Game | [TypeScript](./src/1996.the-number-of-weak-characters-in-the-game.2123/solution.ts) | Medium |
| 1997 | First Day Where You Have Been in All the Rooms | | Medium |
| 1998 | GCD Sort of an Array | | Hard |
| 1999 | Smallest Greater Multiple Made of Two Digits | | Medium |
| 2000 | Reverse Prefix of Word | [Java](./src/2000.reverse-prefix-of-word.2128/solution.java) [JavaScript](./src/2000.reverse-prefix-of-word.2128/solution.js) [TypeScript](./src/2000.reverse-prefix-of-word.2128/solution.ts) | Easy |
| 2001 | Number of Pairs of Interchangeable Rectangles | [JavaScript](./src/2001.number-of-pairs-of-interchangeable-rectangles.2129/solution.js) [TypeScript](./src/2001.number-of-pairs-of-interchangeable-rectangles.2129/solution.ts) | Medium |
| 2002 | Maximum Product of the Length of Two Palindromic Subsequences | [TypeScript](./src/2002.maximum-product-of-the-length-of-two-palindromic-subsequences.2130/solution.ts) | Medium |
| 2003 | Smallest Missing Genetic Value in Each Subtree | | Hard |
| 2004 | The Number of Seniors and Juniors to Join the Company | | Hard |
| 2005 | Subtree Removal Game with Fibonacci Tree | | Hard |
| 2006 | Count Number of Pairs With Absolute Difference K | [Java](./src/2006.count-number-of-pairs-with-absolute-difference-k.2116/solution.java) [JavaScript](./src/2006.count-number-of-pairs-with-absolute-difference-k.2116/solution.js) [TypeScript](./src/2006.count-number-of-pairs-with-absolute-difference-k.2116/solution.ts) | Easy |
| 2007 | Find Original Array From Doubled Array | [JavaScript](./src/2007.find-original-array-from-doubled-array.2117/solution.js) [TypeScript](./src/2007.find-original-array-from-doubled-array.2117/solution.ts) | Medium |
| 2008 | Maximum Earnings From Taxi | [TypeScript](./src/2008.maximum-earnings-from-taxi.2118/solution.ts) | Medium |
| 2009 | Minimum Number of Operations to Make Array Continuous | | Hard |
| 2010 | The Number of Seniors and Juniors to Join the Company II | | Hard |
| 2011 | Final Value of Variable After Performing Operations | [Java](./src/2011.final-value-of-variable-after-performing-operations.2137/solution.java) [JavaScript](./src/2011.final-value-of-variable-after-performing-operations.2137/solution.js) [TypeScript](./src/2011.final-value-of-variable-after-performing-operations.2137/solution.ts) | Easy |
| 2012 | Sum of Beauty in the Array | [TypeScript](./src/2012.sum-of-beauty-in-the-array.2138/solution.ts) | Medium |
| 2013 | Detect Squares | | Medium |
| 2014 | Longest Subsequence Repeated k Times | | Hard |
| 2015 | Average Height of Buildings in Each Segment | | Medium |
| 2016 | Maximum Difference Between Increasing Elements | [Java](./src/2016.maximum-difference-between-increasing-elements.2144/solution.java) [JavaScript](./src/2016.maximum-difference-between-increasing-elements.2144/solution.js) [TypeScript](./src/2016.maximum-difference-between-increasing-elements.2144/solution.ts) | Easy |
| 2017 | Grid Game | [TypeScript](./src/2017.grid-game.2145/solution.ts) | Medium |
| 2018 | Check if Word Can Be Placed In Crossword | | Medium |
| 2019 | The Score of Students Solving Math Expression | | Hard |
| 2020 | Number of Accounts That Did Not Stream | | Medium |
| 2021 | Brightest Position on Street | | Medium |
| 2022 | Convert 1D Array Into 2D Array | [Java](./src/2022.convert-1d-array-into-2d-array.2132/solution.java) [JavaScript](./src/2022.convert-1d-array-into-2d-array.2132/solution.js) [TypeScript](./src/2022.convert-1d-array-into-2d-array.2132/solution.ts) | Easy |
| 2023 | Number of Pairs of Strings With Concatenation Equal to Target | [JavaScript](./src/2023.number-of-pairs-of-strings-with-concatenation-equal-to-target.2133/solution.js) | Medium |
| 2024 | Maximize the Confusion of an Exam | | Medium |
| 2025 | Maximum Number of Ways to Partition an Array | | Hard |
| 2026 | Low-Quality Problems | | Easy |
| 2027 | Minimum Moves to Convert String | [JavaScript](./src/2027.minimum-moves-to-convert-string.2154/solution.js) [TypeScript](./src/2027.minimum-moves-to-convert-string.2154/solution.ts) | Easy |
| 2028 | Find Missing Observations | [TypeScript](./src/2028.find-missing-observations.2155/solution.ts) | Medium |
| 2029 | Stone Game IX | | Medium |
| 2030 | Smallest K-Length Subsequence With Occurrences of a Letter | [TypeScript](./src/2030.smallest-k-length-subsequence-with-occurrences-of-a-letter.2157/solution.ts) | Hard |
| 2031 | Count Subarrays With More Ones Than Zeros | | Medium |
| 2032 | Two Out of Three | [JavaScript](./src/2032.two-out-of-three.2159/solution.js) [TypeScript](./src/2032.two-out-of-three.2159/solution.ts) | Easy |
| 2033 | Minimum Operations to Make a Uni-Value Grid | [TypeScript](./src/2033.minimum-operations-to-make-a-uni-value-grid.2160/solution.ts) | Medium |
| 2034 | Stock Price Fluctuation | [TypeScript](./src/2034.stock-price-fluctuation.2161/solution.ts) | Medium |
| 2035 | Partition Array Into Two Arrays to Minimize Sum Difference | | Hard |
| 2036 | Maximum Alternating Subarray Sum | | Medium |
| 2037 | Minimum Number of Moves to Seat Everyone | [Java](./src/2037.minimum-number-of-moves-to-seat-everyone.2148/solution.java) [JavaScript](./src/2037.minimum-number-of-moves-to-seat-everyone.2148/solution.js) [TypeScript](./src/2037.minimum-number-of-moves-to-seat-everyone.2148/solution.ts) | Easy |
| 2038 | Remove Colored Pieces if Both Neighbors are the Same Color | [JavaScript](./src/2038.remove-colored-pieces-if-both-neighbors-are-the-same-color.2149/solution.js) [TypeScript](./src/2038.remove-colored-pieces-if-both-neighbors-are-the-same-color.2149/solution.ts) | Medium |
| 2039 | The Time When the Network Becomes Idle | | Medium |
| 2040 | Kth Smallest Product of Two Sorted Arrays | | Hard |
| 2041 | Accepted Candidates From the Interviews | | Medium |
| 2042 | Check if Numbers Are Ascending in a Sentence | [Java](./src/2042.check-if-numbers-are-ascending-in-a-sentence.2168/solution.java) [JavaScript](./src/2042.check-if-numbers-are-ascending-in-a-sentence.2168/solution.js) [TypeScript](./src/2042.check-if-numbers-are-ascending-in-a-sentence.2168/solution.ts) | Easy |
| 2043 | Simple Bank System | [JavaScript](./src/2043.simple-bank-system.2169/solution.js) | Medium |
| 2044 | Count Number of Maximum Bitwise-OR Subsets | [TypeScript](./src/2044.count-number-of-maximum-bitwise-or-subsets.2170/solution.ts) | Medium |
| 2045 | Second Minimum Time to Reach Destination | | Hard |
| 2046 | Sort Linked List Already Sorted Using Absolute Values | | Medium |
| 2047 | Number of Valid Words in a Sentence | [JavaScript](./src/2047.number-of-valid-words-in-a-sentence.2173/solution.js) [TypeScript](./src/2047.number-of-valid-words-in-a-sentence.2173/solution.ts) | Easy |
| 2048 | Next Greater Numerically Balanced Number | [TypeScript](./src/2048.next-greater-numerically-balanced-number.2174/solution.ts) | Medium |
| 2049 | Count Nodes With the Highest Score | [TypeScript](./src/2049.count-nodes-with-the-highest-score.2175/solution.ts) | Medium |
| 2050 | Parallel Courses III | | Hard |
| 2051 | The Category of Each Member in the Store | | Medium |
| 2052 | Minimum Cost to Separate Sentence Into Rows | | Medium |
| 2053 | Kth Distinct String in an Array | [JavaScript](./src/2053.kth-distinct-string-in-an-array.2163/solution.js) [TypeScript](./src/2053.kth-distinct-string-in-an-array.2163/solution.ts) | Easy |
| 2054 | Two Best Non-Overlapping Events | | Medium |
| 2055 | Plates Between Candles | [TypeScript](./src/2055.plates-between-candles.2165/solution.ts) | Medium |
| 2056 | Number of Valid Move Combinations On Chessboard | | Hard |
| 2057 | Smallest Index With Equal Value | [Java](./src/2057.smallest-index-with-equal-value.2181/solution.java) [JavaScript](./src/2057.smallest-index-with-equal-value.2181/solution.js) [TypeScript](./src/2057.smallest-index-with-equal-value.2181/solution.ts) | Easy |
| 2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points | [TypeScript](./src/2058.find-the-minimum-and-maximum-number-of-nodes-between-critical-points.2182/solution.ts) | Medium |
| 2059 | Minimum Operations to Convert Number | | Medium |
| 2060 | Check if an Original String Exists Given Two Encoded Strings | | Hard |
| 2061 | Number of Spaces Cleaning Robot Cleaned | | Medium |
| 2062 | Count Vowel Substrings of a String | [JavaScript](./src/2062.count-vowel-substrings-of-a-string.2186/solution.js) [TypeScript](./src/2062.count-vowel-substrings-of-a-string.2186/solution.ts) | Easy |
| 2063 | Vowels of All Substrings | [JavaScript](./src/2063.vowels-of-all-substrings.2187/solution.js) [TypeScript](./src/2063.vowels-of-all-substrings.2187/solution.ts) | Medium |
| 2064 | Minimized Maximum of Products Distributed to Any Store | | Medium |
| 2065 | Maximum Path Quality of a Graph | | Hard |
| 2066 | Account Balance | | Medium |
| 2067 | Number of Equal Count Substrings | | Medium |
| 2068 | Check Whether Two Strings are Almost Equivalent | [Java](./src/2068.check-whether-two-strings-are-almost-equivalent.2177/solution.java) [JavaScript](./src/2068.check-whether-two-strings-are-almost-equivalent.2177/solution.js) [TypeScript](./src/2068.check-whether-two-strings-are-almost-equivalent.2177/solution.ts) | Easy |
| 2069 | Walking Robot Simulation II | | Medium |
| 2070 | Most Beautiful Item for Each Query | [TypeScript](./src/2070.most-beautiful-item-for-each-query.2179/solution.ts) | Medium |
| 2071 | Maximum Number of Tasks You Can Assign | | Hard |
| 2072 | The Winner University | | Easy |
| 2073 | Time Needed to Buy Tickets | [JavaScript](./src/2073.time-needed-to-buy-tickets.2195/solution.js) [TypeScript](./src/2073.time-needed-to-buy-tickets.2195/solution.ts) | Easy |
| 2074 | Reverse Nodes in Even Length Groups | [TypeScript](./src/2074.reverse-nodes-in-even-length-groups.2196/solution.ts) | Medium |
| 2075 | Decode the Slanted Ciphertext | [TypeScript](./src/2075.decode-the-slanted-ciphertext.2197/solution.ts) | Medium |
| 2076 | Process Restricted Friend Requests | | Hard |
| 2077 | Paths in Maze That Lead to Same Room | | Medium |
| 2078 | Two Furthest Houses With Different Colors | [JavaScript](./src/2078.two-furthest-houses-with-different-colors.2199/solution.js) [TypeScript](./src/2078.two-furthest-houses-with-different-colors.2199/solution.ts) | Easy |
| 2079 | Watering Plants | [JavaScript](./src/2079.watering-plants.1310/solution.js) [TypeScript](./src/2079.watering-plants.1310/solution.ts) | Medium |
| 2080 | Range Frequency Queries | [TypeScript](./src/2080.range-frequency-queries.1294/solution.ts) | Medium |
| 2081 | Sum of k-Mirror Numbers | [TypeScript](./src/2081.sum-of-k-mirror-numbers.2202/solution.ts) | Hard |
| 2082 | The Number of Rich Customers | | Easy |
| 2083 | Substrings That Begin and End With the Same Letter | | Medium |
| 2084 | Drop Type 1 Orders for Customers With Type 0 Orders | | Medium |
| 2085 | Count Common Words With One Occurrence | [JavaScript](./src/2085.count-common-words-with-one-occurrence.2190/solution.js) [TypeScript](./src/2085.count-common-words-with-one-occurrence.2190/solution.ts) | Easy |
| 2086 | Minimum Number of Food Buckets to Feed the Hamsters | [JavaScript](./src/2086.minimum-number-of-food-buckets-to-feed-the-hamsters.2191/solution.js) [TypeScript](./src/2086.minimum-number-of-food-buckets-to-feed-the-hamsters.2191/solution.ts) | Medium |
| 2087 | Minimum Cost Homecoming of a Robot in a Grid | | Medium |
| 2088 | Count Fertile Pyramids in a Land | | Hard |
| 2089 | Find Target Indices After Sorting Array | [Java](./src/2089.find-target-indices-after-sorting-array.2210/solution.java) [JavaScript](./src/2089.find-target-indices-after-sorting-array.2210/solution.js) [TypeScript](./src/2089.find-target-indices-after-sorting-array.2210/solution.ts) | Easy |
| 2090 | K Radius Subarray Averages | [JavaScript](./src/2090.k-radius-subarray-averages.2211/solution.js) [TypeScript](./src/2090.k-radius-subarray-averages.2211/solution.ts) | Medium |
| 2091 | Removing Minimum and Maximum From Array | [JavaScript](./src/2091.removing-minimum-and-maximum-from-array.2212/solution.js) [TypeScript](./src/2091.removing-minimum-and-maximum-from-array.2212/solution.ts) | Medium |
| 2092 | Find All People With Secret | | Hard |
| 2093 | Minimum Cost to Reach City With Discounts | | Medium |
| 2094 | Finding 3-Digit Even Numbers | [JavaScript](./src/2094.finding-3-digit-even-numbers.2215/solution.js) [TypeScript](./src/2094.finding-3-digit-even-numbers.2215/solution.ts) | Easy |
| 2095 | Delete the Middle Node of a Linked List | [JavaScript](./src/2095.delete-the-middle-node-of-a-linked-list.2216/solution.js) [TypeScript](./src/2095.delete-the-middle-node-of-a-linked-list.2216/solution.ts) | Medium |
| 2096 | Step-By-Step Directions From a Binary Tree Node to Another | [JavaScript](./src/2096.step-by-step-directions-from-a-binary-tree-node-to-another.2217/solution.js) [TypeScript](./src/2096.step-by-step-directions-from-a-binary-tree-node-to-another.2217/solution.ts) | Medium |
| 2097 | Valid Arrangement of Pairs | | Hard |
| 2098 | Subsequence of Size K With the Largest Even Sum | | Medium |
| 2099 | Find Subsequence of Length K With the Largest Sum | [JavaScript](./src/2099.find-subsequence-of-length-k-with-the-largest-sum.2204/solution.js) [TypeScript](./src/2099.find-subsequence-of-length-k-with-the-largest-sum.2204/solution.ts) | Easy |
| 2100 | Find Good Days to Rob the Bank | [TypeScript](./src/2100.find-good-days-to-rob-the-bank.2205/solution.ts) | Medium |
| 2101 | Detonate the Maximum Bombs | | Medium |
| 2102 | Sequentially Ordinal Rank Tracker | | Hard |
| 2103 | Rings and Rods | [Java](./src/2103.rings-and-rods.2226/solution.java) [JavaScript](./src/2103.rings-and-rods.2226/solution.js) [TypeScript](./src/2103.rings-and-rods.2226/solution.ts) | Easy |
| 2104 | Sum of Subarray Ranges | [TypeScript](./src/2104.sum-of-subarray-ranges.2227/solution.ts) | Medium |
| 2105 | Watering Plants II | | Medium |
| 2106 | Maximum Fruits Harvested After at Most K Steps | [TypeScript](./src/2106.maximum-fruits-harvested-after-at-most-k-steps.2229/solution.ts) | Hard |
| 2107 | Number of Unique Flavors After Sharing K Candies | | Medium |
| 2108 | Find First Palindromic String in the Array | [Java](./src/2108.find-first-palindromic-string-in-the-array.2231/solution.java) [JavaScript](./src/2108.find-first-palindromic-string-in-the-array.2231/solution.js) [TypeScript](./src/2108.find-first-palindromic-string-in-the-array.2231/solution.ts) | Easy |
| 2109 | Adding Spaces to a String | [JavaScript](./src/2109.adding-spaces-to-a-string.2232/solution.js) [TypeScript](./src/2109.adding-spaces-to-a-string.2232/solution.ts) | Medium |
| 2110 | Number of Smooth Descent Periods of a Stock | [JavaScript](./src/2110.number-of-smooth-descent-periods-of-a-stock.2233/solution.js) [TypeScript](./src/2110.number-of-smooth-descent-periods-of-a-stock.2233/solution.ts) | Medium |
| 2111 | Minimum Operations to Make the Array K-Increasing | | Hard |
| 2112 | The Airport With the Most Traffic | | Medium |
| 2113 | Elements in Array After Removing and Replacing Elements | | Medium |
| 2114 | Maximum Number of Words Found in Sentences | [Java](./src/2114.maximum-number-of-words-found-in-sentences.2219/solution.java) [JavaScript](./src/2114.maximum-number-of-words-found-in-sentences.2219/solution.js) [TypeScript](./src/2114.maximum-number-of-words-found-in-sentences.2219/solution.ts) | Easy |
| 2115 | Find All Possible Recipes from Given Supplies | | Medium |
| 2116 | Check if a Parentheses String Can Be Valid | | Medium |
| 2117 | Abbreviating the Product of a Range | | Hard |
| 2118 | Build the Equation | | Hard |
| 2119 | A Number After a Double Reversal | [Java](./src/2119.a-number-after-a-double-reversal.2238/solution.java) [JavaScript](./src/2119.a-number-after-a-double-reversal.2238/solution.js) [TypeScript](./src/2119.a-number-after-a-double-reversal.2238/solution.ts) | Easy |
| 2120 | Execution of All Suffix Instructions Staying in a Grid | [TypeScript](./src/2120.execution-of-all-suffix-instructions-staying-in-a-grid.2239/solution.ts) | Medium |
| 2121 | Intervals Between Identical Elements | [TypeScript](./src/2121.intervals-between-identical-elements.2240/solution.ts) | Medium |
| 2122 | Recover the Original Array | | Hard |
| 2123 | Minimum Operations to Remove Adjacent Ones in Matrix | | Hard |
| 2124 | Check if All A's Appears Before All B's | [Java](./src/2124.check-if-all-as-appears-before-all-bs.2243/solution.java) [JavaScript](./src/2124.check-if-all-as-appears-before-all-bs.2243/solution.js) [TypeScript](./src/2124.check-if-all-as-appears-before-all-bs.2243/solution.ts) | Easy |
| 2125 | Number of Laser Beams in a Bank | [JavaScript](./src/2125.number-of-laser-beams-in-a-bank.2244/solution.js) [TypeScript](./src/2125.number-of-laser-beams-in-a-bank.2244/solution.ts) | Medium |
| 2126 | Destroying Asteroids | [JavaScript](./src/2126.destroying-asteroids.2245/solution.js) [TypeScript](./src/2126.destroying-asteroids.2245/solution.ts) | Medium |
| 2127 | Maximum Employees to Be Invited to a Meeting | | Hard |
| 2128 | Remove All Ones With Row and Column Flips | | Medium |
| 2129 | Capitalize the Title | [Java](./src/2129.capitalize-the-title.2235/solution.java) [JavaScript](./src/2129.capitalize-the-title.2235/solution.js) [TypeScript](./src/2129.capitalize-the-title.2235/solution.ts) | Easy |
| 2130 | Maximum Twin Sum of a Linked List | [JavaScript](./src/2130.maximum-twin-sum-of-a-linked-list.2236/solution.js) [TypeScript](./src/2130.maximum-twin-sum-of-a-linked-list.2236/solution.ts) | Medium |
| 2131 | Longest Palindrome by Concatenating Two Letter Words | | Medium |
| 2132 | Stamping the Grid | | Hard |
| 2133 | Check if Every Row and Column Contains All Numbers | [JavaScript](./src/2133.check-if-every-row-and-column-contains-all-numbers.2254/solution.js) [TypeScript](./src/2133.check-if-every-row-and-column-contains-all-numbers.2254/solution.ts) | Easy |
| 2134 | Minimum Swaps to Group All 1's Together II | [TypeScript](./src/2134.minimum-swaps-to-group-all-1s-together-ii.2255/solution.ts) | Medium |
| 2135 | Count Words Obtained After Adding a Letter | [TypeScript](./src/2135.count-words-obtained-after-adding-a-letter.2256/solution.ts) | Medium |
| 2136 | Earliest Possible Day of Full Bloom | | Hard |
| 2137 | Pour Water Between Buckets to Make Water Levels Equal | | Medium |
| 2138 | Divide a String Into Groups of Size k | [Java](./src/2138.divide-a-string-into-groups-of-size-k.2260/solution.java) [JavaScript](./src/2138.divide-a-string-into-groups-of-size-k.2260/solution.js) [TypeScript](./src/2138.divide-a-string-into-groups-of-size-k.2260/solution.ts) | Easy |
| 2139 | Minimum Moves to Reach Target Score | [JavaScript](./src/2139.minimum-moves-to-reach-target-score.1303/solution.js) [TypeScript](./src/2139.minimum-moves-to-reach-target-score.1303/solution.ts) | Medium |
| 2140 | Solving Questions With Brainpower | [TypeScript](./src/2140.solving-questions-with-brainpower.2262/solution.ts) | Medium |
| 2141 | Maximum Running Time of N Computers | | Hard |
| 2142 | The Number of Passengers in Each Bus I | | Medium |
| 2143 | Choose Numbers From Two Arrays in Range | | Hard |
| 2144 | Minimum Cost of Buying Candies With Discount | [Java](./src/2144.minimum-cost-of-buying-candies-with-discount.2248/solution.java) [JavaScript](./src/2144.minimum-cost-of-buying-candies-with-discount.2248/solution.js) [TypeScript](./src/2144.minimum-cost-of-buying-candies-with-discount.2248/solution.ts) | Easy |
| 2145 | Count the Hidden Sequences | [TypeScript](./src/2145.count-the-hidden-sequences.2249/solution.ts) | Medium |
| 2146 | K Highest Ranked Items Within a Price Range | | Medium |
| 2147 | Number of Ways to Divide a Long Corridor | [TypeScript](./src/2147.number-of-ways-to-divide-a-long-corridor.2251/solution.ts) | Hard |
| 2148 | Count Elements With Strictly Smaller and Greater Elements | [Java](./src/2148.count-elements-with-strictly-smaller-and-greater-elements.2269/solution.java) [JavaScript](./src/2148.count-elements-with-strictly-smaller-and-greater-elements.2269/solution.js) [TypeScript](./src/2148.count-elements-with-strictly-smaller-and-greater-elements.2269/solution.ts) | Easy |
| 2149 | Rearrange Array Elements by Sign | [JavaScript](./src/2149.rearrange-array-elements-by-sign.2271/solution.js) [TypeScript](./src/2149.rearrange-array-elements-by-sign.2271/solution.ts) | Medium |
| 2150 | Find All Lonely Numbers in the Array | [JavaScript](./src/2150.find-all-lonely-numbers-in-the-array.2270/solution.js) [TypeScript](./src/2150.find-all-lonely-numbers-in-the-array.2270/solution.ts) | Medium |
| 2151 | Maximum Good People Based on Statements | | Hard |
| 2152 | Minimum Number of Lines to Cover Points | | Medium |
| 2153 | The Number of Passengers in Each Bus II | | Hard |
| 2154 | Keep Multiplying Found Values by Two | [Java](./src/2154.keep-multiplying-found-values-by-two.2274/solution.java) [JavaScript](./src/2154.keep-multiplying-found-values-by-two.2274/solution.js) [TypeScript](./src/2154.keep-multiplying-found-values-by-two.2274/solution.ts) | Easy |
| 2155 | All Divisions With the Highest Score of a Binary Array | [JavaScript](./src/2155.all-divisions-with-the-highest-score-of-a-binary-array.2261/solution.js) [TypeScript](./src/2155.all-divisions-with-the-highest-score-of-a-binary-array.2261/solution.ts) | Medium |
| 2156 | Find Substring With Given Hash Value | | Hard |
| 2157 | Groups of Strings | | Hard |
| 2158 | Amount of New Area Painted Each Day | | Hard |
| 2159 | Order Two Columns Independently | | Medium |
| 2160 | Minimum Sum of Four Digit Number After Splitting Digits | [JavaScript](./src/2160.minimum-sum-of-four-digit-number-after-splitting-digits.2264/solution.js) [TypeScript](./src/2160.minimum-sum-of-four-digit-number-after-splitting-digits.2264/solution.ts) | Easy |
| 2161 | Partition Array According to Given Pivot | [JavaScript](./src/2161.partition-array-according-to-given-pivot.2265/solution.js) [TypeScript](./src/2161.partition-array-according-to-given-pivot.2265/solution.ts) | Medium |
| 2162 | Minimum Cost to Set Cooking Time | | Medium |
| 2163 | Minimum Difference in Sums After Removal of Elements | | Hard |
| 2164 | Sort Even and Odd Indices Independently | [JavaScript](./src/2164.sort-even-and-odd-indices-independently.2283/solution.js) [TypeScript](./src/2164.sort-even-and-odd-indices-independently.2283/solution.ts) | Easy |
| 2165 | Smallest Value of the Rearranged Number | [JavaScript](./src/2165.smallest-value-of-the-rearranged-number.2284/solution.js) [TypeScript](./src/2165.smallest-value-of-the-rearranged-number.2284/solution.ts) | Medium |
| 2166 | Design Bitset | [TypeScript](./src/2166.design-bitset.2285/solution.ts) | Medium |
| 2167 | Minimum Time to Remove All Cars Containing Illegal Goods | | Hard |
| 2168 | Unique Substrings With Equal Digit Frequency | | Medium |
| 2169 | Count Operations to Obtain Zero | [Java](./src/2169.count-operations-to-obtain-zero.2288/solution.java) [JavaScript](./src/2169.count-operations-to-obtain-zero.2288/solution.js) [TypeScript](./src/2169.count-operations-to-obtain-zero.2288/solution.ts) | Easy |
| 2170 | Minimum Operations to Make the Array Alternating | | Medium |
| 2171 | Removing Minimum Number of Magic Beans | [TypeScript](./src/2171.removing-minimum-number-of-magic-beans.2290/solution.ts) | Medium |
| 2172 | Maximum AND Sum of Array | | Hard |
| 2173 | Longest Winning Streak | | Hard |
| 2174 | Remove All Ones With Row and Column Flips II | | Medium |
| 2175 | The Change in Global Rankings | | Medium |
| 2176 | Count Equal and Divisible Pairs in an Array | [JavaScript](./src/2176.count-equal-and-divisible-pairs-in-an-array.2277/solution.js) [TypeScript](./src/2176.count-equal-and-divisible-pairs-in-an-array.2277/solution.ts) | Easy |
| 2177 | Find Three Consecutive Integers That Sum to a Given Number | [JavaScript](./src/2177.find-three-consecutive-integers-that-sum-to-a-given-number.2278/solution.js) [TypeScript](./src/2177.find-three-consecutive-integers-that-sum-to-a-given-number.2278/solution.ts) | Medium |
| 2178 | Maximum Split of Positive Even Integers | | Medium |
| 2179 | Count Good Triplets in an Array | | Hard |
| 2180 | Count Integers With Even Digit Sum | [Java](./src/2180.count-integers-with-even-digit-sum.2298/solution.java) [JavaScript](./src/2180.count-integers-with-even-digit-sum.2298/solution.js) [TypeScript](./src/2180.count-integers-with-even-digit-sum.2298/solution.ts) | Easy |
| 2181 | Merge Nodes in Between Zeros | [JavaScript](./src/2181.merge-nodes-in-between-zeros.2299/solution.js) [TypeScript](./src/2181.merge-nodes-in-between-zeros.2299/solution.ts) | Medium |
| 2182 | Construct String With Repeat Limit | | Medium |
| 2183 | Count Array Pairs Divisible by K | | Hard |
| 2184 | Number of Ways to Build Sturdy Brick Wall | | Medium |
| 2185 | Counting Words With a Given Prefix | [Java](./src/2185.counting-words-with-a-given-prefix.2292/solution.java) [JavaScript](./src/2185.counting-words-with-a-given-prefix.2292/solution.js) [TypeScript](./src/2185.counting-words-with-a-given-prefix.2292/solution.ts) | Easy |
| 2186 | Minimum Number of Steps to Make Two Strings Anagram II | [JavaScript](./src/2186.minimum-number-of-steps-to-make-two-strings-anagram-ii.2293/solution.js) [TypeScript](./src/2186.minimum-number-of-steps-to-make-two-strings-anagram-ii.2293/solution.ts) | Medium |
| 2187 | Minimum Time to Complete Trips | [TypeScript](./src/2187.minimum-time-to-complete-trips.2294/solution.ts) | Medium |
| 2188 | Minimum Time to Finish the Race | | Hard |
| 2189 | Number of Ways to Build House of Cards | | Medium |
| 2190 | Most Frequent Number Following Key In an Array | [JavaScript](./src/2190.most-frequent-number-following-key-in-an-array.2312/solution.js) [TypeScript](./src/2190.most-frequent-number-following-key-in-an-array.2312/solution.ts) | Easy |
| 2191 | Sort the Jumbled Numbers | [JavaScript](./src/2191.sort-the-jumbled-numbers.1333/solution.js) [TypeScript](./src/2191.sort-the-jumbled-numbers.1333/solution.ts) | Medium |
| 2192 | All Ancestors of a Node in a Directed Acyclic Graph | [JavaScript](./src/2192.all-ancestors-of-a-node-in-a-directed-acyclic-graph.1431/solution.js) [TypeScript](./src/2192.all-ancestors-of-a-node-in-a-directed-acyclic-graph.1431/solution.ts) | Medium |
| 2193 | Minimum Number of Moves to Make Palindrome | | Hard |
| 2194 | Cells in a Range on an Excel Sheet | [Java](./src/2194.cells-in-a-range-on-an-excel-sheet.2304/solution.java) [JavaScript](./src/2194.cells-in-a-range-on-an-excel-sheet.2304/solution.js) [TypeScript](./src/2194.cells-in-a-range-on-an-excel-sheet.2304/solution.ts) | Easy |
| 2195 | Append K Integers With Minimal Sum | | Medium |
| 2196 | Create Binary Tree From Descriptions | [JavaScript](./src/2196.create-binary-tree-from-descriptions.2306/solution.js) [TypeScript](./src/2196.create-binary-tree-from-descriptions.2306/solution.ts) | Medium |
| 2197 | Replace Non-Coprime Numbers in Array | | Hard |
| 2198 | Number of Single Divisor Triplets | | Medium |
| 2199 | Finding the Topic of Each Post | | Hard |
| 2200 | Find All K-Distant Indices in an Array | [JavaScript](./src/2200.find-all-k-distant-indices-in-an-array.2320/solution.js) [TypeScript](./src/2200.find-all-k-distant-indices-in-an-array.2320/solution.ts) | Easy |
| 2201 | Count Artifacts That Can Be Extracted | [TypeScript](./src/2201.count-artifacts-that-can-be-extracted.1312/solution.ts) | Medium |
| 2202 | Maximize the Topmost Element After K Moves | [TypeScript](./src/2202.maximize-the-topmost-element-after-k-moves.1346/solution.ts) | Medium |
| 2203 | Minimum Weighted Subgraph With the Required Paths | | Hard |
| 2204 | Distance to a Cycle in Undirected Graph | | Hard |
| 2205 | The Number of Users That Are Eligible for Discount | | Easy |
| 2206 | Divide Array Into Equal Pairs | [Java](./src/2206.divide-array-into-equal-pairs.2308/solution.java) [JavaScript](./src/2206.divide-array-into-equal-pairs.2308/solution.js) [TypeScript](./src/2206.divide-array-into-equal-pairs.2308/solution.ts) | Easy |
| 2207 | Maximize Number of Subsequences in a String | [TypeScript](./src/2207.maximize-number-of-subsequences-in-a-string.2309/solution.ts) | Medium |
| 2208 | Minimum Operations to Halve Array Sum | [TypeScript](./src/2208.minimum-operations-to-halve-array-sum.2310/solution.ts) | Medium |
| 2209 | Minimum White Tiles After Covering With Carpets | | Hard |
| 2210 | Count Hills and Valleys in an Array | [JavaScript](./src/2210.count-hills-and-valleys-in-an-array.2316/solution.js) [TypeScript](./src/2210.count-hills-and-valleys-in-an-array.2316/solution.ts) | Easy |
| 2211 | Count Collisions on a Road | [TypeScript](./src/2211.count-collisions-on-a-road.2317/solution.ts) | Medium |
| 2212 | Maximum Points in an Archery Competition | | Medium |
| 2213 | Longest Substring of One Repeating Character | | Hard |
| 2214 | Minimum Health to Beat Game | | Medium |
| 2215 | Find the Difference of Two Arrays | [JavaScript](./src/2215.find-the-difference-of-two-arrays.1392/solution.js) [TypeScript](./src/2215.find-the-difference-of-two-arrays.1392/solution.ts) | Easy |
| 2216 | Minimum Deletions to Make Array Beautiful | [TypeScript](./src/2216.minimum-deletions-to-make-array-beautiful.1355/solution.ts) | Medium |
| 2217 | Find Palindrome With Fixed Length | | Medium |
| 2218 | Maximum Value of K Coins From Piles | | Hard |
| 2219 | Maximum Sum Score of Array | | Medium |
| 2220 | Minimum Bit Flips to Convert Number | [Java](./src/2220.minimum-bit-flips-to-convert-number.2323/solution.java) [JavaScript](./src/2220.minimum-bit-flips-to-convert-number.2323/solution.js) [TypeScript](./src/2220.minimum-bit-flips-to-convert-number.2323/solution.ts) | Easy |
| 2221 | Find Triangular Sum of an Array | [JavaScript](./src/2221.find-triangular-sum-of-an-array.2324/solution.js) [TypeScript](./src/2221.find-triangular-sum-of-an-array.2324/solution.ts) | Medium |
| 2222 | Number of Ways to Select Buildings | [TypeScript](./src/2222.number-of-ways-to-select-buildings.2325/solution.ts) | Medium |
| 2223 | Sum of Scores of Built Strings | [TypeScript](./src/2223.sum-of-scores-of-built-strings.2326/solution.ts) | Hard |
| 2224 | Minimum Number of Operations to Convert Time | [JavaScript](./src/2224.minimum-number-of-operations-to-convert-time.2345/solution.js) [TypeScript](./src/2224.minimum-number-of-operations-to-convert-time.2345/solution.ts) | Easy |
| 2225 | Find Players With Zero or One Losses | [JavaScript](./src/2225.find-players-with-zero-or-one-losses.1354/solution.js) [TypeScript](./src/2225.find-players-with-zero-or-one-losses.1354/solution.ts) | Medium |
| 2226 | Maximum Candies Allocated to K Children | | Medium |
| 2227 | Encrypt and Decrypt Strings | | Hard |
| 2228 | Users With Two Purchases Within Seven Days | | Medium |
| 2229 | Check if an Array Is Consecutive | | Easy |
| 2230 | The Users That Are Eligible for Discount | | Easy |
| 2231 | Largest Number After Digit Swaps by Parity | [JavaScript](./src/2231.largest-number-after-digit-swaps-by-parity.2327/solution.js) [TypeScript](./src/2231.largest-number-after-digit-swaps-by-parity.2327/solution.ts) | Easy |
| 2232 | Minimize Result by Adding Parentheses to Expression | [TypeScript](./src/2232.minimize-result-by-adding-parentheses-to-expression.2328/solution.ts) | Medium |
| 2233 | Maximum Product After K Increments | [TypeScript](./src/2233.maximum-product-after-k-increments.2329/solution.ts) | Medium |
| 2234 | Maximum Total Beauty of the Gardens | | Hard |
| 2235 | Add Two Integers | [Java](./src/2235.add-two-integers.2383/solution.java) [JavaScript](./src/2235.add-two-integers.2383/solution.js) [TypeScript](./src/2235.add-two-integers.2383/solution.ts) | Easy |
| 2236 | Root Equals Sum of Children | [Java](./src/2236.root-equals-sum-of-children.2384/solution.java) [JavaScript](./src/2236.root-equals-sum-of-children.2384/solution.js) [TypeScript](./src/2236.root-equals-sum-of-children.2384/solution.ts) | Easy |
| 2237 | Count Positions on Street With Required Brightness | | Medium |
| 2238 | Number of Times a Driver Was a Passenger | | Medium |
| 2239 | Find Closest Number to Zero | [Java](./src/2239.find-closest-number-to-zero.2350/solution.java) [JavaScript](./src/2239.find-closest-number-to-zero.2350/solution.js) [TypeScript](./src/2239.find-closest-number-to-zero.2350/solution.ts) | Easy |
| 2240 | Number of Ways to Buy Pens and Pencils | [TypeScript](./src/2240.number-of-ways-to-buy-pens-and-pencils.2351/solution.ts) | Medium |
| 2241 | Design an ATM Machine | [TypeScript](./src/2241.design-an-atm-machine.2352/solution.ts) | Medium |
| 2242 | Maximum Score of a Node Sequence | | Hard |
| 2243 | Calculate Digit Sum of a String | [JavaScript](./src/2243.calculate-digit-sum-of-a-string.2361/solution.js) [TypeScript](./src/2243.calculate-digit-sum-of-a-string.2361/solution.ts) | Easy |
| 2244 | Minimum Rounds to Complete All Tasks | [TypeScript](./src/2244.minimum-rounds-to-complete-all-tasks.2362/solution.ts) | Medium |
| 2245 | Maximum Trailing Zeros in a Cornered Path | | Medium |
| 2246 | Longest Path With Different Adjacent Characters | | Hard |
| 2247 | Maximum Cost of Trip With K Highways | | Hard |
| 2248 | Intersection of Multiple Arrays | [JavaScript](./src/2248.intersection-of-multiple-arrays.2331/solution.js) [TypeScript](./src/2248.intersection-of-multiple-arrays.2331/solution.ts) | Easy |
| 2249 | Count Lattice Points Inside a Circle | | Medium |
| 2250 | Count Number of Rectangles Containing Each Point | | Medium |
| 2251 | Number of Flowers in Full Bloom | [TypeScript](./src/2251.number-of-flowers-in-full-bloom.2334/solution.ts) | Hard |
| 2252 | Dynamic Pivoting of a Table | | Hard |
| 2253 | Dynamic Unpivoting of a Table | | Hard |
| 2254 | Design Video Sharing Platform | | Hard |
| 2255 | Count Prefixes of a Given String | [Java](./src/2255.count-prefixes-of-a-given-string.2341/solution.java) [JavaScript](./src/2255.count-prefixes-of-a-given-string.2341/solution.js) [TypeScript](./src/2255.count-prefixes-of-a-given-string.2341/solution.ts) | Easy |
| 2256 | Minimum Average Difference | [TypeScript](./src/2256.minimum-average-difference.2342/solution.ts) | Medium |
| 2257 | Count Unguarded Cells in the Grid | | Medium |
| 2258 | Escape the Spreading Fire | | Hard |
| 2259 | Remove Digit From Number to Maximize Result | [JavaScript](./src/2259.remove-digit-from-number-to-maximize-result.2337/solution.js) [TypeScript](./src/2259.remove-digit-from-number-to-maximize-result.2337/solution.ts) | Easy |
| 2260 | Minimum Consecutive Cards to Pick Up | [TypeScript](./src/2260.minimum-consecutive-cards-to-pick-up.2338/solution.ts) | Medium |
| 2261 | K Divisible Elements Subarrays | | Medium |
| 2262 | Total Appeal of A String | | Hard |
| 2263 | Make Array Non-decreasing or Non-increasing | | Hard |
| 2264 | Largest 3-Same-Digit Number in String | [JavaScript](./src/2264.largest-3-same-digit-number-in-string.2346/solution.js) [TypeScript](./src/2264.largest-3-same-digit-number-in-string.2346/solution.ts) | Easy |
| 2265 | Count Nodes Equal to Average of Subtree | [TypeScript](./src/2265.count-nodes-equal-to-average-of-subtree.2347/solution.ts) | Medium |
| 2266 | Count Number of Texts | [TypeScript](./src/2266.count-number-of-texts.2348/solution.ts) | Medium |
| 2267 | Check if There Is a Valid Parentheses String Path | | Hard |
| 2268 | Minimum Number of Keypresses | | Medium |
| 2269 | Find the K-Beauty of a Number | [Java](./src/2269.find-the-k-beauty-of-a-number.1430/solution.java) [JavaScript](./src/2269.find-the-k-beauty-of-a-number.1430/solution.js) [TypeScript](./src/2269.find-the-k-beauty-of-a-number.1430/solution.ts) | Easy |
| 2270 | Number of Ways to Split Array | [TypeScript](./src/2270.number-of-ways-to-split-array.2358/solution.ts) | Medium |
| 2271 | Maximum White Tiles Covered by a Carpet | | Medium |
| 2272 | Substring With Largest Variance | | Hard |
| 2273 | Find Resultant Array After Removing Anagrams | [JavaScript](./src/2273.find-resultant-array-after-removing-anagrams.1353/solution.js) [TypeScript](./src/2273.find-resultant-array-after-removing-anagrams.1353/solution.ts) | Easy |
| 2274 | Maximum Consecutive Floors Without Special Floors | [TypeScript](./src/2274.maximum-consecutive-floors-without-special-floors.2355/solution.ts) | Medium |
| 2275 | Largest Combination With Bitwise AND Greater Than Zero | [TypeScript](./src/2275.largest-combination-with-bitwise-and-greater-than-zero.2356/solution.ts) | Medium |
| 2276 | Count Integers in Intervals | [TypeScript](./src/2276.count-integers-in-intervals.2357/solution.ts) | Hard |
| 2277 | Closest Node to Path in Tree | | Hard |
| 2278 | Percentage of Letter in String | [Java](./src/2278.percentage-of-letter-in-string.2365/solution.java) [JavaScript](./src/2278.percentage-of-letter-in-string.2365/solution.js) [TypeScript](./src/2278.percentage-of-letter-in-string.2365/solution.ts) | Easy |
| 2279 | Maximum Bags With Full Capacity of Rocks | [TypeScript](./src/2279.maximum-bags-with-full-capacity-of-rocks.2366/solution.ts) | Medium |
| 2280 | Minimum Lines to Represent a Line Chart | [TypeScript](./src/2280.minimum-lines-to-represent-a-line-chart.2367/solution.ts) | Medium |
| 2281 | Sum of Total Strength of Wizards | [TypeScript](./src/2281.sum-of-total-strength-of-wizards.2368/solution.ts) | Hard |
| 2282 | Number of People That Can Be Seen in a Grid | | Medium |
| 2283 | Check if Number Has Equal Digit Count and Digit Value | [Java](./src/2283.check-if-number-has-equal-digit-count-and-digit-value.2377/solution.java) [JavaScript](./src/2283.check-if-number-has-equal-digit-count-and-digit-value.2377/solution.js) [TypeScript](./src/2283.check-if-number-has-equal-digit-count-and-digit-value.2377/solution.ts) | Easy |
| 2284 | Sender With Largest Word Count | [TypeScript](./src/2284.sender-with-largest-word-count.2378/solution.ts) | Medium |
| 2285 | Maximum Total Importance of Roads | | Medium |
| 2286 | Booking Concert Tickets in Groups | | Hard |
| 2287 | Rearrange Characters to Make Target String | [Java](./src/2287.rearrange-characters-to-make-target-string.2372/solution.java) [JavaScript](./src/2287.rearrange-characters-to-make-target-string.2372/solution.js) [TypeScript](./src/2287.rearrange-characters-to-make-target-string.2372/solution.ts) | Easy |
| 2288 | Apply Discount to Prices | [TypeScript](./src/2288.apply-discount-to-prices.2373/solution.ts) | Medium |
| 2289 | Steps to Make Array Non-decreasing | [TypeScript](./src/2289.steps-to-make-array-non-decreasing.2374/solution.ts) | Medium |
| 2290 | Minimum Obstacle Removal to Reach Corner | | Hard |
| 2291 | Maximum Profit From Trading Stocks | | Medium |
| 2292 | Products With Three or More Orders in Two Consecutive Years | | Medium |
| 2293 | Min Max Game | [Java](./src/2293.min-max-game.2386/solution.java) [JavaScript](./src/2293.min-max-game.2386/solution.js) [TypeScript](./src/2293.min-max-game.2386/solution.ts) | Easy |
| 2294 | Partition Array Such That Maximum Difference Is K | [JavaScript](./src/2294.partition-array-such-that-maximum-difference-is-k.2387/solution.js) [TypeScript](./src/2294.partition-array-such-that-maximum-difference-is-k.2387/solution.ts) | Medium |
| 2295 | Replace Elements in an Array | [JavaScript](./src/2295.replace-elements-in-an-array.2388/solution.js) [TypeScript](./src/2295.replace-elements-in-an-array.2388/solution.ts) | Medium |
| 2296 | Design a Text Editor | | Hard |
| 2297 | Jump Game VIII | | Medium |
| 2298 | Tasks Count in the Weekend | | Medium |
| 2299 | Strong Password Checker II | [JavaScript](./src/2299.strong-password-checker-ii.2391/solution.js) [TypeScript](./src/2299.strong-password-checker-ii.2391/solution.ts) | Easy |
| 2300 | Successful Pairs of Spells and Potions | [TypeScript](./src/2300.successful-pairs-of-spells-and-potions.2392/solution.ts) | Medium |
| 2301 | Match Substring After Replacement | [TypeScript](./src/2301.match-substring-after-replacement.2393/solution.ts) | Hard |
| 2302 | Count Subarrays With Score Less Than K | [TypeScript](./src/2302.count-subarrays-with-score-less-than-k.2394/solution.ts) | Hard |
| 2303 | Calculate Amount Paid in Taxes | [JavaScript](./src/2303.calculate-amount-paid-in-taxes.1382/solution.js) [TypeScript](./src/2303.calculate-amount-paid-in-taxes.1382/solution.ts) | Easy |
| 2304 | Minimum Path Cost in a Grid | [TypeScript](./src/2304.minimum-path-cost-in-a-grid.1394/solution.ts) | Medium |
| 2305 | Fair Distribution of Cookies | | Medium |
| 2306 | Naming a Company | | Hard |
| 2307 | Check for Contradictions in Equations | | Hard |
| 2308 | Arrange Table by Gender | | Medium |
| 2309 | Greatest English Letter in Upper and Lower Case | [Java](./src/2309.greatest-english-letter-in-upper-and-lower-case.1363/solution.java) [JavaScript](./src/2309.greatest-english-letter-in-upper-and-lower-case.1363/solution.js) [TypeScript](./src/2309.greatest-english-letter-in-upper-and-lower-case.1363/solution.ts) | Easy |
| 2310 | Sum of Numbers With Units Digit K | | Medium |
| 2311 | Longest Binary Subsequence Less Than or Equal to K | | Medium |
| 2312 | Selling Pieces of Wood | | Hard |
| 2313 | Minimum Flips in Binary Tree to Get Result | | Hard |
| 2314 | The First Day of the Maximum Recorded Degree in Each City | | Medium |
| 2315 | Count Asterisks | [Java](./src/2315.count-asterisks.2401/solution.java) [JavaScript](./src/2315.count-asterisks.2401/solution.js) [TypeScript](./src/2315.count-asterisks.2401/solution.ts) | Easy |
| 2316 | Count Unreachable Pairs of Nodes in an Undirected Graph | [JavaScript](./src/2316.count-unreachable-pairs-of-nodes-in-an-undirected-graph.2403/solution.js) [TypeScript](./src/2316.count-unreachable-pairs-of-nodes-in-an-undirected-graph.2403/solution.ts) | Medium |
| 2317 | Maximum XOR After Operations | [TypeScript](./src/2317.maximum-xor-after-operations.2402/solution.ts) | Medium |
| 2318 | Number of Distinct Roll Sequences | | Hard |
| 2319 | Check if Matrix Is X-Matrix | [Java](./src/2319.check-if-matrix-is-x-matrix.2398/solution.java) [JavaScript](./src/2319.check-if-matrix-is-x-matrix.2398/solution.js) [TypeScript](./src/2319.check-if-matrix-is-x-matrix.2398/solution.ts) | Easy |
| 2320 | Count Number of Ways to Place Houses | [TypeScript](./src/2320.count-number-of-ways-to-place-houses.2397/solution.ts) | Medium |
| 2321 | Maximum Score Of Spliced Array | | Hard |
| 2322 | Minimum Score After Removals on a Tree | | Hard |
| 2323 | Find Minimum Time to Finish All Jobs II | | Medium |
| 2324 | Product Sales Analysis IV | | Medium |
| 2325 | Decode the Message | [JavaScript](./src/2325.decode-the-message.2406/solution.js) [TypeScript](./src/2325.decode-the-message.2406/solution.ts) | Easy |
| 2326 | Spiral Matrix IV | [TypeScript](./src/2326.spiral-matrix-iv.2411/solution.ts) | Medium |
| 2327 | Number of People Aware of a Secret | [TypeScript](./src/2327.number-of-people-aware-of-a-secret.2408/solution.ts) | Medium |
| 2328 | Number of Increasing Paths in a Grid | | Hard |
| 2329 | Product Sales Analysis V | | Easy |
| 2330 | Valid Palindrome IV | | Medium |
| 2331 | Evaluate Boolean Binary Tree | [Go](./src/2331.evaluate-boolean-binary-tree.2416/solution.go) [Java](./src/2331.evaluate-boolean-binary-tree.2416/solution.java) [JavaScript](./src/2331.evaluate-boolean-binary-tree.2416/solution.js) [TypeScript](./src/2331.evaluate-boolean-binary-tree.2416/solution.ts) | Easy |
| 2332 | The Latest Time to Catch a Bus | | Medium |
| 2333 | Minimum Sum of Squared Difference | [TypeScript](./src/2333.minimum-sum-of-squared-difference.2418/solution.ts) | Medium |
| 2334 | Subarray With Elements Greater Than Varying Threshold | | Hard |
| 2335 | Minimum Amount of Time to Fill Cups | [JavaScript](./src/2335.minimum-amount-of-time-to-fill-cups.2412/solution.js) [TypeScript](./src/2335.minimum-amount-of-time-to-fill-cups.2412/solution.ts) | Easy |
| 2336 | Smallest Number in Infinite Set | [TypeScript](./src/2336.smallest-number-in-infinite-set.2413/solution.ts) | Medium |
| 2337 | Move Pieces to Obtain a String | [TypeScript](./src/2337.move-pieces-to-obtain-a-string.2414/solution.ts) | Medium |
| 2338 | Count the Number of Ideal Arrays | | Hard |
| 2339 | All the Matches of the League | | Easy |
| 2340 | Minimum Adjacent Swaps to Make a Valid Array | | Medium |
| 2341 | Maximum Number of Pairs in Array | [Java](./src/2341.maximum-number-of-pairs-in-array.2421/solution.java) [JavaScript](./src/2341.maximum-number-of-pairs-in-array.2421/solution.js) [TypeScript](./src/2341.maximum-number-of-pairs-in-array.2421/solution.ts) | Easy |
| 2342 | Max Sum of a Pair With Equal Sum of Digits | [JavaScript](./src/2342.max-sum-of-a-pair-with-equal-sum-of-digits.2473/solution.js) [TypeScript](./src/2342.max-sum-of-a-pair-with-equal-sum-of-digits.2473/solution.ts) | Medium |
| 2343 | Query Kth Smallest Trimmed Number | | Medium |
| 2344 | Minimum Deletions to Make Array Divisible | | Hard |
| 2345 | Finding the Number of Visible Mountains | | Medium |
| 2346 | Compute the Rank as a Percentage | | Medium |
| 2347 | Best Poker Hand | [JavaScript](./src/2347.best-poker-hand.2433/solution.js) [TypeScript](./src/2347.best-poker-hand.2433/solution.ts) | Easy |
| 2348 | Number of Zero-Filled Subarrays | [JavaScript](./src/2348.number-of-zero-filled-subarrays.2432/solution.js) [TypeScript](./src/2348.number-of-zero-filled-subarrays.2432/solution.ts) | Medium |
| 2349 | Design a Number Container System | [TypeScript](./src/2349.design-a-number-container-system.2434/solution.ts) | Medium |
| 2350 | Shortest Impossible Sequence of Rolls | | Hard |
| 2351 | First Letter to Appear Twice | [Java](./src/2351.first-letter-to-appear-twice.2427/solution.java) [JavaScript](./src/2351.first-letter-to-appear-twice.2427/solution.js) [TypeScript](./src/2351.first-letter-to-appear-twice.2427/solution.ts) | Easy |
| 2352 | Equal Row and Column Pairs | [JavaScript](./src/2352.equal-row-and-column-pairs.2428/solution.js) [TypeScript](./src/2352.equal-row-and-column-pairs.2428/solution.ts) | Medium |
| 2353 | Design a Food Rating System | [TypeScript](./src/2353.design-a-food-rating-system.2429/solution.ts) | Medium |
| 2354 | Number of Excellent Pairs | | Hard |
| 2355 | Maximum Number of Books You Can Take | | Hard |
| 2356 | Number of Unique Subjects Taught by Each Teacher | | Easy |
| 2357 | Make Array Zero by Subtracting Equal Amounts | [Java](./src/2357.make-array-zero-by-subtracting-equal-amounts.2436/solution.java) [JavaScript](./src/2357.make-array-zero-by-subtracting-equal-amounts.2436/solution.js) [TypeScript](./src/2357.make-array-zero-by-subtracting-equal-amounts.2436/solution.ts) | Easy |
| 2358 | Maximum Number of Groups Entering a Competition | | Medium |
| 2359 | Find Closest Node to Given Two Nodes | [JavaScript](./src/2359.find-closest-node-to-given-two-nodes.2438/solution.js) [TypeScript](./src/2359.find-closest-node-to-given-two-nodes.2438/solution.ts) | Medium |
| 2360 | Longest Cycle in a Graph | | Hard |
| 2361 | Minimum Costs Using the Train Line | | Hard |
| 2362 | Generate the Invoice | | Hard |
| 2363 | Merge Similar Items | [Java](./src/2363.merge-similar-items.2447/solution.java) [JavaScript](./src/2363.merge-similar-items.2447/solution.js) [TypeScript](./src/2363.merge-similar-items.2447/solution.ts) | Easy |
| 2364 | Count Number of Bad Pairs | [JavaScript](./src/2364.count-number-of-bad-pairs.2448/solution.js) [TypeScript](./src/2364.count-number-of-bad-pairs.2448/solution.ts) | Medium |
| 2365 | Task Scheduler II | | Medium |
| 2366 | Minimum Replacements to Sort the Array | | Hard |
| 2367 | Number of Arithmetic Triplets | [JavaScript](./src/2367.number-of-arithmetic-triplets.2442/solution.js) [TypeScript](./src/2367.number-of-arithmetic-triplets.2442/solution.ts) | Easy |
| 2368 | Reachable Nodes With Restrictions | [JavaScript](./src/2368.reachable-nodes-with-restrictions.2445/solution.js) [TypeScript](./src/2368.reachable-nodes-with-restrictions.2445/solution.ts) | Medium |
| 2369 | Check if There is a Valid Partition For The Array | | Medium |
| 2370 | Longest Ideal Subsequence | | Medium |
| 2371 | Minimize Maximum Value in a Grid | | Hard |
| 2372 | Calculate the Influence of Each Salesperson | | Medium |
| 2373 | Largest Local Values in a Matrix | [Java](./src/2373.largest-local-values-in-a-matrix.2454/solution.java) [JavaScript](./src/2373.largest-local-values-in-a-matrix.2454/solution.js) [TypeScript](./src/2373.largest-local-values-in-a-matrix.2454/solution.ts) | Easy |
| 2374 | Node With Highest Edge Score | [JavaScript](./src/2374.node-with-highest-edge-score.2455/solution.js) [TypeScript](./src/2374.node-with-highest-edge-score.2455/solution.ts) | Medium |
| 2375 | Construct Smallest Number From DI String | [TypeScript](./src/2375.construct-smallest-number-from-di-string.2456/solution.ts) | Medium |
| 2376 | Count Special Integers | | Hard |
| 2377 | Sort the Olympic Table | | Easy |
| 2378 | Choose Edges to Maximize Score in a Tree | | Medium |
| 2379 | Minimum Recolors to Get K Consecutive Black Blocks | [JavaScript](./src/2379.minimum-recolors-to-get-k-consecutive-black-blocks.2463/solution.js) [TypeScript](./src/2379.minimum-recolors-to-get-k-consecutive-black-blocks.2463/solution.ts) | Easy |
| 2380 | Time Needed to Rearrange a Binary String | | Medium |
| 2381 | Shifting Letters II | [TypeScript](./src/2381.shifting-letters-ii.2465/solution.ts) | Medium |
| 2382 | Maximum Segment Sum After Removals | | Hard |
| 2383 | Minimum Hours of Training to Win a Competition | [JavaScript](./src/2383.minimum-hours-of-training-to-win-a-competition.2459/solution.js) [TypeScript](./src/2383.minimum-hours-of-training-to-win-a-competition.2459/solution.ts) | Easy |
| 2384 | Largest Palindromic Number | [JavaScript](./src/2384.largest-palindromic-number.2475/solution.js) [TypeScript](./src/2384.largest-palindromic-number.2475/solution.ts) | Medium |
| 2385 | Amount of Time for Binary Tree to Be Infected | [JavaScript](./src/2385.amount-of-time-for-binary-tree-to-be-infected.2461/solution.js) [TypeScript](./src/2385.amount-of-time-for-binary-tree-to-be-infected.2461/solution.ts) | Medium |
| 2386 | Find the K-Sum of an Array | | Hard |
| 2387 | Median of a Row Wise Sorted Matrix | | Medium |
| 2388 | Change Null Values in a Table to the Previous Value | | Medium |
| 2389 | Longest Subsequence With Limited Sum | [JavaScript](./src/2389.longest-subsequence-with-limited-sum.2469/solution.js) [TypeScript](./src/2389.longest-subsequence-with-limited-sum.2469/solution.ts) | Easy |
| 2390 | Removing Stars From a String | [JavaScript](./src/2390.removing-stars-from-a-string.2470/solution.js) [TypeScript](./src/2390.removing-stars-from-a-string.2470/solution.ts) | Medium |
| 2391 | Minimum Amount of Time to Collect Garbage | [JavaScript](./src/2391.minimum-amount-of-time-to-collect-garbage.2471/solution.js) [TypeScript](./src/2391.minimum-amount-of-time-to-collect-garbage.2471/solution.ts) | Medium |
| 2392 | Build a Matrix With Conditions | | Hard |
| 2393 | Count Strictly Increasing Subarrays | | Medium |
| 2394 | Employees With Deductions | | Medium |
| 2395 | Find Subarrays With Equal Sum | [Java](./src/2395.find-subarrays-with-equal-sum.2480/solution.java) [JavaScript](./src/2395.find-subarrays-with-equal-sum.2480/solution.js) [TypeScript](./src/2395.find-subarrays-with-equal-sum.2480/solution.ts) | Easy |
| 2396 | Strictly Palindromic Number | [JavaScript](./src/2396.strictly-palindromic-number.2481/solution.js) [TypeScript](./src/2396.strictly-palindromic-number.2481/solution.ts) | Medium |
| 2397 | Maximum Rows Covered by Columns | | Medium |
| 2398 | Maximum Number of Robots Within Budget | | Hard |
| 2399 | Check Distances Between Same Letters | [Java](./src/2399.check-distances-between-same-letters.2476/solution.java) [JavaScript](./src/2399.check-distances-between-same-letters.2476/solution.js) [TypeScript](./src/2399.check-distances-between-same-letters.2476/solution.ts) | Easy |
| 2400 | Number of Ways to Reach a Position After Exactly k Steps | [TypeScript](./src/2400.number-of-ways-to-reach-a-position-after-exactly-k-steps.2477/solution.ts) | Medium |
| 2401 | Longest Nice Subarray | [TypeScript](./src/2401.longest-nice-subarray.2478/solution.ts) | Medium |
| 2402 | Meeting Rooms III | | Hard |
| 2403 | Minimum Time to Kill All Monsters | | Hard |
| 2404 | Most Frequent Even Element | [JavaScript](./src/2404.most-frequent-even-element.2486/solution.js) [TypeScript](./src/2404.most-frequent-even-element.2486/solution.ts) | Easy |
| 2405 | Optimal Partition of String | [JavaScript](./src/2405.optimal-partition-of-string.2487/solution.js) [TypeScript](./src/2405.optimal-partition-of-string.2487/solution.ts) | Medium |
| 2406 | Divide Intervals Into Minimum Number of Groups | | Medium |
| 2407 | Longest Increasing Subsequence II | | Hard |
| 2408 | Design SQL | | Medium |
| 2409 | Count Days Spent Together | [JavaScript](./src/2409.count-days-spent-together.2496/solution.js) [TypeScript](./src/2409.count-days-spent-together.2496/solution.ts) | Easy |
| 2410 | Maximum Matching of Players With Trainers | [JavaScript](./src/2410.maximum-matching-of-players-with-trainers.2497/solution.js) [TypeScript](./src/2410.maximum-matching-of-players-with-trainers.2497/solution.ts) | Medium |
| 2411 | Smallest Subarrays With Maximum Bitwise OR | [TypeScript](./src/2411.smallest-subarrays-with-maximum-bitwise-or.2498/solution.ts) | Medium |
| 2412 | Minimum Money Required Before Transactions | | Hard |
| 2413 | Smallest Even Multiple | [Java](./src/2413.smallest-even-multiple.2491/solution.java) [JavaScript](./src/2413.smallest-even-multiple.2491/solution.js) [TypeScript](./src/2413.smallest-even-multiple.2491/solution.ts) | Easy |
| 2414 | Length of the Longest Alphabetical Continuous Substring | [JavaScript](./src/2414.length-of-the-longest-alphabetical-continuous-substring.2492/solution.js) [TypeScript](./src/2414.length-of-the-longest-alphabetical-continuous-substring.2492/solution.ts) | Medium |
| 2415 | Reverse Odd Levels of Binary Tree | [JavaScript](./src/2415.reverse-odd-levels-of-binary-tree.2493/solution.js) [TypeScript](./src/2415.reverse-odd-levels-of-binary-tree.2493/solution.ts) | Medium |
| 2416 | Sum of Prefix Scores of Strings | [TypeScript](./src/2416.sum-of-prefix-scores-of-strings.2494/solution.ts) | Hard |
| 2417 | Closest Fair Integer | | Medium |
| 2418 | Sort the People | [JavaScript](./src/2418.sort-the-people.2502/solution.js) [TypeScript](./src/2418.sort-the-people.2502/solution.ts) | Easy |
| 2419 | Longest Subarray With Maximum Bitwise AND | [JavaScript](./src/2419.longest-subarray-with-maximum-bitwise-and.2503/solution.js) [TypeScript](./src/2419.longest-subarray-with-maximum-bitwise-and.2503/solution.ts) | Medium |
| 2420 | Find All Good Indices | [TypeScript](./src/2420.find-all-good-indices.2504/solution.ts) | Medium |
| 2421 | Number of Good Paths | | Hard |
| 2422 | Merge Operations to Turn Array Into a Palindrome | | Medium |
| 2423 | Remove Letter To Equalize Frequency | [JavaScript](./src/2423.remove-letter-to-equalize-frequency.2532/solution.js) [TypeScript](./src/2423.remove-letter-to-equalize-frequency.2532/solution.ts) | Easy |
| 2424 | Longest Uploaded Prefix | [TypeScript](./src/2424.longest-uploaded-prefix.2512/solution.ts) | Medium |
| 2425 | Bitwise XOR of All Pairings | [JavaScript](./src/2425.bitwise-xor-of-all-pairings.2533/solution.js) [TypeScript](./src/2425.bitwise-xor-of-all-pairings.2533/solution.ts) | Medium |
| 2426 | Number of Pairs Satisfying Inequality | [TypeScript](./src/2426.number-of-pairs-satisfying-inequality.2513/solution.ts) | Hard |
| 2427 | Number of Common Factors | [JavaScript](./src/2427.number-of-common-factors.2507/solution.js) [TypeScript](./src/2427.number-of-common-factors.2507/solution.ts) | Easy |
| 2428 | Maximum Sum of an Hourglass | [JavaScript](./src/2428.maximum-sum-of-an-hourglass.2508/solution.js) [TypeScript](./src/2428.maximum-sum-of-an-hourglass.2508/solution.ts) | Medium |
| 2429 | Minimize XOR | [JavaScript](./src/2429.minimize-xor.2509/solution.js) [TypeScript](./src/2429.minimize-xor.2509/solution.ts) | Medium |
| 2430 | Maximum Deletions on a String | | Hard |
| 2431 | Maximize Total Tastiness of Purchased Fruits | | Medium |
| 2432 | The Employee That Worked on the Longest Task | [Java](./src/2432.the-employee-that-worked-on-the-longest-task.2518/solution.java) [JavaScript](./src/2432.the-employee-that-worked-on-the-longest-task.2518/solution.js) [TypeScript](./src/2432.the-employee-that-worked-on-the-longest-task.2518/solution.ts) | Easy |
| 2433 | Find The Original Array of Prefix Xor | [JavaScript](./src/2433.find-the-original-array-of-prefix-xor.2519/solution.js) [TypeScript](./src/2433.find-the-original-array-of-prefix-xor.2519/solution.ts) | Medium |
| 2434 | Using a Robot to Print the Lexicographically Smallest String | [TypeScript](./src/2434.using-a-robot-to-print-the-lexicographically-smallest-string.2520/solution.ts) | Medium |
| 2435 | Paths in Matrix Whose Sum Is Divisible by K | | Hard |
| 2436 | Minimum Split Into Subarrays With GCD Greater Than One | | Medium |
| 2437 | Number of Valid Clock Times | [JavaScript](./src/2437.number-of-valid-clock-times.2528/solution.js) [TypeScript](./src/2437.number-of-valid-clock-times.2528/solution.ts) | Easy |
| 2438 | Range Product Queries of Powers | [JavaScript](./src/2438.range-product-queries-of-powers.2529/solution.js) [TypeScript](./src/2438.range-product-queries-of-powers.2529/solution.ts) | Medium |
| 2439 | Minimize Maximum of Array | [TypeScript](./src/2439.minimize-maximum-of-array.2530/solution.ts) | Medium |
| 2440 | Create Components With Same Value | | Hard |
| 2441 | Largest Positive Integer That Exists With Its Negative | [Java](./src/2441.largest-positive-integer-that-exists-with-its-negative.2524/solution.java) [JavaScript](./src/2441.largest-positive-integer-that-exists-with-its-negative.2524/solution.js) [TypeScript](./src/2441.largest-positive-integer-that-exists-with-its-negative.2524/solution.ts) | Easy |
| 2442 | Count Number of Distinct Integers After Reverse Operations | [JavaScript](./src/2442.count-number-of-distinct-integers-after-reverse-operations.2525/solution.js) [TypeScript](./src/2442.count-number-of-distinct-integers-after-reverse-operations.2525/solution.ts) | Medium |
| 2443 | Sum of Number and Its Reverse | [JavaScript](./src/2443.sum-of-number-and-its-reverse.2541/solution.js) [TypeScript](./src/2443.sum-of-number-and-its-reverse.2541/solution.ts) | Medium |
| 2444 | Count Subarrays With Fixed Bounds | | Hard |
| 2445 | Number of Nodes With Value One | | Medium |
| 2446 | Determine if Two Events Have Conflict | [JavaScript](./src/2446.determine-if-two-events-have-conflict.2536/solution.js) [TypeScript](./src/2446.determine-if-two-events-have-conflict.2536/solution.ts) | Easy |
| 2447 | Number of Subarrays With GCD Equal to K | [TypeScript](./src/2447.number-of-subarrays-with-gcd-equal-to-k.2546/solution.ts) | Medium |
| 2448 | Minimum Cost to Make Array Equal | | Hard |
| 2449 | Minimum Number of Operations to Make Arrays Similar | | Hard |
| 2450 | Number of Distinct Binary Strings After Applying Operations | | Medium |
| 2451 | Odd String Difference | [JavaScript](./src/2451.odd-string-difference.2547/solution.js) [TypeScript](./src/2451.odd-string-difference.2547/solution.ts) | Easy |
| 2452 | Words Within Two Edits of Dictionary | [JavaScript](./src/2452.words-within-two-edits-of-dictionary.2550/solution.js) [TypeScript](./src/2452.words-within-two-edits-of-dictionary.2550/solution.ts) | Medium |
| 2453 | Destroy Sequential Targets | [JavaScript](./src/2453.destroy-sequential-targets.2548/solution.js) [TypeScript](./src/2453.destroy-sequential-targets.2548/solution.ts) | Medium |
| 2454 | Next Greater Element IV | [JavaScript](./src/2454.next-greater-element-iv.2549/solution.js) [TypeScript](./src/2454.next-greater-element-iv.2549/solution.ts) | Hard |
| 2455 | Average Value of Even Numbers That Are Divisible by Three | [Java](./src/2455.average-value-of-even-numbers-that-are-divisible-by-three.2542/solution.java) [JavaScript](./src/2455.average-value-of-even-numbers-that-are-divisible-by-three.2542/solution.js) [TypeScript](./src/2455.average-value-of-even-numbers-that-are-divisible-by-three.2542/solution.ts) | Easy |
| 2456 | Most Popular Video Creator | [JavaScript](./src/2456.most-popular-video-creator.2543/solution.js) [TypeScript](./src/2456.most-popular-video-creator.2543/solution.ts) | Medium |
| 2457 | Minimum Addition to Make Integer Beautiful | [JavaScript](./src/2457.minimum-addition-to-make-integer-beautiful.2544/solution.js) [TypeScript](./src/2457.minimum-addition-to-make-integer-beautiful.2544/solution.ts) | Medium |
| 2458 | Height of Binary Tree After Subtree Removal Queries | [JavaScript](./src/2458.height-of-binary-tree-after-subtree-removal-queries.2545/solution.js) [TypeScript](./src/2458.height-of-binary-tree-after-subtree-removal-queries.2545/solution.ts) | Hard |
| 2459 | Sort Array by Moving Items to Empty Space | | Hard |
| 2460 | Apply Operations to an Array | [JavaScript](./src/2460.apply-operations-to-an-array.2551/solution.js) [TypeScript](./src/2460.apply-operations-to-an-array.2551/solution.ts) | Easy |
| 2461 | Maximum Sum of Distinct Subarrays With Length K | [JavaScript](./src/2461.maximum-sum-of-distinct-subarrays-with-length-k.2552/solution.js) [TypeScript](./src/2461.maximum-sum-of-distinct-subarrays-with-length-k.2552/solution.ts) | Medium |
| 2462 | Total Cost to Hire K Workers | [JavaScript](./src/2462.total-cost-to-hire-k-workers.2553/solution.js) [TypeScript](./src/2462.total-cost-to-hire-k-workers.2553/solution.ts) | Medium |
| 2463 | Minimum Total Distance Traveled | | Hard |
| 2464 | Minimum Subarrays in a Valid Split | | Medium |
| 2465 | Number of Distinct Averages | [Java](./src/2465.number-of-distinct-averages.2561/solution.java) [JavaScript](./src/2465.number-of-distinct-averages.2561/solution.js) [TypeScript](./src/2465.number-of-distinct-averages.2561/solution.ts) | Easy |
| 2466 | Count Ways To Build Good Strings | [JavaScript](./src/2466.count-ways-to-build-good-strings.2562/solution.js) [TypeScript](./src/2466.count-ways-to-build-good-strings.2562/solution.ts) | Medium |
| 2467 | Most Profitable Path in a Tree | [JavaScript](./src/2467.most-profitable-path-in-a-tree.2564/solution.js) [TypeScript](./src/2467.most-profitable-path-in-a-tree.2564/solution.ts) | Medium |
| 2468 | Split Message Based on Limit | [JavaScript](./src/2468.split-message-based-on-limit.2563/solution.js) [TypeScript](./src/2468.split-message-based-on-limit.2563/solution.ts) | Hard |
| 2469 | Convert the Temperature | [Java](./src/2469.convert-the-temperature.2556/solution.java) [JavaScript](./src/2469.convert-the-temperature.2556/solution.js) [TypeScript](./src/2469.convert-the-temperature.2556/solution.ts) | Easy |
| 2470 | Number of Subarrays With LCM Equal to K | [JavaScript](./src/2470.number-of-subarrays-with-lcm-equal-to-k.2557/solution.js) [TypeScript](./src/2470.number-of-subarrays-with-lcm-equal-to-k.2557/solution.ts) | Medium |
| 2471 | Minimum Number of Operations to Sort a Binary Tree by Level | [JavaScript](./src/2471.minimum-number-of-operations-to-sort-a-binary-tree-by-level.2558/solution.js) [TypeScript](./src/2471.minimum-number-of-operations-to-sort-a-binary-tree-by-level.2558/solution.ts) | Medium |
| 2472 | Maximum Number of Non-overlapping Palindrome Substrings | | Hard |
| 2473 | Minimum Cost to Buy Apples | | Medium |
| 2474 | Customers With Strictly Increasing Purchases | | Hard |
| 2475 | Number of Unequal Triplets in Array | [JavaScript](./src/2475.number-of-unequal-triplets-in-array.2566/solution.js) [TypeScript](./src/2475.number-of-unequal-triplets-in-array.2566/solution.ts) | Easy |
| 2476 | Closest Nodes Queries in a Binary Search Tree | [JavaScript](./src/2476.closest-nodes-queries-in-a-binary-search-tree.2567/solution.js) [TypeScript](./src/2476.closest-nodes-queries-in-a-binary-search-tree.2567/solution.ts) | Medium |
| 2477 | Minimum Fuel Cost to Report to the Capital | [JavaScript](./src/2477.minimum-fuel-cost-to-report-to-the-capital.2568/solution.js) [TypeScript](./src/2477.minimum-fuel-cost-to-report-to-the-capital.2568/solution.ts) | Medium |
| 2478 | Number of Beautiful Partitions | [JavaScript](./src/2478.number-of-beautiful-partitions.2569/solution.js) [TypeScript](./src/2478.number-of-beautiful-partitions.2569/solution.ts) | Hard |
| 2479 | Maximum XOR of Two Non-Overlapping Subtrees | | Hard |
| 2480 | Form a Chemical Bond | | Easy |
| 2481 | Minimum Cuts to Divide a Circle | [JavaScript](./src/2481.minimum-cuts-to-divide-a-circle.2575/solution.js) [TypeScript](./src/2481.minimum-cuts-to-divide-a-circle.2575/solution.ts) | Easy |
| 2482 | Difference Between Ones and Zeros in Row and Column | [JavaScript](./src/2482.difference-between-ones-and-zeros-in-row-and-column.2606/solution.js) [TypeScript](./src/2482.difference-between-ones-and-zeros-in-row-and-column.2606/solution.ts) | Medium |
| 2483 | Minimum Penalty for a Shop | [JavaScript](./src/2483.minimum-penalty-for-a-shop.2576/solution.js) [TypeScript](./src/2483.minimum-penalty-for-a-shop.2576/solution.ts) | Medium |
| 2484 | Count Palindromic Subsequences | | Hard |
| 2485 | Find the Pivot Integer | [Java](./src/2485.find-the-pivot-integer.2571/solution.java) [JavaScript](./src/2485.find-the-pivot-integer.2571/solution.js) [TypeScript](./src/2485.find-the-pivot-integer.2571/solution.ts) | Easy |
| 2486 | Append Characters to String to Make Subsequence | [JavaScript](./src/2486.append-characters-to-string-to-make-subsequence.2572/solution.js) [TypeScript](./src/2486.append-characters-to-string-to-make-subsequence.2572/solution.ts) | Medium |
| 2487 | Remove Nodes From Linked List | [JavaScript](./src/2487.remove-nodes-from-linked-list.2573/solution.js) [TypeScript](./src/2487.remove-nodes-from-linked-list.2573/solution.ts) | Medium |
| 2488 | Count Subarrays With Median K | | Hard |
| 2489 | Number of Substrings With Fixed Ratio | | Medium |
| 2490 | Circular Sentence | [Java](./src/2490.circular-sentence.2580/solution.java) [JavaScript](./src/2490.circular-sentence.2580/solution.js) [TypeScript](./src/2490.circular-sentence.2580/solution.ts) | Easy |
| 2491 | Divide Players Into Teams of Equal Skill | [JavaScript](./src/2491.divide-players-into-teams-of-equal-skill.2581/solution.js) [TypeScript](./src/2491.divide-players-into-teams-of-equal-skill.2581/solution.ts) | Medium |
| 2492 | Minimum Score of a Path Between Two Cities | [JavaScript](./src/2492.minimum-score-of-a-path-between-two-cities.2582/solution.js) [TypeScript](./src/2492.minimum-score-of-a-path-between-two-cities.2582/solution.ts) | Medium |
| 2493 | Divide Nodes Into the Maximum Number of Groups | | Hard |
| 2494 | Merge Overlapping Events in the Same Hall | | Hard |
| 2495 | Number of Subarrays Having Even Product | | Medium |
| 2496 | Maximum Value of a String in an Array | [Java](./src/2496.maximum-value-of-a-string-in-an-array.2589/solution.java) [JavaScript](./src/2496.maximum-value-of-a-string-in-an-array.2589/solution.js) [TypeScript](./src/2496.maximum-value-of-a-string-in-an-array.2589/solution.ts) | Easy |
| 2497 | Maximum Star Sum of a Graph | [JavaScript](./src/2497.maximum-star-sum-of-a-graph.2590/solution.js) [TypeScript](./src/2497.maximum-star-sum-of-a-graph.2590/solution.ts) | Medium |
| 2498 | Frog Jump II | [JavaScript](./src/2498.frog-jump-ii.2591/solution.js) [TypeScript](./src/2498.frog-jump-ii.2591/solution.ts) | Medium |
| 2499 | Minimum Total Cost to Make Arrays Unequal | | Hard |
| 2500 | Delete Greatest Value in Each Row | [Java](./src/2500.delete-greatest-value-in-each-row.2585/solution.java) [JavaScript](./src/2500.delete-greatest-value-in-each-row.2585/solution.js) [TypeScript](./src/2500.delete-greatest-value-in-each-row.2585/solution.ts) | Easy |
| 2501 | Longest Square Streak in an Array | [JavaScript](./src/2501.longest-square-streak-in-an-array.2586/solution.js) [TypeScript](./src/2501.longest-square-streak-in-an-array.2586/solution.ts) | Medium |
| 2502 | Design Memory Allocator | [JavaScript](./src/2502.design-memory-allocator.2587/solution.js) [TypeScript](./src/2502.design-memory-allocator.2587/solution.ts) | Medium |
| 2503 | Maximum Number of Points From Grid Queries | | Hard |
| 2504 | Concatenate the Name and the Profession | | Easy |
| 2505 | Bitwise OR of All Subsequence Sums | | Medium |
| 2506 | Count Pairs Of Similar Strings | [JavaScript](./src/2506.count-pairs-of-similar-strings.2594/solution.js) [TypeScript](./src/2506.count-pairs-of-similar-strings.2594/solution.ts) | Easy |
| 2507 | Smallest Value After Replacing With Sum of Prime Factors | [JavaScript](./src/2507.smallest-value-after-replacing-with-sum-of-prime-factors.2595/solution.js) [TypeScript](./src/2507.smallest-value-after-replacing-with-sum-of-prime-factors.2595/solution.ts) | Medium |
| 2508 | Add Edges to Make Degrees of All Nodes Even | | Hard |
| 2509 | Cycle Length Queries in a Tree | | Hard |
| 2510 | Check if There is a Path With Equal Number of 0's And 1's | | Medium |
| 2511 | Maximum Enemy Forts That Can Be Captured | [TypeScript](./src/2511.maximum-enemy-forts-that-can-be-captured.2602/solution.ts) | Easy |
| 2512 | Reward Top K Students | [TypeScript](./src/2512.reward-top-k-students.2603/solution.ts) | Medium |
| 2513 | Minimize the Maximum of Two Arrays | | Medium |
| 2514 | Count Anagrams | | Hard |
| 2515 | Shortest Distance to Target String in a Circular Array | [Java](./src/2515.shortest-distance-to-target-string-in-a-circular-array.2598/solution.java) [TypeScript](./src/2515.shortest-distance-to-target-string-in-a-circular-array.2598/solution.ts) | Easy |
| 2516 | Take K of Each Character From Left and Right | [TypeScript](./src/2516.take-k-of-each-character-from-left-and-right.2599/solution.ts) | Medium |
| 2517 | Maximum Tastiness of Candy Basket | [TypeScript](./src/2517.maximum-tastiness-of-candy-basket.2600/solution.ts) | Medium |
| 2518 | Number of Great Partitions | | Hard |
| 2519 | Count the Number of K-Big Indices | | Hard |
| 2520 | Count the Digits That Divide a Number | [Java](./src/2520.count-the-digits-that-divide-a-number.2608/solution.java) [JavaScript](./src/2520.count-the-digits-that-divide-a-number.2608/solution.js) [TypeScript](./src/2520.count-the-digits-that-divide-a-number.2608/solution.ts) | Easy |
| 2521 | Distinct Prime Factors of Product of Array | [TypeScript](./src/2521.distinct-prime-factors-of-product-of-array.2609/solution.ts) | Medium |
| 2522 | Partition String Into Substrings With Values at Most K | [TypeScript](./src/2522.partition-string-into-substrings-with-values-at-most-k.2511/solution.ts) | Medium |
| 2523 | Closest Prime Numbers in Range | [TypeScript](./src/2523.closest-prime-numbers-in-range.2610/solution.ts) | Medium |
| 2524 | Maximum Frequency Score of a Subarray | | Hard |
| 2525 | Categorize Box According to Criteria | [JavaScript](./src/2525.categorize-box-according-to-criteria.2619/solution.js) [TypeScript](./src/2525.categorize-box-according-to-criteria.2619/solution.ts) | Easy |
| 2526 | Find Consecutive Integers from a Data Stream | [JavaScript](./src/2526.find-consecutive-integers-from-a-data-stream.2620/solution.js) [TypeScript](./src/2526.find-consecutive-integers-from-a-data-stream.2620/solution.ts) | Medium |
| 2527 | Find Xor-Beauty of Array | [TypeScript](./src/2527.find-xor-beauty-of-array.2621/solution.ts) | Medium |
| 2528 | Maximize the Minimum Powered City | | Hard |
| 2529 | Maximum Count of Positive Integer and Negative Integer | [Java](./src/2529.maximum-count-of-positive-integer-and-negative-integer.2614/solution.java) [JavaScript](./src/2529.maximum-count-of-positive-integer-and-negative-integer.2614/solution.js) [TypeScript](./src/2529.maximum-count-of-positive-integer-and-negative-integer.2614/solution.ts) | Easy |
| 2530 | Maximal Score After Applying K Operations | [TypeScript](./src/2530.maximal-score-after-applying-k-operations.2616/solution.ts) | Medium |
| 2531 | Make Number of Distinct Characters Equal | | Medium |
| 2532 | Time to Cross a Bridge | | Hard |
| 2533 | Number of Good Binary Strings | | Medium |
| 2534 | Time Taken to Cross the Door | | Hard |
| 2535 | Difference Between Element Sum and Digit Sum of an Array | [Java](./src/2535.difference-between-element-sum-and-digit-sum-of-an-array.2624/solution.java) [JavaScript](./src/2535.difference-between-element-sum-and-digit-sum-of-an-array.2624/solution.js) [TypeScript](./src/2535.difference-between-element-sum-and-digit-sum-of-an-array.2624/solution.ts) | Easy |
| 2536 | Increment Submatrices by One | [TypeScript](./src/2536.increment-submatrices-by-one.2625/solution.ts) | Medium |
| 2537 | Count the Number of Good Subarrays | [TypeScript](./src/2537.count-the-number-of-good-subarrays.2626/solution.ts) | Medium |
| 2538 | Difference Between Maximum and Minimum Price Sum | | Hard |
| 2539 | Count the Number of Good Subsequences | | Medium |
| 2540 | Minimum Common Value | [Java](./src/2540.minimum-common-value.2634/solution.java) [JavaScript](./src/2540.minimum-common-value.2634/solution.js) [TypeScript](./src/2540.minimum-common-value.2634/solution.ts) | Easy |
| 2541 | Minimum Operations to Make Array Equal II | [TypeScript](./src/2541.minimum-operations-to-make-array-equal-ii.2604/solution.ts) | Medium |
| 2542 | Maximum Subsequence Score | | Medium |
| 2543 | Check if Point Is Reachable | | Hard |
| 2544 | Alternating Digit Sum | [Java](./src/2544.alternating-digit-sum.2630/solution.java) [JavaScript](./src/2544.alternating-digit-sum.2630/solution.js) [TypeScript](./src/2544.alternating-digit-sum.2630/solution.ts) | Easy |
| 2545 | Sort the Students by Their Kth Score | [JavaScript](./src/2545.sort-the-students-by-their-kth-score.2631/solution.js) [TypeScript](./src/2545.sort-the-students-by-their-kth-score.2631/solution.ts) | Medium |
| 2546 | Apply Bitwise Operations to Make Strings Equal | [JavaScript](./src/2546.apply-bitwise-operations-to-make-strings-equal.2632/solution.js) [TypeScript](./src/2546.apply-bitwise-operations-to-make-strings-equal.2632/solution.ts) | Medium |
| 2547 | Minimum Cost to Split an Array | | Hard |
| 2548 | Maximum Price to Fill a Bag | | Medium |
| 2549 | Count Distinct Numbers on Board | [JavaScript](./src/2549.count-distinct-numbers-on-board.2679/solution.js) [TypeScript](./src/2549.count-distinct-numbers-on-board.2679/solution.ts) | Easy |
| 2550 | Count Collisions of Monkeys on a Polygon | | Medium |
| 2551 | Put Marbles in Bags | | Hard |
| 2552 | Count Increasing Quadruplets | | Hard |
| 2553 | Separate the Digits in an Array | [Java](./src/2553.separate-the-digits-in-an-array.2639/solution.java) [TypeScript](./src/2553.separate-the-digits-in-an-array.2639/solution.ts) | Easy |
| 2554 | Maximum Number of Integers to Choose From a Range I | [JavaScript](./src/2554.maximum-number-of-integers-to-choose-from-a-range-i.2640/solution.js) [TypeScript](./src/2554.maximum-number-of-integers-to-choose-from-a-range-i.2640/solution.ts) | Medium |
| 2555 | Maximize Win From Two Segments | | Medium |
| 2556 | Disconnect Path in a Binary Matrix by at Most One Flip | | Medium |
| 2557 | Maximum Number of Integers to Choose From a Range II | | Medium |
| 2558 | Take Gifts From the Richest Pile | [TypeScript](./src/2558.take-gifts-from-the-richest-pile.2692/solution.ts) | Easy |
| 2559 | Count Vowel Strings in Ranges | [TypeScript](./src/2559.count-vowel-strings-in-ranges.2691/solution.ts) | Medium |
| 2560 | House Robber IV | [TypeScript](./src/2560.house-robber-iv.2690/solution.ts) | Medium |
| 2561 | Rearranging Fruits | | Hard |
| 2562 | Find the Array Concatenation Value | [Java](./src/2562.find-the-array-concatenation-value.2698/solution.java) [TypeScript](./src/2562.find-the-array-concatenation-value.2698/solution.ts) | Easy |
| 2563 | Count the Number of Fair Pairs | [TypeScript](./src/2563.count-the-number-of-fair-pairs.2699/solution.ts) | Medium |
| 2564 | Substring XOR Queries | [TypeScript](./src/2564.substring-xor-queries.2700/solution.ts) | Medium |
| 2565 | Subsequence With the Minimum Score | | Hard |
| 2566 | Maximum Difference by Remapping a Digit | [Java](./src/2566.maximum-difference-by-remapping-a-digit.2704/solution.java) [TypeScript](./src/2566.maximum-difference-by-remapping-a-digit.2704/solution.ts) | Easy |
| 2567 | Minimum Score by Changing Two Elements | [TypeScript](./src/2567.minimum-score-by-changing-two-elements.2706/solution.ts) | Medium |
| 2568 | Minimum Impossible OR | [TypeScript](./src/2568.minimum-impossible-or.2705/solution.ts) | Medium |
| 2569 | Handling Sum Queries After Update | [TypeScript](./src/2569.handling-sum-queries-after-update.2703/solution.ts) | Hard |
| 2570 | Merge Two 2D Arrays by Summing Values | [Java](./src/2570.merge-two-2d-arrays-by-summing-values.2707/solution.java) [TypeScript](./src/2570.merge-two-2d-arrays-by-summing-values.2707/solution.ts) | Easy |
| 2571 | Minimum Operations to Reduce an Integer to 0 | [TypeScript](./src/2571.minimum-operations-to-reduce-an-integer-to-0.2710/solution.ts) | Medium |
| 2572 | Count the Number of Square-Free Subsets | [TypeScript](./src/2572.count-the-number-of-square-free-subsets.2709/solution.ts) | Medium |
| 2573 | Find the String with LCP | [TypeScript](./src/2573.find-the-string-with-lcp.2708/solution.ts) | Hard |
| 2574 | Left and Right Sum Differences | [Java](./src/2574.left-and-right-sum-differences.2714/solution.java) [TypeScript](./src/2574.left-and-right-sum-differences.2714/solution.ts) | Easy |
| 2575 | Find the Divisibility Array of a String | [TypeScript](./src/2575.find-the-divisibility-array-of-a-string.2713/solution.ts) | Medium |
| 2576 | Find the Maximum Number of Marked Indices | [TypeScript](./src/2576.find-the-maximum-number-of-marked-indices.2712/solution.ts) | Medium |
| 2577 | Minimum Time to Visit a Cell In a Grid | | Hard |
| 2578 | Split With Minimum Sum | [TypeScript](./src/2578.split-with-minimum-sum.2650/solution.ts) | Easy |
| 2579 | Count Total Number of Colored Cells | [TypeScript](./src/2579.count-total-number-of-colored-cells.2649/solution.ts) | Medium |
| 2580 | Count Ways to Group Overlapping Ranges | [TypeScript](./src/2580.count-ways-to-group-overlapping-ranges.2651/solution.ts) | Medium |
| 2581 | Count Number of Possible Root Nodes | | Hard |
| 2582 | Pass the Pillow | [TypeScript](./src/2582.pass-the-pillow.2645/solution.ts) | Easy |
| 2583 | Kth Largest Sum in a Binary Tree | [TypeScript](./src/2583.kth-largest-sum-in-a-binary-tree.2646/solution.ts) | Medium |
| 2584 | Split the Array to Make Coprime Products | [TypeScript](./src/2584.split-the-array-to-make-coprime-products.2647/solution.ts) | Hard |
| 2585 | Number of Ways to Earn Points | [TypeScript](./src/2585.number-of-ways-to-earn-points.2648/solution.ts) | Hard |
| 2586 | Count the Number of Vowel Strings in Range | [Java](./src/2586.count-the-number-of-vowel-strings-in-range.2654/solution.java) [TypeScript](./src/2586.count-the-number-of-vowel-strings-in-range.2654/solution.ts) | Easy |
| 2587 | Rearrange Array to Maximize Prefix Score | [TypeScript](./src/2587.rearrange-array-to-maximize-prefix-score.2655/solution.ts) | Medium |
| 2588 | Count the Number of Beautiful Subarrays | [TypeScript](./src/2588.count-the-number-of-beautiful-subarrays.2656/solution.ts) | Medium |
| 2589 | Minimum Time to Complete All Tasks | | Hard |
| 2590 | Design a Todo List | | Medium |
| 2591 | Distribute Money to Maximum Children | [TypeScript](./src/2591.distribute-money-to-maximum-children.2663/solution.ts) | Easy |
| 2592 | Maximize Greatness of an Array | [TypeScript](./src/2592.maximize-greatness-of-an-array.2664/solution.ts) | Medium |
| 2593 | Find Score of an Array After Marking All Elements | [TypeScript](./src/2593.find-score-of-an-array-after-marking-all-elements.2695/solution.ts) | Medium |
| 2594 | Minimum Time to Repair Cars | [TypeScript](./src/2594.minimum-time-to-repair-cars.2665/solution.ts) | Medium |
| 2595 | Number of Even and Odd Bits | [Java](./src/2595.number-of-even-and-odd-bits.2659/solution.java) [TypeScript](./src/2595.number-of-even-and-odd-bits.2659/solution.ts) | Easy |
| 2596 | Check Knight Tour Configuration | [TypeScript](./src/2596.check-knight-tour-configuration.2662/solution.ts) | Medium |
| 2597 | The Number of Beautiful Subsets | [TypeScript](./src/2597.the-number-of-beautiful-subsets.2696/solution.ts) | Medium |
| 2598 | Smallest Missing Non-negative Integer After Operations | [TypeScript](./src/2598.smallest-missing-non-negative-integer-after-operations.2661/solution.ts) | Medium |
| 2599 | Make the Prefix Sum Non-negative | | Medium |
| 2600 | K Items With the Maximum Sum | [Java](./src/2600.k-items-with-the-maximum-sum.2715/solution.java) [TypeScript](./src/2600.k-items-with-the-maximum-sum.2715/solution.ts) | Easy |
| 2601 | Prime Subtraction Operation | [TypeScript](./src/2601.prime-subtraction-operation.2716/solution.ts) | Medium |
| 2602 | Minimum Operations to Make All Array Elements Equal | [TypeScript](./src/2602.minimum-operations-to-make-all-array-elements-equal.2718/solution.ts) | Medium |
| 2603 | Collect Coins in a Tree | | Hard |
| 2604 | Minimum Time to Eat All Grains | | Hard |
| 2605 | Form Smallest Number From Two Digit Arrays | [Java](./src/2605.form-smallest-number-from-two-digit-arrays.2668/solution.java) [TypeScript](./src/2605.form-smallest-number-from-two-digit-arrays.2668/solution.ts) | Easy |
| 2606 | Find the Substring With Maximum Cost | [TypeScript](./src/2606.find-the-substring-with-maximum-cost.2669/solution.ts) | Medium |
| 2607 | Make K-Subarray Sums Equal | [TypeScript](./src/2607.make-k-subarray-sums-equal.2670/solution.ts) | Medium |
| 2608 | Shortest Cycle in a Graph | | Hard |
| 2609 | Find the Longest Balanced Substring of a Binary String | [TypeScript](./src/2609.find-the-longest-balanced-substring-of-a-binary-string.2723/solution.ts) | Easy |
| 2610 | Convert an Array Into a 2D Array With Conditions | [TypeScript](./src/2610.convert-an-array-into-a-2d-array-with-conditions.2724/solution.ts) | Medium |
| 2611 | Mice and Cheese | [TypeScript](./src/2611.mice-and-cheese.2725/solution.ts) | Medium |
| 2612 | Minimum Reverse Operations | | Hard |
| 2613 | Beautiful Pairs | | Hard |
| 2614 | Prime In Diagonal | [TypeScript](./src/2614.prime-in-diagonal.2722/solution.ts) | Easy |
| 2615 | Sum of Distances | [TypeScript](./src/2615.sum-of-distances.2721/solution.ts) | Medium |
| 2616 | Minimize the Maximum Difference of Pairs | [TypeScript](./src/2616.minimize-the-maximum-difference-of-pairs.2720/solution.ts) | Medium |
| 2617 | Minimum Number of Visited Cells in a Grid | | Hard |
| 2618 | Check if Object Instance of Class | [TypeScript](./src/2618.check-if-object-instance-of-class.2758/solution.ts) | Medium |
| 2619 | Array Prototype Last | [TypeScript](./src/2619.array-prototype-last.2734/solution.ts) | Easy |
| 2620 | Counter | [TypeScript](./src/2620.counter.2732/solution.ts) | Easy |
| 2621 | Sleep | [TypeScript](./src/2621.sleep.2733/solution.ts) | Easy |
| 2622 | Cache With Time Limit | [TypeScript](./src/2622.cache-with-time-limit.2762/solution.ts) | Medium |
| 2623 | Memoize | [TypeScript](./src/2623.memoize.2731/solution.ts) | Medium |
| 2624 | Snail Traversal | [TypeScript](./src/2624.snail-traversal.2760/solution.ts) | Medium |
| 2625 | Flatten Deeply Nested Array | [TypeScript](./src/2625.flatten-deeply-nested-array.2759/solution.ts) | Medium |
| 2626 | Array Reduce Transformation | [TypeScript](./src/2626.array-reduce-transformation.2761/solution.ts) | Easy |
| 2627 | Debounce | [TypeScript](./src/2627.debounce.2743/solution.ts) | Medium |
| 2628 | JSON Deep Equal | [TypeScript](./src/2628.json-deep-equal.2735/solution.ts) | Medium |
| 2629 | Function Composition | [TypeScript](./src/2629.function-composition.2741/solution.ts) | Easy |
| 2630 | Memoize II | [TypeScript](./src/2630.memoize-ii.2744/solution.ts) | Hard |
| 2631 | Group By | [TypeScript](./src/2631.group-by.2742/solution.ts) | Medium |
| 2632 | Curry | [TypeScript](./src/2632.curry.2740/solution.ts) | Medium |
| 2633 | Convert Object to JSON String | [TypeScript](./src/2633.convert-object-to-json-string.2745/solution.ts) | Medium |
| 2634 | Filter Elements from Array | [TypeScript](./src/2634.filter-elements-from-array.2746/solution.ts) | Easy |
| 2635 | Apply Transform Over Each Element in Array | [TypeScript](./src/2635.apply-transform-over-each-element-in-array.2747/solution.ts) | Easy |
| 2636 | Promise Pool | [TypeScript](./src/2636.promise-pool.2750/solution.ts) | Medium |
| 2637 | Promise Time Limit | [TypeScript](./src/2637.promise-time-limit.2749/solution.ts) | Medium |
| 2638 | Count the Number of K-Free Subsets | | Medium |
| 2639 | Find the Width of Columns of a Grid | [Java](./src/2639.find-the-width-of-columns-of-a-grid.2675/solution.java) [TypeScript](./src/2639.find-the-width-of-columns-of-a-grid.2675/solution.ts) | Easy |
| 2640 | Find the Score of All Prefixes of an Array | [TypeScript](./src/2640.find-the-score-of-all-prefixes-of-an-array.2676/solution.ts) | Medium |
| 2641 | Cousins in Binary Tree II | [TypeScript](./src/2641.cousins-in-binary-tree-ii.2677/solution.ts) | Medium |
| 2642 | Design Graph With Shortest Path Calculator | [TypeScript](./src/2642.design-graph-with-shortest-path-calculator.2678/solution.ts) | Hard |
| 2643 | Row With Maximum Ones | [Java](./src/2643.row-with-maximum-ones.2737/solution.java) [TypeScript](./src/2643.row-with-maximum-ones.2737/solution.ts) | Easy |
| 2644 | Find the Maximum Divisibility Score | [TypeScript](./src/2644.find-the-maximum-divisibility-score.2694/solution.ts) | Easy |
| 2645 | Minimum Additions to Make Valid String | [TypeScript](./src/2645.minimum-additions-to-make-valid-string.2736/solution.ts) | Medium |
| 2646 | Minimize the Total Price of the Trips | | Hard |
| 2647 | Color the Triangle Red | | Hard |
| 2648 | Generate Fibonacci Sequence | [TypeScript](./src/2648.generate-fibonacci-sequence.2775/solution.ts) | Easy |
| 2649 | Nested Array Generator | [TypeScript](./src/2649.nested-array-generator.2783/solution.ts) | Medium |
| 2650 | Design Cancellable Function | | Hard |
| 2651 | Calculate Delayed Arrival Time | [Java](./src/2651.calculate-delayed-arrival-time.2748/solution.java) [TypeScript](./src/2651.calculate-delayed-arrival-time.2748/solution.ts) | Easy |
| 2652 | Sum Multiples | [Java](./src/2652.sum-multiples.2752/solution.java) [TypeScript](./src/2652.sum-multiples.2752/solution.ts) | Easy |
| 2653 | Sliding Subarray Beauty | [TypeScript](./src/2653.sliding-subarray-beauty.2751/solution.ts) | Medium |
| 2654 | Minimum Number of Operations to Make All Array Elements Equal to 1 | [TypeScript](./src/2654.minimum-number-of-operations-to-make-all-array-elements-equal-to-1.2753/solution.ts) | Medium |
| 2655 | Find Maximal Uncovered Ranges | | Medium |
| 2656 | Maximum Sum With Exactly K Elements | [Java](./src/2656.maximum-sum-with-exactly-k-elements.2767/solution.java) [TypeScript](./src/2656.maximum-sum-with-exactly-k-elements.2767/solution.ts) | Easy |
| 2657 | Find the Prefix Common Array of Two Arrays | [TypeScript](./src/2657.find-the-prefix-common-array-of-two-arrays.2766/solution.ts) | Medium |
| 2658 | Maximum Number of Fish in a Grid | [TypeScript](./src/2658.maximum-number-of-fish-in-a-grid.2764/solution.ts) | Medium |
| 2659 | Make Array Empty | [TypeScript](./src/2659.make-array-empty.2765/solution.ts) | Hard |
| 2660 | Determine the Winner of a Bowling Game | [Java](./src/2660.determine-the-winner-of-a-bowling-game.2684/solution.java) [TypeScript](./src/2660.determine-the-winner-of-a-bowling-game.2684/solution.ts) | Easy |
| 2661 | First Completely Painted Row or Column | [TypeScript](./src/2661.first-completely-painted-row-or-column.2685/solution.ts) | Medium |
| 2662 | Minimum Cost of a Path With Special Roads | [TypeScript](./src/2662.minimum-cost-of-a-path-with-special-roads.2686/solution.ts) | Medium |
| 2663 | Lexicographically Smallest Beautiful String | | Hard |
| 2664 | The Knight’s Tour | | Medium |
| 2665 | Counter II | [TypeScript](./src/2665.counter-ii.2789/solution.ts) | Easy |
| 2666 | Allow One Function Call | [TypeScript](./src/2666.allow-one-function-call.2796/solution.ts) | Easy |
| 2667 | Create Hello World Function | [TypeScript](./src/2667.create-hello-world-function.2809/solution.ts) | Easy |
| 2668 | Find Latest Salaries | | Easy |
| 2669 | Count Artist Occurrences On Spotify Ranking List | | Easy |
| 2670 | Find the Distinct Difference Array | [Java](./src/2670.find-the-distinct-difference-array.2777/solution.java) [TypeScript](./src/2670.find-the-distinct-difference-array.2777/solution.ts) | Easy |
| 2671 | Frequency Tracker | [TypeScript](./src/2671.frequency-tracker.2778/solution.ts) | Medium |
| 2672 | Number of Adjacent Elements With the Same Color | [TypeScript](./src/2672.number-of-adjacent-elements-with-the-same-color.2779/solution.ts) | Medium |
| 2673 | Make Costs of Paths Equal in a Binary Tree | [TypeScript](./src/2673.make-costs-of-paths-equal-in-a-binary-tree.2780/solution.ts) | Medium |
| 2674 | Split a Circular Linked List | | Medium |
| 2675 | Array of Objects to Matrix | [TypeScript](./src/2675.array-of-objects-to-matrix.2769/solution.ts) | Hard |
| 2676 | Throttle | [TypeScript](./src/2676.throttle.2771/solution.ts) | Medium |
| 2677 | Chunk Array | [TypeScript](./src/2677.chunk-array.2798/solution.ts) | Easy |
| 2678 | Number of Senior Citizens | [Java](./src/2678.number-of-senior-citizens.2727/solution.java) [TypeScript](./src/2678.number-of-senior-citizens.2727/solution.ts) | Easy |
| 2679 | Sum in a Matrix | [TypeScript](./src/2679.sum-in-a-matrix.2728/solution.ts) | Medium |
| 2680 | Maximum OR | | Medium |
| 2681 | Power of Heroes | | Hard |
| 2682 | Find the Losers of the Circular Game | [TypeScript](./src/2682.find-the-losers-of-the-circular-game.2791/solution.ts) | Easy |
| 2683 | Neighboring Bitwise XOR | [TypeScript](./src/2683.neighboring-bitwise-xor.2792/solution.ts) | Medium |
| 2684 | Maximum Number of Moves in a Grid | [TypeScript](./src/2684.maximum-number-of-moves-in-a-grid.2794/solution.ts) | Medium |
| 2685 | Count the Number of Complete Components | [TypeScript](./src/2685.count-the-number-of-complete-components.2793/solution.ts) | Medium |
| 2686 | Immediate Food Delivery III | | Medium |
| 2687 | Bikes Last Time Used | | Easy |
| 2688 | Find Active Users | | Medium |
| 2689 | Extract Kth Character From The Rope Tree | | Easy |
| 2690 | Infinite Method Object | | Easy |
| 2691 | Immutability Helper | | Hard |
| 2692 | Make Object Immutable | | Medium |
| 2693 | Call Function with Custom Context | [TypeScript](./src/2693.call-function-with-custom-context.2790/solution.ts) | Medium |
| 2694 | Event Emitter | [TypeScript](./src/2694.event-emitter.2797/solution.ts) | Medium |
| 2695 | Array Wrapper | [TypeScript](./src/2695.array-wrapper.2805/solution.ts) | Easy |
| 2696 | Minimum String Length After Removing Substrings | [TypeScript](./src/2696.minimum-string-length-after-removing-substrings.2800/solution.ts) | Easy |
| 2697 | Lexicographically Smallest Palindrome | [TypeScript](./src/2697.lexicographically-smallest-palindrome.2816/solution.ts) | Easy |
| 2698 | Find the Punishment Number of an Integer | [TypeScript](./src/2698.find-the-punishment-number-of-an-integer.2802/solution.ts) | Medium |
| 2699 | Modify Graph Edge Weights | | Hard |
| 2700 | Differences Between Two Objects | [TypeScript](./src/2700.differences-between-two-objects.2774/solution.ts) | Medium |
| 2701 | Consecutive Transactions with Increasing Amounts | | Hard |
| 2702 | Minimum Operations to Make Numbers Non-positive | | Hard |
| 2703 | Return Length of Arguments Passed | [TypeScript](./src/2703.return-length-of-arguments-passed.2820/solution.ts) | Easy |
| 2704 | To Be Or Not To Be | [TypeScript](./src/2704.to-be-or-not-to-be.2813/solution.ts) | Easy |
| 2705 | Compact Object | [TypeScript](./src/2705.compact-object.2804/solution.ts) | Medium |
| 2706 | Buy Two Chocolates | [Java](./src/2706.buy-two-chocolates.2756/solution.java) [TypeScript](./src/2706.buy-two-chocolates.2756/solution.ts) | Easy |
| 2707 | Extra Characters in a String | [TypeScript](./src/2707.extra-characters-in-a-string.2755/solution.ts) | Medium |
| 2708 | Maximum Strength of a Group | [TypeScript](./src/2708.maximum-strength-of-a-group.2754/solution.ts) | Medium |
| 2709 | Greatest Common Divisor Traversal | [TypeScript](./src/2709.greatest-common-divisor-traversal.2827/solution.ts) | Hard |
| 2710 | Remove Trailing Zeros From a String | [Java](./src/2710.remove-trailing-zeros-from-a-string.2819/solution.java) [TypeScript](./src/2710.remove-trailing-zeros-from-a-string.2819/solution.ts) | Easy |
| 2711 | Difference of Number of Distinct Values on Diagonals | [TypeScript](./src/2711.difference-of-number-of-distinct-values-on-diagonals.2801/solution.ts) | Medium |
| 2712 | Minimum Cost to Make All Characters Equal | | Medium |
| 2713 | Maximum Strictly Increasing Cells in a Matrix | | Hard |
| 2714 | Find Shortest Path with K Hops | | Hard |
| 2715 | Timeout Cancellation | [TypeScript](./src/2715.timeout-cancellation.2821/solution.ts) | Easy |
| 2716 | Minimize String Length | [TypeScript](./src/2716.minimize-string-length.2825/solution.ts) | Easy |
| 2717 | Semi-Ordered Permutation | [TypeScript](./src/2717.semi-ordered-permutation.2785/solution.ts) | Easy |
| 2718 | Sum of Matrix After Queries | [TypeScript](./src/2718.sum-of-matrix-after-queries.2838/solution.ts) | Medium |
| 2719 | Count of Integers | | Hard |
| 2720 | Popularity Percentage | | Hard |
| 2721 | Execute Asynchronous Functions in Parallel | [TypeScript](./src/2721.execute-asynchronous-functions-in-parallel.2807/solution.ts) | Medium |
| 2722 | Join Two Arrays by ID | [TypeScript](./src/2722.join-two-arrays-by-id.2858/solution.ts) | Medium |
| 2723 | Add Two Promises | [TypeScript](./src/2723.add-two-promises.2859/solution.ts) | Easy |
| 2724 | Sort By | [TypeScript](./src/2724.sort-by.2860/solution.ts) | Easy |
| 2725 | Interval Cancellation | [TypeScript](./src/2725.interval-cancellation.2862/solution.ts) | Easy |
| 2726 | Calculator with Method Chaining | [TypeScript](./src/2726.calculator-with-method-chaining.2863/solution.ts) | Easy |
| 2727 | Is Object Empty | [TypeScript](./src/2727.is-object-empty.2864/solution.ts) | Easy |
| 2728 | Count Houses in a Circular Street | | Easy |
| 2729 | Check if The Number is Fascinating | [Java](./src/2729.check-if-the-number-is-fascinating.2824/solution.java) [TypeScript](./src/2729.check-if-the-number-is-fascinating.2824/solution.ts) | Easy |
| 2730 | Find the Longest Semi-Repetitive Substring | [TypeScript](./src/2730.find-the-longest-semi-repetitive-substring.2786/solution.ts) | Medium |
| 2731 | Movement of Robots | [TypeScript](./src/2731.movement-of-robots.2787/solution.ts) | Medium |
| 2732 | Find a Good Subset of the Matrix | | Hard |
| 2733 | Neither Minimum nor Maximum | [Java](./src/2733.neither-minimum-nor-maximum.2836/solution.java) [TypeScript](./src/2733.neither-minimum-nor-maximum.2836/solution.ts) | Easy |
| 2734 | Lexicographically Smallest String After Substring Operation | [TypeScript](./src/2734.lexicographically-smallest-string-after-substring-operation.2828/solution.ts) | Medium |
| 2735 | Collecting Chocolates | | Medium |
| 2736 | Maximum Sum Queries | | Hard |
| 2737 | Find the Closest Marked Node | | Medium |
| 2738 | Count Occurrences in Text | | Medium |
| 2739 | Total Distance Traveled | [TypeScript](./src/2739.total-distance-traveled.2857/solution.ts) | Easy |
| 2740 | Find the Value of the Partition | [TypeScript](./src/2740.find-the-value-of-the-partition.2845/solution.ts) | Medium |
| 2741 | Special Permutations | | Medium |
| 2742 | Painting the Walls | | Hard |
| 2743 | Count Substrings Without Repeating Character | | Medium |
| 2744 | Find Maximum Number of String Pairs | [Java](./src/2744.find-maximum-number-of-string-pairs.2847/solution.java) [TypeScript](./src/2744.find-maximum-number-of-string-pairs.2847/solution.ts) | Easy |
| 2745 | Construct the Longest New String | [TypeScript](./src/2745.construct-the-longest-new-string.2850/solution.ts) | Medium |
| 2746 | Decremental String Concatenation | | Medium |
| 2747 | Count Zero Request Servers | [TypeScript](./src/2747.count-zero-request-servers.2833/solution.ts) | Medium |
| 2748 | Number of Beautiful Pairs | [TypeScript](./src/2748.number-of-beautiful-pairs.2831/solution.ts) | Easy |
| 2749 | Minimum Operations to Make the Integer Zero | [TypeScript](./src/2749.minimum-operations-to-make-the-integer-zero.2837/solution.ts) | Medium |
| 2750 | Ways to Split Array Into Good Subarrays | [TypeScript](./src/2750.ways-to-split-array-into-good-subarrays.2867/solution.ts) | Medium |
| 2751 | Robot Collisions | | Hard |
| 2752 | Customers with Maximum Number of Transactions on Consecutive Days | | Hard |
| 2753 | Count Houses in a Circular Street II | | Hard |
| 2754 | Bind Function to Context | | Medium |
| 2755 | Deep Merge of Two Objects | | Medium |
| 2756 | Query Batching | | Hard |
| 2757 | Generate Circular Array Values | | Medium |
| 2758 | Next Day | | Easy |
| 2759 | Convert JSON String to Object | | Hard |
| 2760 | Longest Even Odd Subarray With Threshold | [TypeScript](./src/2760.longest-even-odd-subarray-with-threshold.2866/solution.ts) | Easy |
| 2761 | Prime Pairs With Target Sum | [TypeScript](./src/2761.prime-pairs-with-target-sum.2873/solution.ts) | Medium |
| 2762 | Continuous Subarrays | | Medium |
| 2763 | Sum of Imbalance Numbers of All Subarrays | | Hard |
| 2764 | Is Array a Preorder of Some Binary Tree | | Medium |
| 2765 | Longest Alternating Subarray | [TypeScript](./src/2765.longest-alternating-subarray.2870/solution.ts) | Easy |
| 2766 | Relocate Marbles | [TypeScript](./src/2766.relocate-marbles.2834/solution.ts) | Medium |
| 2767 | Partition String Into Minimum Beautiful Substrings | [TypeScript](./src/2767.partition-string-into-minimum-beautiful-substrings.2883/solution.ts) | Medium |
| 2768 | Number of Black Blocks | | Medium |
| 2769 | Find the Maximum Achievable Number | [Java](./src/2769.find-the-maximum-achievable-number.2812/solution.java) [TypeScript](./src/2769.find-the-maximum-achievable-number.2812/solution.ts) | Easy |
| 2770 | Maximum Number of Jumps to Reach the Last Index | [TypeScript](./src/2770.maximum-number-of-jumps-to-reach-the-last-index.2855/solution.ts) | Medium |
| 2771 | Longest Non-decreasing Subarray From Two Arrays | | Medium |
| 2772 | Apply Operations to Make All Array Elements Equal to Zero | [TypeScript](./src/2772.apply-operations-to-make-all-array-elements-equal-to-zero.2878/solution.ts) | Medium |
| 2773 | Height of Special Binary Tree | | Medium |
| 2774 | Array Upper Bound | | Easy |
| 2775 | Undefined to Null | | Medium |
| 2776 | Convert Callback Based Function to Promise Based Function | | Medium |
| 2777 | Date Range Generator | | Medium |
| 2778 | Sum of Squares of Special Elements | [Java](./src/2778.sum-of-squares-of-special-elements.2844/solution.java) [TypeScript](./src/2778.sum-of-squares-of-special-elements.2844/solution.ts) | Easy |
| 2779 | Maximum Beauty of an Array After Applying Operation | | Medium |
| 2780 | Minimum Index of a Valid Split | [TypeScript](./src/2780.minimum-index-of-a-valid-split.2888/solution.ts) | Medium |
| 2781 | Length of the Longest Valid Substring | | Hard |
| 2782 | Number of Unique Categories | | Medium |
| 2783 | Flight Occupancy and Waitlist Analysis | | Medium |
| 2784 | Check if Array is Good | [Java](./src/2784.check-if-array-is-good.2892/solution.java) [TypeScript](./src/2784.check-if-array-is-good.2892/solution.ts) | Easy |
| 2785 | Sort Vowels in a String | [TypeScript](./src/2785.sort-vowels-in-a-string.2887/solution.ts) | Medium |
| 2786 | Visit Array Positions to Maximize Score | [TypeScript](./src/2786.visit-array-positions-to-maximize-score.2893/solution.ts) | Medium |
| 2787 | Ways to Express an Integer as Sum of Powers | [TypeScript](./src/2787.ways-to-express-an-integer-as-sum-of-powers.2882/solution.ts) | Medium |
| 2788 | Split Strings by Separator | [Java](./src/2788.split-strings-by-separator.2881/solution.java) [TypeScript](./src/2788.split-strings-by-separator.2881/solution.ts) | Easy |
| 2789 | Largest Element in an Array after Merge Operations | [TypeScript](./src/2789.largest-element-in-an-array-after-merge-operations.2872/solution.ts) | Medium |
| 2790 | Maximum Number of Groups With Increasing Length | | Hard |
| 2791 | Count Paths That Can Form a Palindrome in a Tree | | Hard |
| 2792 | Count Nodes That Are Great Enough | | Hard |
| 2793 | Status of Flight Tickets | | Hard |
| 2794 | Create Object from Two Arrays | | Easy |
| 2795 | Parallel Execution of Promises for Individual Results Retrieval | | Medium |
| 2796 | Repeat String | | Easy |
| 2797 | Partial Function with Placeholders | | Easy |
| 2798 | Number of Employees Who Met the Target | [Java](./src/2798.number-of-employees-who-met-the-target.2876/solution.java) [TypeScript](./src/2798.number-of-employees-who-met-the-target.2876/solution.ts) | Easy |
| 2799 | Count Complete Subarrays in an Array | [TypeScript](./src/2799.count-complete-subarrays-in-an-array.2856/solution.ts) | Medium |
| 2800 | Shortest String That Contains Three Strings | | Medium |
| 2801 | Count Stepping Numbers in Range | | Hard |
| 2802 | Find The K-th Lucky Number | | Medium |
| 2803 | Factorial Generator | | Easy |
| 2804 | Array Prototype ForEach | | Easy |
| 2805 | Custom Interval | | Medium |
| 2806 | Account Balance After Rounded Purchase | [Java](./src/2806.account-balance-after-rounded-purchase.2955/solution.java) [TypeScript](./src/2806.account-balance-after-rounded-purchase.2955/solution.ts) | Easy |
| 2807 | Insert Greatest Common Divisors in Linked List | [TypeScript](./src/2807.insert-greatest-common-divisors-in-linked-list.2903/solution.ts) | Medium |
| 2808 | Minimum Seconds to Equalize a Circular Array | | Medium |
| 2809 | Minimum Time to Make Array Sum At Most x | | Hard |
| 2810 | Faulty Keyboard | [TypeScript](./src/2810.faulty-keyboard.2886/solution.ts) | Easy |
| 2811 | Check if it is Possible to Split Array | | Medium |
| 2812 | Find the Safest Path in a Grid | | Medium |
| 2813 | Maximum Elegance of a K-Length Subsequence | | Hard |
| 2814 | Minimum Time Takes to Reach Destination Without Drowning | | Hard |
| 2815 | Max Pair Sum in an Array | [Java](./src/2815.max-pair-sum-in-an-array.2902/solution.java) [TypeScript](./src/2815.max-pair-sum-in-an-array.2902/solution.ts) | Easy |
| 2816 | Double a Number Represented as a Linked List | [TypeScript](./src/2816.double-a-number-represented-as-a-linked-list.2871/solution.ts) | Medium |
| 2817 | Minimum Absolute Difference Between Elements With Constraint | [TypeScript](./src/2817.minimum-absolute-difference-between-elements-with-constraint.3000/solution.ts) | Medium |
| 2818 | Apply Operations to Maximize Score | | Hard |
| 2819 | Minimum Relative Loss After Buying Chocolates | | Hard |
| 2820 | Election Results | | Medium |
| 2821 | Delay the Resolution of Each Promise | | Medium |
| 2822 | Inversion of Object | | Easy |
| 2823 | Deep Object Filter | | Medium |
| 2824 | Count Pairs Whose Sum is Less than Target | [TypeScript](./src/2824.count-pairs-whose-sum-is-less-than-target.2917/solution.ts) | Easy |
| 2825 | Make String a Subsequence Using Cyclic Increments | | Medium |
| 2826 | Sorting Three Groups | [TypeScript](./src/2826.sorting-three-groups.2904/solution.ts) | Medium |
| 2827 | Number of Beautiful Integers in the Range | | Hard |
| 2828 | Check if a String Is an Acronym of Words | [Java](./src/2828.check-if-a-string-is-an-acronym-of-words.2977/solution.java) [TypeScript](./src/2828.check-if-a-string-is-an-acronym-of-words.2977/solution.ts) | Easy |
| 2829 | Determine the Minimum Sum of a k-avoiding Array | [TypeScript](./src/2829.determine-the-minimum-sum-of-a-k-avoiding-array.2811/solution.ts) | Medium |
| 2830 | Maximize the Profit as the Salesman | [TypeScript](./src/2830.maximize-the-profit-as-the-salesman.2979/solution.ts) | Medium |
| 2831 | Find the Longest Equal Subarray | | Medium |
| 2832 | Maximal Range That Each Element Is Maximum in It | | Medium |
| 2833 | Furthest Point From Origin | [Java](./src/2833.furthest-point-from-origin.3019/solution.java) [TypeScript](./src/2833.furthest-point-from-origin.3019/solution.ts) | Easy |
| 2834 | Find the Minimum Possible Sum of a Beautiful Array | [TypeScript](./src/2834.find-the-minimum-possible-sum-of-a-beautiful-array.3026/solution.ts) | Medium |
| 2835 | Minimum Operations to Form Subsequence With Target Sum | | Hard |
| 2836 | Maximize Value of Function in a Ball Passing Game | | Hard |
| 2837 | Total Traveled Distance | | Easy |
| 2838 | Maximum Coins Heroes Can Collect | | Medium |
| 2839 | Check if Strings Can be Made Equal With Operations I | [TypeScript](./src/2839.check-if-strings-can-be-made-equal-with-operations-i.2999/solution.ts) | Easy |
| 2840 | Check if Strings Can be Made Equal With Operations II | [TypeScript](./src/2840.check-if-strings-can-be-made-equal-with-operations-ii.2978/solution.ts) | Medium |
| 2841 | Maximum Sum of Almost Unique Subarray | [TypeScript](./src/2841.maximum-sum-of-almost-unique-subarray.2954/solution.ts) | Medium |
| 2842 | Count K-Subsequences of a String With Maximum Beauty | | Hard |
| 2843 | Count Symmetric Integers | [TypeScript](./src/2843.count-symmetric-integers.2998/solution.ts) | Easy |
| 2844 | Minimum Operations to Make a Special Number | [TypeScript](./src/2844.minimum-operations-to-make-a-special-number.3046/solution.ts) | Medium |
| 2845 | Count of Interesting Subarrays | [TypeScript](./src/2845.count-of-interesting-subarrays.2915/solution.ts) | Medium |
| 2846 | Minimum Edge Weight Equilibrium Queries in a Tree | | Hard |
| 2847 | Smallest Number With Given Digit Product | | Medium |
| 2848 | Points That Intersect With Cars | [TypeScript](./src/2848.points-that-intersect-with-cars.3034/solution.ts) | Easy |
| 2849 | Determine if a Cell Is Reachable at a Given Time | | Medium |
| 2850 | Minimum Moves to Spread Stones Over Grid | | Medium |
| 2851 | String Transformation | | Hard |
| 2852 | Sum of Remoteness of All Cells | | Medium |
| 2853 | Highest Salaries Difference | | Easy |
| 2854 | Rolling Average Steps | | Medium |
| 2855 | Minimum Right Shifts to Sort the Array | [TypeScript](./src/2855.minimum-right-shifts-to-sort-the-array.3045/solution.ts) | Easy |
| 2856 | Minimum Array Length After Pair Removals | [TypeScript](./src/2856.minimum-array-length-after-pair-removals.3081/solution.ts) | Medium |
| 2857 | Count Pairs of Points With Distance k | | Medium |
| 2858 | Minimum Edge Reversals So Every Node Is Reachable | | Hard |
| 2859 | Sum of Values at Indices With K Set Bits | [Java](./src/2859.sum-of-values-at-indices-with-k-set-bits.3093/solution.java) [TypeScript](./src/2859.sum-of-values-at-indices-with-k-set-bits.3093/solution.ts) | Easy |
| 2860 | Happy Students | | Medium |
| 2861 | Maximum Number of Alloys | | Medium |
| 2862 | Maximum Element-Sum of a Complete Subset of Indices | | Hard |
| 2863 | Maximum Length of Semi-Decreasing Subarrays | | Medium |
| 2864 | Maximum Odd Binary Number | [Java](./src/2864.maximum-odd-binary-number.3055/solution.java) [TypeScript](./src/2864.maximum-odd-binary-number.3055/solution.ts) | Easy |
| 2865 | Beautiful Towers I | [TypeScript](./src/2865.beautiful-towers-i.3114/solution.ts) | Medium |
| 2866 | Beautiful Towers II | [TypeScript](./src/2866.beautiful-towers-ii.3113/solution.ts) | Medium |
| 2867 | Count Valid Paths in a Tree | | Hard |
| 2868 | The Wording Game | | Hard |
| 2869 | Minimum Operations to Collect Elements | [Java](./src/2869.minimum-operations-to-collect-elements.3044/solution.java) [TypeScript](./src/2869.minimum-operations-to-collect-elements.3044/solution.ts) | Easy |
| 2870 | Minimum Number of Operations to Make Array Empty | [TypeScript](./src/2870.minimum-number-of-operations-to-make-array-empty.3094/solution.ts) | Medium |
| 2871 | Split Array Into Maximum Number of Subarrays | [TypeScript](./src/2871.split-array-into-maximum-number-of-subarrays.3080/solution.ts) | Medium |
| 2872 | Maximum Number of K-Divisible Components | | Hard |
| 2873 | Maximum Value of an Ordered Triplet I | [TypeScript](./src/2873.maximum-value-of-an-ordered-triplet-i.3154/solution.ts) | Easy |
| 2874 | Maximum Value of an Ordered Triplet II | [TypeScript](./src/2874.maximum-value-of-an-ordered-triplet-ii.3152/solution.ts) | Medium |
| 2875 | Minimum Size Subarray in Infinite Array | [TypeScript](./src/2875.minimum-size-subarray-in-infinite-array.3141/solution.ts) | Medium |
| 2876 | Count Visited Nodes in a Directed Graph | | Hard |
| 2877 | Create a DataFrame from List | | Easy |
| 2878 | Get the Size of a DataFrame | | Easy |
| 2879 | Display the First Three Rows | | Easy |
| 2880 | Select Data | | Easy |
| 2881 | Create a New Column | | Easy |
| 2882 | Drop Duplicate Rows | | Easy |
| 2883 | Drop Missing Data | | Easy |
| 2884 | Modify Columns | | Easy |
| 2885 | Rename Columns | | Easy |
| 2886 | Change Data Type | | Easy |
| 2887 | Fill Missing Data | | Easy |
| 2888 | Reshape Data: Concatenate | | Easy |
| 2889 | Reshape Data: Pivot | | Easy |
| 2890 | Reshape Data: Melt | | Easy |
| 2891 | Method Chaining | | Easy |
| 2892 | Minimizing Array After Replacing Pairs With Their Product | | Medium |
| 2893 | Calculate Orders Within Each Interval | | Medium |
| 2894 | Divisible and Non-divisible Sums Difference | [Java](./src/2894.divisible-and-non-divisible-sums-difference.3172/solution.java) [TypeScript](./src/2894.divisible-and-non-divisible-sums-difference.3172/solution.ts) | Easy |
| 2895 | Minimum Processing Time | [TypeScript](./src/2895.minimum-processing-time.3151/solution.ts) | Medium |
| 2896 | Apply Operations to Make Two Strings Equal | | Medium |
| 2897 | Apply Operations on Array to Maximize Sum of Squares | | Hard |
| 2898 | Maximum Linear Stock Score | | Medium |
| 2899 | Last Visited Integers | [TypeScript](./src/2899.last-visited-integers.3164/solution.ts) | Easy |
| 2900 | Longest Unequal Adjacent Groups Subsequence I | [TypeScript](./src/2900.longest-unequal-adjacent-groups-subsequence-i.3143/solution.ts) | Easy |
| 2901 | Longest Unequal Adjacent Groups Subsequence II | | Medium |
| 2902 | Count of Sub-Multisets With Bounded Sum | | Hard |
| 2903 | Find Indices With Index and Value Difference I | [TypeScript](./src/2903.find-indices-with-index-and-value-difference-i.3165/solution.ts) | Easy |
| 2904 | Shortest and Lexicographically Smallest Beautiful String | [TypeScript](./src/2904.shortest-and-lexicographically-smallest-beautiful-string.3150/solution.ts) | Medium |
| 2905 | Find Indices With Index and Value Difference II | [TypeScript](./src/2905.find-indices-with-index-and-value-difference-ii.3170/solution.ts) | Medium |
| 2906 | Construct Product Matrix | [TypeScript](./src/2906.construct-product-matrix.3031/solution.ts) | Medium |
| 2907 | Maximum Profitable Triplets With Increasing Prices I | | Medium |
| 2908 | Minimum Sum of Mountain Triplets I | [TypeScript](./src/2908.minimum-sum-of-mountain-triplets-i.3176/solution.ts) | Easy |
| 2909 | Minimum Sum of Mountain Triplets II | [TypeScript](./src/2909.minimum-sum-of-mountain-triplets-ii.3186/solution.ts) | Medium |
| 2910 | Minimum Number of Groups to Create a Valid Assignment | | Medium |
| 2911 | Minimum Changes to Make K Semi-palindromes | | Hard |
| 2912 | Number of Ways to Reach Destination in the Grid | | Hard |
| 2913 | Subarrays Distinct Element Sum of Squares I | [TypeScript](./src/2913.subarrays-distinct-element-sum-of-squares-i.3163/solution.ts) | Easy |
| 2914 | Minimum Number of Changes to Make Binary String Beautiful | [TypeScript](./src/2914.minimum-number-of-changes-to-make-binary-string-beautiful.3174/solution.ts) | Medium |
| 2915 | Length of the Longest Subsequence That Sums to Target | [TypeScript](./src/2915.length-of-the-longest-subsequence-that-sums-to-target.3106/solution.ts) | Medium |
| 2916 | Subarrays Distinct Element Sum of Squares II | | Hard |
| 2917 | Find the K-or of an Array | [Java](./src/2917.find-the-k-or-of-an-array.3183/solution.java) [TypeScript](./src/2917.find-the-k-or-of-an-array.3183/solution.ts) | Easy |
| 2918 | Minimum Equal Sum of Two Arrays After Replacing Zeros | [TypeScript](./src/2918.minimum-equal-sum-of-two-arrays-after-replacing-zeros.3171/solution.ts) | Medium |
| 2919 | Minimum Increment Operations to Make Array Beautiful | | Medium |
| 2920 | Maximum Points After Collecting Coins From All Nodes | | Hard |
| 2921 | Maximum Profitable Triplets With Increasing Prices II | | Hard |
| 2922 | Market Analysis III | | Medium |
| 2923 | Find Champion I | [TypeScript](./src/2923.find-champion-i.3188/solution.ts) | Easy |
| 2924 | Find Champion II | | Medium |
| 2925 | Maximum Score After Applying Operations on a Tree | | Medium |
| 2926 | Maximum Balanced Subsequence Sum | | Hard |
| 2927 | Distribute Candies Among Children III | | Hard |
| 2928 | Distribute Candies Among Children I | [TypeScript](./src/2928.distribute-candies-among-children-i.3199/solution.ts) | Easy |
| 2929 | Distribute Candies Among Children II | [TypeScript](./src/2929.distribute-candies-among-children-ii.3201/solution.ts) | Medium |
| 2930 | Number of Strings Which Can Be Rearranged to Contain Substring | | Medium |
| 2931 | Maximum Spending After Buying Items | [TypeScript](./src/2931.maximum-spending-after-buying-items.3107/solution.ts) | Hard |
| 2932 | Maximum Strong Pair XOR I | [TypeScript](./src/2932.maximum-strong-pair-xor-i.3193/solution.ts) | Easy |
| 2933 | High-Access Employees | [TypeScript](./src/2933.high-access-employees.3202/solution.ts) | Medium |
| 2934 | Minimum Operations to Maximize Last Elements in Arrays | | Medium |
| 2935 | Maximum Strong Pair XOR II | | Hard |
| 2936 | Number of Equal Numbers Blocks | | Medium |
| 2937 | Make Three Strings Equal | [TypeScript](./src/2937.make-three-strings-equal.3207/solution.ts) | Easy |
| 2938 | Separate Black and White Balls | [TypeScript](./src/2938.separate-black-and-white-balls.3195/solution.ts) | Medium |
| 2939 | Maximum Xor Product | | Medium |
| 2940 | Find Building Where Alice and Bob Can Meet | [TypeScript](./src/2940.find-building-where-alice-and-bob-can-meet.3181/solution.ts) | Hard |
| 2941 | Maximum GCD-Sum of a Subarray | | Hard |
| 2942 | Find Words Containing Character | [Java](./src/2942.find-words-containing-character.3194/solution.java) [TypeScript](./src/2942.find-words-containing-character.3194/solution.ts) | Easy |
| 2943 | Maximize Area of Square Hole in Grid | [TypeScript](./src/2943.maximize-area-of-square-hole-in-grid.3214/solution.ts) | Medium |
| 2944 | Minimum Number of Coins for Fruits | | Medium |
| 2945 | Find Maximum Non-decreasing Array Length | | Hard |
| 2946 | Matrix Similarity After Cyclic Shifts | [TypeScript](./src/2946.matrix-similarity-after-cyclic-shifts.3215/solution.ts) | Easy |
| 2947 | Count Beautiful Substrings I | [TypeScript](./src/2947.count-beautiful-substrings-i.3210/solution.ts) | Medium |
| 2948 | Make Lexicographically Smallest Array by Swapping Elements | | Medium |
| 2949 | Count Beautiful Substrings II | [TypeScript](./src/2949.count-beautiful-substrings-ii.3208/solution.ts) | Hard |
| 2950 | Number of Divisible Substrings | | Medium |
| 2951 | Find the Peaks | [Java](./src/2951.find-the-peaks.3221/solution.java) [TypeScript](./src/2951.find-the-peaks.3221/solution.ts) | Easy |
| 2952 | Minimum Number of Coins to be Added | | Medium |
| 2953 | Count Complete Substrings | | Hard |
| 2954 | Count the Number of Infection Sequences | | Hard |
| 2955 | Number of Same-End Substrings | | Medium |
| 2956 | Find Common Elements Between Two Arrays | [Java](./src/2956.find-common-elements-between-two-arrays.3206/solution.java) [TypeScript](./src/2956.find-common-elements-between-two-arrays.3206/solution.ts) | Easy |
| 2957 | Remove Adjacent Almost-Equal Characters | [TypeScript](./src/2957.remove-adjacent-almost-equal-characters.3230/solution.ts) | Medium |
| 2958 | Length of Longest Subarray With at Most K Frequency | [TypeScript](./src/2958.length-of-longest-subarray-with-at-most-k-frequency.3225/solution.ts) | Medium |
| 2959 | Number of Possible Sets of Closing Branches | | Hard |
| 2960 | Count Tested Devices After Test Operations | [Java](./src/2960.count-tested-devices-after-test-operations.3220/solution.java) [TypeScript](./src/2960.count-tested-devices-after-test-operations.3220/solution.ts) | Easy |
| 2961 | Double Modular Exponentiation | [TypeScript](./src/2961.double-modular-exponentiation.3234/solution.ts) | Medium |
| 2962 | Count Subarrays Where Max Element Appears at Least K Times | [TypeScript](./src/2962.count-subarrays-where-max-element-appears-at-least-k-times.3213/solution.ts) | Medium |
| 2963 | Count the Number of Good Partitions | | Hard |
| 2964 | Number of Divisible Triplet Sums | | Medium |
| 2965 | Find Missing and Repeated Values | [Java](./src/2965.find-missing-and-repeated-values.3227/solution.java) [TypeScript](./src/2965.find-missing-and-repeated-values.3227/solution.ts) | Easy |
| 2966 | Divide Array Into Arrays With Max Difference | [TypeScript](./src/2966.divide-array-into-arrays-with-max-difference.3241/solution.ts) | Medium |
| 2967 | Minimum Cost to Make Array Equalindromic | [TypeScript](./src/2967.minimum-cost-to-make-array-equalindromic.3229/solution.ts) | Medium |
| 2968 | Apply Operations to Maximize Frequency Score | | Hard |
| 2969 | Minimum Number of Coins for Fruits II | | Hard |
| 2970 | Count the Number of Incremovable Subarrays I | | Easy |
| 2971 | Find Polygon With the Largest Perimeter | [TypeScript](./src/2971.find-polygon-with-the-largest-perimeter.3262/solution.ts) | Medium |
| 2972 | Count the Number of Incremovable Subarrays II | | Hard |
| 2973 | Find Number of Coins to Place in Tree Nodes | | Hard |
| 2974 | Minimum Number Game | [Java](./src/2974.minimum-number-game.3226/solution.java) [TypeScript](./src/2974.minimum-number-game.3226/solution.ts) | Easy |
| 2975 | Maximum Square Area by Removing Fences From a Field | [TypeScript](./src/2975.maximum-square-area-by-removing-fences-from-a-field.3250/solution.ts) | Medium |
| 2976 | Minimum Cost to Convert String I | [TypeScript](./src/2976.minimum-cost-to-convert-string-i.3235/solution.ts) | Medium |
| 2977 | Minimum Cost to Convert String II | | Hard |
| 2978 | Symmetric Coordinates | | Medium |
| 2979 | Most Expensive Item That Can Not Be Bought | | Medium |
| 2980 | Check if Bitwise OR Has Trailing Zeros | [Java](./src/2980.check-if-bitwise-or-has-trailing-zeros.3246/solution.java) [TypeScript](./src/2980.check-if-bitwise-or-has-trailing-zeros.3246/solution.ts) | Easy |
| 2981 | Find Longest Special Substring That Occurs Thrice I | [TypeScript](./src/2981.find-longest-special-substring-that-occurs-thrice-i.3267/solution.ts) | Medium |
| 2982 | Find Longest Special Substring That Occurs Thrice II | [TypeScript](./src/2982.find-longest-special-substring-that-occurs-thrice-ii.3266/solution.ts) | Medium |
| 2983 | Palindrome Rearrangement Queries | [TypeScript](./src/2983.palindrome-rearrangement-queries.3203/solution.ts) | Hard |
| 2984 | Find Peak Calling Hours for Each City | | Medium |
| 2985 | Calculate Compressed Mean | | Easy |
| 2986 | Find Third Transaction | | Medium |
| 2987 | Find Expensive Cities | | Easy |
| 2988 | Manager of the Largest Department | | Medium |
| 2989 | Class Performance | | Medium |
| 2990 | Loan Types | | Easy |
| 2991 | Top Three Wineries | | Hard |
| 2992 | Number of Self-Divisible Permutations | | Medium |
| 2993 | Friday Purchases I | | Medium |
| 2994 | Friday Purchases II | | Hard |
| 2995 | Viewers Turned Streamers | | Hard |
| 2996 | Smallest Missing Integer Greater Than Sequential Prefix Sum | [TypeScript](./src/2996.smallest-missing-integer-greater-than-sequential-prefix-sum.3236/solution.ts) | Easy |
| 2997 | Minimum Number of Operations to Make Array XOR Equal to K | [TypeScript](./src/2997.minimum-number-of-operations-to-make-array-xor-equal-to-k.3249/solution.ts) | Medium |
| 2998 | Minimum Number of Operations to Make X and Y Equal | | Medium |
| 2999 | Count the Number of Powerful Integers | | Hard |
| 3000 | Maximum Area of Longest Diagonal Rectangle | [TypeScript](./src/3000.maximum-area-of-longest-diagonal-rectangle.3251/solution.ts) | Easy |
| 3001 | Minimum Moves to Capture The Queen | | Medium |
| 3002 | Maximum Size of a Set After Removals | [TypeScript](./src/3002.maximum-size-of-a-set-after-removals.3228/solution.ts) | Medium |
| 3003 | Maximize the Number of Partitions After Operations | | Hard |
| 3004 | Maximum Subtree of the Same Color | | Medium |
| 3005 | Count Elements With Maximum Frequency | [TypeScript](./src/3005.count-elements-with-maximum-frequency.3242/solution.ts) | Easy |
| 3006 | Find Beautiful Indices in the Given Array I | [TypeScript](./src/3006.find-beautiful-indices-in-the-given-array-i.3245/solution.ts) | Medium |
| 3007 | Maximum Number That Sum of the Prices Is Less Than or Equal to K | | Medium |
| 3008 | Find Beautiful Indices in the Given Array II | [TypeScript](./src/3008.find-beautiful-indices-in-the-given-array-ii.3303/solution.ts) | Hard |
| 3009 | Maximum Number of Intersections on the Chart | | Hard |
| 3010 | Divide an Array Into Subarrays With Minimum Cost I | [TypeScript](./src/3010.divide-an-array-into-subarrays-with-minimum-cost-i.3263/solution.ts) | Easy |
| 3011 | Find if Array Can Be Sorted | [TypeScript](./src/3011.find-if-array-can-be-sorted.3291/solution.ts) | Medium |
| 3012 | Minimize Length of Array Using Operations | [TypeScript](./src/3012.minimize-length-of-array-using-operations.3244/solution.ts) | Medium |
| 3013 | Divide an Array Into Subarrays With Minimum Cost II | [TypeScript](./src/3013.divide-an-array-into-subarrays-with-minimum-cost-ii.3260/solution.ts) | Hard |
| 3014 | Minimum Number of Pushes to Type Word I | [TypeScript](./src/3014.minimum-number-of-pushes-to-type-word-i.3275/solution.ts) | Easy |
| 3015 | Count the Number of Houses at a Certain Distance I | [TypeScript](./src/3015.count-the-number-of-houses-at-a-certain-distance-i.3271/solution.ts) | Medium |
| 3016 | Minimum Number of Pushes to Type Word II | [TypeScript](./src/3016.minimum-number-of-pushes-to-type-word-ii.3276/solution.ts) | Medium |
| 3017 | Count the Number of Houses at a Certain Distance II | | Hard |
| 3018 | Maximum Number of Removal Queries That Can Be Processed I | | Hard |
| 3019 | Number of Changing Keys | [TypeScript](./src/3019.number-of-changing-keys.3312/solution.ts) | Easy |
| 3020 | Find the Maximum Number of Elements in Subset | [TypeScript](./src/3020.find-the-maximum-number-of-elements-in-subset.3299/solution.ts) | Medium |
| 3021 | Alice and Bob Playing Flower Game | | Medium |
| 3022 | Minimize OR of Remaining Elements Using Operations | | Hard |
| 3023 | Find Pattern in Infinite Stream I | | Medium |
| 3024 | Type of Triangle | [Java](./src/3024.type-of-triangle.3321/solution.java) [TypeScript](./src/3024.type-of-triangle.3321/solution.ts) | Easy |
| 3025 | Find the Number of Ways to Place People I | | Medium |
| 3026 | Maximum Good Subarray Sum | [TypeScript](./src/3026.maximum-good-subarray-sum.3265/solution.ts) | Medium |
| 3027 | Find the Number of Ways to Place People II | | Hard |
| 3028 | Ant on the Boundary | [Java](./src/3028.ant-on-the-boundary.3311/solution.java) [TypeScript](./src/3028.ant-on-the-boundary.3311/solution.ts) | Easy |
| 3029 | Minimum Time to Revert Word to Initial State I | [TypeScript](./src/3029.minimum-time-to-revert-word-to-initial-state-i.3297/solution.ts) | Medium |
| 3030 | Find the Grid of Region Average | [TypeScript](./src/3030.find-the-grid-of-region-average.3272/solution.ts) | Medium |
| 3031 | Minimum Time to Revert Word to Initial State II | [TypeScript](./src/3031.minimum-time-to-revert-word-to-initial-state-ii.3296/solution.ts) | Hard |
| 3032 | Count Numbers With Unique Digits II | | Easy |
| 3033 | Modify the Matrix | [TypeScript](./src/3033.modify-the-matrix.3330/solution.ts) | Easy |
| 3034 | Number of Subarrays That Match a Pattern I | [TypeScript](./src/3034.number-of-subarrays-that-match-a-pattern-i.3269/solution.ts) | Medium |
| 3035 | Maximum Palindromes After Operations | [TypeScript](./src/3035.maximum-palindromes-after-operations.3317/solution.ts) | Medium |
| 3036 | Number of Subarrays That Match a Pattern II | [TypeScript](./src/3036.number-of-subarrays-that-match-a-pattern-ii.3290/solution.ts) | Hard |
| 3037 | Find Pattern in Infinite Stream II | | Hard |
| 3038 | Maximum Number of Operations With the Same Score I | [Java](./src/3038.maximum-number-of-operations-with-the-same-score-i.3320/solution.java) [TypeScript](./src/3038.maximum-number-of-operations-with-the-same-score-i.3320/solution.ts) | Easy |
| 3039 | Apply Operations to Make String Empty | [TypeScript](./src/3039.apply-operations-to-make-string-empty.3308/solution.ts) | Medium |
| 3040 | Maximum Number of Operations With the Same Score II | [TypeScript](./src/3040.maximum-number-of-operations-with-the-same-score-ii.3318/solution.ts) | Medium |
| 3041 | Maximize Consecutive Elements in an Array After Modification | [TypeScript](./src/3041.maximize-consecutive-elements-in-an-array-after-modification.3298/solution.ts) | Hard |
| 3042 | Count Prefix and Suffix Pairs I | [TypeScript](./src/3042.count-prefix-and-suffix-pairs-i.3309/solution.ts) | Easy |
| 3043 | Find the Length of the Longest Common Prefix | [TypeScript](./src/3043.find-the-length-of-the-longest-common-prefix.3329/solution.ts) | Medium |
| 3044 | Most Frequent Prime | [TypeScript](./src/3044.most-frequent-prime.3314/solution.ts) | Medium |
| 3045 | Count Prefix and Suffix Pairs II | [TypeScript](./src/3045.count-prefix-and-suffix-pairs-ii.3305/solution.ts) | Hard |
| 3046 | Split the Array | [TypeScript](./src/3046.split-the-array.3324/solution.ts) | Easy |
| 3047 | Find the Largest Area of Square Inside Two Rectangles | | Medium |
| 3048 | Earliest Second to Mark Indices I | | Medium |
| 3049 | Earliest Second to Mark Indices II | | Hard |
| 3050 | Pizza Toppings Cost Analysis | | Medium |
| 3051 | Find Candidates for Data Scientist Position | | Easy |
| 3052 | Maximize Items | | Hard |
| 3053 | Classifying Triangles by Lengths | | Easy |
| 3054 | Binary Tree Nodes | | Medium |
| 3055 | Top Percentile Fraud | | Medium |
| 3056 | Snaps Analysis | | Medium |
| 3057 | Employees Project Allocation | | Hard |
| 3058 | Friends With No Mutual Friends | | Medium |
| 3059 | Find All Unique Email Domains | | Easy |
| 3060 | User Activities within Time Bounds | | Hard |
| 3061 | Calculate Trapping Rain Water | | Hard |
| 3062 | Winner of the Linked List Game | | Easy |
| 3063 | Linked List Frequency | | Easy |
| 3064 | Guess the Number Using Bitwise Questions I | | Medium |
| 3065 | Minimum Operations to Exceed Threshold Value I | [TypeScript](./src/3065.minimum-operations-to-exceed-threshold-value-i.3331/solution.ts) | Easy |
| 3066 | Minimum Operations to Exceed Threshold Value II | | Medium |
| 3067 | Count Pairs of Connectable Servers in a Weighted Tree Network | | Medium |
| 3068 | Find the Maximum Sum of Node Values | | Hard |
| 3069 | Distribute Elements Into Two Arrays I | [Java](./src/3069.distribute-elements-into-two-arrays-i.3347/solution.java) [TypeScript](./src/3069.distribute-elements-into-two-arrays-i.3347/solution.ts) | Easy |
| 3070 | Count Submatrices with Top-Left Element and Sum Less Than k | | Medium |
| 3071 | Minimum Operations to Write the Letter Y on a Grid | | Medium |
| 3072 | Distribute Elements Into Two Arrays II | | Hard |
| 3073 | Maximum Increasing Triplet Value | | Medium |
| 3074 | Apple Redistribution into Boxes | [Java](./src/3074.apple-redistribution-into-boxes.3334/solution.java) [TypeScript](./src/3074.apple-redistribution-into-boxes.3334/solution.ts) | Easy |
| 3075 | Maximize Happiness of Selected Children | | Medium |
| 3076 | Shortest Uncommon Substring in an Array | | Medium |
| 3077 | Maximum Strength of K Disjoint Subarrays | | Hard |
| 3078 | Match Alphanumerical Pattern in Matrix I | | Medium |
| 3079 | Find the Sum of Encrypted Integers | [Java](./src/3079.find-the-sum-of-encrypted-integers.3367/solution.java) [TypeScript](./src/3079.find-the-sum-of-encrypted-integers.3367/solution.ts) | Easy |
| 3080 | Mark Elements on Array by Performing Queries | | Medium |
| 3081 | Replace Question Marks in String to Minimize Its Value | | Medium |
| 3082 | Find the Sum of the Power of All Subsequences | | Hard |
| 3083 | Existence of a Substring in a String and Its Reverse | [Java](./src/3083.existence-of-a-substring-in-a-string-and-its-reverse.3353/solution.java) [TypeScript](./src/3083.existence-of-a-substring-in-a-string-and-its-reverse.3353/solution.ts) | Easy |
| 3084 | Count Substrings Starting and Ending with Given Character | | Medium |
| 3085 | Minimum Deletions to Make String K-Special | | Medium |
| 3086 | Minimum Moves to Pick K Ones | | Hard |
| 3087 | Find Trending Hashtags | | Medium |
| 3088 | Make String Anti-palindrome | | Hard |
| 3089 | Find Bursty Behavior | | Medium |
| 3090 | Maximum Length Substring With Two Occurrences | | Easy |
| 3091 | Apply Operations to Make Sum of Array Greater Than or Equal to k | | Medium |
| 3092 | Most Frequent IDs | | Medium |
| 3093 | Longest Common Suffix Queries | | Hard |
| 3094 | Guess the Number Using Bitwise Questions II | | Medium |
| 3095 | Shortest Subarray With OR at Least K I | | Easy |
| 3096 | Minimum Levels to Gain More Points | | Medium |
| 3097 | Shortest Subarray With OR at Least K II | | Medium |
| 3098 | Find the Sum of Subsequence Powers | | Hard |
| 3099 | Harshad Number | [Java](./src/3099.harshad-number.3371/solution.java) [TypeScript](./src/3099.harshad-number.3371/solution.ts) | Easy |
| 3100 | Water Bottles II | | Medium |
| 3101 | Count Alternating Subarrays | | Medium |
| 3102 | Minimize Manhattan Distances | | Hard |
| 3103 | Find Trending Hashtags II | | Hard |
| 3104 | Find Longest Self-Contained Substring | | Hard |
| 3105 | Longest Strictly Increasing or Strictly Decreasing Subarray | | Easy |
| 3106 | Lexicographically Smallest String After Operations With Constraint | | Medium |
| 3107 | Minimum Operations to Make Median of Array Equal to K | | Medium |
| 3108 | Minimum Cost Walk in Weighted Graph | | Hard |
| 3109 | Find the Index of Permutation | | Medium |
| 3110 | Score of a String | [Java](./src/3110.score-of-a-string.3379/solution.java) [TypeScript](./src/3110.score-of-a-string.3379/solution.ts) | Easy |
| 3111 | Minimum Rectangles to Cover Points | | Medium |
| 3112 | Minimum Time to Visit Disappearing Nodes | | Medium |
| 3113 | Find the Number of Subarrays Where Boundary Elements Are Maximum | | Hard |
| 3114 | Latest Time You Can Obtain After Replacing Characters | [TypeScript](./src/3114.latest-time-you-can-obtain-after-replacing-characters.3361/solution.ts) | Easy |
| 3115 | Maximum Prime Difference | | Medium |
| 3116 | Kth Smallest Amount With Single Denomination Combination | | Hard |
| 3117 | Minimum Sum of Values by Dividing Array | | Hard |
| 3118 | Friday Purchase III | | Medium |
| 3119 | Maximum Number of Potholes That Can Be Fixed | | Medium |
| 3120 | Count the Number of Special Characters I | [Java](./src/3120.count-the-number-of-special-characters-i.3408/solution.java) [TypeScript](./src/3120.count-the-number-of-special-characters-i.3408/solution.ts) | Easy |
| 3121 | Count the Number of Special Characters II | | Medium |
| 3122 | Minimum Number of Operations to Satisfy Conditions | | Medium |
| 3123 | Find Edges in Shortest Paths | | Hard |
| 3124 | Find Longest Calls | | Medium |
| 3125 | Maximum Number That Makes Result of Bitwise AND Zero | | Medium |
| 3126 | Server Utilization Time | | Medium |
| 3127 | Make a Square with the Same Color | [Java](./src/3127.make-a-square-with-the-same-color.3398/solution.java) [TypeScript](./src/3127.make-a-square-with-the-same-color.3398/solution.ts) | Easy |
| 3128 | Right Triangles | | Medium |
| 3129 | Find All Possible Stable Binary Arrays I | | Medium |
| 3130 | Find All Possible Stable Binary Arrays II | | Hard |
| 3131 | Find the Integer Added to Array I | [Java](./src/3131.find-the-integer-added-to-array-i.3397/solution.java) [TypeScript](./src/3131.find-the-integer-added-to-array-i.3397/solution.ts) | Easy |
| 3132 | Find the Integer Added to Array II | | Medium |
| 3133 | Minimum Array End | | Medium |
| 3134 | Find the Median of the Uniqueness Array | | Hard |
| 3135 | Equalize Strings by Adding or Removing Characters at Ends | | Medium |
| 3136 | Valid Word | [Java](./src/3136.valid-word.3396/solution.java) [TypeScript](./src/3136.valid-word.3396/solution.ts) | Easy |
| 3137 | Minimum Number of Operations to Make Word K-Periodic | | Medium |
| 3138 | Minimum Length of Anagram Concatenation | | Medium |
| 3139 | Minimum Cost to Equalize Array | | Hard |
| 3140 | Consecutive Available Seats II | | Medium |
| 3141 | Maximum Hamming Distances | | Hard |
| 3142 | Check if Grid Satisfies Conditions | [Java](./src/3142.check-if-grid-satisfies-conditions.3415/solution.java) [TypeScript](./src/3142.check-if-grid-satisfies-conditions.3415/solution.ts) | Easy |
| 3143 | Maximum Points Inside the Square | | Medium |
| 3144 | Minimum Substring Partition of Equal Character Frequency | | Medium |
| 3145 | Find Products of Elements of Big Array | | Hard |
| 3146 | Permutation Difference between Two Strings | [Java](./src/3146.permutation-difference-between-two-strings.3412/solution.java) [TypeScript](./src/3146.permutation-difference-between-two-strings.3412/solution.ts) | Easy |
| 3147 | Taking Maximum Energy From the Mystic Dungeon | | Medium |
| 3148 | Maximum Difference Score in a Grid | | Medium |
| 3149 | Find the Minimum Cost Array Permutation | | Hard |
| 3150 | Invalid Tweets II | | Easy |
| 3151 | Special Array I | [Java](./src/3151.special-array-i.3429/solution.java) [TypeScript](./src/3151.special-array-i.3429/solution.ts) | Easy |
| 3152 | Special Array II | | Medium |
| 3153 | Sum of Digit Differences of All Pairs | | Medium |
| 3154 | Find Number of Ways to Reach the K-th Stair | | Hard |
| 3155 | Maximum Number of Upgradable Servers | | Medium |
| 3156 | Employee Task Duration and Concurrent Tasks | | Hard |
| 3157 | Find the Level of Tree with Minimum Sum | | Medium |
| 3158 | Find the XOR of Numbers Which Appear Twice | [Java](./src/3158.find-the-xor-of-numbers-which-appear-twice.3428/solution.java) [TypeScript](./src/3158.find-the-xor-of-numbers-which-appear-twice.3428/solution.ts) | Easy |
| 3159 | Find Occurrences of an Element in an Array | | Medium |
| 3160 | Find the Number of Distinct Colors Among the Balls | | Medium |
| 3161 | Block Placement Queries | | Hard |
| 3162 | Find the Number of Good Pairs I | [TypeScript](./src/3162.find-the-number-of-good-pairs-i.3446/solution.ts) | Easy |
| 3163 | String Compression III | | Medium |
| 3164 | Find the Number of Good Pairs II | | Medium |
| 3165 | Maximum Sum of Subsequence With Non-adjacent Elements | | Hard |
| 3166 | Calculate Parking Fees and Duration | | Medium |
| 3167 | Better Compression of String | | Medium |
| 3168 | Minimum Number of Chairs in a Waiting Room | [Java](./src/3168.minimum-number-of-chairs-in-a-waiting-room.3426/solution.java) [TypeScript](./src/3168.minimum-number-of-chairs-in-a-waiting-room.3426/solution.ts) | Easy |
| 3169 | Count Days Without Meetings | | Medium |
| 3170 | Lexicographically Minimum String After Removing Stars | | Medium |
| 3171 | Find Subarray With Bitwise OR Closest to K | | Hard |
| 3172 | Second Day Verification | | Easy |
| 3173 | Bitwise OR of Adjacent Elements | | Easy |
| 3174 | Clear Digits | [Java](./src/3174.clear-digits.3447/solution.java) [TypeScript](./src/3174.clear-digits.3447/solution.ts) | Easy |
| 3175 | Find The First Player to win K Games in a Row | | Medium |
| 3176 | Find the Maximum Length of a Good Subsequence I | | Medium |
| 3177 | Find the Maximum Length of a Good Subsequence II | | Hard |
| 3178 | Find the Child Who Has the Ball After K Seconds | | Easy |
| 3179 | Find the N-th Value After K Seconds | | Medium |
| 3180 | Maximum Total Reward Using Operations I | | Medium |
| 3181 | Maximum Total Reward Using Operations II | | Hard |
| 3182 | Find Top Scoring Students | | Medium |
| 3183 | The Number of Ways to Make the Sum | | Medium |
| 3184 | Count Pairs That Form a Complete Day I | [Java](./src/3184.count-pairs-that-form-a-complete-day-i.3421/solution.java) [TypeScript](./src/3184.count-pairs-that-form-a-complete-day-i.3421/solution.ts) | Easy |
| 3185 | Count Pairs That Form a Complete Day II | | Medium |
| 3186 | Maximum Total Damage With Spell Casting | | Medium |
| 3187 | Peaks in Array | | Hard |
| 3188 | Find Top Scoring Students II | | Hard |
| 3189 | Minimum Moves to Get a Peaceful Board | | Medium |
| 3190 | Find Minimum Operations to Make All Elements Divisible by Three | [Java](./src/3190.find-minimum-operations-to-make-all-elements-divisible-by-three.3476/solution.java) [TypeScript](./src/3190.find-minimum-operations-to-make-all-elements-divisible-by-three.3476/solution.ts) | Easy |
| 3191 | Minimum Operations to Make Binary Array Elements Equal to One I | | Medium |
| 3192 | Minimum Operations to Make Binary Array Elements Equal to One II | | Medium |
| 3193 | Count the Number of Inversions | | Hard |
| 3194 | Minimum Average of Smallest and Largest Elements | | Easy |
| 3195 | Find the Minimum Area to Cover All Ones I | | Medium |
| 3196 | Maximize Total Cost of Alternating Subarrays | | Medium |
| 3197 | Find the Minimum Area to Cover All Ones II | | Hard |
| 3198 | Find Cities in Each State | | Easy |
| 3199 | Count Triplets with Even XOR Set Bits I | | Easy |
| 3200 | Maximum Height of a Triangle | | Easy |
| 3201 | Find the Maximum Length of Valid Subsequence I | | Medium |
| 3202 | Find the Maximum Length of Valid Subsequence II | | Medium |
| 3203 | Find Minimum Diameter After Merging Two Trees | | Hard |
| 3204 | Bitwise User Permissions Analysis | | Medium |
| 3205 | Maximum Array Hopping Score I | | Medium |
| 3206 | Alternating Groups I | | Easy |
| 3207 | Maximum Points After Enemy Battles | | Medium |
| 3208 | Alternating Groups II | | Medium |
| 3209 | Number of Subarrays With AND Value of K | | Hard |
| 3210 | Find the Encrypted String | [Java](./src/3210.find-the-encrypted-string.3468/solution.java) [TypeScript](./src/3210.find-the-encrypted-string.3468/solution.ts) | Easy |
| 3211 | Generate Binary Strings Without Adjacent Zeros | | Medium |
| 3212 | Count Submatrices With Equal Frequency of X and Y | | Medium |
| 3213 | Construct String with Minimum Cost | | Hard |
| 3214 | Year on Year Growth Rate | | Hard |
| 3215 | Count Triplets with Even XOR Set Bits II | | Medium |
| 3216 | Lexicographically Smallest String After a Swap | [TypeScript](./src/3216.lexicographically-smallest-string-after-a-swap.3484/solution.ts) | Easy |
| 3217 | Delete Nodes From Linked List Present in Array | | Medium |
| 3218 | Minimum Cost for Cutting Cake I | | Medium |
| 3219 | Minimum Cost for Cutting Cake II | | Hard |
| 3220 | Odd and Even Transactions | | Medium |
| 3221 | Maximum Array Hopping Score II | | Medium |
| 3222 | Find the Winning Player in Coin Game | [Java](./src/3222.find-the-winning-player-in-coin-game.3511/solution.java) [TypeScript](./src/3222.find-the-winning-player-in-coin-game.3511/solution.ts) | Easy |
| 3223 | Minimum Length of String After Operations | | Medium |
| 3224 | Minimum Array Changes to Make Differences Equal | | Medium |
| 3225 | Maximum Score From Grid Operations | | Hard |
| 3226 | Number of Bit Changes to Make Two Integers Equal | [Java](./src/3226.number-of-bit-changes-to-make-two-integers-equal.3508/solution.java) [TypeScript](./src/3226.number-of-bit-changes-to-make-two-integers-equal.3508/solution.ts) | Easy |
| 3227 | Vowels Game in a String | | Medium |
| 3228 | Maximum Number of Operations to Move Ones to the End | | Medium |
| 3229 | Minimum Operations to Make Array Equal to Target | | Hard |
| 3230 | Customer Purchasing Behavior Analysis | | Medium |
| 3231 | Minimum Number of Increasing Subsequence to Be Removed | | Hard |
| 3232 | Find if Digit Game Can Be Won | [Java](./src/3232.find-if-digit-game-can-be-won.3515/solution.java) [TypeScript](./src/3232.find-if-digit-game-can-be-won.3515/solution.ts) | Easy |
| 3233 | Find the Count of Numbers Which Are Not Special | | Medium |
| 3234 | Count the Number of Substrings With Dominant Ones | | Medium |
| 3235 | Check if the Rectangle Corner Is Reachable | | Hard |
| 3236 | CEO Subordinate Hierarchy | | Hard |
| 3237 | Alt and Tab Simulation | | Medium |
| 3238 | Find the Number of Winning Players | [TypeScript](./src/3238.find-the-number-of-winning-players.3519/solution.ts) | Easy |
| 3239 | Minimum Number of Flips to Make Binary Grid Palindromic I | | Medium |
| 3240 | Minimum Number of Flips to Make Binary Grid Palindromic II | | Medium |
| 3241 | Time Taken to Mark All Nodes | | Hard |
| 3242 | Design Neighbor Sum Service | | Easy |
| 3243 | Shortest Distance After Road Addition Queries I | | Medium |
| 3244 | Shortest Distance After Road Addition Queries II | | Hard |
| 3245 | Alternating Groups III | | Hard |
| 3246 | Premier League Table Ranking | | Easy |
| 3247 | Number of Subsequences with Odd Sum | | Medium |
| 3248 | Snake in Matrix | [Java](./src/3248.snake-in-matrix.3533/solution.java) | Easy |
| 3249 | Count the Number of Good Nodes | | Medium |
| 3250 | Find the Count of Monotonic Pairs I | | Hard |
| 3251 | Find the Count of Monotonic Pairs II | | Hard |
| 3252 | Premier League Table Ranking II | | Medium |
| 3253 | Construct String with Minimum Cost (Easy) | | Medium |
| 3254 | Find the Power of K-Size Subarrays I | | Medium |
| 3255 | Find the Power of K-Size Subarrays II | | Medium |
| 3256 | Maximum Value Sum by Placing Three Rooks I | | Hard |
| 3257 | Maximum Value Sum by Placing Three Rooks II | | Hard |
| 3258 | Count Substrings That Satisfy K-Constraint I | | Easy |
| 3259 | Maximum Energy Boost From Two Drinks | | Medium |
| 3260 | Find the Largest Palindrome Divisible by K | | Hard |
| 3261 | Count Substrings That Satisfy K-Constraint II | | Hard |
| 3262 | Find Overlapping Shifts | | Medium |
| 3263 | Convert Doubly Linked List to Array I | | Easy |
| 3264 | Final Array State After K Multiplication Operations I | | Easy |
| 3265 | Count Almost Equal Pairs I | | Medium |
| 3266 | Final Array State After K Multiplication Operations II | | Hard |
| 3267 | Count Almost Equal Pairs II | | Hard |
| 3268 | Find Overlapping Shifts II | | Hard |
| 3269 | Constructing Two Increasing Arrays | | Hard |
| 3270 | Find the Key of the Numbers | [Java](./src/3270.find-the-key-of-the-numbers.3568/solution.java) [TypeScript](./src/3270.find-the-key-of-the-numbers.3568/solution.ts) | Easy |
| 3271 | Hash Divided String | | Medium |
| 3272 | Find the Count of Good Integers | | Hard |
| 3273 | Minimum Amount of Damage Dealt to Bob | | Hard |
| 3274 | Check if Two Chessboard Squares Have the Same Color | [Java](./src/3274.check-if-two-chessboard-squares-have-the-same-color.3553/solution.java) [TypeScript](./src/3274.check-if-two-chessboard-squares-have-the-same-color.3553/solution.ts) | Easy |
| 3275 | K-th Nearest Obstacle Queries | | Medium |
| 3276 | Select Cells in Grid With Maximum Score | | Hard |
| 3277 | Maximum XOR Score Subarray Queries | | Hard |
| 3278 | Find Candidates for Data Scientist Position II | | Medium |
| 3279 | Maximum Total Area Occupied by Pistons | | Hard |
| 3280 | Convert Date to Binary | [Java](./src/3280.convert-date-to-binary.3567/solution.java) [TypeScript](./src/3280.convert-date-to-binary.3567/solution.ts) | Easy |
| 3281 | Maximize Score of Numbers in Ranges | | Medium |
| 3282 | Reach End of Array With Max Score | | Medium |
| 3283 | Maximum Number of Moves to Kill All Pawns | | Hard |
| 3284 | Sum of Consecutive Subarrays | | Medium |
| 3285 | Find Indices of Stable Mountains | [Java](./src/3285.find-indices-of-stable-mountains.3582/solution.java) [TypeScript](./src/3285.find-indices-of-stable-mountains.3582/solution.ts) | Easy |
| 3286 | Find a Safe Walk Through a Grid | | Medium |
| 3287 | Find the Maximum Sequence Value of Array | | Hard |
| 3288 | Length of the Longest Increasing Path | | Hard |
| 3289 | The Two Sneaky Numbers of Digitville | [Java](./src/3289.the-two-sneaky-numbers-of-digitville.3581/solution.java) [TypeScript](./src/3289.the-two-sneaky-numbers-of-digitville.3581/solution.ts) | Easy |
| 3290 | Maximum Multiplication Score | | Medium |
| 3291 | Minimum Number of Valid Strings to Form Target I | | Medium |
| 3292 | Minimum Number of Valid Strings to Form Target II | | Hard |
| 3293 | Calculate Product Final Price | | Medium |
| 3294 | Convert Doubly Linked List to Array II | | Medium |
| 3295 | Report Spam Message | [Java](./src/3295.report-spam-message.3541/solution.java) | Medium |
| 3296 | Minimum Number of Seconds to Make Mountain Height Zero | | Medium |
| 3297 | Count Substrings That Can Be Rearranged to Contain a String I | | Medium |
| 3298 | Count Substrings That Can Be Rearranged to Contain a String II | | Hard |
| 3299 | Sum of Consecutive Subsequences | | Hard |
| 3300 | Minimum Element After Replacement With Digit Sum | [TypeScript](./src/3300.minimum-element-after-replacement-with-digit-sum.3606/solution.ts) | Easy |
| 3301 | Maximize the Total Height of Unique Towers | | Medium |
| 3302 | Find the Lexicographically Smallest Valid Sequence | | Medium |
| 3303 | Find the Occurrence of First Almost Equal Substring | | Hard |
| 3304 | Find the K-th Character in String Game I | [TypeScript](./src/3304.find-the-k-th-character-in-string-game-i.3600/solution.ts) | Easy |
| 3305 | Count of Substrings Containing Every Vowel and K Consonants I | | Medium |
| 3306 | Count of Substrings Containing Every Vowel and K Consonants II | | Medium |
| 3307 | Find the K-th Character in String Game II | | Hard |
| 3308 | Find Top Performing Driver | | Medium |
| 3309 | Maximum Possible Number by Binary Concatenation | | Medium |
| 3310 | Remove Methods From Project | | Medium |
| 3311 | Construct 2D Grid Matching Graph Layout | | Hard |
| 3312 | Sorted GCD Pair Queries | | Hard |
| 3313 | Find the Last Marked Nodes in Tree | | Hard |
| 3314 | Construct the Minimum Bitwise Array I | | Easy |
| 3315 | Construct the Minimum Bitwise Array II | | Medium |
| 3316 | Find Maximum Removals From Source String | | Medium |
| 3317 | Find the Number of Possible Ways for an Event | | Hard |
| 3318 | Find X-Sum of All K-Long Subarrays I | | Easy |
| 3319 | K-th Largest Perfect Subtree Size in Binary Tree | | Medium |
| 3320 | Count The Number of Winning Sequences | | Hard |
| 3321 | Find X-Sum of All K-Long Subarrays II | | Hard |
| 3322 | Premier League Table Ranking III | | Medium |
| 3323 | Minimize Connected Groups by Inserting Interval | | Medium |
| 3324 | Find the Sequence of Strings Appeared on the Screen | | Medium |
| 3325 | Count Substrings With K-Frequency Characters I | | Medium |
| 3326 | Minimum Division Operations to Make Array Non Decreasing | | Medium |
| 3327 | Check if DFS Strings Are Palindromes | | Hard |
| 3328 | Find Cities in Each State II | | Medium |
| 3329 | Count Substrings With K-Frequency Characters II | | Hard |
| 3330 | Find the Original Typed String I | [Java](./src/3330.find-the-original-typed-string-i.3617/solution.java) [TypeScript](./src/3330.find-the-original-typed-string-i.3617/solution.ts) | Easy |
| 3331 | Find Subtree Sizes After Changes | | Medium |
| 3332 | Maximum Points Tourist Can Earn | | Medium |
| 3333 | Find the Original Typed String II | | Hard |
| 3334 | Find the Maximum Factor Score of Array | | Medium |
| 3335 | Total Characters in String After Transformations I | | Medium |
| 3336 | Find the Number of Subsequences With Equal GCD | | Hard |
| 3337 | Total Characters in String After Transformations II | | Hard |
| 3338 | Second Highest Salary II | | Medium |
| 3339 | Find the Number of K-Even Arrays | | Medium |
| 3340 | Check Balanced String | [Java](./src/3340.check-balanced-string.3636/solution.java) | Easy |
| 3341 | Find Minimum Time to Reach Last Room I | | Medium |
| 3342 | Find Minimum Time to Reach Last Room II | | Medium |
| 3343 | Count Number of Balanced Permutations | | Hard |
| 3344 | Maximum Sized Array | | Medium |
| 3345 | Smallest Divisible Digit Product I | [Java](./src/3345.smallest-divisible-digit-product-i.3626/solution.java) | Easy |
| 3346 | Maximum Frequency of an Element After Performing Operations I | | Medium |
| 3347 | Maximum Frequency of an Element After Performing Operations II | | Hard |
| 3348 | Smallest Divisible Digit Product II | | Hard |
| 3349 | Adjacent Increasing Subarrays Detection I | | Easy |
| 3350 | Adjacent Increasing Subarrays Detection II | | Medium |
| 3351 | Sum of Good Subsequences | | Hard |
| 3352 | Count K-Reducible Numbers Less Than N | | Hard |
| 3353 | Minimum Total Operations | | Easy |
| 3354 | Make Array Elements Equal to Zero | | Easy |
| 3355 | Zero Array Transformation I | | Medium |
| 3356 | Zero Array Transformation II | | Medium |
| 3357 | Minimize the Maximum Adjacent Element Difference | | Hard |
| 3358 | Books with NULL Ratings | | Easy |
| 3359 | Find Sorted Submatrices With Maximum Element at Most K | | Hard |
| 3360 | Stone Removal Game | [Java](./src/3360.stone-removal-game.3625/solution.java) | Easy |
| 3361 | Shift Distance Between Two Strings | | Medium |
| 3362 | Zero Array Transformation III | | Medium |
| 3363 | Find the Maximum Number of Fruits Collected | | Hard |
| 3364 | Minimum Positive Sum Subarray | | Easy |
| 3365 | Rearrange K Substrings to Form Target String | | Medium |
| 3366 | Minimum Array Sum | | Medium |
| 3367 | Maximize Sum of Weights after Edge Removals | | Hard |
| 3368 | First Letter Capitalization | | Hard |
| 3369 | Design an Array Statistics Tracker | | Hard |
| 3370 | Smallest Number With All Set Bits | [Java](./src/3370.smallest-number-with-all-set-bits.3676/solution.java) | Easy |
| 3371 | Identify the Largest Outlier in an Array | | Medium |
| 3372 | Maximize the Number of Target Nodes After Connecting Trees I | | Medium |
| 3373 | Maximize the Number of Target Nodes After Connecting Trees II | | Hard |
| 3374 | First Letter Capitalization II | | Hard |
| 3375 | Minimum Operations to Make Array Values Equal to K | [Java](./src/3375.minimum-operations-to-make-array-values-equal-to-k.3621/solution.java) | Easy |
| 3376 | Minimum Time to Break Locks I | | Medium |
| 3377 | Digit Operations to Make Two Integers Equal | | Medium |
| 3378 | Count Connected Components in LCM Graph | | Hard |
| 3379 | Transformed Array | | Easy |
| 3380 | Maximum Area Rectangle With Point Constraints I | | Medium |
| 3381 | Maximum Subarray Sum With Length Divisible by K | | Medium |
| 3382 | Maximum Area Rectangle With Point Constraints II | | Hard |
| 3383 | Minimum Runes to Add to Cast Spell | | Hard |
| 3384 | Team Dominance by Pass Success | | Hard |
| 3385 | Minimum Time to Break Locks II | | Hard |
| 3386 | Button with Longest Push Time | | Easy |
| 3387 | Maximize Amount After Two Days of Conversions | | Medium |
| 3388 | Count Beautiful Splits in an Array | | Medium |
| 3389 | Minimum Operations to Make Character Frequencies Equal | | Hard |
| 3390 | Longest Team Pass Streak | | Hard |
| 3391 | Design a 3D Binary Matrix with Efficient Layer Tracking | | Medium |
| 3392 | Count Subarrays of Length Three With a Condition | | Easy |
| 3393 | Count Paths With the Given XOR Value | | Medium |
| 3394 | Check if Grid can be Cut into Sections | | Medium |
| 3395 | Subsequences with a Unique Middle Mode I | | Hard |
| 3396 | Minimum Number of Operations to Make Elements in Array Distinct | | Easy |
| 3397 | Maximum Number of Distinct Elements After Operations | | Medium |
| 3398 | Smallest Substring With Identical Characters I | | Hard |
| 3399 | Smallest Substring With Identical Characters II | | Hard |
| 3400 | Maximum Number of Matching Indices After Right Shifts | | Medium |
| 3401 | Find Circular Gift Exchange Chains | | Hard |
| 3402 | Minimum Operations to Make Columns Strictly Increasing | [Java](./src/3402.minimum-operations-to-make-columns-strictly-increasing.3691/solution.java) | Easy |
| 3403 | Find the Lexicographically Largest String From the Box I | | Medium |
| 3404 | Count Special Subsequences | | Medium |
| 3405 | Count the Number of Arrays with K Matching Adjacent Elements | | Hard |
| 3406 | Find the Lexicographically Largest String From the Box II | | Hard |
| LCP01 | Guess Numbers | [Java](./src/LCP01.guess-numbers.100107/solution.java) [JavaScript](./src/LCP01.guess-numbers.100107/solution.js) [TypeScript](./src/LCP01.guess-numbers.100107/solution.ts) | Easy |
| LCP02 | Deep Dark Fraction | [JavaScript](./src/LCP02.deep-dark-fraction.100092/solution.js) [TypeScript](./src/LCP02.deep-dark-fraction.100092/solution.ts) | Easy |
| LCP03 | Programmable Robot | | Medium |
| LCP04 | Broken Board Dominoes | | Hard |
| LCP05 | Coin Bonus | | Hard |
| LCP06 | 拿硬币 | [Java](./src/LCP06.na-ying-bi.1000056/solution.java) [JavaScript](./src/LCP06.na-ying-bi.1000056/solution.js) [TypeScript](./src/LCP06.na-ying-bi.1000056/solution.ts) | Easy |
| LCP07 | 传递信息 | | Easy |
| LCP08 | 剧情触发时间 | | Medium |
| LCP09 | 最小跳跃次数 | | Hard |
| LCP10 | 二叉树任务调度 | | Hard |
| LCP11 | 期望个数统计 | | Easy |
| LCP12 | 小张刷题计划 | [TypeScript](./src/LCP12.xiao-zhang-shua-ti-ji-hua.1000087/solution.ts) | Medium |
| LCP13 | 寻宝 | | Hard |
| LCP14 | 切分数组 | | Hard |
| LCP15 | 游乐园的迷宫 | | Hard |
| LCP16 | 游乐园的游览计划 | | Hard |
| LCP17 | 速算机器人 | [Java](./src/LCP17.nGK0Fy.1000139/solution.java) [JavaScript](./src/LCP17.nGK0Fy.1000139/solution.js) [TypeScript](./src/LCP17.nGK0Fy.1000139/solution.ts) | Easy |
| LCP18 | 早餐组合 | [JavaScript](./src/LCP18.2vYnGI.1000146/solution.js) [TypeScript](./src/LCP18.2vYnGI.1000146/solution.ts) | Easy |
| LCP19 | 秋叶收藏集 | [TypeScript](./src/LCP19.UlBDOe.1000130/solution.ts) | Medium |
| LCP20 | 快速公交 | | Hard |
| LCP21 | 追逐游戏 | | Hard |
| LCP22 | 黑白方格画 | | Easy |
| LCP23 | 魔术排列 | | Medium |
| LCP24 | 数字游戏 | | Hard |
| LCP25 | 古董键盘 | | Hard |
| LCP26 | 导航装置 | | Hard |
| LCP27 | 黑盒光线反射 | | Hard |
| LCP28 | 采购方案 | [JavaScript](./src/LCP28.4xy4Wx.1000215/solution.js) [TypeScript](./src/LCP28.4xy4Wx.1000215/solution.ts) | Easy |
| LCP29 | 乐团站位 | | Medium |
| LCP30 | 魔塔游戏 | | Medium |
| LCP31 | 变换的迷宫 | | Hard |
| LCP32 | 批量处理任务 | | Hard |
| LCP33 | 蓄水 | | Easy |
| LCP34 | 二叉树染色 | | Medium |
| LCP35 | 电动车游城市 | | Hard |
| LCP36 | 最多牌组数 | | Hard |
| LCP37 | 最小矩形面积 | | Hard |
| LCP38 | 守卫城堡 | | Hard |
| LCP39 | 无人机方阵 | | Easy |
| LCP40 | 心算挑战 | [TypeScript](./src/LCP40.uOAnQW.1000368/solution.ts) | Easy |
| LCP41 | 黑白翻转棋 | | Medium |
| LCP42 | 玩具套圈 | | Hard |
| LCP43 | 十字路口的交通 | | Hard |
| LCP44 | 开幕式焰火 | [JavaScript](./src/LCP44.sZ59z6.1000362/solution.js) [TypeScript](./src/LCP44.sZ59z6.1000362/solution.ts) | Easy |
| LCP45 | 自行车炫技赛场 | | Medium |
| LCP46 | 志愿者调配 | | Medium |
| LCP47 | 入场安检 | | Hard |
| LCP48 | 无限棋局 | | Hard |
| LCP49 | 环形闯关游戏 | | Hard |
| LCP50 | 宝石补给 | [JavaScript](./src/LCP50.WHnhjV.1000433/solution.js) [TypeScript](./src/LCP50.WHnhjV.1000433/solution.ts) | Easy |
| LCP51 | 烹饪料理 | [TypeScript](./src/LCP51.UEcfPD.1000434/solution.ts) | Easy |
| LCP52 | 二叉搜索树染色 | | Medium |
| LCP53 | 守护太空城 | | Hard |
| LCP54 | 夺回据点 | | Hard |
| LCP55 | 采集果实 | [JavaScript](./src/LCP55.PTXy4P.1000438/solution.js) [TypeScript](./src/LCP55.PTXy4P.1000438/solution.ts) | Easy |
| LCP56 | 信物传送 | | Medium |
| LCP57 | 打地鼠 | | Hard |
| LCP58 | 积木拼接 | | Hard |
| LCP59 | 搭桥过河 | | Hard |
| LCP60 | 力扣泡泡龙 | | Hard |
| LCP61 | 气温变化趋势 | [JavaScript](./src/LCP61.6CE719.1000476/solution.js) [TypeScript](./src/LCP61.6CE719.1000476/solution.ts) | Easy |
| LCP62 | 交通枢纽 | [TypeScript](./src/LCP62.D9PW8w.1000477/solution.ts) | Medium |
| LCP63 | 弹珠游戏 | | Medium |
| LCP64 | 二叉树灯饰 | | Medium |
| LCP65 | 舒适的湿度 | | Hard |
| LCP66 | 最小展台数量 | [JavaScript](./src/LCP66.600YaG.1000481/solution.js) [TypeScript](./src/LCP66.600YaG.1000481/solution.ts) | Easy |
| LCP67 | 装饰树 | [JavaScript](./src/LCP67.KnLfVT.1000482/solution.js) [TypeScript](./src/LCP67.KnLfVT.1000482/solution.ts) | Medium |
| LCP68 | 美观的花束 | [TypeScript](./src/LCP68.1GxJYY.1000483/solution.ts) | Medium |
| LCP69 | Hello LeetCode! | | Hard |
| LCP70 | 沙地治理 | | Hard |
| LCP71 | 集水器 | | Hard |
| LCP72 | 补给马车 | [TypeScript](./src/LCP72.hqCnmP.1000560/solution.ts) | Easy |
| LCP73 | 探险营地 | [TypeScript](./src/LCP73.0Zeoeg.1000561/solution.ts) | Medium |
| LCP74 | 最强祝福力场 | | Medium |
| LCP75 | 传送卷轴 | | Hard |
| LCP76 | 魔法棋盘 | | Hard |
| LCP77 | 符文储备 | [Java](./src/LCP77.W2ZX4X.1000565/solution.java) [TypeScript](./src/LCP77.W2ZX4X.1000565/solution.ts) | Easy |
| LCP78 | 城墙防线 | | Medium |
| LCP79 | 提取咒文 | | Medium |
| LCP80 | 生物进化录 | | Hard |
| LCP81 | 与非的谜题 | | Hard |
| LCP82 | 万灵之树 | | Hard |
| LCR120 | 寻找文件副本 | [Java](./src/LCR120.shu-zu-zhong-zhong-fu-de-shu-zi-lcof.100275/solution.java) [JavaScript](./src/LCR120.shu-zu-zhong-zhong-fu-de-shu-zi-lcof.100275/solution.js) [TypeScript](./src/LCR120.shu-zu-zhong-zhong-fu-de-shu-zi-lcof.100275/solution.ts) | Easy |
| LCR121 | 寻找目标值 - 二维数组 | [JavaScript](./src/LCR121.er-wei-shu-zu-zhong-de-cha-zhao-lcof.100276/solution.js) [TypeScript](./src/LCR121.er-wei-shu-zu-zhong-de-cha-zhao-lcof.100276/solution.ts) | Medium |
| LCR122 | 路径加密 | [Java](./src/LCR122.ti-huan-kong-ge-lcof.100280/solution.java) [JavaScript](./src/LCR122.ti-huan-kong-ge-lcof.100280/solution.js) [TypeScript](./src/LCR122.ti-huan-kong-ge-lcof.100280/solution.ts) | Easy |
| LCR123 | 图书整理 I | [Go](./src/LCR123.cong-wei-dao-tou-da-yin-lian-biao-lcof.100282/solution.go) [Java](./src/LCR123.cong-wei-dao-tou-da-yin-lian-biao-lcof.100282/solution.java) [JavaScript](./src/LCR123.cong-wei-dao-tou-da-yin-lian-biao-lcof.100282/solution.js) [TypeScript](./src/LCR123.cong-wei-dao-tou-da-yin-lian-biao-lcof.100282/solution.ts) | Easy |
| LCR124 | 推理二叉树 | [JavaScript](./src/LCR124.zhong-jian-er-cha-shu-lcof.100283/solution.js) [TypeScript](./src/LCR124.zhong-jian-er-cha-shu-lcof.100283/solution.ts) | Medium |
| LCR125 | 图书整理 II | [JavaScript](./src/LCR125.yong-liang-ge-zhan-shi-xian-dui-lie-lcof.100273/solution.js) [TypeScript](./src/LCR125.yong-liang-ge-zhan-shi-xian-dui-lie-lcof.100273/solution.ts) | Easy |
| LCR126 | 斐波那契数 | [Java](./src/LCR126.fei-bo-na-qi-shu-lie-lcof.100274/solution.java) [JavaScript](./src/LCR126.fei-bo-na-qi-shu-lie-lcof.100274/solution.js) [TypeScript](./src/LCR126.fei-bo-na-qi-shu-lie-lcof.100274/solution.ts) | Easy |
| LCR127 | 跳跃训练 | [JavaScript](./src/LCR127.qing-wa-tiao-tai-jie-wen-ti-lcof.100277/solution.js) [TypeScript](./src/LCR127.qing-wa-tiao-tai-jie-wen-ti-lcof.100277/solution.ts) | Easy |
| LCR128 | 库存管理 I | [JavaScript](./src/LCR128.xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof.100278/solution.js) | Easy |
| LCR129 | 字母迷宫 | [JavaScript](./src/LCR129.ju-zhen-zhong-de-lu-jing-lcof.100279/solution.js) [TypeScript](./src/LCR129.ju-zhen-zhong-de-lu-jing-lcof.100279/solution.ts) | Medium |
| LCR130 | 衣橱整理 | [JavaScript](./src/LCR130.ji-qi-ren-de-yun-dong-fan-wei-lcof.100281/solution.js) [TypeScript](./src/LCR130.ji-qi-ren-de-yun-dong-fan-wei-lcof.100281/solution.ts) | Medium |
| LCR131 | 砍竹子 I | [JavaScript](./src/LCR131.jian-sheng-zi-lcof.100284/solution.js) [TypeScript](./src/LCR131.jian-sheng-zi-lcof.100284/solution.ts) | Medium |
| LCR132 | 砍竹子 II | [JavaScript](./src/LCR132.jian-sheng-zi-ii-lcof.100285/solution.js) [TypeScript](./src/LCR132.jian-sheng-zi-ii-lcof.100285/solution.ts) | Medium |
| LCR133 | 位 1 的个数 | [Java](./src/LCR133.er-jin-zhi-zhong-1de-ge-shu-lcof.100292/solution.java) [JavaScript](./src/LCR133.er-jin-zhi-zhong-1de-ge-shu-lcof.100292/solution.js) | Easy |
| LCR134 | Pow(x, n) | [JavaScript](./src/LCR134.shu-zhi-de-zheng-shu-ci-fang-lcof.100295/solution.js) [TypeScript](./src/LCR134.shu-zhi-de-zheng-shu-ci-fang-lcof.100295/solution.ts) | Medium |
| LCR135 | 报数 | [Java](./src/LCR135.da-yin-cong-1dao-zui-da-de-nwei-shu-lcof.100296/solution.java) [JavaScript](./src/LCR135.da-yin-cong-1dao-zui-da-de-nwei-shu-lcof.100296/solution.js) [TypeScript](./src/LCR135.da-yin-cong-1dao-zui-da-de-nwei-shu-lcof.100296/solution.ts) | Easy |
| LCR136 | 删除链表的节点 | [Go](./src/LCR136.shan-chu-lian-biao-de-jie-dian-lcof.100299/solution.go) [Java](./src/LCR136.shan-chu-lian-biao-de-jie-dian-lcof.100299/solution.java) [JavaScript](./src/LCR136.shan-chu-lian-biao-de-jie-dian-lcof.100299/solution.js) [TypeScript](./src/LCR136.shan-chu-lian-biao-de-jie-dian-lcof.100299/solution.ts) | Easy |
| LCR137 | 模糊搜索验证 | [JavaScript](./src/LCR137.zheng-ze-biao-da-shi-pi-pei-lcof.100297/solution.js) [TypeScript](./src/LCR137.zheng-ze-biao-da-shi-pi-pei-lcof.100297/solution.ts) | Hard |
| LCR138 | 有效数字 | [TypeScript](./src/LCR138.biao-shi-shu-zhi-de-zi-fu-chuan-lcof.100290/solution.ts) | Medium |
| LCR139 | 训练计划 I | [Java](./src/LCR139.diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof.100291/solution.java) [JavaScript](./src/LCR139.diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof.100291/solution.js) [TypeScript](./src/LCR139.diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof.100291/solution.ts) | Easy |
| LCR140 | 训练计划 II | [Go](./src/LCR140.lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof.100294/solution.go) [JavaScript](./src/LCR140.lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof.100294/solution.js) [TypeScript](./src/LCR140.lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof.100294/solution.ts) | Easy |
| LCR141 | 训练计划 III | [Go](./src/LCR141.fan-zhuan-lian-biao-lcof.100298/solution.go) [JavaScript](./src/LCR141.fan-zhuan-lian-biao-lcof.100298/solution.js) [TypeScript](./src/LCR141.fan-zhuan-lian-biao-lcof.100298/solution.ts) | Easy |
| LCR142 | 训练计划 IV | [Go](./src/LCR142.he-bing-liang-ge-pai-xu-de-lian-biao-lcof.100286/solution.go) [JavaScript](./src/LCR142.he-bing-liang-ge-pai-xu-de-lian-biao-lcof.100286/solution.js) [TypeScript](./src/LCR142.he-bing-liang-ge-pai-xu-de-lian-biao-lcof.100286/solution.ts) | Easy |
| LCR143 | 子结构判断 | [JavaScript](./src/LCR143.shu-de-zi-jie-gou-lcof.100287/solution.js) [TypeScript](./src/LCR143.shu-de-zi-jie-gou-lcof.100287/solution.ts) | Medium |
| LCR144 | 翻转二叉树 | [Java](./src/LCR144.er-cha-shu-de-jing-xiang-lcof.100288/solution.java) [JavaScript](./src/LCR144.er-cha-shu-de-jing-xiang-lcof.100288/solution.js) [TypeScript](./src/LCR144.er-cha-shu-de-jing-xiang-lcof.100288/solution.ts) | Easy |
| LCR145 | 判断对称二叉树 | [Java](./src/LCR145.dui-cheng-de-er-cha-shu-lcof.100289/solution.java) [JavaScript](./src/LCR145.dui-cheng-de-er-cha-shu-lcof.100289/solution.js) [TypeScript](./src/LCR145.dui-cheng-de-er-cha-shu-lcof.100289/solution.ts) | Easy |
| LCR146 | 螺旋遍历二维数组 | [JavaScript](./src/LCR146.shun-shi-zhen-da-yin-ju-zhen-lcof.100293/solution.js) [TypeScript](./src/LCR146.shun-shi-zhen-da-yin-ju-zhen-lcof.100293/solution.ts) | Easy |
| LCR147 | 最小栈 | [JavaScript](./src/LCR147.bao-han-minhan-shu-de-zhan-lcof.100302/solution.js) [TypeScript](./src/LCR147.bao-han-minhan-shu-de-zhan-lcof.100302/solution.ts) | Easy |
| LCR148 | 验证图书取出顺序 | [JavaScript](./src/LCR148.zhan-de-ya-ru-dan-chu-xu-lie-lcof.100306/solution.js) [TypeScript](./src/LCR148.zhan-de-ya-ru-dan-chu-xu-lie-lcof.100306/solution.ts) | Medium |
| LCR149 | 彩灯装饰记录 I | [JavaScript](./src/LCR149.cong-shang-dao-xia-da-yin-er-cha-shu-lcof.100311/solution.js) [TypeScript](./src/LCR149.cong-shang-dao-xia-da-yin-er-cha-shu-lcof.100311/solution.ts) | Medium |
| LCR150 | 彩灯装饰记录 II | [Java](./src/LCR150.cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof.100312/solution.java) [JavaScript](./src/LCR150.cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof.100312/solution.js) [TypeScript](./src/LCR150.cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof.100312/solution.ts) | Easy |
| LCR151 | 彩灯装饰记录 III | [JavaScript](./src/LCR151.cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof.100314/solution.js) [TypeScript](./src/LCR151.cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof.100314/solution.ts) | Medium |
| LCR152 | 验证二叉搜索树的后序遍历序列 | [JavaScript](./src/LCR152.er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof.100315/solution.js) | Medium |
| LCR153 | 二叉树中和为目标值的路径 | [JavaScript](./src/LCR153.er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof.100317/solution.js) [TypeScript](./src/LCR153.er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof.100317/solution.ts) | Medium |
| LCR154 | 随机链表的复制 | [JavaScript](./src/LCR154.fu-za-lian-biao-de-fu-zhi-lcof.100300/solution.js) | Medium |
| LCR155 | 将二叉搜索树转化为排序的双向链表 | [JavaScript](./src/LCR155.er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof.100305/solution.js) | Medium |
| LCR156 | 序列化与反序列化二叉树 | [JavaScript](./src/LCR156.xu-lie-hua-er-cha-shu-lcof.100307/solution.js) | Hard |
| LCR157 | 套餐内商品的排列顺序 | [JavaScript](./src/LCR157.zi-fu-chuan-de-pai-lie-lcof.100308/solution.js) [TypeScript](./src/LCR157.zi-fu-chuan-de-pai-lie-lcof.100308/solution.ts) | Medium |
| LCR158 | 库存管理 II | [JavaScript](./src/LCR158.shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof.100310/solution.js) [TypeScript](./src/LCR158.shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof.100310/solution.ts) | Easy |
| LCR159 | 库存管理 III | [JavaScript](./src/LCR159.zui-xiao-de-kge-shu-lcof.100301/solution.js) [TypeScript](./src/LCR159.zui-xiao-de-kge-shu-lcof.100301/solution.ts) | Easy |
| LCR160 | 数据流中的中位数 | [JavaScript](./src/LCR160.shu-ju-liu-zhong-de-zhong-wei-shu-lcof.100303/solution.js) [TypeScript](./src/LCR160.shu-ju-liu-zhong-de-zhong-wei-shu-lcof.100303/solution.ts) | Hard |
| LCR161 | 连续天数的最高销售额 | [Java](./src/LCR161.lian-xu-zi-shu-zu-de-zui-da-he-lcof.100304/solution.java) [JavaScript](./src/LCR161.lian-xu-zi-shu-zu-de-zui-da-he-lcof.100304/solution.js) [TypeScript](./src/LCR161.lian-xu-zi-shu-zu-de-zui-da-he-lcof.100304/solution.ts) | Easy |
| LCR162 | 数字 1 的个数 | [JavaScript](./src/LCR162.1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof.100309/solution.js) | Hard |
| LCR163 | 找到第 k 位数字 | [JavaScript](./src/LCR163.shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof.100313/solution.js) | Medium |
| LCR164 | 破解闯关密码 | [JavaScript](./src/LCR164.ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof.100323/solution.js) [TypeScript](./src/LCR164.ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof.100323/solution.ts) | Medium |
| LCR165 | 解密数字 | [JavaScript](./src/LCR165.ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof.100325/solution.js) [TypeScript](./src/LCR165.ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof.100325/solution.ts) | Medium |
| LCR166 | 珠宝的最高价值 | [JavaScript](./src/LCR166.li-wu-de-zui-da-jie-zhi-lcof.100327/solution.js) [TypeScript](./src/LCR166.li-wu-de-zui-da-jie-zhi-lcof.100327/solution.ts) | Medium |
| LCR167 | 招式拆解 I | [JavaScript](./src/LCR167.zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof.100332/solution.js) | Medium |
| LCR168 | 丑数 | [JavaScript](./src/LCR168.chou-shu-lcof.100334/solution.js) | Medium |
| LCR169 | 招式拆解 II | [JavaScript](./src/LCR169.di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof.100316/solution.js) [TypeScript](./src/LCR169.di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof.100316/solution.ts) | Easy |
| LCR170 | 交易逆序对的总数 | [JavaScript](./src/LCR170.shu-zu-zhong-de-ni-xu-dui-lcof.100318/solution.js) | Hard |
| LCR171 | 训练计划 V | [JavaScript](./src/LCR171.liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof.100326/solution.js) | Easy |
| LCR172 | 统计目标成绩的出现次数 | [Java](./src/LCR172.zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof.100329/solution.java) [JavaScript](./src/LCR172.zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof.100329/solution.js) [TypeScript](./src/LCR172.zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof.100329/solution.ts) | Easy |
| LCR173 | 点名 | [Java](./src/LCR173.que-shi-de-shu-zi-lcof.100331/solution.java) [JavaScript](./src/LCR173.que-shi-de-shu-zi-lcof.100331/solution.js) [TypeScript](./src/LCR173.que-shi-de-shu-zi-lcof.100331/solution.ts) | Easy |
| LCR174 | 寻找二叉搜索树中的目标节点 | [JavaScript](./src/LCR174.er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof.100333/solution.js) [TypeScript](./src/LCR174.er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof.100333/solution.ts) | Easy |
| LCR175 | 计算二叉树的深度 | [Java](./src/LCR175.er-cha-shu-de-shen-du-lcof.100319/solution.java) [JavaScript](./src/LCR175.er-cha-shu-de-shen-du-lcof.100319/solution.js) [TypeScript](./src/LCR175.er-cha-shu-de-shen-du-lcof.100319/solution.ts) | Easy |
| LCR176 | 判断是否为平衡二叉树 | [Java](./src/LCR176.ping-heng-er-cha-shu-lcof.100342/solution.java) [JavaScript](./src/LCR176.ping-heng-er-cha-shu-lcof.100342/solution.js) [TypeScript](./src/LCR176.ping-heng-er-cha-shu-lcof.100342/solution.ts) | Easy |
| LCR177 | 撞色搭配 | [JavaScript](./src/LCR177.shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof.100320/solution.js) [TypeScript](./src/LCR177.shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof.100320/solution.ts) | Medium |
| LCR178 | 训练计划 VI | [JavaScript](./src/LCR178.shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof.100321/solution.js) | Medium |
| LCR179 | 查找总价格为目标值的两个商品 | [Java](./src/LCR179.he-wei-sde-liang-ge-shu-zi-lcof.100322/solution.java) [JavaScript](./src/LCR179.he-wei-sde-liang-ge-shu-zi-lcof.100322/solution.js) | Easy |
| LCR180 | 文件组合 | [JavaScript](./src/LCR180.he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof.100324/solution.js) [TypeScript](./src/LCR180.he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof.100324/solution.ts) | Easy |
| LCR181 | 字符串中的单词反转 | [Java](./src/LCR181.fan-zhuan-dan-ci-shun-xu-lcof.100328/solution.java) [JavaScript](./src/LCR181.fan-zhuan-dan-ci-shun-xu-lcof.100328/solution.js) [TypeScript](./src/LCR181.fan-zhuan-dan-ci-shun-xu-lcof.100328/solution.ts) | Easy |
| LCR182 | 动态口令 | [Java](./src/LCR182.zuo-xuan-zhuan-zi-fu-chuan-lcof.100330/solution.java) [JavaScript](./src/LCR182.zuo-xuan-zhuan-zi-fu-chuan-lcof.100330/solution.js) [TypeScript](./src/LCR182.zuo-xuan-zhuan-zi-fu-chuan-lcof.100330/solution.ts) | Easy |
| LCR183 | 望远镜中最高的海拔 | [JavaScript](./src/LCR183.hua-dong-chuang-kou-de-zui-da-zhi-lcof.100336/solution.js) [TypeScript](./src/LCR183.hua-dong-chuang-kou-de-zui-da-zhi-lcof.100336/solution.ts) | Hard |
| LCR184 | 设计自助结算系统 | [JavaScript](./src/LCR184.dui-lie-de-zui-da-zhi-lcof.100337/solution.js) [TypeScript](./src/LCR184.dui-lie-de-zui-da-zhi-lcof.100337/solution.ts) | Medium |
| LCR185 | 统计结果概率 | [JavaScript](./src/LCR185.nge-tou-zi-de-dian-shu-lcof.100339/solution.js) | Medium |
| LCR186 | 文物朝代判断 | [Java](./src/LCR186.bu-ke-pai-zhong-de-shun-zi-lcof.100341/solution.java) [JavaScript](./src/LCR186.bu-ke-pai-zhong-de-shun-zi-lcof.100341/solution.js) [TypeScript](./src/LCR186.bu-ke-pai-zhong-de-shun-zi-lcof.100341/solution.ts) | Easy |
| LCR187 | 破冰游戏 | | Easy |
| LCR188 | 买卖芯片的最佳时机 | [JavaScript](./src/LCR188.gu-piao-de-zui-da-li-run-lcof.100344/solution.js) [TypeScript](./src/LCR188.gu-piao-de-zui-da-li-run-lcof.100344/solution.ts) | Medium |
| LCR189 | 设计机械累加器 | [JavaScript](./src/LCR189.qiu-12n-lcof.100345/solution.js) [TypeScript](./src/LCR189.qiu-12n-lcof.100345/solution.ts) | Medium |
| LCR190 | 加密运算 | [JavaScript](./src/LCR190.bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof.100335/solution.js) [TypeScript](./src/LCR190.bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof.100335/solution.ts) | Easy |
| LCR191 | 按规则计算统计结果 | [JavaScript](./src/LCR191.gou-jian-cheng-ji-shu-zu-lcof.100338/solution.js) [TypeScript](./src/LCR191.gou-jian-cheng-ji-shu-zu-lcof.100338/solution.ts) | Medium |
| LCR192 | 把字符串转换成整数 (atoi) | [JavaScript](./src/LCR192.ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof.100340/solution.js) | Medium |
| LCR193 | 求二叉搜索树的最近公共祖先 | [Java](./src/LCR193.er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof.100346/solution.java) [JavaScript](./src/LCR193.er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof.100346/solution.js) [Python3](./src/LCR193.er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof.100346/solution.py) [TypeScript](./src/LCR193.er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof.100346/solution.ts) | Easy |
| LCR194 | 寻找二叉树的最近公共祖先 | [Java](./src/LCR194.er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof.100347/solution.java) [JavaScript](./src/LCR194.er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof.100347/solution.js) [Python3](./src/LCR194.er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof.100347/solution.py) [TypeScript](./src/LCR194.er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof.100347/solution.ts) | Easy |
| 面试题01_01 | Is Unique LCCI | [Java](./src/面试题01_01.is-unique-lcci.100158/solution.java) [JavaScript](./src/面试题01_01.is-unique-lcci.100158/solution.js) [TypeScript](./src/面试题01_01.is-unique-lcci.100158/solution.ts) | Easy |
| 面试题01_02 | Check Permutation LCCI | [Java](./src/面试题01_02.check-permutation-lcci.100159/solution.java) [JavaScript](./src/面试题01_02.check-permutation-lcci.100159/solution.js) [TypeScript](./src/面试题01_02.check-permutation-lcci.100159/solution.ts) | Easy |
| 面试题01_03 | String to URL LCCI | [Java](./src/面试题01_03.string-to-url-lcci.100160/solution.java) [JavaScript](./src/面试题01_03.string-to-url-lcci.100160/solution.js) [TypeScript](./src/面试题01_03.string-to-url-lcci.100160/solution.ts) | Easy |
| 面试题01_04 | Palindrome Permutation LCCI | [JavaScript](./src/面试题01_04.palindrome-permutation-lcci.100184/solution.js) [TypeScript](./src/面试题01_04.palindrome-permutation-lcci.100184/solution.ts) | Easy |
| 面试题01_05 | One Away LCCI | [JavaScript](./src/面试题01_05.one-away-lcci.1000006/solution.js) [TypeScript](./src/面试题01_05.one-away-lcci.1000006/solution.ts) | Medium |
| 面试题01_06 | Compress String LCCI | [Java](./src/面试题01_06.compress-string-lcci.100161/solution.java) [JavaScript](./src/面试题01_06.compress-string-lcci.100161/solution.js) [TypeScript](./src/面试题01_06.compress-string-lcci.100161/solution.ts) | Easy |
| 面试题01_07 | Rotate Matrix LCCI | [JavaScript](./src/面试题01_07.rotate-matrix-lcci.100185/solution.js) [TypeScript](./src/面试题01_07.rotate-matrix-lcci.100185/solution.ts) | Medium |
| 面试题01_08 | Zero Matrix LCCI | [JavaScript](./src/面试题01_08.zero-matrix-lcci.100186/solution.js) [TypeScript](./src/面试题01_08.zero-matrix-lcci.100186/solution.ts) | Medium |
| 面试题01_09 | String Rotation LCCI | [JavaScript](./src/面试题01_09.string-rotation-lcci.100162/solution.js) [TypeScript](./src/面试题01_09.string-rotation-lcci.100162/solution.ts) | Easy |
| 面试题02_01 | Remove Duplicate Node LCCI | [JavaScript](./src/面试题02_01.remove-duplicate-node-lcci.100163/solution.js) [TypeScript](./src/面试题02_01.remove-duplicate-node-lcci.100163/solution.ts) | Easy |
| 面试题02_02 | Kth Node From End of List LCCI | [JavaScript](./src/面试题02_02.kth-node-from-end-of-list-lcci.1000007/solution.js) [TypeScript](./src/面试题02_02.kth-node-from-end-of-list-lcci.1000007/solution.ts) | Easy |
| 面试题02_03 | Delete Middle Node LCCI | [JavaScript](./src/面试题02_03.delete-middle-node-lcci.100187/solution.js) | Easy |
| 面试题02_04 | Partition List LCCI | [JavaScript](./src/面试题02_04.partition-list-lcci.1000008/solution.js) | Medium |
| 面试题02_05 | Sum Lists LCCI | [JavaScript](./src/面试题02_05.sum-lists-lcci.100188/solution.js) [TypeScript](./src/面试题02_05.sum-lists-lcci.100188/solution.ts) | Medium |
| 面试题02_06 | Palindrome Linked List LCCI | [JavaScript](./src/面试题02_06.palindrome-linked-list-lcci.100164/solution.js) [TypeScript](./src/面试题02_06.palindrome-linked-list-lcci.100164/solution.ts) | Easy |
| 面试题02_07 | Intersection of Two Linked Lists LCCI | [JavaScript](./src/面试题02_07.intersection-of-two-linked-lists-lcci.100167/solution.js) | Easy |
| 面试题02_08 | Linked List Cycle LCCI | [JavaScript](./src/面试题02_08.linked-list-cycle-lcci.100168/solution.js) | Medium |
| 面试题03_01 | Three in One LCCI | [JavaScript](./src/面试题03_01.three-in-one-lcci.100172/solution.js) [TypeScript](./src/面试题03_01.three-in-one-lcci.100172/solution.ts) | Easy |
| 面试题03_02 | Min Stack LCCI | [JavaScript](./src/面试题03_02.min-stack-lcci.100169/solution.js) [TypeScript](./src/面试题03_02.min-stack-lcci.100169/solution.ts) | Easy |
| 面试题03_03 | Stack of Plates LCCI | [JavaScript](./src/面试题03_03.stack-of-plates-lcci.100195/solution.js) [TypeScript](./src/面试题03_03.stack-of-plates-lcci.100195/solution.ts) | Medium |
| 面试题03_04 | Implement Queue using Stacks LCCI | [JavaScript](./src/面试题03_04.implement-queue-using-stacks-lcci.100170/solution.js) [TypeScript](./src/面试题03_04.implement-queue-using-stacks-lcci.100170/solution.ts) | Easy |
| 面试题03_05 | Sort of Stacks LCCI | [JavaScript](./src/面试题03_05.sort-of-stacks-lcci.100173/solution.js) [TypeScript](./src/面试题03_05.sort-of-stacks-lcci.100173/solution.ts) | Medium |
| 面试题03_06 | Animal Shelter LCCI | [JavaScript](./src/面试题03_06.animal-shelter-lcci.100228/solution.js) [TypeScript](./src/面试题03_06.animal-shelter-lcci.100228/solution.ts) | Easy |
| 面试题04_01 | Route Between Nodes LCCI | [JavaScript](./src/面试题04_01.route-between-nodes-lcci.100171/solution.js) [TypeScript](./src/面试题04_01.route-between-nodes-lcci.100171/solution.ts) | Medium |
| 面试题04_02 | Minimum Height Tree LCCI | [JavaScript](./src/面试题04_02.minimum-height-tree-lcci.100174/solution.js) [TypeScript](./src/面试题04_02.minimum-height-tree-lcci.100174/solution.ts) | Easy |
| 面试题04_03 | List of Depth LCCI | [JavaScript](./src/面试题04_03.list-of-depth-lcci.100175/solution.js) [TypeScript](./src/面试题04_03.list-of-depth-lcci.100175/solution.ts) | Medium |
| 面试题04_04 | Check Balance LCCI | [Java](./src/面试题04_04.check-balance-lcci.100176/solution.java) [JavaScript](./src/面试题04_04.check-balance-lcci.100176/solution.js) [TypeScript](./src/面试题04_04.check-balance-lcci.100176/solution.ts) | Easy |
| 面试题04_05 | Legal Binary Search Tree LCCI | [JavaScript](./src/面试题04_05.legal-binary-search-tree-lcci.100177/solution.js) [TypeScript](./src/面试题04_05.legal-binary-search-tree-lcci.100177/solution.ts) | Medium |
| 面试题04_06 | Successor LCCI | [JavaScript](./src/面试题04_06.successor-lcci.100178/solution.js) | Medium |
| 面试题04_08 | First Common Ancestor LCCI | [JavaScript](./src/面试题04_08.first-common-ancestor-lcci.100179/solution.js) | Medium |
| 面试题04_09 | BST Sequences LCCI | [JavaScript](./src/面试题04_09.bst-sequences-lcci.1000010/solution.js) [TypeScript](./src/面试题04_09.bst-sequences-lcci.1000010/solution.ts) | Hard |
| 面试题04_10 | Check SubTree LCCI | [JavaScript](./src/面试题04_10.check-subtree-lcci.100229/solution.js) [TypeScript](./src/面试题04_10.check-subtree-lcci.100229/solution.ts) | Medium |
| 面试题04_12 | Paths with Sum LCCI | [JavaScript](./src/面试题04_12.paths-with-sum-lcci.1000009/solution.js) [TypeScript](./src/面试题04_12.paths-with-sum-lcci.1000009/solution.ts) | Medium |
| 面试题05_01 | Insert Into Bits LCCI | [JavaScript](./src/面试题05_01.insert-into-bits-lcci.100180/solution.js) [TypeScript](./src/面试题05_01.insert-into-bits-lcci.100180/solution.ts) | Easy |
| 面试题05_02 | Binary Number to String LCCI | [JavaScript](./src/面试题05_02.binary-number-to-string-lcci.100203/solution.js) [TypeScript](./src/面试题05_02.binary-number-to-string-lcci.100203/solution.ts) | Medium |
| 面试题05_03 | Reverse Bits LCCI | [JavaScript](./src/面试题05_03.reverse-bits-lcci.100230/solution.js) | Easy |
| 面试题05_04 | Closed Number LCCI | [TypeScript](./src/面试题05_04.closed-number-lcci.100183/solution.ts) | Medium |
| 面试题05_06 | Convert Integer LCCI | [JavaScript](./src/面试题05_06.convert-integer-lcci.100181/solution.js) [TypeScript](./src/面试题05_06.convert-integer-lcci.100181/solution.ts) | Easy |
| 面试题05_07 | Exchange LCCI | [JavaScript](./src/面试题05_07.exchange-lcci.100182/solution.js) [TypeScript](./src/面试题05_07.exchange-lcci.100182/solution.ts) | Easy |
| 面试题05_08 | Draw Line LCCI | | Medium |
| 面试题08_01 | Three Steps Problem LCCI | [Java](./src/面试题08_01.three-steps-problem-lcci.100197/solution.java) [JavaScript](./src/面试题08_01.three-steps-problem-lcci.100197/solution.js) [TypeScript](./src/面试题08_01.three-steps-problem-lcci.100197/solution.ts) | Easy |
| 面试题08_02 | Robot in a Grid LCCI | [JavaScript](./src/面试题08_02.robot-in-a-grid-lcci.1000011/solution.js) [TypeScript](./src/面试题08_02.robot-in-a-grid-lcci.1000011/solution.ts) | Medium |
| 面试题08_03 | Magic Index LCCI | [JavaScript](./src/面试题08_03.magic-index-lcci.100240/solution.js) [TypeScript](./src/面试题08_03.magic-index-lcci.100240/solution.ts) | Easy |
| 面试题08_04 | Power Set LCCI | [JavaScript](./src/面试题08_04.power-set-lcci.100198/solution.js) [TypeScript](./src/面试题08_04.power-set-lcci.100198/solution.ts) | Medium |
| 面试题08_05 | Recursive Mulitply LCCI | [JavaScript](./src/面试题08_05.recursive-mulitply-lcci.100199/solution.js) | Medium |
| 面试题08_06 | Hanota LCCI | [JavaScript](./src/面试题08_06.hanota-lcci.1000015/solution.js) [TypeScript](./src/面试题08_06.hanota-lcci.1000015/solution.ts) | Easy |
| 面试题08_07 | Permutation I LCCI | [JavaScript](./src/面试题08_07.permutation-i-lcci.100241/solution.js) [TypeScript](./src/面试题08_07.permutation-i-lcci.100241/solution.ts) | Medium |
| 面试题08_08 | Permutation II LCCI | [JavaScript](./src/面试题08_08.permutation-ii-lcci.100348/solution.js) [TypeScript](./src/面试题08_08.permutation-ii-lcci.100348/solution.ts) | Medium |
| 面试题08_09 | Bracket LCCI | [JavaScript](./src/面试题08_09.bracket-lcci.100200/solution.js) [TypeScript](./src/面试题08_09.bracket-lcci.100200/solution.ts) | Medium |
| 面试题08_10 | Color Fill LCCI | [JavaScript](./src/面试题08_10.color-fill-lcci.100201/solution.js) [TypeScript](./src/面试题08_10.color-fill-lcci.100201/solution.ts) | Easy |
| 面试题08_11 | Coin LCCI | [JavaScript](./src/面试题08_11.coin-lcci.100231/solution.js) [TypeScript](./src/面试题08_11.coin-lcci.100231/solution.ts) | Medium |
| 面试题08_12 | Eight Queens LCCI | | Hard |
| 面试题08_13 | Pile Box LCCI | [TypeScript](./src/面试题08_13.pile-box-lcci.100202/solution.ts) | Hard |
| 面试题08_14 | Boolean Evaluation LCCI | | Medium |
| 面试题10_01 | Sorted Merge LCCI | [Java](./src/面试题10_01.sorted-merge-lcci.1000012/solution.java) [JavaScript](./src/面试题10_01.sorted-merge-lcci.1000012/solution.js) [TypeScript](./src/面试题10_01.sorted-merge-lcci.1000012/solution.ts) | Easy |
| 面试题10_02 | Group Anagrams LCCI | [JavaScript](./src/面试题10_02.group-anagrams-lcci.1000040/solution.js) [TypeScript](./src/面试题10_02.group-anagrams-lcci.1000040/solution.ts) | Medium |
| 面试题10_03 | Search Rotate Array LCCI | [JavaScript](./src/面试题10_03.search-rotate-array-lcci.100232/solution.js) | Medium |
| 面试题10_05 | Sparse Array Search LCCI | [JavaScript](./src/面试题10_05.sparse-array-search-lcci.100242/solution.js) [TypeScript](./src/面试题10_05.sparse-array-search-lcci.100242/solution.ts) | Easy |
| 面试题10_09 | Sorted Matrix Search LCCI | [JavaScript](./src/面试题10_09.sorted-matrix-search-lcci.1000016/solution.js) | Medium |
| 面试题10_10 | Rank from Stream LCCI | [JavaScript](./src/面试题10_10.rank-from-stream-lcci.1000041/solution.js) [TypeScript](./src/面试题10_10.rank-from-stream-lcci.1000041/solution.ts) | Medium |
| 面试题10_11 | Peaks and Valleys LCCI | [JavaScript](./src/面试题10_11.peaks-and-valleys-lcci.1000013/solution.js) | Medium |
| 面试题16_01 | Swap Numbers LCCI | [JavaScript](./src/面试题16_01.swap-numbers-lcci.100258/solution.js) [TypeScript](./src/面试题16_01.swap-numbers-lcci.100258/solution.ts) | Medium |
| 面试题16_02 | Words Frequency LCCI | [Java](./src/面试题16_02.words-frequency-lcci.100259/solution.java) [JavaScript](./src/面试题16_02.words-frequency-lcci.100259/solution.js) [TypeScript](./src/面试题16_02.words-frequency-lcci.100259/solution.ts) | Medium |
| 面试题16_03 | Intersection LCCI | | Hard |
| 面试题16_04 | Tic-Tac-Toe LCCI | [JavaScript](./src/面试题16_04.tic-tac-toe-lcci.100261/solution.js) [TypeScript](./src/面试题16_04.tic-tac-toe-lcci.100261/solution.ts) | Medium |
| 面试题16_05 | Factorial Zeros LCCI | [Java](./src/面试题16_05.factorial-zeros-lcci.1000017/solution.java) [JavaScript](./src/面试题16_05.factorial-zeros-lcci.1000017/solution.js) [TypeScript](./src/面试题16_05.factorial-zeros-lcci.1000017/solution.ts) | Easy |
| 面试题16_06 | Smallest Difference LCCI | [JavaScript](./src/面试题16_06.smallest-difference-lcci.100262/solution.js) [TypeScript](./src/面试题16_06.smallest-difference-lcci.100262/solution.ts) | Medium |
| 面试题16_07 | Maximum LCCI | [Java](./src/面试题16_07.maximum-lcci.100349/solution.java) [JavaScript](./src/面试题16_07.maximum-lcci.100349/solution.js) [TypeScript](./src/面试题16_07.maximum-lcci.100349/solution.ts) | Easy |
| 面试题16_08 | English Int LCCI | [JavaScript](./src/面试题16_08.english-int-lcci.1000018/solution.js) | Hard |
| 面试题16_09 | Operations LCCI | [TypeScript](./src/面试题16_09.operations-lcci.100350/solution.ts) | Medium |
| 面试题16_10 | Living People LCCI | [JavaScript](./src/面试题16_10.living-people-lcci.100351/solution.js) [TypeScript](./src/面试题16_10.living-people-lcci.100351/solution.ts) | Medium |
| 面试题16_11 | Diving Board LCCI | [JavaScript](./src/面试题16_11.diving-board-lcci.100352/solution.js) [TypeScript](./src/面试题16_11.diving-board-lcci.100352/solution.ts) | Easy |
| 面试题16_13 | Bisect Squares LCCI | | Medium |
| 面试题16_14 | Best Line LCCI | | Medium |
| 面试题16_15 | Master Mind LCCI | [JavaScript](./src/面试题16_15.master-mind-lcci.100355/solution.js) [TypeScript](./src/面试题16_15.master-mind-lcci.100355/solution.ts) | Easy |
| 面试题16_16 | Sub Sort LCCI | [TypeScript](./src/面试题16_16.sub-sort-lcci.100356/solution.ts) | Medium |
| 面试题16_17 | Contiguous Sequence LCCI | [JavaScript](./src/面试题16_17.contiguous-sequence-lcci.1000003/solution.js) [TypeScript](./src/面试题16_17.contiguous-sequence-lcci.1000003/solution.ts) | Easy |
| 面试题16_18 | Pattern Matching LCCI | | Medium |
| 面试题16_19 | Pond Sizes LCCI | [JavaScript](./src/面试题16_19.pond-sizes-lcci.1000005/solution.js) [TypeScript](./src/面试题16_19.pond-sizes-lcci.1000005/solution.ts) | Medium |
| 面试题16_20 | T9 LCCI | [JavaScript](./src/面试题16_20.t9-lcci.1000047/solution.js) [TypeScript](./src/面试题16_20.t9-lcci.1000047/solution.ts) | Medium |
| 面试题16_21 | Sum Swap LCCI | [JavaScript](./src/面试题16_21.sum-swap-lcci.1000048/solution.js) [TypeScript](./src/面试题16_21.sum-swap-lcci.1000048/solution.ts) | Medium |
| 面试题16_22 | Langtons Ant LCCI | | Medium |
| 面试题16_24 | Pairs With Sum LCCI | [JavaScript](./src/面试题16_24.pairs-with-sum-lcci.1000042/solution.js) [TypeScript](./src/面试题16_24.pairs-with-sum-lcci.1000042/solution.ts) | Medium |
| 面试题16_25 | LRU Cache LCCI | [JavaScript](./src/面试题16_25.lru-cache-lcci.1000026/solution.js) | Medium |
| 面试题16_26 | Calculator LCCI | [TypeScript](./src/面试题16_26.calculator-lcci.1000027/solution.ts) | Medium |
| 面试题17_01 | Add Without Plus LCCI | [JavaScript](./src/面试题17_01.add-without-plus-lcci.1000025/solution.js) [TypeScript](./src/面试题17_01.add-without-plus-lcci.1000025/solution.ts) | Easy |
| 面试题17_04 | Missing Number LCCI | [JavaScript](./src/面试题17_04.missing-number-lcci.1000032/solution.js) [TypeScript](./src/面试题17_04.missing-number-lcci.1000032/solution.ts) | Easy |
| 面试题17_05 | Find Longest Subarray LCCI | [JavaScript](./src/面试题17_05.find-longest-subarray-lcci.1000033/solution.js) | Medium |
| 面试题17_06 | Number Of 2s In Range LCCI | | Hard |
| 面试题17_07 | Baby Names LCCI | [JavaScript](./src/面试题17_07.baby-names-lcci.1000035/solution.js) [TypeScript](./src/面试题17_07.baby-names-lcci.1000035/solution.ts) | Medium |
| 面试题17_08 | Circus Tower LCCI | | Medium |
| 面试题17_09 | Get Kth Magic Number LCCI | [JavaScript](./src/面试题17_09.get-kth-magic-number-lcci.1000037/solution.js) [TypeScript](./src/面试题17_09.get-kth-magic-number-lcci.1000037/solution.ts) | Medium |
| 面试题17_10 | Find Majority Element LCCI | [JavaScript](./src/面试题17_10.find-majority-element-lcci.1000038/solution.js) [TypeScript](./src/面试题17_10.find-majority-element-lcci.1000038/solution.ts) | Easy |
| 面试题17_11 | Find Closest LCCI | [JavaScript](./src/面试题17_11.find-closest-lcci.1000039/solution.js) [TypeScript](./src/面试题17_11.find-closest-lcci.1000039/solution.ts) | Medium |
| 面试题17_12 | BiNode LCCI | [JavaScript](./src/面试题17_12.binode-lcci.1000019/solution.js) [TypeScript](./src/面试题17_12.binode-lcci.1000019/solution.ts) | Easy |
| 面试题17_13 | Re-Space LCCI | | Medium |
| 面试题17_14 | Smallest K LCCI | [JavaScript](./src/面试题17_14.smallest-k-lcci.1000021/solution.js) [TypeScript](./src/面试题17_14.smallest-k-lcci.1000021/solution.ts) | Medium |
| 面试题17_15 | Longest Word LCCI | [TypeScript](./src/面试题17_15.longest-word-lcci.1000022/solution.ts) | Medium |
| 面试题17_16 | The Masseuse LCCI | [JavaScript](./src/面试题17_16.the-masseuse-lcci.1000023/solution.js) [TypeScript](./src/面试题17_16.the-masseuse-lcci.1000023/solution.ts) | Easy |
| 面试题17_17 | Multi Search LCCI | [TypeScript](./src/面试题17_17.multi-search-lcci.1000024/solution.ts) | Medium |
| 面试题17_18 | Shortest Supersequence LCCI | [TypeScript](./src/面试题17_18.shortest-supersequence-lcci.1000043/solution.ts) | Medium |
| 面试题17_19 | Missing Two LCCI | [JavaScript](./src/面试题17_19.missing-two-lcci.1000044/solution.js) [TypeScript](./src/面试题17_19.missing-two-lcci.1000044/solution.ts) | Hard |
| 面试题17_20 | Continuous Median LCCI | [JavaScript](./src/面试题17_20.continuous-median-lcci.1000028/solution.js) [TypeScript](./src/面试题17_20.continuous-median-lcci.1000028/solution.ts) | Hard |
| 面试题17_21 | Volume of Histogram LCCI | [JavaScript](./src/面试题17_21.volume-of-histogram-lcci.1000029/solution.js) | Hard |
| 面试题17_22 | Word Transformer LCCI | | Medium |
| 面试题17_23 | Max Black Square LCCI | | Medium |
| 面试题17_24 | Max Submatrix LCCI | | Hard |
| 面试题17_25 | Word Rectangle LCCI | | Hard |
| 面试题17_26 | Sparse Similarity LCCI | | Hard |
| LCS01 | 下载插件 | [TypeScript](./src/LCS01.Ju9Xwi.1000225/solution.ts) | Easy |
| LCS02 | 完成一半题目 | [TypeScript](./src/LCS02.WqXACV.1000226/solution.ts) | Easy |
| LCS03 | 主题空间 | [TypeScript](./src/LCS03.YesdPw.1000227/solution.ts) | Medium |
| LCR001 | 两数相除 | [TypeScript](./src/LCR001.xoh6Oh.1000228/solution.ts) | Easy |
| LCR002 | 二进制求和 | [JavaScript](./src/LCR002.JFETK5.1000231/solution.js) | Easy |
| LCR003 | 比特位计数 | [Java](./src/LCR003.w3tCBm.1000230/solution.java) [JavaScript](./src/LCR003.w3tCBm.1000230/solution.js) [TypeScript](./src/LCR003.w3tCBm.1000230/solution.ts) | Easy |
| LCR004 | 只出现一次的数字 II | [TypeScript](./src/LCR004.WGki4K.1000233/solution.ts) | Medium |
| LCR005 | 最大单词长度乘积 | [JavaScript](./src/LCR005.aseY1I.1000236/solution.js) [TypeScript](./src/LCR005.aseY1I.1000236/solution.ts) | Medium |
| LCR006 | 两数之和 II - 输入有序数组 | [JavaScript](./src/LCR006.kLl5u1.1000237/solution.js) | Easy |
| LCR007 | 三数之和 | [TypeScript](./src/LCR007.1fGaJU.1000239/solution.ts) | Medium |
| LCR008 | 长度最小的子数组 | [TypeScript](./src/LCR008.2VG8Kg.1000242/solution.ts) | Medium |
| LCR009 | 乘积小于 K 的子数组 | [TypeScript](./src/LCR009.ZVAVXX.1000244/solution.ts) | Medium |
| LCR010 | 和为 K 的子数组 | [JavaScript](./src/LCR010.QTMn0o.1000246/solution.js) [TypeScript](./src/LCR010.QTMn0o.1000246/solution.ts) | Medium |
| LCR011 | 连续数组 | [TypeScript](./src/LCR011.A1NYOS.1000247/solution.ts) | Medium |
| LCR012 | 寻找数组的中心下标 | [JavaScript](./src/LCR012.tvdfij.1000248/solution.js) [TypeScript](./src/LCR012.tvdfij.1000248/solution.ts) | Easy |
| LCR013 | 二维区域和检索 - 矩阵不可变 | [JavaScript](./src/LCR013.O4NDxx.1000249/solution.js) [TypeScript](./src/LCR013.O4NDxx.1000249/solution.ts) | Medium |
| LCR014 | 字符串的排列 | [JavaScript](./src/LCR014.MPnaiL.1000250/solution.js) [TypeScript](./src/LCR014.MPnaiL.1000250/solution.ts) | Medium |
| LCR015 | 找到字符串中所有字母异位词 | [JavaScript](./src/LCR015.VabMRr.1000251/solution.js) [TypeScript](./src/LCR015.VabMRr.1000251/solution.ts) | Medium |
| LCR016 | 无重复字符的最长子串 | [TypeScript](./src/LCR016.wtcaE1.1000252/solution.ts) | Medium |
| LCR017 | 最小覆盖子串 | [JavaScript](./src/LCR017.M1oyTv.1000253/solution.js) | Hard |
| LCR018 | 验证回文串 | [Java](./src/LCR018.XltzEq.1000254/solution.java) [JavaScript](./src/LCR018.XltzEq.1000254/solution.js) [TypeScript](./src/LCR018.XltzEq.1000254/solution.ts) | Easy |
| LCR019 | 验证回文串 II | [JavaScript](./src/LCR019.RQku0D.1000255/solution.js) | Easy |
| LCR020 | 回文子串 | [TypeScript](./src/LCR020.a7VOhD.1000256/solution.ts) | Medium |
| LCR021 | 删除链表的倒数第 N 个结点 | [JavaScript](./src/LCR021.SLwz0R.1000257/solution.js) [TypeScript](./src/LCR021.SLwz0R.1000257/solution.ts) | Medium |
| LCR022 | 环形链表 II | [JavaScript](./src/LCR022.c32eOV.1000258/solution.js) | Medium |
| LCR023 | 相交链表 | [Java](./src/LCR023.3u1WK4.1000259/solution.java) [JavaScript](./src/LCR023.3u1WK4.1000259/solution.js) | Easy |
| LCR024 | 反转链表 | [Go](./src/LCR024.UHnkqh.1000260/solution.go) [Java](./src/LCR024.UHnkqh.1000260/solution.java) [JavaScript](./src/LCR024.UHnkqh.1000260/solution.js) [TypeScript](./src/LCR024.UHnkqh.1000260/solution.ts) | Easy |
| LCR025 | 两数相加 II | [TypeScript](./src/LCR025.lMSNwu.1000261/solution.ts) | Medium |
| LCR026 | 重排链表 | [TypeScript](./src/LCR026.LGjMqU.1000262/solution.ts) | Medium |
| LCR027 | 回文链表 | [JavaScript](./src/LCR027.aMhZSa.1000263/solution.js) [TypeScript](./src/LCR027.aMhZSa.1000263/solution.ts) | Easy |
| LCR028 | 扁平化多级双向链表 | [TypeScript](./src/LCR028.Qv1Da2.1000264/solution.ts) | Medium |
| LCR029 | 循环有序列表的插入 | | Medium |
| LCR030 | O(1) 时间插入、删除和获取随机元素 | [TypeScript](./src/LCR030.FortPu.1000267/solution.ts) | Medium |
| LCR031 | LRU 缓存 | | Medium |
| LCR032 | 有效的字母异位词 | [JavaScript](./src/LCR032.dKk3P7.1000273/solution.js) | Easy |
| LCR033 | 字母异位词分组 | [JavaScript](./src/LCR033.sfvd7V.1000275/solution.js) | Medium |
| LCR034 | 验证外星语词典 | [JavaScript](./src/LCR034.lwyVBB.1000276/solution.js) | Easy |
| LCR035 | 最小时间差 | [JavaScript](./src/LCR035.569nqc.1000278/solution.js) [TypeScript](./src/LCR035.569nqc.1000278/solution.ts) | Medium |
| LCR036 | 逆波兰表达式求值 | [JavaScript](./src/LCR036.8Zf90G.1000279/solution.js) | Medium |
| LCR037 | 行星碰撞 | [JavaScript](./src/LCR037.XagZNi.1000281/solution.js) | Medium |
| LCR038 | 每日温度 | [JavaScript](./src/LCR038.iIQa4I.1000282/solution.js) | Medium |
| LCR039 | 柱状图中最大的矩形 | [TypeScript](./src/LCR039.0ynMMM.1000283/solution.ts) | Hard |
| LCR040 | 最大矩形 | [TypeScript](./src/LCR040.PLYXKQ.1000284/solution.ts) | Hard |
| LCR041 | 数据流中的移动平均值 | [JavaScript](./src/LCR041.qIsx9U.1000292/solution.js) [TypeScript](./src/LCR041.qIsx9U.1000292/solution.ts) | Easy |
| LCR042 | 最近的请求次数 | [JavaScript](./src/LCR042.H8086Q.1000293/solution.js) [TypeScript](./src/LCR042.H8086Q.1000293/solution.ts) | Easy |
| LCR043 | 完全二叉树插入器 | [TypeScript](./src/LCR043.NaqhDT.1000295/solution.ts) | Medium |
| LCR044 | 在每个树行中找最大值 | [JavaScript](./src/LCR044.hPov7L.1000297/solution.js) [TypeScript](./src/LCR044.hPov7L.1000297/solution.ts) | Medium |
| LCR045 | 找树左下角的值 | [JavaScript](./src/LCR045.LwUNpT.1000298/solution.js) | Medium |
| LCR046 | 二叉树的右视图 | [JavaScript](./src/LCR046.WNC0Lk.1000299/solution.js) | Medium |
| LCR047 | 二叉树剪枝 | [JavaScript](./src/LCR047.pOCWxh.1000301/solution.js) | Medium |
| LCR048 | 二叉树的序列化与反序列化 | [TypeScript](./src/LCR048.h54YBf.1000304/solution.ts) | Hard |
| LCR049 | 求根节点到叶节点数字之和 | [JavaScript](./src/LCR049.3Etpl5.1000306/solution.js) | Medium |
| LCR050 | 路径总和 III | [TypeScript](./src/LCR050.6eUYwP.1000307/solution.ts) | Medium |
| LCR051 | 二叉树中的最大路径和 | [TypeScript](./src/LCR051.jC7MId.1000309/solution.ts) | Hard |
| LCR052 | 递增顺序搜索树 | [JavaScript](./src/LCR052.NYBBNL.1000311/solution.js) | Easy |
| LCR053 | 二叉搜索树中的中序后继 | [JavaScript](./src/LCR053.P5rCT8.1000313/solution.js) [TypeScript](./src/LCR053.P5rCT8.1000313/solution.ts) | Medium |
| LCR054 | 把二叉搜索树转换为累加树 | [JavaScript](./src/LCR054.w6cpku.1000315/solution.js) | Medium |
| LCR055 | 二叉搜索树迭代器 | [JavaScript](./src/LCR055.kTOapQ.1000316/solution.js) [TypeScript](./src/LCR055.kTOapQ.1000316/solution.ts) | Medium |
| LCR056 | 两数之和 IV - 输入二叉搜索树 | [JavaScript](./src/LCR056.opLdQZ.1000319/solution.js) | Easy |
| LCR057 | 存在重复元素 III | | Medium |
| LCR058 | 我的日程安排表 I | [TypeScript](./src/LCR058.fi9suh.1000322/solution.ts) | Medium |
| LCR059 | 数据流中的第 K 大元素 | [JavaScript](./src/LCR059.jBjn9C.1000323/solution.js) | Easy |
| LCR060 | 前 K 个高频元素 | [TypeScript](./src/LCR060.g5c51o.1000324/solution.ts) | Medium |
| LCR061 | 查找和最小的 K 对数字 | [TypeScript](./src/LCR061.qn8gGX.1000326/solution.ts) | Medium |
| LCR062 | 实现 Trie (前缀树) | [TypeScript](./src/LCR062.QC3q1f.1000325/solution.ts) | Medium |
| LCR063 | 单词替换 | [TypeScript](./src/LCR063.UhWRSj.1000327/solution.ts) | Medium |
| LCR064 | 实现一个魔法字典 | [JavaScript](./src/LCR064.US1pGT.1000328/solution.js) | Medium |
| LCR065 | 单词的压缩编码 | [JavaScript](./src/LCR065.iSwD2y.1000329/solution.js) | Medium |
| LCR066 | 键值映射 | [TypeScript](./src/LCR066.z1R5dt.1000330/solution.ts) | Medium |
| LCR067 | 数组中两个数的最大异或值 | | Medium |
| LCR068 | 搜索插入位置 | [JavaScript](./src/LCR068.N6YdxV.1000332/solution.js) | Easy |
| LCR069 | 山脉数组的峰顶索引 | [JavaScript](./src/LCR069.B1IidL.1000333/solution.js) | Easy |
| LCR070 | 有序数组中的单一元素 | [JavaScript](./src/LCR070.skFtm2.1000334/solution.js) [TypeScript](./src/LCR070.skFtm2.1000334/solution.ts) | Medium |
| LCR071 | 按权重随机选择 | [TypeScript](./src/LCR071.cuyjEf.1000335/solution.ts) | Medium |
| LCR072 | x 的平方根 | [JavaScript](./src/LCR072.jJ0w9p.1000336/solution.js) [TypeScript](./src/LCR072.jJ0w9p.1000336/solution.ts) | Easy |
| LCR073 | 爱吃香蕉的狒狒 | [JavaScript](./src/LCR073.nZZqjQ.1000337/solution.js) | Medium |
| LCR074 | 合并区间 | [TypeScript](./src/LCR074.SsGoHC.1000338/solution.ts) | Medium |
| LCR075 | 数组的相对排序 | [JavaScript](./src/LCR075.0H97ZC.1000339/solution.js) [TypeScript](./src/LCR075.0H97ZC.1000339/solution.ts) | Easy |
| LCR076 | 数组中的第 K 个最大元素 | [TypeScript](./src/LCR076.xx4gT2.1000340/solution.ts) | Medium |
| LCR077 | 排序链表 | [TypeScript](./src/LCR077.7WHec2.1000341/solution.ts) | Medium |
| LCR078 | 合并 K 个升序链表 | [TypeScript](./src/LCR078.vvXgSW.1000342/solution.ts) | Hard |
| LCR079 | 子集 | [JavaScript](./src/LCR079.TVdhkn.1000343/solution.js) [TypeScript](./src/LCR079.TVdhkn.1000343/solution.ts) | Medium |
| LCR080 | 组合 | [JavaScript](./src/LCR080.uUsW3B.1000344/solution.js) [TypeScript](./src/LCR080.uUsW3B.1000344/solution.ts) | Medium |
| LCR081 | 组合总和 | [JavaScript](./src/LCR081.Ygoe9J.1000229/solution.js) [TypeScript](./src/LCR081.Ygoe9J.1000229/solution.ts) | Medium |
| LCR082 | 组合总和 II | [JavaScript](./src/LCR082.4sjJUc.1000232/solution.js) [TypeScript](./src/LCR082.4sjJUc.1000232/solution.ts) | Medium |
| LCR083 | 全排列 | [JavaScript](./src/LCR083.VvJkup.1000234/solution.js) [TypeScript](./src/LCR083.VvJkup.1000234/solution.ts) | Medium |
| LCR084 | 全排列 II | [JavaScript](./src/LCR084.7p8L0Z.1000235/solution.js) [TypeScript](./src/LCR084.7p8L0Z.1000235/solution.ts) | Medium |
| LCR085 | 括号生成 | [JavaScript](./src/LCR085.IDBivT.1000238/solution.js) [TypeScript](./src/LCR085.IDBivT.1000238/solution.ts) | Medium |
| LCR086 | 分割回文串 | [TypeScript](./src/LCR086.M99OJA.1000240/solution.ts) | Medium |
| LCR087 | 复原 IP 地址 | [TypeScript](./src/LCR087.0on3uN.1000241/solution.ts) | Medium |
| LCR088 | 使用最小花费爬楼梯 | [JavaScript](./src/LCR088.GzCJIP.1000243/solution.js) [TypeScript](./src/LCR088.GzCJIP.1000243/solution.ts) | Easy |
| LCR089 | 打家劫舍 | [JavaScript](./src/LCR089.Gu0c2T.1000245/solution.js) | Medium |
| LCR090 | 打家劫舍 II | [TypeScript](./src/LCR090.PzWKhm.1000266/solution.ts) | Medium |
| LCR091 | 粉刷房子 | [TypeScript](./src/LCR091.JEj789.1000268/solution.ts) | Medium |
| LCR092 | 将字符串翻转到单调递增 | [JavaScript](./src/LCR092.cyJERH.1000269/solution.js) [TypeScript](./src/LCR092.cyJERH.1000269/solution.ts) | Medium |
| LCR093 | 最长的斐波那契子序列的长度 | [JavaScript](./src/LCR093.Q91FMA.1000271/solution.js) | Medium |
| LCR094 | 分割回文串 II | [JavaScript](./src/LCR094.omKAoA.1000272/solution.js) | Hard |
| LCR095 | 最长公共子序列 | [TypeScript](./src/LCR095.qJnOS7.1000274/solution.ts) | Medium |
| LCR096 | 交错字符串 | [JavaScript](./src/LCR096.IY6buf.1000277/solution.js) | Medium |
| LCR097 | 不同的子序列 | [JavaScript](./src/LCR097.21dk04.1000280/solution.js) | Hard |
| LCR098 | 不同路径 | [JavaScript](./src/LCR098.2AoeFn.1000345/solution.js) [TypeScript](./src/LCR098.2AoeFn.1000345/solution.ts) | Medium |
| LCR099 | 最小路径和 | [JavaScript](./src/LCR099.0i0mDW.1000285/solution.js) [TypeScript](./src/LCR099.0i0mDW.1000285/solution.ts) | Medium |
| LCR100 | 三角形最小路径和 | [JavaScript](./src/LCR100.IlPe0q.1000286/solution.js) [TypeScript](./src/LCR100.IlPe0q.1000286/solution.ts) | Medium |
| LCR101 | 分割等和子集 | [Java](./src/LCR101.NUPfPr.1000287/solution.java) [JavaScript](./src/LCR101.NUPfPr.1000287/solution.js) [TypeScript](./src/LCR101.NUPfPr.1000287/solution.ts) | Easy |
| LCR102 | 目标和 | [TypeScript](./src/LCR102.YaVDxD.1000288/solution.ts) | Medium |
| LCR103 | 零钱兑换 | [JavaScript](./src/LCR103.gaM7Ch.1000289/solution.js) [TypeScript](./src/LCR103.gaM7Ch.1000289/solution.ts) | Medium |
| LCR104 | 组合总和 Ⅳ | [TypeScript](./src/LCR104.D0F0SV.1000290/solution.ts) | Medium |
| LCR105 | 岛屿的最大面积 | [JavaScript](./src/LCR105.ZL6zAn.1000291/solution.js) [TypeScript](./src/LCR105.ZL6zAn.1000291/solution.ts) | Medium |
| LCR106 | 判断二分图 | [JavaScript](./src/LCR106.vEAB3K.1000294/solution.js) [TypeScript](./src/LCR106.vEAB3K.1000294/solution.ts) | Medium |
| LCR107 | 01 矩阵 | [JavaScript](./src/LCR107.2bCMpM.1000296/solution.js) [TypeScript](./src/LCR107.2bCMpM.1000296/solution.ts) | Medium |
| LCR108 | 单词接龙 | [JavaScript](./src/LCR108.om3reC.1000300/solution.js) | Hard |
| LCR109 | 打开转盘锁 | [JavaScript](./src/LCR109.zlDJc7.1000302/solution.js) | Medium |
| LCR110 | 所有可能的路径 | [JavaScript](./src/LCR110.bP4bmD.1000303/solution.js) [TypeScript](./src/LCR110.bP4bmD.1000303/solution.ts) | Medium |
| LCR111 | 除法求值 | [JavaScript](./src/LCR111.vlzXQL.1000305/solution.js) [TypeScript](./src/LCR111.vlzXQL.1000305/solution.ts) | Medium |
| LCR112 | 矩阵中的最长递增路径 | | Hard |
| LCR113 | 课程表 II | [JavaScript](./src/LCR113.QA2IGt.1000310/solution.js) [TypeScript](./src/LCR113.QA2IGt.1000310/solution.ts) | Medium |
| LCR114 | 火星词典 | [JavaScript](./src/LCR114.Jf1JuT.1000312/solution.js) [TypeScript](./src/LCR114.Jf1JuT.1000312/solution.ts) | Hard |
| LCR115 | 序列重建 | | Medium |
| LCR116 | 省份数量 | [JavaScript](./src/LCR116.bLyHh0.1000346/solution.js) | Medium |
| LCR117 | 相似字符串组 | | Hard |
| LCR118 | 冗余连接 | | Medium |
| LCR119 | 最长连续序列 | [JavaScript](./src/LCR119.WhsWhI.1000320/solution.js) | Medium |