Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/luliyucoordinate/leetcode
Play Leetcode with different programming language
https://github.com/luliyucoordinate/leetcode
c cpp go java javascript leetcode rust
Last synced: about 1 month ago
JSON representation
Play Leetcode with different programming language
- Host: GitHub
- URL: https://github.com/luliyucoordinate/leetcode
- Owner: luliyucoordinate
- Created: 2018-05-09T12:30:59.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2023-05-24T11:57:20.000Z (over 1 year ago)
- Last Synced: 2024-10-09T13:41:28.629Z (about 1 month ago)
- Topics: c, cpp, go, java, javascript, leetcode, rust
- Language: C++
- Homepage:
- Size: 1.64 MB
- Stars: 1,465
- Watchers: 56
- Forks: 480
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
LeetCode
========
| # | Title | c | c++ | python | go | js | java | rust | Difficulty |
|---| ----- | -------- | ---------- | ---------- | ---------- | ---------- | ---------- | ---------- | ---------- |
|0001|[Two Sum](https://leetcode.com/problems/two-sum/) | [c](./src/0001-Two-Sum/two_sum.c) | [c++](./src/0001-Two-Sum/two_sum.cpp) |[python](./src/0001-Two-Sum/two_sum.py)|[go](./src/0001-Two-Sum/two_sum.go)|[js](./src/0001-Two-Sum/two_sum.js)|[java](./src/0001-Two-Sum/two_sum.java)||Easy|
|0002|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | [c](./src/0002-Add-Two-Numbers/Add_Two_Numbers.c) | [c++](./src/0002-Add-Two-Numbers/Add_Two_Numbers.cpp) |[python](./src/0002-Add-Two-Numbers/Add_Two_Numbers.py)|[go](./src/0002-Add-Two-Numbers/Add_Two_Numbers.go)||||Medium|
|0003|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) || [c++](./src/0003-Longest-Substring-Without-Repeating-Characters/0003.cpp) |[python](./src/0003-Longest-Substring-Without-Repeating-Characters/0003.py)|[go](./src/0003-Longest-Substring-Without-Repeating-Characters/0003.go)||||Medium|
|0004|[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) || [c++](./src/0004-Median-of-Two-Sorted-Arrays/0004.cpp) |[python](./src/0004-Median-of-Two-Sorted-Arrays/0004.py)|||||Hard|
|0005|[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) || [c++](./src/0005-Longest-Palindromic-Substring/0005.cpp) |[python](./src/0005-Longest-Palindromic-Substring/0005.py)|[go](./src/0005-Longest-Palindromic-Substring/0005.go)||||Medium|
|0006|[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/) || [c++](./src/0006-ZigZag-Conversion/0006.cpp) |[python](./src/0006-ZigZag-Conversion/0006.py)|[go](./src/0006-ZigZag-Conversion/0006.go)||||Medium|
|0007|[Reverse Integer](https://leetcode.com/problems/reverse-integer/) || [c++](./src/0007-Reverse-Integer/0007.cpp) |[python](./src/0007-Reverse-Integer/0007.py)|[go](./src/0007-Reverse-Integer/0007.go)||||Easy|
|0008|[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/) || [c++](./src/0008-String-to-Integer-(atoi)/0008.cpp) |[python](./src/0008-String-to-Integer-(atoi)/0008.py)|[go](./src/0008-String-to-Integer-(atoi)/0008.go)||||Medium|
|0009|[Palindrome Number](https://leetcode.com/problems/palindrome-number/) || [c++](./src/0009-Palindrome-Number/0009.cpp) |[python](./src/0009-Palindrome-Number/0009.py)|[go](./src/0009-Palindrome-Number/0009.go)|[js](./src/0009-Palindrome-Number/0009.js)|||Easy|
|0010|[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) || [c++](./src/0010-Regular-Expression-Matching/0010.cpp) |[python](./src/0010-Regular-Expression-Matching/0010.py)|[go](./src/0010-Regular-Expression-Matching/0010.go)||||Hard|
|0011|[Container With Most Water](https://leetcode.com/problems/container-with-most-water/) || [c++](./src/0011-Container-With-Most-Water/0011.cpp)|[python](./src/0011-Container-With-Most-Water/0011.py)|[go](./src/0011-Container-With-Most-Water/0011.go)||||Medium|
|0012|[Integer to Roman](https://leetcode.com/problems/integer-to-roman) || [c++](./src/0012-Integer-to-Roman/0012.cpp) |[python](./src/0012-Integer-to-Roman/0012.py)|[go](./src/0012-Integer-to-Roman/0012.go)||||Medium|
|0013|[Roman to Integer](https://leetcode.com/problems/roman-to-integer/) || [c++](./src/0013-Roman-to-Integer/0013.cpp) |[python](./src/0013-Roman-to-Integer/0013.py)|[go](./src/0013-Roman-to-Integer/0013.go)|[js](./src/0013-Roman-to-Integer/0013.js)|[java](./src/0013-Roman-to-Integer/0013.java)||Easy|
|0014|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) || [c++](./src/0014-Longest-Common-Prefix/0014.cpp) |[python](./src/0014-Longest-Common-Prefix/0014.py)|[go](./src/0014-Longest-Common-Prefix/0014.go)||||Easy|
|0015|[3Sum](https://leetcode.com/problems/3sum/) || [c++](./src/0015-3Sum/0015.cpp) |[python](./src/0015-3Sum/0015.py)|[go](./src/0015-3Sum/0015.go)||||Medium|
|0016|[3Sum Closest](https://leetcode.com/problems/3Sum-Closest/) || [c++](./src/0016-3Sum-Closest/0016.cpp) |[python](./src/0016-3Sum-Closest/0016.py)|||||Medium|
|0017|[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) || [c++](./src/0017-Letter-Combinations-of-a-Phone-Number/0017.cpp) |[python](./src/0017-Letter-Combinations-of-a-Phone-Number/0017.py)|||||Medium|
|0018|[4Sum](https://leetcode.com/problems/4sum/) || [c++](./src/0018-4Sum/0018.cpp) |[python](./src/0018-4Sum/0018.py)|||||Medium|
|0019|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) || [c++](./src/0019-Remove-Nth-Node-From-End-of-List/0019.cpp) |[python](./src/0019-Remove-Nth-Node-From-End-of-List/0019.py)|||||Medium|
|0020|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) || [c++](./src/0020-Valid-Parentheses/0020.cpp) |[python](./src/0020-Valid-Parentheses/0020.py)|[go](./src/0020-Valid-Parentheses/0020.go)||[java](./src/0020-Valid-Parentheses/0020.java)||Easy|
|0021|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) || [c++](./src/0021-Merge-Two-Sorted-Lists/0021.cpp) |[python](./src/0021-Merge-Two-Sorted-Lists/0021.py)|||||Easy|
|0022|[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) || [c++](./src/0022-Generate-Parentheses/0022.cpp) |[python](./src/0022-Generate-Parentheses/0022.py)|||||Medium|
|0023|[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) || [c++](./src/0023-Merge-k-Sorted-Lists/0023.cpp) |[python](./src/0023-Merge-k-Sorted-Lists/0023.py)|||||Hard|
|0024|[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) || [c++](./src/0024-Swap-Nodes-in-Pairs/0024.cpp) |[python](./src/0024-Swap-Nodes-in-Pairs/0024.py)|||||Medium|
|0025|[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) || [c++](./src/0025-Reverse-Nodes-in-k-Group/0025.cpp) |[python](./src/0025-Reverse-Nodes-in-k-Group/0025.py)|||||Hard|
|0026|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) || [c++](./src/0026-Remove-Duplicates-from-Sorted-Array/0026.cpp) |[python](./src/0026-Remove-Duplicates-from-Sorted-Array/0026.py)|[go](./src/0026-Remove-Duplicates-from-Sorted-Array/0026.go)|[js](./src/0026-Remove-Duplicates-from-Sorted-Array/0026.js)|||Easy|
|0027|[Remove Element](https://leetcode.com/problems/remove-element/) || [c++](./src/0027-Remove-Element/0027.cpp) |[python](./src/0027-Remove-Element/0027.py)|[go](./src/0027-Remove-Element/0027.go)||||Easy|
|0028|[Implement strStr()](https://leetcode.com/problems/implement-strstr/) || [c++](./src/0028-Implement-strStr()/0028.cpp) |[python](./src/0028-Implement-strStr()/0028.py)|||||Easy|
|0029|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) || [c++](./src/0029-Divide-Two-Integers/0029.cpp) |[python](./src/0029-Divide-Two-Integers/0029.py)|||||Medium|
|0030|[Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/) || [c++](./src/0030-Substring-with-Concatenation-of-All-Words/0030.cpp) |[python](./src/0030-Substring-with-Concatenation-of-All-Words/0030.py)|||||Hard|
|0031|[Next Permutation](https://leetcode.com/problems/next-permutation/) || [c++](./src/0031-Next-Permutation/0031.cpp) |[python](./src/0031-Next-Permutation/0031.py)|||||Medium|
|0032|[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) || [c++](./src/0032-Longest-Valid-Parentheses/0032.cpp) |[python](./src/0032-Longest-Valid-Parentheses/0032.py)|||||Hard|
|0033|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) || [c++](./src/0033-Search-in-Rotated-Sorted-Array/0033.cpp) |[python](./src/0033-Search-in-Rotated-Sorted-Array/0033.py)|[go](./src/0033-Search-in-Rotated-Sorted-Array/0033.go)||||Medium|
|0034|[Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/) || [c++](./src/0034-Find-First-and-Last-Position-of-Element-in-Sorted-Array/0034.cpp) |[python](./src/0034-Find-First-and-Last-Position-of-Element-in-Sorted-Array/0034.py)|||||Medium|
|0035|[Search Insert Position](https://leetcode.com/problems/search-insert-position/) || [c++](./src/0035-Search-Insert-Position/0035.cpp) |[python](./src/0035-Search-Insert-Position/0035.py)|[go](./src/0035-Search-Insert-Position/0035.go)||||Easy|
|0036|[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) || [c++](./src/0036-Valid-Sudoku/0036.cpp) |[python](./src/0036-Valid-Sudoku/0036.py)|||||Medium|
|0037|[Sudoku Solver](https://leetcode.com/problems/sudoku-solver/) || [c++](./src/0037-Sudoku-Solver/0037.cpp) |[python](./src/0037-Sudoku-Solver/0037.py)|||||Hard|
|0038|[Count and Say](https://leetcode.com/problems/count-and-say/) || [c++](./src/0038-Count-and-Say/0038.cpp) |[python](./src/0038-Count-and-Say/0038.py)|||||Easy|
|0039|[Combination Sum](https://leetcode.com/problems/combination-sum/) || [c++](./src/0039-Combination-Sum/0039.cpp) |[python](./src/0039-Combination-Sum/0039.py)|||||Medium|
|0040|[Combination Sum II](https://leetcode.com/problems/combination-sum-ii/) || [c++](./src/0040-Combination-Sum-II/0040.cpp) |[python](./src/0040-Combination-Sum-II/0040.py)|||||Medium|
|0041|[First Missing Positive](https://leetcode.com/problems/first-missing-positive/) || [c++](./src/0041-First-Missing-Positive/0041.cpp) |[python](./src/0041-First-Missing-Positive/0041.py)|||||Hard|
|0042|[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) || [c++](./src/0042-Trapping-Rain-Water/0042.cpp) |[python](./src/0042-Trapping-Rain-Water/0042.py)|||||Hard|
|0043|[Multiply Strings](https://leetcode.com/problems/multiply-strings/) || [c++](./src/0043-Multiply-Strings/0043.cpp) |[python](./src/0043-Multiply-Strings/0043.py)|||||Medium|
|0044|[Wildcard Matching](https://leetcode.com/problems/wildcard-matching/) || [c++](./src/0044-Wildcard-Matching/0044.cpp) |[python](./src/0044-Wildcard-Matching/0044.py)|||||Hard|
|0045|[Jump Game II](https://leetcode.com/problems/jump-game-ii/) || [c++](./src/0045-Jump-Game-II/0045.cpp) |[python](./src/0045-Jump-Game-II/0045.py)|||||Hard|
|0046|[Permutations](https://leetcode.com/problems/permutations/) || [c++](./src/0046-Permutations/0046.cpp) |[python](./src/0046-Permutations/0046.py)|||[java](./src/0046-Permutations/0046.java)||Medium|
|0047|[Permutations II](https://leetcode.com/problems/permutations-ii/) || [c++](./src/0047-Permutations-II/0047.cpp) |[python](./src/0047-Permutations-II/0047.py)|||[java](./src/0047-Permutations-II/0047.java)||Medium|
|0048|[Rotate Image](https://leetcode.com/problems/rotate-image/) || [c++](./src/0048-Rotate-Image/0048.cpp) |[python](./src/0048-Rotate-Image/0048.py)|[go](./src/0048-Rotate-Image/0048.go)||||Medium|
|0049|[Group Anagrams](https://leetcode.com/problems/group-anagrams/) || [c++](./src/0049-Group-Anagrams/0049.cpp) |[python](./src/0049-Group-Anagrams/0049.py)|[go](./src/0049-Group-Anagrams/0049.go)||||Medium|
|0050|[Pow(x, n)](https://leetcode.com/problems/powx-n/) || [c++](./src/0050-Pow(x,n)/0050.cpp) |[python](./src/0050-Pow(x,n)/0050.py)|||||Medium|
|0051|[N-Queens](https://leetcode.com/problems/n-queens/) || [c++](./src/0051-N-Queens/0051.cpp) |[python](./src/0051-N-Queens/0051.py)|||||Hard|
|0052|[N-Queens II](https://leetcode.com/problems/n-queens-ii/) || [c++](./src/0052-N-Queens-II/0052.cpp) |[python](./src/0052-N-Queens-II/0052.py)|||||Hard|
|0053|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) || [c++](./src/0053-Maximum-Subarray/0053.cpp) |[python](./src/0053-Maximum-Subarray/0053.py)|||||Easy|
|0054|[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) || [c++](./src/0054-Spiral-Matrix/0054.cpp) |[python](./src/0054-Spiral-Matrix/0054.py)|||||Medium|
|0055|[Jump Game](https://leetcode.com/problems/jump-game/) || [c++](./src/0055-Jump-Game/0055.cpp) |[python](./src/0055-Jump-Game/0055.py)|[go](./src/0055-Jump-Game/0055.go)||||Medium|
|0056|[Merge Intervals](https://leetcode.com/problems/merge-intervals/) || [c++](./src/0056-Merge-Intervals/0056.cpp) |[python](./src/0056-Merge-Intervals/0056.py)|||||Medium|
|0057|[Insert Interval](https://leetcode.com/problems/insert-interval/) || [c++](./src/0057-Insert-Interval/0057.cpp) ||||||Medium|
|0058|[Length of Last Word](https://leetcode.com/problems/length-of-last-word/) || [c++](./src/0058-Length-of-Last-Word/0058.cpp) |[python](./src/0058-Length-of-Last-Word/0058.py)||[js](./src/0058-Length-of-Last-Word/0058.js)|| [rust](./src/0058-Length-of-Last-Word/0058.rs)|Easy|
|0059|[Spiral Matrix II](https://leetcode.com/problem/spiral-matrix-ii/) || [c++](./src/0059-Spiral-Matrix-II/0059.cpp) |[python](./src/0059-Spiral-Matrix-II/0059.py)|||||Hard|
|0060|[Permutation Sequence](https://leetcode.com/problems/permutation-sequence/) || [c++](./src/0060-Permutation-Sequence/0060.cpp) |[python](./src/0060-Permutation-Sequence/0060.py)|||||Medium|
|0061|[Rotate List](https://leetcode.com/problems/rotate-list/) || [c++](./src/0061-Rotate-List/0061.cpp) |[python](./src/0061-Rotate-List/0061.py)|||||Medium|
|0062|[Unique Paths](https://leetcode.com/problems/unique-paths/) || [c++](./src/0062-Unique-Paths/0062.cpp) |[python](./src/0062-Unique-Paths/0062.py)|||||Medium|
|0063|[Unique Paths II](https://leetcode.com/problems/unique-paths-ii/) || [c++](./src/0063-Unique-Paths-II/0063.cpp) |[python](./src/0063-Unique-Paths-II/0063.py)|||||Medium|
|0064|[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) || [c++](./src/0064-Minimum-Path-Sum/0064.cpp) |[python](./src/0064-Minimum-Path-Sum/0064.py)|||||Medium|
|0065|[Valid Number](https://leetcode.com/problems/valid-number/) || [c++](./src/0065-Valid-Number/0065.cpp) |[python](./src/0065-Valid-Number/0065.py)|||||Hard|
|0066|[Plus One](https://leetcode.com/problems/plus-one/) || [c++](./src/0066-Plus-One/0066.cpp) |[python](./src/0066-Plus-One/0066.py)||||[rust](./src/0066-Plus-One/0066.rs)|Easy|
|0067|[Add Binary](https://leetcode.com/problems/add-binary/) || [c++](./src/0067-Add-Binary/0067.cpp) |[python](./src/0067-Add-Binary/0067.py)|||||Easy|
|0068|[Text Justification](https://leetcode.com/problems/text-justification/) || [c++](./src/0068-Text-Justification/0068.cpp) |[python](./src/0068-Text-Justification/0068.py)|||||Hard|
|0069|[Sqrt(x)](https://leetcode.com/problems/sqrtx/) || [c++](./src/0069-Sqrt(x)/0069.cpp) |[python](./src/0069-Sqrt(x)/0069.py)|[go](./src/0069-Sqrt(x)/0069.go)||||Easy|
|0070|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) || [c++](./src0070-Climbing-Stairs/0070.cpp) |[python](./src/0070-Climbing-Stairs/0070.py)|[go](./src/0070-Climbing-Stairs/0070.go)||||Easy|
|0071|[Simplify Path](https://leetcode.com/problems/simplify-path/) || [c++](./src/0071-Simplify-Path/0071.cpp) |[python](./src/0071-Simplify-Path/0071.py)|||||Medium|
|0072|[Edit Distance](https://leetcode.com/problems/edit-distance/) || [c++](./src/0072-Edit-Distance/0072.cpp) |[python](./src/0072-Edit-Distance/0072.py)|||||Hard|
|0073|[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) || [c++](./src/0073-Set-Matrix-Zeroes/0073.cpp) |[python](./src/0073-Set-Matrix-Zeroes/0073.py)|||||Medium|
|0074|[Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/) || [c++](./src/0074-Search-a-2D-Matrix/0074.cpp) |[python](./src/0074-Search-a-2D-Matrix/0074.py)|||||Medium|
|0075|[Sort Colors](https://leetcode.com/problems/sort-colors/) || [c++](./src/0075-Sort-Colors/0075.cpp) |[python](./src/0075-Sort-Colors/0075.py)|[go](./src/0075-Sort-Colors/0075.go)||||Medium|
|0076|[Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) || [c++](./src/0076-Minimum-Window-Substring/0076.cpp) |[python](./src/0076-Minimum-Window-Substring/0076.py)|||||Easy|
|0077|[Combinations](https://leetcode.com/problems/combinations/) || [c++](./src/0077-Combinations/0077.cpp) |[python](./src/0077-Combinations/0077.py)|||||Medium|
|0078|[Subsets](https://leetcode.com/problems/subsets/) || [c++](./src/0078-Subsets/0078.cpp) |[python](./src/0078-Subsets/0078.py)|||||Medium|
|0079|[Word Search](https://leetcode.com/problems/word-search/) || [c++](./src/0079-Word-Search/0079.cpp) |[python](./src/0079-Word-Search/0079.py)|||||Medium|
|0080|[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) || [c++]() |[python](./src/0080-Remove-Duplicates-from-Sorted-Array-II/0080.py)|||||Medium|
|0081|[Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/) || [c++](./src/0081-Search-in-Rotated-Sorted-Array-II/0081.py) |[python](./src/0081-Search-in-Rotated-Sorted-Array-II/0081.py)|||||Medium|
|0082|[Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/) || [c++](./src/0082-Remove-Duplicates-from-Sorted-List-II/0082.cpp) |[python](./src/0082-Remove-Duplicates-from-Sorted-List-II/0082.py)|||||Medium|
|0083|[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) || [c++](./src/0083-Remove-Duplicates-from-Sorted-List/0083.cpp) |[python](./src/0083-Remove-Duplicates-from-Sorted-List/0083.py)|||||Easy|
|0084|[Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/) || [c++](./src/0084-Largest-Rectangle-in-Histogram/0084.cpp) |[python](./src/0084-Largest-Rectangle-in-Histogram/0084.py)|||||Hard|
|0085|[Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/) || [c++](./src/0085-Maximal-Rectangle/0085.cpp) |[python](./src/0085-Maximal-Rectangle/0085.py)|||||Hard|
|0086|[Partition List](https://leetcode.com/problems/partition-list/) || [c++](./src/0086-Partition-List/0086.cpp) |[python](./src/0086-Partition-List/0086.py)|||||Medium|
|0087|[Scramble String](https://leetcode.com/problems/scramble-string/) || [c++](./src/0087-Scramble-String/0087.cpp) |[python](./src/0087-Scramble-String/0087.py)|||||Hard|
|0088|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) || [c++](./src/0088-Merge-Sorted-Array/0088.cpp) |[python](./src/0088-Merge-Sorted-Array/0088.py)|||||Easy|
|0089|[Gray Code](https://leetcode.com/problems/gray-code/) || [c++](./src/0089-Gray-Code/0089.cpp) |[python](./src/0089-Gray-Code/0089.py)|||||Medium|
|0090|[Subsets II](https://leetcode.com/problems/subsets-ii/) || [c++](./src/0090-Subsets-II/0090.cpp) |[python](./src/0090-Subsets-II/0090.py)|||||Medium|
|0091|[Decode Ways](https://leetcode.com/problems/decode-ways/) || [c++](./src/0091-Decode-Ways/0091.cpp) |[python](./src/0091-Decode-Ways/0091.py)|||||Medium|
|0092|[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/) || [c++](./src/0092-Reverse-Linked-List-II/0092.cpp) |[python](./src/0092-Reverse-Linked-List-II/0092.py)|||||Medium|
|0093|[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/) || [c++](./src/0093-Restore-IP-Addresses/0093.cpp) |[python](./src/0093-Restore-IP-Addresses/0093.py)|||||Medium|
|0094|[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) || [c++](./src/0094-Binary-Tree-Inorder-Traversal/0094.cpp) |[python](./src/0094-Binary-Tree-Inorder-Traversal/0094.py)|||||Medium|
|0095|[Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/) || [c++](./src/0095-Unique-Binary-Search-Trees-II/0095.cpp) |[python](./src/0095-Unique-Binary-Search-Trees-II/0095.py)|||||Medium|
|0096|[Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/) || [c++](./src/0096-Unique-Binary-Search-Trees/0096.cpp) |[python](./src/0096-Unique-Binary-Search-Trees/0096.py)|||||Medium|
|0097|[Interleaving String](https://leetcode.com/problems/interleaving-string/) || [c++](./src/0097-Interleaving-String/0097.cpp) |[python](./src/0097-Interleaving-String/0097.py)|||||Medium|
|0098|[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) || [c++](./src/0098-Validate-Binary-Search-Tree/0098.cpp) |[python](./src/0098-Validate-Binary-Search-Tree/0098.py)|||||Medium|
|0099|[Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/) || [c++](./src/0087-Scramble-String/0087.cpp) |[python](./src/0087-Scramble-String/0087.py)|||||Hard|
|0100|[Same Tree](https://leetcode.com/problems/same-tree/) || [c++](./src/0100-Same-Tree/0100.cpp) |[python](./src/0100-Same-Tree/0100.py)|||||Easy|
|0101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) || [c++](./src/0101-Symmetric-Tree/0101.cpp) |[python](./src/0101-Symmetric-Tree/0101.py)|||||Easy|
|0102|[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) || [c++](./src/0102-Binary-Tree-Level-Order-Traversal/0102.cpp) |[python](./src/0102-Binary-Tree-Level-Order-Traversal/0102.py)|||||Medium|
|0103|[Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/) || [c++](./src/0103-Binary-Tree-Zigzag-Level-Order-Traversal/0103.cpp) |[python](./src/0103-Binary-Tree-Zigzag-Level-Order-Traversal/0103.py)|||||Medium|
|0104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) || [c++](./src/0104-Maximum-Depth-of-Binary-Tree/0104.cpp) |[python](./src/0104-Maximum-Depth-of-Binary-Tree/0104.py)|||||Easy|
|0105|[Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) || [c++](./src/0105-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/0105.cpp) |[python](./src/0105-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/0105.py)|||||Medium|
|0106|[Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) || [c++](./src/0106-Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/0106.cpp) |[python](./src/0106-Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/0106.py)|||||Medium|
|0107|[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/) || [c++](./src/0107-Binary-Tree-Level-Order-Traversal-II/0107.cpp) |[python](./src/0107-Binary-Tree-Level-Order-Traversal-II/0107.py)|||||Easy|
|0108|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) || [c++](./src/0108-Convert-Sorted-Array-to-Binary-Search-Tree/0108.cpp) |[python](./src/0108-Convert-Sorted-Array-to-Binary-Search-Tree/0108.py)|||||Easy|
|0109|[Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/) || [c++](./src/0109-Convert-Sorted-List-to-Binary-Search-Treel/0109.cpp) |[python](./src/0109-Convert-Sorted-List-to-Binary-Search-Tree/0109.py)|||||Medium|
|0110|[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) || [c++](./src/0110-Balanced-Binary-Tree/0110.cpp) |[python](./src/0110-Balanced-Binary-Tree/0110.py)|||||Easy|
|0111|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/) || [c++](./src/0111-Minimum-Depth-of-Binary-Tree/0111.cpp) |[python](./src/0111-Minimum-Depth-of-Binary-Tree/0111.py)|||||Easy|
|0112|[Path Sum](https://leetcode.com/problems/path-sum/) || [c++](./src/0112-Path-Sum/0112.cpp) |[python](./src/0112-Path-Sum/0112.py)|||||Easy|
|0113|[Path Sum II](https://leetcode.com/problems/path-sum-ii/) || [c++](./src/0113-Path-Sum-II/0113.cpp) |[python](./src/0113-Path-Sum-II/0113.py)|||||Medium|
|0114|[Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/) || [c++](./src/0114-Flatten-Binary-Tree-to-Linked-List/0114.cpp) |[python](./src/0114-Flatten-Binary-Tree-to-Linked-List/0114.py)|||||Medium|
|0115|[Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/) || [c++](./src/0115-Distinct-Subsequences/0115.cpp) |[python](./src/0115-Distinct-Subsequences/0115.py)|||||Hard|
|0116|[Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) || [c++](./src/0116-Populating-Next-Right-Pointers-in-Each-Node/0116.cpp) |[python](./src/0116-Populating-Next-Right-Pointers-in-Each-Node/0116.py)|||||Medium|
|0117|[Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/) || [c++](./src/0117-Populating-Next-Right-Pointers-in-Each-Node-II/0117.cpp) |[python](./src/0117-Populating-Next-Right-Pointers-in-Each-Node-II/0117.py)|||||Medium|
|0118|[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) || [c++](./src/0118-Pascal's-Triangle/0118.cpp) |[python](./src/0118-Pascal's-Triangle/0118.py)|||||Easy|
|0119|[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/) || [c++](./src/0119-Pascal's-Triangle-II/0119.cpp) |[python](./src/0119-Pascal's-Triangle-II/0119.py)|||||Easy|
|0120|[Triangle](https://leetcode.com/problems/triangle/) || [c++](./src/0120-Triangle/0120.cpp) |[python](./src/0120-Triangle/0120.py)|||||Medium|
|0121|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) || [c++](./src/0121-Best-Time-to-Buy-and-Sell-Stock/0121.cpp) |[python](./src/0121-Best-Time-to-Buy-and-Sell-Stock/0121.py)|[go](./src/0121-Best-Time-to-Buy-and-Sell-Stock/0121.go)||||Easy|
|0122|[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) || [c++](./src/0122-Best-Time-to-Buy-and-Sell-Stock-II/0122.cpp) |[python](./src/0122-Best-Time-to-Buy-and-Sell-Stock-II/0122.py)|||||Easy|
|0123|[Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/) || [c++](./src/0123-Best-Time-to-Buy-and-Sell-Stock-III/0123.cpp) |[python](./src/0123-Best-Time-to-Buy-and-Sell-Stock-III/0123.py)|||||Hard|
|0124|[Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) || [c++](./src/0124-Binary-Tree-Maximum-Path-Sum/0124.cpp) |[python](./src/0124-Binary-Tree-Maximum-Path-Sum/0124.py)|||||Hard|
|0125|[Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) || [c++](./src/0125-Valid-Palindrome/0125.cpp) |[python](./src/0125-Valid-Palindrome/0125.py)|[go](./src/0125-Valid-Palindrome/0125.go)||||Easy|
|0126|[Word Ladder II](https://leetcode.com/problems/word-ladder-ii/) || [c++](./src/0126-Word-Ladder-II/0126.cpp) |[python](./src/0126-Word-Ladder-II/0126.py)|||||Hard|
|0127|[Word Ladder](https://leetcode.com/problems/word-ladder/) || [c++](./src/0127-Word-Ladder/0127.cpp) |[python](./src/0127-Word-Ladder/0127.py)|||||Medium|
|0128|[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) || [c++](./src/0128-Longest-Consecutive-Sequence/0128.cpp) |[python](./src/0128-Longest-Consecutive-Sequence/0128.py)|[go](./src/0128-Longest-Consecutive-Sequence/0128.go)||||Hard|
|0129|[Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/) || [c++](./src/0129-Sum-Root-to-Leaf-Numbers/0129.cpp) |[python](./src/0129-Sum-Root-to-Leaf-Numbers/0129.py)|||||Medium|
|0130|[Surrounded Regions](https://leetcode.com/problems/surrounded-regions/) || [c++](./src/0130-Surrounded-Regions/0130.cpp) |[python](./src/0130-Surrounded-Regions/0130.py)|||||Medium|
|0131|[Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/) || [c++](./src/0131-Palindrome-Partitioning/0131.cpp) |[python](./src/0131-Palindrome-Partitioning/0131.py)|||||Medium|
|0132|[Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii/) || [c++](./src/0132-Palindrome-Partitioning-II/0132.cpp) |[python](./src/0132-Palindrome-Partitioning-II/0132.py)|||||Hard|
|0133|[Clone Graph](https://leetcode.com/problems/clone-graph/) || [c++](./src/0133-Clone-Graph/0133.cpp) |[python](./src/0133-Clone-Graph/0133.py)|||||Medium|
|0134|[Gas Station](https://leetcode.com/problems/gas-station/) || [c++](./src/0134-Gas-Station/0134.cpp) |[python](./src/0134-Gas-Station/0134.py)|||||Medium|
|0135|[Candy](https://leetcode.com/problems/gas-station/) || [c++](./src/0134-Gas-Station/0134.cpp) |[python](./src/0134-Gas-Station/0134.py)|||||Hard|
|0136|[Single Number](https://leetcode.com/problems/single-number/) || [c++](./src/0136-Single-Number/0136.cpp) |[python](./src/0136-Single-Number/0136.py)|[go](./src/0136-Single-Number/0136.go)||||Easy|
|0137|[Single Number II](https://leetcode.com/problems/single-number-ii/) || [c++](./src/0137-Single-Number-II/0137.cpp) |[python](./src/0137-Single-Number-II/0137.py)|[go](./src/0137-Single-Number-II/0137.go)||||Medium|
|0138|[Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/) || [c++](./src/0138-Copy-List-with-Random-Pointer/0138.cpp) |[python](./src/0138-Copy-List-with-Random-Pointer/0138.py)|||||Medium|
|0139|[Word Break](https://leetcode.com/problems/word-break/) || [c++](./src/0139-Word-Break/0139.cpp) |[python](./src/0139-Word-Break/0139.py)|||||Medium|
|0140|[Word Break II](https://leetcode.com/problems/word-break-ii/) || [c++](./src/0140-Word-Break-II/0140.cpp) |[python](./src/0140-Word-Break-II/0140.py)|||||Hard|
|0141|[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) || [c++](./src/0141-Linked-List-Cycle/0141.cpp) |[python](./src/0141-Linked-List-Cycle/0141.py)|||||Easy|
|0142|[Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/) || [c++](./src/0142-Linked-List-Cycle-II/0142.cpp) |[python](./src/0142-Linked-List-Cycle-II/0142.py)|||||Medium|
|0143|[Reorder-List](https://leetcode.com/problems/reorder-list/) || [c++](./src/0143-Reorder-List/0143.cpp) |[python](./src/0143-Reorder-List/0143.py)|||||Medium|
|0144|[Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/) || [c++](./src/0144-Binary-Tree-Preorder-Traversal/0144.cpp) |[python](./src/0144-Binary-Tree-Preorder-Traversal/0144.py)|||||Medium|
|0145|[Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) || [c++](./src/0145-Binary-Tree-Postorder-Traversal/0145.cpp) |[python](./src/0145-Binary-Tree-Postorder-Traversal/0145.py)|||||Hard|
|0146|[LRU Cache](https://leetcode.com/problems/lru-cache/) || [c++](./src/0146-LRU-Cache/0146.cpp) |[python](./src/0146-LRU-Cache/0146.py)|||||Hard|
|0147|[Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/) || [c++](./src/0147-Insertion-Sort-List/0147.cpp) |[python](./src/0147-Insertion-Sort-List/0147.py)|||||Medium|
|0148|[Sort List](https://leetcode.com/problems/sort-list/) || [c++](./src/0148-Sort-List/0148.cpp) |[python](./src/0148-Sort-List/0148.py)|||||Medium|
|0149|[Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/) || [c++](./src/0149-Max-Points-on-a-Line/0149.cpp) |[python](./src/0149-Max-Points-on-a-Line/0149.py)|||||Hard|
|0150|[Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) || [c++](./src/0150-Evaluate-Reverse-Polish-Notation/0150.cpp) |[python](./src/0150-Evaluate-Reverse-Polish-Notation/0150.py)|||||Medium|
|0151|[Reverse Words in a String](https://leetcode.com/problems/evaluate-reverse-polish-notation/) || [c++](./src/0151-Reverse-Words-in-a-String/0151.cpp) |[python](./src/0151-Reverse-Words-in-a-String/0151.py)|||||Medium|
|0152|[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) || [c++](./src/0152-Maximum-Product-Subarray/0152.cpp) |[python](./src/0152-Maximum-Product-Subarray/0152.py)|[go](./src/0152-Maximum-Product-Subarray/0152.go)||||Medium|
|0153|[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) || [c++](./src/0153-Find-Minimum-in-Rotated-Sorted-Array/0153.cpp) |[python](./src/0153-Find-Minimum-in-Rotated-Sorted-Array/0153.py)|[go](./src/0153-Find-Minimum-in-Rotated-Sorted-Array/0153.go)||||Medium|
|0154|[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/) || [c++](./src/0154-Find-Minimum-in-Rotated-Sorted-Array-II/0154.cpp) |[python](./src/0154-Find-Minimum-in-Rotated-Sorted-Array-II/0154.py)|||||Hard|
|0155|[Min Stack](https://leetcode.com/problems/min-stack/) || [c++](./src/0155-Min-Stack/0155.cpp) |[python](./src/0155-Min-Stack/0155.py)|||||Easy|
|0160|[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) || [c++](./src/0160-Intersection-of-Two-Linked-Lists/0160.cpp) |[python](./src/0160-Intersection-of-Two-Linked-Lists/0160.py)|||||Easy|
|0162|[Find Peak Element](https://leetcode.com/problems/find-peak-element/) || [c++](./src/0162-Find-Peak-Element/0162.cpp) |[python](./src/0162-Find-Peak-Element/0162.py)|[go](./src/0162-Find-Peak-Element/0162.go)|||[rust](./src/0162-Find-Peak-Element/0162.rs)|Medium|
|0165|[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/) || [c++](./src/0165-Compare-Version-Numbers/0165.cpp) |[python](./src/0165-Compare-Version-Numbers/0165.py)|||||Medium|
|0166|[Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal/) || [c++](./src/0166-Fraction-to-Recurring-Decimal/0166.cpp) |[python](./src/0166-Fraction-to-Recurring-Decimal/0166.py)|||||Medium|
|0167|[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) || [c++](./src/0167-Two-Sum-II-Input-array-is-sorted/0167.cpp) |[python](./src/0167-Two-Sum-II-Input-array-is-sorted/0167.py)|||||Easy|
|0168|[Excel Sheet Column Title](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) || [c++](./src/0168-Excel-Sheet-Column-Title/0168.cpp) |[python](./src/0168-Excel-Sheet-Column-Title/0168.py)|||||Easy|
|0169|[Majority Element](https://leetcode.com/problems/majority-element/) || [c++](./src/0169-Majority-Element/0169.cpp) |[python](./src/0169-Majority-Element/0169.py)|[go](./src/0169-Majority-Element/0169.go)|||[rust](./src/0169-Majority-Element/0169.rs)|Easy|
|0171|[Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/) || [c++](./src/0171-Excel-Sheet-Column-Number/0171.cpp) |[python](./src/0171-Excel-Sheet-Column-Number/0171.py)|||||Easy|
|0172|[Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/) || [c++](./src/0172-Factorial-Trailing-Zeroes/0172.cpp) |[python](./src/0172-Factorial-Trailing-Zeroes/0172.py)|||||Easy|
|0173|[Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/) || [c++](./src/0173-Binary-Search-Tree-Iterator/0173.cpp) |[python](./src/0173-Binary-Search-Tree-Iterator/0173.py)|||||Medium|
|0174|[Dungeon Game](https://leetcode.com/problems/dungeon-game/) || [c++](./src/0174-Dungeon-Game/0174.cpp) |[python](./src/0174-Dungeon-Game/0174.py)|||||Hard|
|0179|[Largest Number](https://leetcode.com/problems/largest-number/) || [c++](./src/0179-Largest-Number/0179.cpp) |[python](./src/0179-Largest-Number/0179.py)|||||Medium|
|0187|[Repeated-DNA-Sequences](https://leetcode.com/problems/repeated-dna-sequences/) || [c++](./src/0187-Repeated-DNA-Sequences/0187.cpp) |[python](./src/0187-Repeated-DNA-Sequences/0187.py)|||||Medium|
|0188|[Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/) || [c++](./src/0188-Best-Time-to-Buy-and-Sell-Stock-IV/0188.cpp) |[python](./src/0188-Best-Time-to-Buy-and-Sell-Stock-IV/0188.py)|||||Hard|
|0189|[Rotate Array](https://leetcode.com/problems/rotate-array/) || [c++](./src/0189-Rotate-Array/0189.cpp) |[python](./src/0189-Rotate-Array/0189.py)|||||Easy|
|0190|[Reverse Bits](https://leetcode.com/problems/reverse-bits/) || [c++](./src/0190-Reverse-Bits/0190.cpp) |[python](./src/0190-Reverse-Bits/0190.py)|[go](./src/0190-Reverse-Bits/0190.go)||||Easy|
|0191|[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) || [c++](./src/0191-Number-of-1-Bits/0191.cpp) |[python](./src/0191-Number-of-1-Bits/0191.py)|[go](./src/0191-Number-of-1-Bits/0191.go)||||Easy|
|0198|[House Robber](https://leetcode.com/problems/house-robber/) || [c++](./src/0198-House-Robber/0198.cpp) |[python](./src/0198-House-Robber/0198.py)|[go](./src/0198-House-Robber/0198.go)||||Easy|
|0199|[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) || [c++](./src/0199-Binary-Tree-Right-Side-View/0199.cpp) |[python](./src/0199-Binary-Tree-Right-Side-View/0199.py)|||||Medium|
|0200|[Number of Islands](https://leetcode.com/problems/number-of-islands/) || [c++](./src/0200-Number-of-Islands/0200.cpp) |[python](./src/0200-Number-of-Islands/0200.py)|[go](./src/0200-Number-of-Islands/0200.go)|[js](./src/0200-Number-of-Islands/0200.js)|[java](./src/0200-Number-of-Islands/0200.java)||Medium|
|0201|[Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/) || [c++](./src/0201-Bitwise-AND-of-Numbers-Range/0201.cpp) |[python](./src/0201-Bitwise-AND-of-Numbers-Range/0201.py)|||||Medium|
|0202|[Happy Number](https://leetcode.com/problems/happy-number/) || [c++](./src/0202-Happy-Number/0202.cpp) |[python](./src/0202-Happy-Number/0202.py)|||||Easy|
|0203|[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/) || [c++](./src/0203-Remove-Linked-List-Elements/0203.cpp) |[python](./src/0203-Remove-Linked-List-Elements/0203.py)|||||Easy|
|0204|[Count Primes](https://leetcode.com/problems/remove-linked-list-elements/) || [c++](./src/0204-Count-Primes/0204.cpp) |[python](./src/0204-Count-Primes/0204.py)|||||Easy|
|0205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/) || [c++](./src/0205-Isomorphic-Strings/0205.cpp) |[python](./src/0205-Isomorphic-Strings/0205.py)|||||Easy|
|0206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) || [c++](./src/0206-Reverse-Linked-List/0206.cpp) |[python](./src/0206-Reverse-Linked-List/0206.py)|[go](./src/0206-Reverse-Linked-List/0206.go)||||Easy|
|0207|[Course Schedule](https://leetcode.com/problems/course-schedule/) || [c++](./src/0207-Course-Schedule/0207.cpp) |[python](./src/0207-Course-Schedule/0207.py)|[go](./src/0207-Course-Schedule/0207.go)|[js](./src/0207-Course-Schedule/0207.js)|||Medium|
|0208|[Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/) || [c++](./src/0208-Implement-Trie-(Prefix-Tree)/0208.cpp) |[python](./src/0208-Implement-Trie-(Prefix-Tree)/0208.py)|||||Medium|
|0209|[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/) || [c++](./src/0209-Minimum-Size-Subarray-Sum/0209.cpp) |[python](./src/0209-Minimum-Size-Subarray-Sum/0209.py)|||||Medium|
|0210|[Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) || [c++](./src/0210-Course-Schedule-II/0210.cpp) |[python](./src/0210-Course-Schedule-II/0210.py)|[go](./src/0210-Course-Schedule-II/0210.go)|[js](./src/0210-Course-Schedule-II/0210.js)|||Medium|
|0211|[Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design/) || [c++](./src/0211-Add-and-Search-Word-Data-structure-design/0211.cpp) |[python](./src/0211-Add-and-Search-Word-Data-structure-design/0211.py)||||[rust](./src/0211-Add-and-Search-Word-Data-structure-design/0211.rs)|Medium|
|0212|[Word Search II](https://leetcode.com/problems/word-search-ii/) || [c++](./src/0212-Word-Search-II/0212.cpp) |[python](./src/0212-Word-Search-II/0212.py)|[go](./src/0212-Word-Search-II/0212.go)|[js](./src/0212-Word-Search-II/0212.js)|||Medium|
|0213|[House Robber II](https://leetcode.com/problems/house-robber-ii/) || [c++](./src/0213-House-Robber-II/0213.cpp) |[python](./src/0213-House-Robber-II/0213.py)|||||Medium|
|0215|[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) || [c++](./src/0215-Kth-Largest-Element-in-an-Array/0215.cpp) |[python](./src/0215-Kth-Largest-Element-in-an-Array/0215.py)|||||Medium|
|0216|[Combination Sum III](https://leetcode.com/problems/combination-sum-iii/) || [c++](./src/0216-Combination-Sum-III/0216.cpp) |[python](./src/0216-Combination-Sum-III/0216.py)|||||Medium|
|0217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) || [c++](./src/0217-Contains-Duplicate/0217.cpp) |[python](./src/0217-Contains-Duplicate/0217.py)|[go](./src/0217-Contains-Duplicate/0217.go)||||Easy|
|0218|[The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/) || [c++](./src/0218-The-Skyline-Problem/0218.cpp) |[python](./src/0218-The-Skyline-Problem/0218.py)|[go](./src/0218-The-Skyline-Problem/0218.go)|[js](./src/0218-The-Skyline-Problem/0218.js)|||Hard|
|0219|[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/) || [c++](./src/0219-Contains-Duplicate-II/0219.cpp) |[python](./src/0219-Contains-Duplicate-II/0219.py)|[go](./src/0219-Contains-Duplicate-II/0219.go)||||Easy|
|0221|[Maximal Square](https://leetcode.com/problems/maximal-square/) || [c++](./src/0221-Maximal-Square/0221.cpp) |[python](./src/0221-Maximal-Square/0221.py)|[go](./src/0221-Maximal-Square/0221.go)|[js](./src/0221-Maximal-Square/0221.js)|||Medium|
|0222|[Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/) || [c++](./src/0222-Count-Complete-Tree-Nodes/0222.cpp) |[python](./src/0222-Count-Complete-Tree-Nodes/0222.py)|||||Medium|
|0223|[Rectangle Area](https://leetcode.com/problems/rectangle-area/) || [c++](./src/0223-Rectangle-Area/0223.cpp) |[python](./src/0223-Rectangle-Area/0223.py)|||||Medium|
|0224|[Basic Calculator](https://leetcode.com/problems/basic-calculator/) || [c++](./src/0224-Basic-Calculator/0224.cpp) |[python](./src/0224-Basic-Calculator/0224.py)|[go](./src/0224-Basic-Calculator/0224.go)|[js](./src/0224-Basic-Calculator/0224.js)|||Hard|
|0226|[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) || [c++](./src/0226-Invert-Binary-Tree/0226.cpp) |[python](./src/0226-Invert-Binary-Tree/0226.py)|||||Easy|
|0228|[Summary Ranges](https://leetcode.com/problems/summary-ranges/) || [c++](./src/0228-Summary-Ranges/0228.cpp) |[python](./src/0228-Summary-Ranges/0228.py)|||||Medium|
|0229|[Majority Element II](https://leetcode.com/problems/majority-element-ii/) || [c++](./src/0229-Majority-Element-II/0229.cpp) |[python](./src/0229-Majority-Element-II/0229.py)||||[rust](./src/0229-Majority-Element-II/0229.rs)|Medium|
|0230|[Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) || [c++](./src/0230-Kth-Smallest-Element-in-a-BST/0230.cpp) |[python](./src/0230-Kth-Smallest-Element-in-a-BST/0230.py)|||||Medium|
|0231|[Power of Two](https://leetcode.com/problems/power-of-two/) || [c++](./src/0231-Power-of-Two/231.cpp) |[python](./src/0231-Power-of-Two/231.py)|[go](./src/0231-Power-of-Two/0231.go)||||Easy|
|0234|[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) || [c++](./src/0234-Palindrome-Linked-List/0234.cpp) |[python](./src/0234-Palindrome-Linked-List/0234.py)|||||Medium|
|0235|[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) || [c++](./src/0235-Lowest-Common-Ancestor-of-a-Binary-Search-Tree/0235.cpp) |[python](./src/0235-Lowest-Common-Ancestor-of-a-Binary-Search-Tree/0235.py)|||||Easy|
|0236|[Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) || [c++](./src/0236-Lowest-Common-Ancestor-of-a-Binary-Tree/0236.cpp) |[python](./src/0236-Lowest-Common-Ancestor-of-a-Binary-Tree/0236.py)|||||Medium|
|0237|[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/) || [c++](./src/0237-Delete-Node-in-a-Linked-List/0237.cpp) |[python](./src/0237-Delete-Node-in-a-Linked-List/0237.py)|||||Easy|
|0238|[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) || [c++](./src/0238-Product-of-Array-Except-Self/0238.cpp) |[python](./src/0238-Product-of-Array-Except-Self/0238.py)|[go](./src/0238-Product-of-Array-Except-Self/0238.go)||||Medium|
|0239|[Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) || [c++](./src/0239-Sliding-Window-Maximum/0239.cpp) |[python](./src/0239-Sliding-Window-Maximum/0239.py)|||||Medium|
|0240|[Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/) || [c++](./src/0240-Search-a-2D-Matrix-II/0240.cpp) |[python](./src/0240-Search-a-2D-Matrix-II/0240.py)|||||Medium|
|0241|[Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/) || [c++](./src/0241-Different-Ways-to-Add-Parentheses/0241.cpp) |[python](./src/0241-Different-Ways-to-Add-Parentheses/0241.py)|||||Medium|
|0242|[Valid Anagram](https://leetcode.com/problems/valid-anagram/) || [c++](./src/0242-Valid-Anagram/0242.cpp) |[python](./src/0242-Valid-Anagram/0242.py)|[go](./src/0242-Valid-Anagram/0242.go)||||Easy|
|0242|[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/) || [c++](./src/0257-Binary-Tree-Paths/0257.cpp) |[python](./src/0257-Binary-Tree-Paths/0257.py)|||||Easy|
|0253|[Meeting Rooms II](https://leetcode.com/meeting-rooms-ii) || [c++](./src/0253-Meeting-Rooms-II/0253.cpp) |[python](./src/0253-Meeting-Rooms-II/0253.py)|||||Medium|
|0260|[Single Number III](https://leetcode.com/problems/single-number-iii/) || [c++](./src/0260-Single-Number-III/0260.cpp) |[python](./src/0260-Single-Number-III/0260.py)|||[java](./src/0260-Single-Number-III/0260.java)||Medium|
|0263|[Ugly Number](https://leetcode.com/problems/ugly-number/) || [c++](./src/0263-Ugly-Number/0263.cpp) |[python](./src/0263-Ugly-Number/0263.py)|[go](./src/0263-Ugly-Number/0263.go)||||Easy|
|0264|[Ugly Number II](https://leetcode.com/problems/ugly-number-ii/) || [c++](./src/0264-Ugly-Number-II/0264.cpp) |[python](./src/0264-Ugly-Number-II/0264.py)|||||Medium|
|0268|[Missing Number](https://leetcode.com/problems/missing-number/) || [c++](./src/0268-Missing-Number/0268.cpp) |[python](./src/0268-Missing-Number/0268.py)|[go](./src/0268-Missing-Number/0268.go)||||Easy|
|0274|[H-Index](https://leetcode.com/problems/h-index/) || [c++](./src/0274-H-Index/0274.cpp) |[python](./src/0274-H-Index/0274.py)|[go](./src/0274-H-Index/0274.go)||||Medium|
|0275|[H-Index](https://leetcode.com/problems/h-index-ii/) || [c++](./src/0275-H-Index-II/0275.cpp) |[python](./src/0275-H-Index-II/0275.py)|[go](./src/0275-H-Index-II/0275.go)||||Medium|
|0278|[First Bad Version](https://leetcode.com/problems/first-bad-version/) || [c++](./src/0278-First-Bad-Version/0278.cpp) |[python](./src/0278-First-Bad-Version/0278.py)|[go](./src/0278-First-Bad-Version/0278.go)||||Easy|
|0279|[Perfect Squares](https://leetcode.com/problems/perfect-squares/) || [c++](./src/0279-Perfect-Squares/0279.cpp) |[python](./src/0279-Perfect-Squares/0279.py)|||||Medium|
|0283|[Move Zeroes](https://leetcode.com/problems/move-zeroes/) || [c++](./src/0283-Move-Zeroes/0283.cpp) |[python](./src/0283-Move-Zeroes/0283.py)|||||Easy|
|0287|[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) || [c++](./src/00287-Find-the-Duplicate-Number/0287.cpp) |[python](./src/0287-Find-the-Duplicate-Number/0287.py)|||||Medium|
|0289|[Game of Life](https://leetcode.com/problems/game-of-life/) || [c++](./src/0289-Game-of-Life/0289.cpp) |[python](./src/0289-Game-of-Life/0289.py)|||||Medium|
|0290|[Word Pattern](https://leetcode.com/problems/word-pattern/) || [c++](./src/0290-Word-Pattern/0290.cpp) |[python](./src/0290-Word-Pattern/0290.py)|||||Easy|
|0297|[Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) || [c++](./src/0297-Serialize-and-Deserialize-Binary-Tree/0297.cpp) |[python](./src/0297-Serialize-and-Deserialize-Binary-Tree/0297.py)||[js](./src/0297-Serialize-and-Deserialize-Binary-Tree/0297.js)|||Hard|
|0300|[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) || [c++](./src/0300-Longest-Increasing-Subsequence/0300.cpp) |[python](./src/0300-Longest-Increasing-Subsequence/0300.py)||||[rust](./src/0300-Longest-Increasing-Subsequence/0300.rs)|Medium|
|0303|[Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/) || [c++](./src/0303-Range-Sum-Query-Immutable/0303.cpp) |[python](./src/0303-Range-Sum-Query-Immutable/0303.py)|||||Easy|
|0307|[Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/) || [c++](./src/0307-Range-Sum-Query-Mutable/0307.cpp) |[python](./src/0307-Range-Sum-Query-Mutable/0307.py)|[go](./src/0307-Range-Sum-Query-Mutable/0307.go)|[js](./src/0307-Range-Sum-Query-Mutable/0307.js)|||Medium|
|0309|[Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/) || [c++](./src/0309-Best-Time-to-Buy-and-Sel-Stock-with-Cooldown/0309.cpp) |[python](./src/0309-Best-Time-to-Buy-and-Sel-Stock-with-Cooldown/0309.py)|||||Medium|
|0310|[Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) || [c++](./src/0310-Insert-Delete-GetRandom-O(1)/0310.cpp) ||||||Medium|
|0316|[Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters/) || [c++](./src/0316-Remove-Duplicate-Letters/0316.cpp) |[python](./src/0316-Remove-Duplicate-Letters/0316.py)|||||Hard|
|0319|[Bulb Switcher](https://leetcode.com/problems/bulb-switcher/) || [c++](./src/0319-Bulb-Switcher/0319.cpp) |[python](./src/0319-Bulb-Switcher/0319.py)|[go](./src/0319-Bulb-Switcher/0319.go)||||Medium|
|0322|[Coin-Change](https://leetcode.com/problems/coin-change/) || [c++](./src/0322-Coin-Change/0322.cpp) |[python](./src/0322-Coin-Change/0322.py)|[go](./src/0322-Coin-Change/0322.go)|[js](./src/0322-Coin-Change/0322.js)|[java](./src/0322-Coin-Change/0322.java)||Medium|
|0325|[Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/) || [c++](./src/0325-Maximum-Size-Subarray-Sum-Equals-k/0325.cpp) |[python](./src/0325-Maximum-Size-Subarray-Sum-Equals-k/0325.py)|||||Medium|
|0326|[Power of Three](https://leetcode.com/problems/power-of-three/)||[c++](./src/0326-Power-of-Three/0326.cpp)||[go](./src/0326-Power-of-Three/0326.go)|||[rust](./src/0326-Power-of-Three/0326.rs)|Easy|
|0328|[Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/) || [c++](./src/0328-Odd-Even-Linked-List/0328.cpp) |[python](./src/0328-Odd-Even-Linked-List/0328.py)|||||Medium|
|0331|[Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/odd-even-linked-list/) || [c++](./src/0328-Odd-Even-Linked-List/0328.cpp) |[python](./src/0328-Odd-Even-Linked-List/0328.py)|||||Medium|
|0337|[House Robber III](https://leetcode.com/problems/house-robber-iii/) || [c++](./src/0328-Odd-Even-Linked-List/0337.cpp) |[python](./src/0328-Odd-Even-Linked-List/0337.py)|||||Medium|
|0341|[Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/) || [c++](./src/0341-Flatten-Nested-List-Iterator/0341.cpp) |[python](./src/0341-Flatten-Nested-List-Iterator/0341.py)|||||Medium|
|0343|[Integer Break](https://leetcode.com/problems/integer-break/) || [c++](./src/0343-Integer-Break/0343.cpp) |[python](./src/0343-Integer-Break/0343.py)|||||Medium|
|0344|[Reverse String](https://leetcode.com/problems/reverse-string/) || [c++](./src/0344-Reverse-String/0344.cpp) |[python](./src/0344-Reverse-String/0344.py)|[go](./src/0344-Reverse-String/0344.go)||||Easy|
|0345|[Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/) || [c++](./src/0345-Reverse-Vowels-of-a-String/0345.cpp) |[python](./src/0345-Reverse-Vowels-of-a-String/0345.py)|||||Easy|
|0347|[Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) || [c++](./src/0347-Top-K-Frequent-Elements/0347.cpp) |[python](./src/0347-Top-K-Frequent-Elements/0347.py)|[go](./src/0347-Top-K-Frequent-Elements/0347.go)||||Medium|
|0349|[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/) || [c++](./src/0349-Intersection-of-Two-Arrays/0349.cpp) |[python](./src/0349-Intersection-of-Two-Arrays/0349.py)|||||Easy|
|0350|[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/) || [c++](./src/0350-Intersection-of-Two-Arrays-II/0350.cpp) |[python](./src/0350-Intersection-of-Two-Arrays-II/0350.py)|||||Easy|
|0352|[Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals/) || [c++](./src/0352-Data-Stream-as-Disjoint-Intervals/0352.cpp) ||||||Hard|
|0354|[Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes/) || [c++](./src/0354-Russian-Doll-Envelopes/0354.cpp) |[python](./src/0354-Russian-Doll-Envelopes/0354.py)|||||Hard|
|0365|[Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem/)||[c++](./src/0365-Water-and-Jug-Problem/0365.cpp)|[python](./src/0365-Water-and-Jug-Problem/0365.py)|[go](./src/0365-Water-and-Jug-Problem/0365.go)|[js](./src/0365-Water-and-Jug-Problem/0365.js)|[java](./src/0365-Water-and-Jug-Problem/0365.java)||Medium|
|0371|[Sum of Two Integers](https://leetcode.com/problems/russian-doll-envelopes/) || [c++](./src/0371-Sum-of-Two-Integers/0371.cpp) |[python](./src/0371-Sum-of-Two-Integers/0371.py)||||[rust](./src/0371-Sum-of-Two-Integers/0371.rs)|Medium|
|0377|[Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/) || [c++](./src/0377-Combination-Sum-IV/0377.cpp) |[python](./src/0377-Combination-Sum-IV/0377.py)|||||Medium|
|0389|[Find the Difference](https://leetcode.com/problems/find-the-difference/) || [c++](./src/0389-Find-the-Difference/0389.cpp) |[python](./src/0389-Find-the-Difference/0389.py)|||||Easy|
|0384|[Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/) || [c++](./src/0384-Shuffle-an-Array/0384.cpp) |||||[rust](./src/0384-Shuffle-an-Array/0384.rs)|Medium|
|0392|[Is Subsequence](https://leetcode.com/problems/is-subsequence/) || [c++](./src/0392-Is-Subsequence/0392.cpp) |[python](./src/0392-Is-Subsequence/0392.py)|||||Medium|
|0401|[Binary Watch](https://leetcode.com/problems/binary-watch/) || [c++](./src/0401-Binary-Watch/0401.cpp) |[python](./src/0401-Binary-Watch/0401.py)|||||Easy|
|0404|[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/) || [c++](./src/0404-Sum-of-Left-Leaves/0404.cpp) |[python](./src/0404-Sum-of-Left-Leaves/0404.py)|||||Easy|
|0409|[Longest Palindrome](https://leetcode.com/problems/longest-palindrome/)||[c++](./src/0409-Longest-Palindrome/0409.cpp)|[python](./src/0409-Longest-Palindrome/0409.py)|[go](./src/0409-Longest-Palindrome/0409.go)|[js](./src/0409-Longest-Palindrome/0409.js)|[java](./src/0409-Longest-Palindrome/0409.java)||Easy|
|0416|[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/) || [c++](./src/0416-Partition-Equal-Subset-Sum/0416.cpp) |[python](./src/0416-Partition-Equal-Subset-Sum/0416.py)|[go](./src/0416-Partition-Equal-Subset-Sum/0416.go)|[js](./src/0416-Partition-Equal-Subset-Sum/0416.js)|[java](./src/0416-Partition-Equal-Subset-Sum/0416.java)||Medium|
|0423|[Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english/) || [c++](./src/0423-Reconstruct-Original-Digits-from-English/0423.cpp) |||||[rust](./src/0423-Reconstruct-Original-Digits-from-English/0423.rs)|Medium|
|0424|[Longest Repeating Character Replacement](https://leetcode.com/problems/partition-equal-subset-sum/) || [c++](./src/0424-Longest-Repeating-Character-Replacement/0424.cpp) |[python](./src/0424-Longest-Repeating-Character-Replacement/0424.py)|[go](./src/0424-Longest-Repeating-Character-Replacement/0424.go)|[js](./src/0424-Longest-Repeating-Character-Replacement/0424.js)|||Medium|
|0435|[Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/) || [c++](./src/0435-Non-overlapping-Intervals/0435.cpp) |[python](./src/0435-Non-overlapping-Intervals/0435.py)|[go](./src/0435-Non-overlapping-Intervals/0435.go)||||Medium|
|0437|[Path Sum III](https://leetcode.com/problems/path-sum-iii/) || [c++](./src/0437-Path-Sum-III/0437.cpp) |[python](./src/0437-Path-Sum-III/0437.py)|||||Easy|
|0438|[Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/) || [c++](./src/0438-Find-All-Anagrams-in-a-String/0438.cpp) |[python](./src/0438-Find-All-Anagrams-in-a-String/0438.py)||||[rust](./src/0438-Find-All-Anagrams-in-a-String/0438.rs)|Medium|
|0445|[Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/) || [c++](./src/0445-Add-Two-Numbers-II/0445.cpp) |[python](./src/0445-Add-Two-Numbers-II/0445.py)|||||Medium|
|0446|[Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence/) || [c++](./src/0446-Arithmetic-Slices-II-Subsequence/0446.cpp) ||||||Hard|
|0447|[Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs/) || [c++](./src/0447-Number-of-Boomerangs/0447.cpp) |[python](./src/0447-Number-of-Boomerangs/0447.py)||||[rust](./src/0447-Number-of-Boomerangs/0447.rs)|Medium|
|0450|[Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/) || [c++](./src/0450-Delete-Node-in-a-BST/0450.cpp) |[python](./src/0450-Delete-Node-in-a-BST/0450.py)|||||Medium|
|0451|[Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/) || [c++](./src/0451-Sort-Characters-By-Frequency/0451.cpp) |[python](./src/0451-Sort-Characters-By-Frequency/0451.py)|||||Easy|
|0452|[Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/) || [c++](./src/0451-Sort-Characters-By-Frequency/0451.cpp) ||||||Medium|
|0453|[Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/)||[c++](./src/0453-Minimum-Moves-to-Equal-Array-Elements/0453.cpp)|[python](./src/0453-Minimum-Moves-to-Equal-Array-Elements/0453.py)||||[rust](./src/0453-Minimum-Moves-to-Equal-Array-Elements/0453.rs)|Easy|
|0454|[4Sum II](https://leetcode.com/problems/4sum-ii/) || [c++](./src/0454-4Sum-II/0454.cpp) |[python](./src/0454-4Sum-II/0454.py)|||||Medium|
|0455|[Assign Cookies](https://leetcode.com/problems/assign-cookies/) || [c++](./src/0455-Assign-Cookies/0455.cpp) |[python](./src/0455-Assign-Cookies/0455.py)|||||Easy|
|0458|[Poor Pigs](https://leetcode.com/problems/poor-pigs/) || [c++](./src/0458-Poor-Pigs/0458.cpp) |[python](./src/0458-Poor-Pigs/0458.py)||||[rust](./src/0458-Poor-Pigs/0458.rs)|Hard|
|0459|[Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/)||[c++](./src/0459-Repeated-Substring-Pattern/0459.cpp)|[python](./src/0459-Repeated-Substring-Pattern/0459.py)|[go](./src/0459-Repeated-Substring-Pattern/0459.go)|[js](./src/0459-Repeated-Substring-Pattern/0459.js)|[java](./src/0459-Repeated-Substring-Pattern/0459.java)||Easy|
|0462|[Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/) || [c++](./src/0462-Minimum-Moves-to-Equal-Array-Elements-II/0462.cpp) |[python](./src/0462-Minimum-Moves-to-Equal-Array-Elements-II/0462.py)|||||Medium|
|0473|[Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square/)||[c++](./src/0473-Matchsticks-to-Square/0473.cpp)|[python](./src/0473-Matchsticks-to-Square/0473.py)|[go](./src/0473-Matchsticks-to-Square/0473.go)|[js](./src/0473-Matchsticks-to-Square/0473.js)|[java](./src/0473-Matchsticks-to-Square/0473.java)||Medium|
|0474|[Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes/) || [c++](./src/0474-Ones-and-Zeroes/0474.cpp) |[python](./src/0474-Ones-and-Zeroes/0474.py)|||||Medium|
|0486|[Predict the Winner](https://leetcode.com/problems/predict-the-winner/) || [c++](./src/0486-Predict-the-Winner/0486.cpp) |[python](./0486-Predict-the-Winner/0486.py)|||||Medium|
|0492|[Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle/)||[c++](./src/0492-Construct-the-Rectangle/0492.cpp)|[python](./src/0492-Construct-the-Rectangle/0492.py)|[go](./src/0492-Construct-the-Rectangle/0492.go)|[js](./src/0492-Construct-the-Rectangle/0492.js)|[java](./src/0492-Construct-the-Rectangle/0492.java)|[rust](./src/0492-Construct-the-Rectangle/0492.rs)|Easy|
|0492|[Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle/)||[c++](./src/0492-Construct-the-Rectangle/0492.cpp)|[python](./src/0492-Construct-the-Rectangle/0492.py)|[go](./src/0492-Construct-the-Rectangle/0492.go)|[js](./src/0492-Construct-the-Rectangle/0492.js)|[java](./src/0492-Construct-the-Rectangle/0492.java)|[rust](./src/0492-Construct-the-Rectangle/0492.rs)|Easy|
|0492|[Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle/)||[c++](./src/0492-Construct-the-Rectangle/0492.cpp)|||||[rust](./src/0492-Construct-the-Rectangle/0492.rs)|Easy|
|0494|[Target Sum](https://leetcode.com/problems/target-sum/) || [c++](./src/0494-Target-Sum/0494.cpp) |[python](./src/0494-Target-Sum/0494.py)|||||Medium|
|0496|[Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/) || [c++](./src/0496-Next-Greater-Element-I/0496.cpp) |[python](./src/0496-Next-Greater-Element-I/0496.py)|||||Easy|
|0503|[Next Greater Element II](https://leetcode.com/problems/next-greater-element-i/) || [c++](./src/0503-Next-Greater-Element-II/0503.cpp) |[python](./src/0503-Next-Greater-Element-II/0503.py)|||||Medium|
|0520|[Detect Capital](https://leetcode.com/problems/detect-capital/) || [c++](./src/0520-Detect-Capital/0520.cpp) ||||||Easy|
|0524|[Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/)||[c++](./src/0524-Longest-Word-in-Dictionary-through-Deleting/0524.cpp)|||||[rust](./src/0524-Longest-Word-in-Dictionary-through-Deleting/0524.rs)|Medium|
|0525|[Contiguous Array](https://leetcode.com/problems/contiguous-array/) || [c++](./src/0525-Contiguous-Array/0525.cpp) |[python](./src/0525-Contiguous-Array/0525.py)|||||Medium|
|0528|[Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/)||[c++](./src/0528-Random-Pick-with-Weight/0528.cpp)|[python](./src/0528-Random-Pick-with-Weight/0528.py)|[go](./src/0528-Random-Pick-with-Weight/0528.go)|[js](./src/0528-Random-Pick-with-Weight/0528.js)|[java](./src/0528-Random-Pick-with-Weight/0528.java)|[rust](./src/0528-Random-Pick-with-Weight/0528.rs)|Medium|
|0530|[Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/) || [c++](./src/0530-Minimum-Absolute-Difference-in-BST/0530.cpp) |[python](./src/0530-Minimum-Absolute-Difference-in-BST/0530.py)|||||Easy|
|0543|[Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) || [c++](./src/0543-Diameter-of-Binary-Tree/0543.cpp) |[python](./src/0543-Diameter-of-Binary-Tree/0543.py)|||||Easy|
|0547|[Friend Circles](https://leetcode.com/problems/friend-circles/) || [c++](./src/0547-Friend-Circles/0547.cpp) |[python](./src/0547-Friend-Circles/0547.py)|||||Medium|
|0559|[Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree/) || [c++](./src/0559-Maximum-Depth-of-N-ary-Tree/0559.cpp) ||||||Easy|
|0560|[Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) || [c++](./src/0560-Subarray-Sum-Equals-K/0560.cpp) |[python](./src/0560-Subarray-Sum-Equals-K/0560.py)|||||Medium|
|0567|[Permutation in String](https://leetcode.com/problems/permutation-in-string/) || [c++](./src/0567-Permutation-in-String/0567.cpp) ||||||Medium|
|0583|[Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings/)||[c++](./src/0583-Delete-Operation-for-Two-Strings/0583.cpp)|||||[rust](./src/0583-Delete-Operation-for-Two-Strings/0583.rs)|Medium|
|0587|[Erect the Fence](https://leetcode.com/problems/erect-the-fence/)||[c++](./src/0587-Erect-the-Fence/0587.cpp)||||||Hard|
|0594|[Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence/) ||[c++](./src/0594-Longest-Harmonious-Subsequence/0594.cpp)|||||[rust](./src/0594-Longest-Harmonious-Subsequence/0594.rs)|Easy|
|0605|[Can Place Flowers](https://leetcode.com/problems/can-place-flowers/)||[c++](./src/0605-Can-Place-Flowers/0605.cpp)||||||Easy|
|0637|[Average of Levels in Binary Tree](https://leetcode.com/problems/subarray-sum-equals-k/) || [c++](./src/0637-Average-of-Levels-in-Binary-Tree/0637.cpp) |[python](./src/0637-Average-of-Levels-in-Binary-Tree/0637.py)|||||Easy|
|0638|[Shopping Offers](https://leetcode.com/problems/shopping-offers/)||[c++](./src/0638-Shopping-Offers/0638.cpp)|||||[rust](./src/0638-Shopping-Offers/0638.rs)|Medium|
|0650|[2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard/) || [c++](./src/0650-2-Keys-Keyboard/0650.cpp) |[python](./src/0650-2-Keys-Keyboard/0650.py)|||||Medium|
|0652|[Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees/) || [c++](./src/0652-Find-Duplicate-Subtrees/0652.cpp) |[python](./src/0652-Find-Duplicate-Subtrees/0652.py)|[go](./src/0652-Find-Duplicate-Subtrees/0652.go)|[js](./src/0652-Find-Duplicate-Subtrees/0652.js)|||Medium|
|0653|[Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/) || [c++](./src/0653-Two-Sum-IV-Input-is-a-BST/0653.cpp) |[python](./src/0653-Two-Sum-IV-Input-is-a-BST/0653.py)|||||Easy|
|0654|[Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree/) || [c++](./src/0654-Maximum-Binary-Tree/0654.cpp) |[python](./src/0654-Maximum-Binary-Tree/0654.py)|||||Medium|
|0678|[Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string/)||[c++](./src/0678-Valid-Parenthesis-String/0678.cpp)|||||[rust](./src/0678-Valid-Parenthesis-String/0678.rs)|Medium|
|0684|[Redundant Connection](https://leetcode.com/problems/redundant-connection/) || [c++](./src/0684-Redundant-Connection/0684.cpp) |[python](./src/0684-Redundant-Connection/0684.py)|||||Medium|
|0687|[Longest Univalue Path](https://leetcode.com/problems/redundant-connection/) || [c++](./src/0687-Longest-Univalue-Path/0687.cpp) |[python](./src/0687-Longest-Univalue-Path/0687.py)|||||Easy|
|0695|[Max Area of Island](https://leetcode.com/problems/max-area-of-island/)||[c++](./src/0695-Max-Area-of-Island/0695.cpp)|[python](./src/0695-Max-Area-of-Island/0695.py)|[go](./src/0695-Max-Area-of-Island/0695.go)|[js](./src/0695-Max-Area-of-Island/0695.js)|[java](./src/0695-Max-Area-of-Island/0695.java)||Medium|
|0697|[Degree of an Array](https://leetcode.com/problems/degree-of-an-array/)||[c++](./src/0697-Degree-of-an-Array/0697.cpp)||||||Easy|
|0698|[Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets/)||[c++](./src/0698-Partition-to-K-Equal-Sum-Subsets/0698.cpp)|[python](./src/0698-Partition-to-K-Equal-Sum-Subsets/0698.py)|[go](./src/0698-Partition-to-K-Equal-Sum-Subsets/0698.go)|[js](./src/0698-Partition-to-K-Equal-Sum-Subsets/0698.js)|[java](./src/0698-Partition-to-K-Equal-Sum-Subsets/0698.java)||Medium|
|0700|[Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/)||[c++](./src/0700-Search-in-a-Binary-Search-Tree/0700.cpp)|||||[rust](./src/0700-Search-in-a-Binary-Search-Tree/0700.rs)|Easy|
|0733|[Flood Fill](https://leetcode.com/problems/flood-fill/) || [c++](./src/0733-Flood-Fill/0733.cpp) |[python](./src/0733-Flood-Fill/0733.py)|||||Easy|
|0739|[Daily Temperatures](https://leetcode.com/problems/daily-temperatures/) || [c++](./src/0739-Daily-Temperatures/0739.cpp) |[python](./src/0739-Daily-Temperatures/0739.py)|[go](./src/0739-Daily-Temperatures/0739.go)||||Medium|
|0742|[Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree/) || [c++](./src/0742-Closest-Leaf-in-a-Binary-Tree/0742.cpp) |[python](./src/0742-Closest-Leaf-in-a-Binary-Tree/0742.py)|||||Medium|
|0776|[Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix/)||[c++](./src/0776-Toeplitz-Matrix/0776.cpp)||||||Easy|
|0783|[Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)||[c++](./src/0783-Minimum-Distance-Between-BST-Nodes/0783.cpp)||||||Easy|
|0788|[Rotated Digits](https://leetcode.com/problems/rotated-digits/) || [c++](./src/0788-Rotated-Digits/0788.cpp) |[python](./src/0788-Rotated-Digits/0788.py)|||||Easy|
|0790|[Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling/)||[c++](./src/0790-Domino-and-Tromino-Tiling/0790.cpp)||||||Medium|
|0793|[Preimage Size of Factorial Zeroes Function](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function/) || [c++](./src/0793-Preimage-Size-of-Factorial-Zeroes-Function/0793.cpp) |[python](./src/0793-Preimage-Size-of-Factorial-Zeroes-Function/0793.py)|[go](./src/0793-Preimage-Size-of-Factorial-Zeroes-Function/0793.go)|[js](./src/0793-Preimage-Size-of-Factorial-Zeroes-Function/0793.js)|||Hard|
|0795|[Number of Subarrays with Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum/) || [c++](./src/0795-Number-of-Subarrays-with-Bounded-Maximum/0795.cpp) ||||||Medium|
|0813|[Largest Sum of Averages](https://leetcode.com/problems/largest-sum-of-averages/) || [c++](./src/0813-Largest-Sum-of-Averages/0813.cpp) ||||||Medium|
|0820|[Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words/)||[c++](./src/0820-Short-Encoding-of-Words/0820.cpp)|[python](./src/0820-Short-Encoding-of-Words/0820.py)|[go](./src/0820-Short-Encoding-of-Words/0820.go)|[js](./src/0820-Short-Encoding-of-Words/0820.js)|[java](./src/0820-Short-Encoding-of-Words/0820.java)||Medium|
|0824|[Goat Latin](https://leetcode.com/problems/goat-latin/)||[c++](./src/0824-Goat-Latin/0824.cpp)|[python](./src/0824-Goat-Latin/0824.py)|[go](./src/0824-Goat-Latin/0824.go)|[js](./src/0824-Goat-Latin/0824.js)|[java](./src/0824-Goat-Latin/0824.java)||Easy|
|0825|[Friends Of Appropriate Ages](https://leetcode.com/problems/friends-of-appropriate-ages/)||[c++](./src/0825-Friends-Of-Appropriate-Ages/0825.cpp)|[python](./src/0825-Friends-Of-Appropriate-Ages/0825.py)|[go](./src/0825-Friends-Of-Appropriate-Ages/0825.go)|[js](./src/0825-Friends-Of-Appropriate-Ages/0825.js)|[java](./src/0825-Friends-Of-Appropriate-Ages/0825.java)||Medium|
|0826|[Most Profit Assigning Work](https://leetcode.com/problems/most-profit-assigning-work/)||[c++](./src/0826-Most-Profit-Assigning-Work/0826.cpp)|[python](./src/0826-Most-Profit-Assigning-Work/0826.py)|[go](./src/0826-Most-Profit-Assigning-Work/0826.go)|[js](./src/0826-Most-Profit-Assigning-Work/0826.js)|[java](./src/0826-Most-Profit-Assigning-Work/0826.java)||Medium|
|0827|[Making A Large Island](https://leetcode.com/problems/making-a-large-island/)||[c++](./src/0827-Making-A-Large-Island/0827.cpp)|[python](./src/0827-Making-A-Large-Island/0827.py)|[go](./src/0827-Making-A-Large-Island/0827.go)|[js](./src/0827-Making-A-Large-Island/0827.js)|[java](./src/0827-Making-A-Large-Island/0827.java)||Hard|
|0828|[Unique Letter String](https://leetcode.com/problems/unique-letter-string/)||[c++](./src/0828-Unique-Letter-String/0828.cpp)|[python](./src/0828-Unique-Letter-String/0828.py)|[go](./src/0828-Unique-Letter-String/0828.go)|[js](./src/0828-Unique-Letter-String/0828.js)|[java](./src/0828-Unique-Letter-String/0828.java)||Hard|
|0829|[Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum/)||[c++](./src/0829-Consecutive-Numbers-Sum/0829.cpp)|[python](./src/0829-Consecutive-Numbers-Sum/0829.py)|[go](./src/0829-Consecutive-Numbers-Sum/0829.go)|[js](./src/0829-Consecutive-Numbers-Sum/0829.js)|[java](./src/0829-Consecutive-Numbers-Sum/0829.java)||Hard|
|0832|[Flipping an Image](https://leetcode.com/problems/flipping-an-image/)||[c++](./src/0832-Flipping-an-Image/0832.cpp)|[python](./src/0832-Flipping-an-Image/0832.py)|||||Easy|
|0834|[Sum of Distances in Tree](https://leetcode.com/problems/daily-temperatures/) || [c++](./src/0834-Sum-of-Distances-in-Tree/0834.cpp) |[python](./src/0834-Sum-of-Distances-in-Tree/0834.py)|||||Hard|
|0836|[Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap/)||[c++](./src/0836-Rectangle-Overlap/0836.cpp)|[python](./src/0836-Rectangle-Overlap/0836.py)|[go](./src/0836-Rectangle-Overlap/0836.go)|[js](./src/0836-Rectangle-Overlap/0836.js)|[java](./src/0836-Rectangle-Overlap/0836.java)||Easy|
|0844|[Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/) || [c++](./src/0844-Backspace-String-Compare/0844.cpp) |[python](./src/0844-Backspace-String-Compare/0844.py)|||||Easy|
|0845|[Longest Mountain in Array](https://leetcode.com/problems/longest-mountain-in-array/) || [c++](./src/0845-Longest-Mountain-in-Array/0845.cpp) |[python](./src/0845-Longest-Mountain-in-Array/0845.py)|||||Medium|
|0846|[Hand of Straights](https://leetcode.com/problems/longest-mountain-in-array/) || [c++](./src/0846-Hand-of-Straights/0846.cpp) |[python](./src/0846-Hand-of-Straights/0846.py)|||||Medium|
|0847|[Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes/) || [c++](./src/0847-Shortest-Path-Visiting-All-Nodes/0847.cpp) |[python](./src/0847-Shortest-Path-Visiting-All-Nodes/0847.py)|[go](./src/0847-Shortest-Path-Visiting-All-Nodes/0847.go)|[js](./src/0847-Shortest-Path-Visiting-All-Nodes/0847.js)|||Hard|
|0852|[Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/) || [c++](./src/0852-Peak-Index-in-a-Mountain-Array/0852.cpp) |[python](./src/0852-Peak-Index-in-a-Mountain-Array/0852.py)|||||Easy|
|0857|[Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers/)||[c++](./src/0857-Minimum-Cost-to-Hire-K-Workers/0857.cpp)|[python](./src/0857-Minimum-Cost-to-Hire-K-Workers/0857.py)|[go](./src/0857-Minimum-Cost-to-Hire-K-Workers/0857.go)|[js](./src/0857-Minimum-Cost-to-Hire-K-Workers/0857.js)|[java](./src/0857-Minimum-Cost-to-Hire-K-Workers/0857.java)||Hard|
|0859|[Buddy Strings](https://leetcode.com/problems/buddy-strings/) || [c++](./src/0859-Buddy-Strings/0859.cpp) |||||[rust](./src/0859-Buddy-Strings/0859.rs)|Easy|
|0872|[Leaf-Similar Trees](https://leetcode.com/problems/peak-index-in-a-mountain-array/) || [c++](./src/0852-Peak-Index-in-a-Mountain-Array/0852.cpp) |[python](./src/0852-Peak-Index-in-a-Mountain-Array/0852.py)|||||Easy|
|0873|[Length of Longest Fibonacci Subsequence](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence/) || [c++](./src/0873-Length-of-Longest-Fibonacci-Subsequence/0873.cpp) |[python](./src/0873-Length-of-Longest-Fibonacci-Subsequence/0873.py)|||||Medium|
|0874|[Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation/) || [c++](./src/0874-Walking-Robot-Simulation/0874.cpp) |[python](./src/0874-Walking-Robot-Simulation/0874.py)|||||Easy|
|0876|[Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/)||[c++](./src/0876-Middle-of-the-Linked-List/0876.cpp)|[python](./src/0876-Middle-of-the-Linked-List/0876.py)|[go](./src/0876-Middle-of-the-Linked-List/0876.go)|[js](./src/0876-Middle-of-the-Linked-List/0876.js)|[java](./src/0876-Middle-of-the-Linked-List/0876.java)||Easy|
|0878|[Nth Magical Number](https://leetcode.com/problems/nth-magical-number/) || [c++](./src/0878-Nth-Magical-Number/0878.cpp) ||||||Hard|
|0891|[Sum of Subsequence Widths](https://leetcode.com/problems/sum-of-subsequence-widths/) || [c++](./src/0891-Sum-of-Subsequence-Widths/0891.cpp) |[python](./src/0891-Sum-of-Subsequence-Widths/0891.py)|[go](./src/0891-Sum-of-Subsequence-Widths/0891.go)|[js](./src/0891-Sum-of-Subsequence-Widths/0891.js)|||Hard|
|0892|[Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes/)||[c++](./src/0892-Surface-Area-of-3D-Shapes/0892.cpp)|[python](./src/0892-Surface-Area-of-3D-Shapes/0892.py)|[go](./src/0892-Surface-Area-of-3D-Shapes/0892.go)|[js](./src/0892-Surface-Area-of-3D-Shapes/0892.js)|[java](./src/0892-Surface-Area-of-3D-Shapes/0892.java)||Easy|
|0895|[Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack/) || [c++](./src/0895-Maximum-Frequency-Stack/0895.cpp) ||||||Hard|
|0901|[Online Stock Span](https://leetcode.com/problems/online-stock-span/) || [c++](./src/0901-Online-Stock-Span/0901.cpp) |[python](./src/0901-Online-Stock-Span/0901.py)|||||Medium|
|0902|[Numbers At Most N Given Digit Set](https://leetcode.com/problems/numbers-at-most-n-given-digit-set/) || [c++](./src/0902-Numbers-At-Most-N-Given-Digit-Set/0902.cpp) |[python](./src/0902-Numbers-At-Most-N-Given-Digit-Set/0902.py)|||||Hard|
|0904|[Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets/) || [c++](./src/0904-Fruit-Into-Baskets/0904.cpp)||||||Medium|
|0907|[Sum of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums/) || [c++](./src/0907-Sum-of-Subarray-Minimums/0907.cpp) |[python](./src/0907-Sum-of-Subarray-Minimums/0907.py)|||||Medium|
|0914|[X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/)||[c++](./src/0914-X-of-a-Kind-in-a-Deck-of-Cards/0914.cpp)|[python](./src/0914-X-of-a-Kind-in-a-Deck-of-Cards/0914.py)|[go](./src/0914-X-of-a-Kind-in-a-Deck-of-Cards/0914.go)|[js](./src/0914-X-of-a-Kind-in-a-Deck-of-Cards/0914.js)|[java](./src/0914-X-of-a-Kind-in-a-Deck-of-Cards/0914.java)||Easy|
|0917|[Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters/) || [c++](./src/0917-Reverse-Only-Letters/0917.cpp) |[python](./src/0917-Reverse-Only-Letters/0917.py)|||||Easy|
|0918|[Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray/) || [c++](./src/0918-Maximum-Sum-Circular-Subarray/0918.cpp) |[python](./src/0918-Maximum-Sum-Circular-Subarray/0918.py)|||||Medium|
|0919|[Complete Binary Tree Inserter](https://leetcode.com/problems/complete-binary-tree-inserter/) || [c++](./src/0919-Complete-Binary-Tree-Inserter/0919.cpp) |[python](./src/0919-Complete-Binary-Tree-Inserter/0919.py)|||||Medium|
|0920|[Number of Music Playlists](https://leetcode.com/problems/number-of-music-playlists/) || [c++](./src/0920-Number-of-Music-Playlists/0920.cpp) |[python](./src/0920-Number-of-Music-Playlists/0920.py)|||||Medium|
|0921|[Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/) || [c++](./src/0921-Minimum-Add-to-Make-Parentheses-Valid/0921.cpp) |[python](./src/0921-Minimum-Add-to-Make-Parentheses-Valid/0921.py)|||||Medium|
|0922|[Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii/) || [c++](./src/0922-Sort-Array-By-Parity-II/0922.cpp) |[python](./src/0922-Sort-Array-By-Parity-II/0922.py)|||||Easy|
|0923|[3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity/) || [c++](./src/0923-3Sum-With-Multiplicity/0923.cpp) |[python](./src/0923-3Sum-With-Multiplicity/0923.py)|||||Medium|
|0925|[Long Pressed Name](https://leetcode.com/problems/long-pressed-name/) || [c++](./src/0925-Long-Pressed-Name/0925.cpp) |[python](./src/0925-Long-Pressed-Name/0925.py)|||||Easy|
|0926|[Flip String to Monotone Increasing](https://leetcode.com/problems/flip-string-to-monotone-increasing/) || [c++](./src/0926-Flip-String-to-Monotone-Increasing/0926.cpp) |[python](./src/0926-Flip-String-to-Monotone-Increasing/0926.py)|||||Medium|
|0927|[Three Equal Parts](https://leetcode.com/problems/three-equal-parts/) || [c++](./src/0927-Three-Equal-Parts/0927.cpp) |[python](./src/0927-Three-Equal-Parts/0927.py)|||||Medium|
|0929|[Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses/) || [c++](./src/0929-Unique-Email-Addresses/0929.cpp) |[python](./src/0929-Unique-Email-Addresses/0929.py)|||||Easy|
|0930|[Binary Subarrays With Sum](https://leetcode.com/problems/binary-subarrays-with-sum/) || [c++](./src/0930-Binary-Subarrays-With-Sum/0930.cpp) |[python](./src/0930-Binary-Subarrays-With-Sum/0930.py)|||||Medium|
|0931|[Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum/) || [c++](./src/0931-Minimum-Falling-Path-Sum/0931.cpp) |[python](./src/0931-Minimum-Falling-Path-Sum/0931.py)|||||Medium|
|0932|[Beautiful Array](https://leetcode.com/problems/minimum-falling-path-sum/) || [c++](./src/0932-Beautiful-Array/0932.cpp) |[python](./src/0932-Beautiful-Array/0932.py)|||||Medium|
|0933|[Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/) || [c++](./src/0933-Number-of-Recent-Calls/0933.cpp) |[python](./src/0933-Number-of-Recent-Calls/0933.py)|||||Easy|
|0934|[Shortest Bridge](https://leetcode.com/problems/shortest-bridge/) || [c++](./src/0934-Shortest-Bridge/0934.cpp) |[python](./src/0934-Shortest-Bridge/0934.py)|||||Medium|
|0935|[Knight Dialer](https://leetcode.com/problems/knight-dialer/) || [c++](./src/0935-Knight-Dialer/0935.cpp) |[python](./src/0935-Knight-Dialer/0935.py)|||||Medium|
|0936|[Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence/) || [c++](./src/0936-Stamping-The-Sequence/0936.cpp) |[python](./src/0936-Stamping-The-Sequence/0936.py)|[go](./src/0936-Stamping-The-Sequence/0936.go)|[js](./src/0936-Stamping-The-Sequence/0936.js)|||Hard|
|0937|[Reorder Log Files](https://leetcode.com/problems/reorder-log-files/) || [c++](./src/0937-Reorder-Log-Files/0937.cpp) |[python](./src/0937-Reorder-Log-Files/0937.py)|||||Easy|
|0938|[Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/) || [c++](./src/0938-Range-Sum-of-BST/0938.cpp) |[python](./src/0938-Range-Sum-of-BST/0938.py)|||||Medium|
|0939|[Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle/) || [c++](./src/0939-Minimum-Area-Rectangle/0939.cpp) |[python](./src/0939-Minimum-Area-Rectangle/0939.py)|||||Medium|
|0940|[Distinct Subsequences II](https://leetcode.com/problems/distinct-subsequences-ii/) || [c++](./src/0940-Distinct-Subsequences-II/0940.cpp) |[python](./src/0940-Distinct-Subsequences-II/0940.py)|||||Hard|
|0941|[Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array/) || [c++](./src/0941-Valid-Mountain-Array/0941.cpp) |[python](./src/0941-Valid-Mountain-Array/0941.py)|||||Easy|
|0942|[DI String Match](https://leetcode.com/problems/di-string-match/) || [c++](./src/0942-DI-String-Match/0942.cpp) |[python](./src/0942-DI-String-Match/0942.py)|||||Easy|
|0943|[Find the Shortest Superstring](https://leetcode.com/problems/find-the-shortest-superstring/) || [c++](./src/0943-Find-the-Shortest-Superstring/0943.cpp) |[python](./src/0943-Find-the-Shortest-Superstring/0943.py)|||||Hard|
|0944|[Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted/) || [c++](./src/0944-Delete-Columns-to-Make-Sorted/0944.cpp) |[python](./src/0944-Delete-Columns-to-Make-Sorted/0944.py)|||||Easy|
|0945|[Minimum Increment to Make Array Unique](https://leetcode.com/problems/minimum-increment-to-make-array-unique/) || [c++](./src/0945-Minimum-Increment-to-Make-Array-Unique/0945.cpp) |[python](./src/0945-Minimum-Increment-to-Make-Array-Unique/0945.py)|||||Medium|
|0946|[Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences/) || [c++](./src/0946-Validate-Stack-Sequences/0946.cpp) |[python](./src/0946-Validate-Stack-Sequences/0946.py)|[go](./src/0946-Validate-Stack-Sequences/0946.go)|[js](./src/0946-Validate-Stack-Sequences/0946.js)|[java](./src/0946-Validate-Stack-Sequences/0946.java)||Medium|
|0947|[Most Stones Removed with Same Row or Column](https://leetcode.com/problems/validate-stack-sequences/https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/) || [c++](./src/0947-Most-Stones-Removed-with-Same-Row-or-Column/0947.cpp) |[python](./src/0947-Most-Stones-Removed-with-Same-Row-or-Column/0947.py)|||||Medium|
|0948|[Bag of Tokens](https://leetcode.com/problems/bag-of-tokens/) || [c++](./src/0948-Bag-of-Tokens/0948.cpp) |[python](./src/0948-Bag-of-Tokens/0948.py)|||||Medium|
|0949|[Largest Time for Given Digits](https://leetcode.com/problems/largest-time-for-given-digits/) || [c++](./src/0949-Largest-Time-for-Given-Digits/0949.cpp) |[python](./src/0949-Largest-Time-for-Given-Digits/0949.py)|||||Easy|
|0950|[Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order/) || [c++](./src/0950-Reveal-Cards-In-Increasing-Order/0950.cpp) |[python](./src/0950-Reveal-Cards-In-Increasing-Order/0950.py)|||||Medium|
|0951|[Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees/) || [c++](./src/0951-Flip-Equivalent-Binary-Trees/0951.cpp) |[python](./src/0951-Flip-Equivalent-Binary-Trees/0951.py)|||||Medium|
|0953|[Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary/) || [c++](./src/0953-Verifying-an-Alien-Dictionary/0953.cpp) |[python](./src/0953-Verifying-an-Alien-Dictionary/0953.py)|||||Easy|
|0954|[Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs/) || [c++](./src/0954-Array-of-Doubled-Pairs/0954.cpp) |[python](./src/0954-Array-of-Doubled-Pairs/0954.py)|||||Medium|
|0955|[Delete Columns to Make Sorted II](https://leetcode.com/problems/delete-columns-to-make-sorted-ii/) || [c++](./src/0955-Delete-Columns-to-Make-Sorted-II/0955.cpp) |[python](./src/0955-Delete-Columns-to-Make-Sorted-II/0955.py)|||||Medium|
|0956|[Tallest Billboard](https://leetcode.com/problems/tallest-billboard/) || [c++](./src/0956-Tallest-Billboard/0956.cpp) |[python](./src/0956-Tallest-Billboard/0956.py)|||||Hard|
|0957|[Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days/) || [c++](./src/0957-Prison-Cells-After-N-Days/0957.cpp) |[python](./src/0957-Prison-Cells-After-N-Days/0957.py)|||||Medium|
|0958|[Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree/) || [c++](./src/0958-Check-Completeness-of-a-Binary-Tree/0958.cpp) |[python](./src/0958-Check-Completeness-of-a-Binary-Tree/0958.py)|||||Medium|
|0959|[Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes/) || [c++](./src/0959-Regions-Cut-By-Slashes/0959.cpp) |[python](./src/0959-Regions-Cut-By-Slashes/0959.py)|||||Medium|
|0960|[Delete Columns to Make Sorted III](https://leetcode.com/problems/delete-columns-to-make-sorted-iii/) || [c++](./src/0960-Delete-Columns-to-Make-Sorted-III/0960.cpp) |[python](./src/0960-Delete-Columns-to-Make-Sorted-III/0960.py)|||||Hard|
|0961|[N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array/) || [c++](./src/0961-N-Repeated-Element-in-Size-2N-Array/0961.cpp) |[python](./src/0961-N-Repeated-Element-in-Size-2N-Array/0961.py)|||||Easy|
|0962|[Maximum Width Ramp](https://leetcode.com/problems/maximum-width-ramp/) || [c++](./src/0962-Maximum-Width-Ramp/0962.cpp) |[python](./src/0962-Maximum-Width-Ramp/0962.py)|||||Medium|
|0963|[Minimum Area Rectangle II](https://leetcode.com/problems/minimum-area-rectangle-ii/) || [c++](./src/0963-Minimum-Area-Rectangle-II/0963.cpp) |[python](./src/0963-Minimum-Area-Rectangle-II/0963.py)|||||Medium|
|0965|[Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree/) || [c++](./src/0965-Univalued-Binary-Tree/0965.cpp) |[python](./src/0965-Univalued-Binary-Tree/0965.py)|||||Easy|
|0966|[Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker/) || [c++](./src/0966-Vowel-Spellchecker/0966.cpp) |[python](./src/0966-Vowel-Spellchecker/0966.py)|||||Medium|
|0967|[Numbers With Same Consecutive Differences](https://leetcode.com/problems/numbers-with-same-consecutive-differences/) || [c++](./src/0967-Numbers-With-Same-Consecutive-Differences/0967.cpp) |[python](./src/0967-Numbers-With-Same-Consecutive-Differences/0967.py)|||||Medium|
|0969|[Pancake Sorting](https://leetcode.com/problems/pancake-sorting/) || [c++](./src/0969-Pancake-Sorting/0969.cpp) |[python](./src/0969-Pancake-Sorting/0969.py)|||||Medium|
|0970|[Powerful Integers](https://leetcode.com/problems/powerful-integers/) || [c++](./src/0970-Powerful-Integers/0970.cpp) |[python](./src/0970-Powerful-Integers/0970.py)|||||Easy|
|0971|[Flip Binary Tree To Match Preorder Traversal](https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal/) || [c++](./src/0971-Flip-Binary-Tree-To-Match-Preorder-Traversal/0971.cpp) |[python](./src/0971-Flip-Binary-Tree-To-Match-Preorder-Traversal/0971.py)|||||Medium|
|0972|[Equal Rational Numbers](https://leetcode.com/problems/equal-rational-numbers/) || [c++](./src/0972-Equal-Rational-Numbers/0972.cpp) |[python](./src/0972-Equal-Rational-Numbers/0972.py)|||||Hard|
|0973|[K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) || [c++](./src/0973-K-Closest-Points-to-Origin/0973.cpp) |[python](./src/0973-K-Closest-Points-to-Origin/0973.py)|||||Easy|
|0974|[Subarray Sums Divisible by K](https://leetcode.com/problems/equal-rational-numbers/) || [c++](./src/0974-Subarray-Sums-Divisible-by-K/0974.cpp) |[python](./src/0974-Subarray-Sums-Divisible-by-K/0974.py)|||||Medium|
|0975|[Odd Even Jump](https://leetcode.com/problems/odd-even-jump/) || [c++](./src/0975-Odd-Even-Jump/0975.cpp) |[python](./src/0975-Odd-Even-Jump/0975.py)|||||Hard|
|0976|[Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/) || [c++](./src/0976-Largest-Perimeter-Triangle/0976.cpp) |[python](./src/0976-Largest-Perimeter-Triangle/0976.py)|||||Easy|
|0977|[Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/) || [c++](./src/0977-Squares-of-a-Sorted-Array/0977.cpp) |[python](./src/0977-Squares-of-a-Sorted-Array/0977.py)|||||Easy|
|0978|[Longest Turbulent Subarray](https://leetcode.com/problems/longest-turbulent-subarray/) || [c++](./src/0978-Longest-Turbulent-Subarray/0978.cpp) |[python](./src/0978-Longest-Turbulent-Subarray/0978.py)|||||Medium|
|0979|[Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree/) || [c++](./src/0979-Distribute-Coins-in-Binary-Tree/0979.cpp) |[python](./src/0979-Distribute-Coins-in-Binary-Tree/0979.py)|||||Medium|
|0980|[Unique Paths III](https://leetcode.com/problems/unique-paths-iii/) || [c++](./src/0980-Unique-Paths-III/0980.cpp) |[python](./src/0980-Unique-Paths-III/0980.py)|||||Medium|
|0981|[Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/) || [c++](./src/0981-Time-Based-Key-Value-Store/0981.cpp) |[python](./src/0981-Time-Based-Key-Value-Store/0981.py)|||||Medium|
|0982|[Triples with Bitwise AND Equal To Zero](https://leetcode.com/problems/triples-with-bitwise-and-equal-to-zero/) || [c++](./src/0982-Triples-with-Bitwise-AND-Equal-To-Zero/0982.cpp) |[python](./src/0982-Triples-with-Bitwise-AND-Equal-To-Zero/0982.py)|||||Hard|
|0983|[Minimum Cost For Tickets](https://leetcode.com/problems/minimum-cost-for-tickets/) || [c++](./src/0983-Minimum-Cost-For-Tickets/0983.cpp) |[python](./src/0983-Minimum-Cost-For-Tickets/0983.py)|||||Medium|
|0984|[String Without AAA or BBB](https://leetcode.com/problems/string-without-aaa-or-bbb/) || [c++](./src/0984-String-Without-AAA-or-BBB/0984.cpp) |[python](./src/0984-String-Without-AAA-or-BBB/0984.py)|||||Easy|
|0985|[Sum of Even Numbers After Queries](https://leetcode.com/problems/sum-of-even-numbers-after-queries/) || [c++](./src/0985-Sum-of-Even-Numbers-After-Queries/0985.cpp) |[python](./src/0985-Sum-of-Even-Numbers-After-Queries/0985.py)|||||Easy|
|0986|[Interval List Intersections](https://leetcode.com/problems/interval-list-intersections/) || [c++](./src/0986-Interval-List-Intersections/0986.cpp) |[python](./src/0986-Interval-List-Intersections/0986.py)|||||Medium|
|0987|[Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/) || [c++](./src/0987-Vertical-Order-Traversal-of-a-Binary-Tree/0987.cpp) |[python](./src/0987-Vertical-Order-Traversal-of-a-Binary-Tree/0987.py)|||||Medium|
|0988|[Smallest String Starting From Leaf](https://leetcode.com/problems/smallest-string-starting-from-leaf/) || [c++](./src/0988-Smallest-String-Starting-From-Leaf/0988.cpp) |[python](./src/0988-Smallest-String-Starting-From-Leaf/0988.py)|||||Medium|
|0989|[Add to Array-Form of Integer](https://leetcode.com/problems/add-to-array-form-of-integer/) || [c++](./src/0989-Add-to-Array-Form-of-Integer/0989.cpp) |[python](./src/0989-Add-to-Array-Form-of-Integer/0989.py)|||||Easy|
|0990|[Satisfiability of Equality Equations](https://leetcode.com/problems/satisfiability-of-equality-equations/) || [c++](./src/0990-Satisfiability-of-Equality-Equations/0990.cpp) |[python](./src/0990-Satisfiability-of-Equality-Equations/0990.py)|||||Medium|
|0991|[Broken Calculator](https://leetcode.com/problems/broken-calculator/) || [c++](./src/0991-Broken-Calculator/0991.cpp) |[python](./src/0991-Broken-Calculator/0991.py)|||||Medium|
|0992|[Subarrays with K Different Integers](https://leetcode.com/problems/subarrays-with-k-different-integers/) || [c++](./src/0992-Subarrays-with-K-Different-Integers/0992.cpp) |[python](./src/0992-Subarrays-with-K-Different-Integers/0992.py)|||||Hard|
|0993|[Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree/) || [c++](./src/0993-Cousins-in-Binary-Tree/0993.cpp) |[python](./src/0993-Cousins-in-Binary-Tree/0993.py)|||||Easy|
|0994|[Rotting Oranges](https://leetcode.com/problems/rotting-oranges/) || [c++](./src/0994-Rotting-Oranges/0994.cpp) |[python](./src/0994-Rotting-Oranges/0994.py)|||||Easy|
|0995|[Minimum Number of K Consecutive Bit Flips](https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/) || [c++](./src/0995-Minimum-Number-of-K-Consecutive-Bit-Flips/0995.cpp) |[python](./src/0995-Minimum-Number-of-K-Consecutive-Bit-Flips/0995.py)|||||Hard|
|0996|[Number of Squareful Arrays](https://leetcode.com/problems/number-of-squareful-arrays/) || [c++](./src/0996-Number-of-Squareful-Arrays/0996.cpp) |[python](./src/0996-Number-of-Squareful-Arrays/0996.py)|||||Hard|
|0997|[Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/) || [c++](./src/0997-Find-the-Town-Judge/0997.cpp) |[python](./src/0997-Find-the-Town-Judge/0997.py)|||||Easy|
|0998|[Maximum Binary Tree II](https://leetcode.com/problems/maximum-binary-tree-ii/) || [c++](./src/0998-Maximum-Binary-Tree-II/0998.cpp) |[python](./src/0998-Maximum-Binary-Tree-II/0998.py)|||||Medium|
|0999|[Available Captures for Rook](https://leetcode.com/problems/available-captures-for-rook/) || [c++](./src/0999-Available-Captures-for-Rook/0999.cpp) |[python](./src/0999-Available-Captures-for-Rook/0999.py)|||||Easy|
|1000|[Minimum Cost to Merge Stones](https://leetcode.com/problems/minimum-cost-to-merge-stones/) || [c++](./src/1000-Minimum-Cost-to-Merge-Stones/1000.cpp) ||||[java](./src/1000-Minimum-Cost-to-Merge-Stones/1000.java)||Hard|
|1001|[Grid Illumination](https://leetcode.com/problems/grid-illumination/) || [c++](./src/1001-Grid-Illumination/1001.cpp) |[python](./src/1001-Grid-Illumination/1001.py)|||||Hard|
|1002|[Find Common Characters](https://leetcode.com/problems/find-common-characters/) || [c++](./src/1002-Find-Common-Characters/1002.cpp) |[python](./src/1002-Find-Common-Characters/1002.py)|||||Easy|
|1003|[Check If Word Is Valid After Substitutions](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions/) || [c++](./src/1003-Check-If-Word-Is-Valid-After-Substitutions/1003.cpp) |[python](./src/1003-Check-If-Word-Is-Valid-After-Substitutions/1003.py)|||||Medium|
|1004|[Max Consecutive Ones III](https://leetcode.com/problems/max-consecutive-ones-iii/) || [c++](./src/1004-Max-Consecutive-Ones-III/1004.cpp) |[python](./src/1004-Max-Consecutive-Ones-III/1004.py)|||||Medium|
|1005|[Maximize Sum Of Array After K Negations](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/) || [c++](./src/1005-Maximize-Sum-Of-Array-After-K-Negations/1005.cpp) |[python](./src/1005-Maximize-Sum-Of-Array-After-K-Negations/1005.py)|||||Easy|
|1006|[Clumsy Factorial](https://leetcode.com/problems/clumsy-factorial/) || [c++](./src/1006-Clumsy-Factorial/1006.cpp) |[python](./src/1006-Clumsy-Factorial/1006.py)|||||Medium|
|1007|[Minimum Domino Rotations For Equal Row](https://leetcode.com/problems/minimum-domino-rotations-for-equal-row/) || [c++](./src/1007-Minimum-Domino-Rotations-For-Equal-Row/1007.cpp) |[python](./src/1007-Minimum-Domino-Rotations-For-Equal-Row/1007.py)|||||Medium|
|1008|[Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/) || [c++](./src/1008-Construct-Binary-Search-Tree-from-Preorder-Traversal/1008.cpp) |[python](./src/1008-Construct-Binary-Search-Tree-from-Preorder-Traversal/1008.py)|||||Medium|
|1009|[Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer/) || [c++](./src/1009-Complement-of-Base-10-Integer/1009.cpp) |[python](./src/1009-Complement-of-Base-10-Integer/1009.py)|||||Easy|
|1010|[Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/) || [c++](./src/1010-Pairs-of-Songs-With-Total-Durations-Divisible-by-60/1010.cpp) |[python](./src/1010-Pairs-of-Songs-With-Total-Durations-Divisible-by-60/1010.py)|||||Easy|
|1011|[Capacity To Ship Packages Within D Days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/) || [c++](./src/1011-Capacity-To-Ship-Packages-Within-D-Days/1011.cpp) |[python](./src/1011-Capacity-To-Ship-Packages-Within-D-Days/1011.py)|||||Medium|
|1012|[Numbers With Repeated Digits](https://leetcode.com/problems/numbers-with-repeated-digits/) || [c++](./src/1012-Numbers-With-Repeated-Digits/1012.cpp) |[python](./src/1012-Numbers-With-Repeated-Digits/1012.py)|||||Hard|
|1013|[Partition Array Into Three Parts With Equal Sum](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/) || [c++](./src/1013-Partition-Array-Into-Three-Parts-With-Equal-Sum/1013.cpp) |[python](./src/1013-Partition-Array-Into-Three-Parts-With-Equal-Sum/1013.py)|||||Easy|
|1014|[Best Sightseeing Pair](https://leetcode.com/problems/best-sightseeing-pair/) || [c++](./src/1014-Best-Sightseeing-Pair/1014.cpp) |[python](./src/1014-Best-Sightseeing-Pair/1014.py)|||||Medium|
|1015|[Smallest Integer Divisible by K](https://leetcode.com/problems/smallest-integer-divisible-by-k/) || [c++](./src/1015-Smallest-Integer-Divisible-by-K/1015.cpp) |[python](./src/1015-Smallest-Integer-Divisible-by-K/1015.py)|||||Medium|
|1017|[Convert to Base -2](https://leetcode.com/problems/convert-to-base-2/) || [c++](./src/1017-Convert-to-Base-2/1017.cpp) |[python](./src/1017-Convert-to-Base-2/1017.py)|||||Medium|
|1018|[Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5/) || [c++](./src/1018-Binary-Prefix-Divisible-By-5/1018.cpp) |[python](./src/1018-Binary-Prefix-Divisible-By-5/1018.py)|||||Easy|
|1019|[Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/) || [c++](./src/1019-Next-Greater-Node-In-Linked-List/1019.cpp) |[python](./src/1019-Next-Greater-Node-In-Linked-List/1019.py)|||||Medium|
|1020|[Number of Enclaves](https://leetcode.com/problems/next-greater-node-in-linked-list/) || [c++](./src/1020-Number-of-Enclaves/1020.cpp) |[python](./src/1020-Number-of-Enclaves/1020.py)|||||Medium|
|1021|[Remove Outermost Parentheses](https://leetcode.com/problems/remove-outermost-parentheses/) || [c++](./src/1021-Remove-Outermost-Parentheses/1021.cpp) |[python](./src/1021-Remove-Outermost-Parentheses/1021.py)|||||Easy|
|1022|[Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/) || [c++](./src/1022-Sum-of-Root-To-Leaf-Binary-Numbers/1022.cpp) |[python](./src/1022-Sum-of-Root-To-Leaf-Binary-Numbers/1022.py)|||||Easy|
|1023|[Camelcase Matching](https://leetcode.com/problems/camelcase-matching/) || [c++](./src/1023-Camelcase-Matching/1023.cpp) |[python](./src/1023-Camelcase-Matching/1023.py)|[go](./src/1023-Camelcase-Matching/1023.go)|[js](./src/1023-Camelcase-Matching/1023.js)|||Medium|
|1024|[Video Stitching](https://leetcode.com/problems/video-stitching/)||[c++](./src/1024-Video-Stitching/1024.cpp)|[python](./src/1024-Video-Stitching/1024.py)|[go](./src/1024-Video-Stitching/1024.go)|[js](./src/1024-Video-Stitching/1024.js)|[java](./src/1024-Video-Stitching/1024.java)||Medium|
|1025|[Divisor Game](https://leetcode.com/problems/divisor-game/) || [c++](./src/1025-Divisor-Game/1025.cpp) |[python](./src/1025-Divisor-Game/1025.py)|||||Easy|
|1026|[Maximum Difference Between Node and Ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/) || [c++](./src/1026-Maximum-Difference-Between-Node-and-Ancestor/1026.cpp) |[python](./src/1026-Maximum-Difference-Between-Node-and-Ancestor/1026.py)|||||Medium|
|1027|[Longest Arithmetic Sequence](https://leetcode.com/problems/longest-arithmetic-sequence/) || [c++](./src/1027-Longest-Arithmetic-Sequence/1027.cpp) |[python](./src/1027-Longest-Arithmetic-Sequence/1027.py)|[go](./src/1027-Longest-Arithmetic-Sequence/1027.go)|[js](./src/1027-Longest-Arithmetic-Sequence/1027.js)|||Medium|
|1033|[Moving Stones Until Consecutive](https://leetcode.com/problems/moving-stones-until-consecutive/) || [c++](./src/1033-Moving-Stones-Until-Consecutive/1033.cpp) |[python](./src/1033-Moving-Stones-Until-Consecutive/1033.py)|||||Easy|
|1034|[Coloring A Border](https://leetcode.com/problems/coloring-a-border/) || [c++](./src/1034-Coloring-A-Border/1034.cpp) |[python](./src/1034-Coloring-A-Border/1034.py)|||||Medium|
|1035|[Uncrossed Lines](https://leetcode.com/problems/uncrossed-lines/) || [c++](./src/1035-Uncrossed-Lines/1035.cpp) |[python](./src/1035-Uncrossed-Lines/1035.py)|||||Medium|
|1037|[Valid Boomerang](https://leetcode.com/problems/valid-boomerang/) || [c++](./src/1037-Valid-Boomerang/1037.cpp) |[python](./src/1037-Valid-Boomerang/1037.py)|||||Medium|
|1038|[Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/) || [c++](./src/1038-Binary-Search-Tree-to-Greater-Sum-Tree/1038.cpp) |[python](./src/1038-Binary-Search-Tree-to-Greater-Sum-Tree/1038.py)|||||Medium|
|1039|[Minimum Score Triangulation of Polygon](https://leetcode.com/problems/minimum-score-triangulation-of-polygon/) || [c++](./src/1039-Minimum-Score-Triangulation-of-Polygon/1039.cpp) |[python](./src/1039-Minimum-Score-Triangulation-of-Polygon/1039.py)|||||Medium|
|1041|[Robot Bounded In Circle](https://leetcode.com/problems/robot-bounded-in-circle/) || [c++](./src/1041-Robot-Bounded-In-Circle/1041.cpp) |[python](./src/1041-Robot-Bounded-In-Circle/1041.py)|[go](./src/1041-Robot-Bounded-In-Circle/1041.go)||||Easy|
|1042|[Flower Planting With No Adjacent](https://leetcode.com/problems/flower-planting-with-no-adjacent/) || [c++](./src/1042-Flower-Planting-With-No-Adjacent/1042.cpp) |[python](./src/1042-Flower-Planting-With-No-Adjacent/1042.py)|[go](./src/1042-Flower-Planting-With-No-Adjacent/1042.go)||||Easy|
|1043|[Partition Array for Maximum Sum](https://leetcode.com/problems/partition-array-for-maximum-sum/) || [c++](./src/1043-Partition-Array-for-Maximum-Sum/1043.cpp) |[python](./src/1043-Partition-Array-for-Maximum-Sum/1043.py)|[go](./src/1043-Partition-Array-for-Maximum-Sum/1043.go)||||Medium|
|1046|[Last Stone Weight](https://leetcode.com/problems/last-stone-weight/) || [c++](./src/1046-Last-Stone-Weight/1046.cpp) |[python](./src/1046-Last-Stone-Weight/1046.py)|[go](./src/1046-Last-Stone-Weight/1046.go)|[js](./src/1046-Last-Stone-Weight/1046.js)|||Easy|
|1047|[Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/) || [c++](./src/1047-Remove-All-Adjacent-Duplicates-In-String/1047.cpp) |[python](./src/1047-Remove-All-Adjacent-Duplicates-In-String/1047.py)|[go](./src/1047-Remove-All-Adjacent-Duplicates-In-String/1047.go)|[js](./src/1047-Remove-All-Adjacent-Duplicates-In-String/1047.js)|||Easy|
|1048|[Longest String Chain](https://leetcode.com/problems/longest-string-chain/) || [c++](./src/1048-Longest-String-Chain/1048.cpp) |[python](./src/1048-Longest-String-Chain/1048.py)|[go](./src/1048-Longest-String-Chain/1048.go)|[js](./src/1048-Longest-String-Chain/1048.js)|||Medium|
|1049|[Last Stone Weight II](https://leetcode.com/problems/last-stone-weight-ii/) || [c++](./src/1049-Last-Stone-Weight-II/1049.cpp) |[python](./src/1049-Last-Stone-Weight-II/1049.py)|[go](./src/1049-Last-Stone-Weight-II/1049.go)|[js](./src/1049-Last-Stone-Weight-II/1049.js)|||Medium|
|1051|[Height Checker](https://leetcode.com/problems/height-checker/) || [c++](./src/1051-Height-Checker/1051.cpp) |[python](./src/1051-Height-Checker/1051.py)|||||Easy|
|1052|[Grumpy Bookstore Owner](https://leetcode.com/problems/grumpy-bookstore-owner/) || [c++](./src/1052-Grumpy-Bookstore-Owner/1052.cpp) |[python](./src/1052-Grumpy-Bookstore-Owner/1052.py)|||||Medium|
|1053|[Previous Permutation With One Swap](https://leetcode.com/problems/previous-permutation-with-one-swap/) || [c++](./src/1053-Previous-Permutation-With-One-Swap/1053.cpp) |[python](./src/1053-Previous-Permutation-With-One-Swap/1053.py)|||||Medium|
|1054|[Distant Barcodes](https://leetcode.com/problems/distant-barcodes/) || [c++](./src/1054-Distant-Barcodes/1054.cpp) |[python](./src/1054-Distant-Barcodes/1054.py)|||||Medium|
|1061|[Lexicographically Smallest Equivalent String](https://leetcode.com/problems/lexicographically-smallest-equivalent-string/) ||[c++](./src/1061-Lexicographically-Smallest-Equivalent-String/1061.cpp)||||||Medium|
|1064|[Fixed Point](https://leetcode.com/contest/biweekly-contest-1/problems/fixed-point/) || [c++](./src/1064-Fixed-Point/1064.cpp) |[python](./src/1064-Fixed-Point/1064.py)|||||Easy|
|1065|[Index Pairs of a String](https://leetcode.com/contest/biweekly-contest-1/problems/index-pairs-of-a-string/) || [c++](./src/1065-Index-Pairs-of-a-String/1065.cpp) |[python](./src/1065-Index-Pairs-of-a-String/1065.py)|||||Easy|
|1066|[Campus Bikes II](https://leetcode.com/contest/biweekly-contest-1/problems/campus-bikes-ii/) || [c++](./src/1066-Campus-Bikes-II/1066.cpp) |[python](./src/1066-Campus-Bikes-II/1066.py)|||||Medium|
|1067|[Digit Count in Range](https://leetcode.com/contest/biweekly-contest-1/problems/digit-count-in-range/) || [c++](./src/1067-Digit-Count-in-Range/1067.cpp) |[python](./src/1067-Digit-Count-in-Range/1067.py)|||||Medium|
|1071|[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/)||[c++](./src/1071-Greatest-Common-Divisor-of-Strings/1071.cpp)|[python](./src/1071-Greatest-Common-Divisor-of-Strings/1071.py)|[go](./src/1071-Greatest-Common-Divisor-of-Strings/1071.go)|[js](./src/1071-Greatest-Common-Divisor-of-Strings/1071.js)|[java](./src/1071-Greatest-Common-Divisor-of-Strings/1071.java)||Easy|
|1072|[Flip Columns For Maximum Number of Equal Rows](https://leetcode.com/problems/flip-columns-for-maximum-number-of-equal-rows/)||[c++](./src/1072-Flip-Columns-For-Maximum-Number-of-Equal-Rows/1072.cpp)|[python](./src/1072-Flip-Columns-For-Maximum-Number-of-Equal-Rows/1072.py)|[go](./src/1072-Flip-Columns-For-Maximum-Number-of-Equal-Rows/1072.go)|[js](./src/1072-Flip-Columns-For-Maximum-Number-of-Equal-Rows/1072.js)|[java](./src/1072-Flip-Columns-For-Maximum-Number-of-Equal-Rows/1072.java)||Medium|
|1073|[Adding Two Negabinary Numbers](https://leetcode.com/problems/adding-two-negabinary-numbers/) || [c++](./src/1073-Adding-Two-Negabinary-Numbers/1073.cpp) |[python](./src/1073-Adding-Two-Negabinary-Numbers/1073.py)|[go](./src/1072-Flip-Columns-For-Maximum-Number-of-Equal-Rows/1072.go)|[js](./src/1072-Flip-Columns-For-Maximum-Number-of-Equal-Rows/1072.js)|[java](./src/1072-Flip-Columns-For-Maximum-Number-of-Equal-Rows/1072.java)||Medium|
|1074|[Number of Submatrices That Sum to Target](https://leetcode.com/problems/number-of-submatrices-that-sum-to-target/)||[c++](./src/1074-Number-of-Submatrices-That-Sum-to-Target/1074.cpp)|[python](./src/1074-Number-of-Submatrices-That-Sum-to-Target/1074.py)|[go](./src/1074-Number-of-Submatrices-That-Sum-to-Target/1074.go)|[js](./src/1074-Number-of-Submatrices-That-Sum-to-Target/1074.js)|[java](./src/1074-Number-of-Submatrices-That-Sum-to-Target/1074.java)||Hard|
|1078|[Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/) || [c++](./src/1078-Occurrences-After-Bigram/1078.cpp) |[python](./src/1078-Occurrences-After-Bigram/1078.py)|||||Easy|
|1079|[Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities/) || [c++](./src/1079-Letter-Tile-Possibilities/1079.cpp) |[python](./src/1079-Letter-Tile-Possibilities/1079.py)|||||Easy|
|1080|[Insufficient Nodes in Root to Leaf Paths](https://leetcode.com/problems/occurrences-after-bigram/) || [c++](./src/1080-Insufficient-Nodes-in-Root-to-Leaf-Paths/1080.cpp) |[python](./src/1080-Insufficient-Nodes-in-Root-to-Leaf-Paths/1080.py)|||||Medium|
|1081|[Smallest Subsequence of Distinct Characters](https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/) || [c++](./src/1081-Smallest-Subsequence-of-Distinct-Characters/1081.cpp) |[python](./src/1081-Smallest-Subsequence-of-Distinct-Characters/1081.py)|||||Medium|
|1085|[Sum of Digits in the Minimum Number](https://leetcode.com/contest/biweekly-contest-2/problems/sum-of-digits-in-the-minimum-number/) || [c++](./src/1085-Sum-of-Digits-in-the-Minimum-Number/1085.cpp) |[python](./src/1085-Sum-of-Digits-in-the-Minimum-Number/1085.py)|||||Easy|
|1086|[High Five](https://leetcode.com/contest/biweekly-contest-2/problems/high-five/) || [c++](./src/1086-High-Five/1086.cpp) |[python](./src/1086-High-Five/1086.py)|||||Easy|
|1087|[Brace Expansion](https://leetcode.com/contest/biweekly-contest-2/problems/brace-expansion/) || [c++](./src/1087-Brace-Expansion/1087.cpp) |[python](./src/1087-Brace-Expansion/1087.py)|||||Medium|
|1089|[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/) || [c++](./src/1089-Duplicate-Zeros/1089.cpp) |[python](./src/1089-Duplicate-Zeros/1089.py)|||||Easy|
|1090|[Largest Values From Labels](https://leetcode.com/problems/largest-values-from-labels/) || [c++](./src/1090-Largest-Values-From-Labels/1090.cpp) |[python](./src/1090-Largest-Values-From-Labels/1090.py)|||||Medium|
|1091|[Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/) || [c++](./src/1091-Shortest-Path-in-Binary-Matrix/1091.cpp) |[python](./src/1091-Shortest-Path-in-Binary-Matrix/1091.py)|[go](./src/1091-Shortest-Path-in-Binary-Matrix/1091.go)|[js](./src/1091-Shortest-Path-in-Binary-Matrix/1091.js)|||Medium|
|1093|[Statistics from a Large Sample](https://leetcode.com/problems/statistics-from-a-large-sample/) || [c++](./src/1093-Statistics-from-a-Large-Sample/1093.cpp) |[python](./src/1093-Statistics-from-a-Large-Sample/1093.py)|[go](./src/1093-Statistics-from-a-Large-Sample/1093.go)|[js](./src/1093-Statistics-from-a-Large-Sample/1093.js)|||Medium|
|1094|[Car Pooling](https://leetcode.com/problems/car-pooling/) || [c++](./src/1094-Car-Pooling/1094.cpp) |[python](./src/1094-Car-Pooling/1094.py)|[go](./src/1094-Car-Pooling/1094.go)|[js](./src/1094-Car-Pooling/1094.js)|||Medium|
|1095|[Find in Mountain Array](https://leetcode.com/problems/find-in-mountain-array/) || [c++](./src/1095-Find-in-Mountain-Array/1095.cpp) |[python](./src/1095-Find-in-Mountain-Array/1095.py)|[go](./src/1095-Find-in-Mountain-Array/1095.go)|[js](./src/1095-Find-in-Mountain-Array/1095.js)|||Hard|
|1096|[Brace Expansion II](https://leetcode.com/problems/brace-expansion-ii/) || [c++](./src/1096-Brace-Expansion-II/1096.cpp) |[python](./src/1096-Brace-Expansion-II/1096.py)|[go](./src/1096-Brace-Expansion-II/1096.go)||||Hard|
|1099|[Two Sum Less Than K](https://leetcode.com/contest/biweekly-contest-3/problems/two-sum-less-than-k/) || [c++](./src/1099-Two-Sum-Less-Than-K/1099.cpp) |[python](./src/1099-Two-Sum-Less-Than-K/1099.py)|[go](./src/1099-Two-Sum-Less-Than-K/1099.go)|[js](./src/1099-Two-Sum-Less-Than-K/1099.js)|||Easy|
|1100|[Find K-Length Substrings With No Repeated Characters](https://leetcode.com/contest/biweekly-contest-3/problems/find-k-length-substrings-with-no-repeated-characters/) || [c++](./src/1100-Find-K-Length-Substrings-With-No-Repeated-Characters/1100.cpp) |[python](./src/1100-Find-K-Length-Substrings-With-No-Repeated-Characters/1100.py)|[go](./src/1100-Find-K-Length-Substrings-With-No-Repeated-Characters/1100.go)|[js](./src/1100-Find-K-Length-Substrings-With-No-Repeated-Characters/1100.js)|||Medium|
|1101|[The Earliest Moment When Everyone Become Friends](https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends) || [c++](./src/1101-The-Earliest-Moment-When-Everyone-Become-Friends/1101.cpp) |[python](./src/1101-The-Earliest-Moment-When-Everyone-Become-Friends/1101.py)|[go](./src/1101-The-Earliest-Moment-When-Everyone-Become-Friends/1101.go)|[js](./src/1101-The-Earliest-Moment-When-Everyone-Become-Friends/1101.js)|||Easy|
|1102|[Path With Maximum Minimum Value](https://leetcode.com/contest/biweekly-contest-3/problems/path-with-maximum-minimum-value/) || [c++](./src/1102-Path-With-Maximum-Minimum-Value/1102.cpp) |[python](./src/1102-Path-With-Maximum-Minimum-Value/1102.py)|[go](./src/1102-Path-With-Maximum-Minimum-Value/1102.go)||||Medium|
|1103|[Distribute Candies to People](https://leetcode.com/problems/distribute-candies-to-people/) || [c++](./src/1103-Distribute-Candies-to-People/1103.cpp) |[python](./src/1103-Distribute-Candies-to-People/1103.py)|[go](./src/1103-Distribute-Candies-to-People/1103.go)||||Easy|
|1104|[Path In Zigzag Labelled Binary Tree](https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/) || [c++](./src/1104-Path-In-Zigzag-Labelled-Binary-Tree/1104.cpp) |[python](./src/1104-Path-In-Zigzag-Labelled-Binary-Tree/1104.py)|[go](./src/1104-Path-In-Zigzag-Labelled-Binary-Tree/1104.go)||||Medium|
|1105|[Filling Bookcase Shelves](https://leetcode.com/problems/filling-bookcase-shelves/) || [c++](./src/1105-Filling-Bookcase-Shelves/1105.cpp) |[python](./src/1105-Filling-Bookcase-Shelves/1105.py)|[go](./src/1105-Filling-Bookcase-Shelves/1105.go)||||Medium|
|1106|[Parsing A Boolean Expression](https://leetcode.com/problems/parsing-a-boolean-expression/) || [c++](./src/1106-Parsing-A-Boolean-Expression/1106.cpp) |[python](./src/1106-Parsing-A-Boolean-Expression/1106.py)|[go](./src/1106-Parsing-A-Boolean-Expression/1106.go)||||Hard|
|1108|[Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address/) || [c++](./src/1108-Defanging-an-IP-Address/1108.cpp) |[python](./src/1108-Defanging-an-IP-Address/1108.py)|[go](./src/1108-Defanging-an-IP-Address/1108.go)||||Easy|
|1109|[iCorporate Flight Bookings](https://leetcode.com/problems/corporate-flight-bookings/) || [c++](./src/1109-Corporate-Flight-Bookings/1109.cpp) |[python](./src/1109-Corporate-Flight-Bookings/1109.py)|[go](./src/1109-Corporate-Flight-Bookings/1109.go)||||Medium|
|1110|[Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest/) || [c++](./src/1110-Delete-Nodes-And-Return-Forest/1110.cpp) |[python](./src/1110-Delete-Nodes-And-Return-Forest/1110.py)|[go](./src/1110-Delete-Nodes-And-Return-Forest/1110.go)||||Medium|
|1111|[Maximum Nesting Depth of Two Valid Parentheses Strings](https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/) || [c++](./src/1111-Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/1111.cpp) |[python](./src/1111-Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/1111.py)|[go](./src/1111-Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/1111.go)||||Medium|
|1118|[Number of Days in a Month](https://leetcode.com/contest/biweekly-contest-4/problems/number-of-days-in-a-month/) || [c++](./src/1118-Number-of-Days-in-a-Month/1118.cpp) |[python](./src/1118-Number-of-Days-in-a-Month/1118.py)|[go](./src/1118-Number-of-Days-in-a-Month/1118.go)||||Easy|
|1119|[Remove Vowels from a String](https://leetcode.com/contest/biweekly-contest-4/problems/remove-vowels-from-a-string/) || [c++](./src/1119-Remove-Vowels-from-a-String/1119.cpp) |[python](./src/1119-Remove-Vowels-from-a-String/1119.py)|[go](./src/1119-Remove-Vowels-from-a-String/1119.go)||||Easy|
|1120|[Maximum Average Subtree](https://leetcode.com/contest/biweekly-contest-4/problems/maximum-average-subtree/) || [c++](./src/1120-Maximum-Average-Subtree/1120.cpp) |[python](./src/1120-Maximum-Average-Subtree/1120.py)|[go](./src/1120-Maximum-Average-Subtree/1120.go)||||Medium|
|1121|[Divide Array Into Increasing Sequences](https://leetcode.com/contest/biweekly-contest-4/problems/divide-array-into-increasing-sequences/) || [c++](./src/1121-Divide-Array-Into-Increasing-Sequences/1121.cpp) |[python](./src/1121-Divide-Array-Into-Increasing-Sequences/1121.py)|[go](./src/1121-Divide-Array-Into-Increasing-Sequences/1121.go)||||Hard|
|1122|[Relative Sort Array](https://leetcode.com/problems/relative-sort-array/) || [c++](./src/1122-Relative-Sort-Array/1122.cpp) |[python](./src/1122-Relative-Sort-Array/1122.py)|[go](./src/1122-Relative-Sort-Array/1122.go)||||Easy|
|1123|[Lowest Common Ancestor of Deepest Leaves](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/) || [c++](./src/1123-Lowest-Common-Ancestor-of-Deepest-Leaves/1123.cpp) |[python](./src/1123-Lowest-Common-Ancestor-of-Deepest-Leaves/1123.py)|[go](./src/1123-Lowest-Common-Ancestor-of-Deepest-Leaves/1123.go)||||Medium|
|1124|[Longest Well-Performing Interval](https://leetcode.com/problems/longest-well-performing-interval/) || [c++](./src/1124-Longest-Well-Performing-Interval/1124.cpp) |[python](./src/1124-Longest-Well-Performing-Interval/1124.py)|[go](./src/1124-Longest-Well-Performing-Interval/1124.go)||||Medium|
|1125|[Smallest Sufficient Team](https://leetcode.com/problems/smallest-sufficient-team/) || [c++](./src/1125-Smallest-Sufficient-Team/1125.cpp) |[python](./src/1125-Smallest-Sufficient-Team/1125.py)|[go](./src/1125-Smallest-Sufficient-Team/1125.go)||||Hard|
|1128|[Number of Equivalent Domino Pairs](https://leetcode.com/problems/smallest-sufficient-team/) || [c++](./src/1128-Number-of-Equivalent-Domino-Pairs/1128.cpp) |[python](./src/1128-Number-of-Equivalent-Domino-Pairs/1128.py)|[go](./src/1128-Number-of-Equivalent-Domino-Pairs/1128.go)|[js](./src/1128-Number-of-Equivalent-Domino-Pairs/1128.js)|||Easy|
|1129|[Shortest Path with Alternating Colors](https://leetcode.com/problems/shortest-path-with-alternating-colors/) || [c++](./src/1129-Shortest-Path-with-Alternating-Colors/1129.cpp) |[python](./src/1129-Shortest-Path-with-Alternating-Colors/1129.py)|[go](./src/1129-Shortest-Path-with-Alternating-Colors/1129.go)|[js](./src/1129-Shortest-Path-with-Alternating-Colors/1129.js)|||Medium|
|1130|[Minimum Cost Tree From Leaf Values](https://leetcode.com/problems/smallest-sufficient-team/) || [c++](./src/1130-Minimum-Cost-Tree-From-Leaf-Values/1130.cpp) |[python](./src/1130-Minimum-Cost-Tree-From-Leaf-Values/1130.py)|[go](./src/1130-Minimum-Cost-Tree-From-Leaf-Values/1130.go)|[js](./src/1130-Minimum-Cost-Tree-From-Leaf-Values/1130.js)|||Medium|
|1131|[Maximum of Absolute Value Expression](https://leetcode.com/problems/maximum-of-absolute-value-expression/) || [c++](./src/1131-Maximum-of-Absolute-Value-Expression/1131.cpp) |[python](./src/1131-Maximum-of-Absolute-Value-Expression/1131.py)|[go](./src/1131-Maximum-of-Absolute-Value-Expression/1131.go)|[js](./src/1131-Maximum-of-Absolute-Value-Expression/1131.js)|||Medium|
|1133|[Largest Unique Number](https://leetcode.com/contest/biweekly-contest-5/problems/largest-unique-number/) || [c++](./src/1133-Largest-Unique-Number/1133.cpp) |[python](./src/1133-Largest-Unique-Number/1133.py)|[go](./src/1133-Largest-Unique-Number/1133.go)|[js](./src/1133-Largest-Unique-Number/1133.js)|||Easy|
|1134|[Armstrong Number](https://leetcode.com/contest/biweekly-contest-5/problems/armstrong-number/) || [c++](./src/1134-Armstrong-Number/1134.cpp) |[python](./src/1134-Armstrong-Number/1134.py)|[go](./src/1134-Armstrong-Number/1134.go)|[js](./src/1134-Armstrong-Number/1134.js)|||Easy|
|1135|[Connecting Cities With Minimum Cost](https://leetcode.com/contest/biweekly-contest-5/problems/connecting-cities-with-minimum-cost/) || [c++](./src/1135-Connecting-Cities-With-Minimum-Cost/1135.cpp) |[python](./src/1135-Connecting-Cities-With-Minimum-Cost/1135.py)|[go](./src/1135-Connecting-Cities-With-Minimum-Cost/1135.go)|[js](./src/1135-Connecting-Cities-With-Minimum-Cost/1135.js)|||Medium|
|1136|[Parallel Courses](https://leetcode.com/contest/biweekly-contest-5/problems/parallel-courses/) || [c++](./src/1136-Parallel-Courses/1136.cpp) |[python](./src/1136-Parallel-Courses/1136.py)|[go](./src/1136-Parallel-Courses/1136.go)|[js](./src/1136-Parallel-Courses/1136.js)|||Hard|
|1137|[N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/) || [c++](./src/1137-N-th-Tribonacci-Number/1137.cpp) |[python](./src/1137-N-th-Tribonacci-Number/1137.py)|[go](./src/1137-N-th-Tribonacci-Number/1137.go)|[js](./src/1137-N-th-Tribonacci-Number/1137.js)|||Easy|
|1138|[Alphabet Board Path](https://leetcode.com/problems/alphabet-board-path/) || [c++](./src/1138-Alphabet-Board-Path/1138.cpp) |[python](./src/1138-Alphabet-Board-Path/1138.py)|[go](./src/1138-Alphabet-Board-Path/1138.go)|[js](./src/1138-Alphabet-Board-Path/1138.js)|||Medium|
|1139|[Largest 1-Bordered Square](https://leetcode.com/problems/largest-1-bordered-square/) || [c++](./src/1139-Largest-1-Bordered-Square/1139.cpp) |[python](./src/1139-Largest-1-Bordered-Square/1139.py)|[go](./src/1139-Largest-1-Bordered-Square/1139.go)|[js](./src/1139-Largest-1-Bordered-Square/1139.js)|||Medium|
|1140|[Stone Game II](https://leetcode.com/problems/stone-game-ii/) || [c++](./src/1140-Stone-Game-II/1140.cpp) |[python](./src/1140-Stone-Game-II/1140.py)|[go](./src/1140-Stone-Game-II/1140.go)|[js](./src/1140-Stone-Game-II/1140.js)|||Medium|
|1143|[Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) || [c++](./src/1143-Longest-Common-Subsequence/1143.cpp) |[python](./src/1143-Longest-Common-Subsequence/1143.py)|[go](./src/1143-Longest-Common-Subsequence/1143.go)|[js](./src/1143-Longest-Common-Subsequence/1143.js)|||Medium|
|1144|[Decrease Elements To Make Array Zigzag](https://leetcode.com/problems/decrease-elements-to-make-array-zigzag/) || [c++](./src/1144-Decrease-Elements-To-Make-Array-Zigzag/1144.cpp) |[python](./src/1144-Decrease-Elements-To-Make-Array-Zigzag/1144.py)|[go](./src/1144-Decrease-Elements-To-Make-Array-Zigzag/1144.go)|[js](./src/1144-Decrease-Elements-To-Make-Array-Zigzag/1144.js)|||Medium|
|1145|[Binary Tree Coloring Game](https://leetcode.com/problems/binary-tree-coloring-game/) || [c++](./src/1145-Binary-Tree-Coloring-Game/1145.cpp) |[python](./src/1145-Binary-Tree-Coloring-Game/1145.py)|[go](./src/1145-Binary-Tree-Coloring-Game/1145.go)|[js](./src/1145-Binary-Tree-Coloring-Game/1145.js)|||Medium|
|1146|[Snapshot Array](https://leetcode.com/problems/snapshot-array/) || [c++](./src/1146-Snapshot-Array/1146.cpp) |[python](./src/1146-Snapshot-Array/1146.py)|[go](./src/1146-Snapshot-Array/1146.go)|[js](./src/1146-Snapshot-Array/1146.js)|||Medium|
|1147|[Longest Chunked Palindrome Decomposition](https://leetcode.com/problems/longest-chunked-palindrome-decomposition/) || [c++](./src/1147-Longest-Chunked-Palindrome-Decomposition/1147.cpp) |[python](./src/1147-Longest-Chunked-Palindrome-Decomposition/1147.py)|[go](./src/1147-Longest-Chunked-Palindrome-Decomposition/1147.go)|[js](./src/1147-Longest-Chunked-Palindrome-Decomposition/1147.js)|||Hard|
|1150|[Check If a Number Is Majority Element in a Sorted Array](https://leetcode.com/contest/biweekly-contest-6/problems/is-a-a-majority-element/) || [c++](./src/1150-Check-If-a-Number-Is-Majority-Element-in-a-Sorted-Array/1150.cpp) |[python](./src/1150-Check-If-a-Number-Is-Majority-Element-in-a-Sorted-Array/1150.py)|[go](./src/1150-Check-If-a-Number-Is-Majority-Element-in-a-Sorted-Array/1150.go)|[js](./src/1150-Check-If-a-Number-Is-Majority-Element-in-a-Sorted-Array/1150.js)|||Easy|
|1151|[Minimum Swaps to Group All 1's Together](https://leetcode.com/contest/biweekly-contest-6/problems/minimum-swaps-to-group-all-1s-together/) || [c++](./src/1151-Minimum-Swaps-to-Group-All-1's-Together/1151.cpp) |[python](./src/1151-Minimum-Swaps-to-Group-All-1's-Together/1151.py)|[go](./src/1151-Minimum-Swaps-to-Group-All-1's-Together/1151.go)|[js](./src/1151-Minimum-Swaps-to-Group-All-1's-Together/1151.js)|||Medium|
|1152|[Analyze User Website Visit Pattern](https://leetcode.com/contest/biweekly-contest-6/problems/analyse-user-website-visit-pattern/) || [c++](./src/1152-Analyze-User-Website-Visit-Pattern/1152.cpp) |[python](./src/1152-Analyze-User-Website-Visit-Pattern/1152.py)|[go](./src/1152-Analyze-User-Website-Visit-Pattern/1152.go)|[js](./src/1152-Analyze-User-Website-Visit-Pattern/1152.js)|||Medium|
|1153|[String Transforms Into Another String](https://leetcode.com/contest/biweekly-contest-6/problems/string-transforms-into-another-string/) || [c++](./src/1153-String-Transforms-Into-Another-String/1153.cpp) |[python](./src/1153-String-Transforms-Into-Another-String/1153.py)|[go](./src/1153-String-Transforms-Into-Another-String/1153.go)|[js](./src/1153-String-Transforms-Into-Another-String/1153.js)|||Hard|
|1154|[Day of the Year](https://leetcode.com/problems/day-of-the-year/) || [c++](./src/1154-Day-of-the-Year/1154.cpp) |[python](./src/1154-Day-of-the-Year/1154.py)|[go](./src/1154-Day-of-the-Year/1154.go)|[js](./src/1154-Day-of-the-Year/1154.js)|||Easy|
|1155|[Number of Dice Rolls With Target Sum](https://leetcode.com/problems/number-of-dice-rolls-with-target-sum/) || [c++](./src/1155-Number-of-Dice-Rolls-With-Target-Sum/1155.cpp) |[python](./src/1155-Number-of-Dice-Rolls-With-Target-Sum/1155.py)|[go](./src/1155-Number-of-Dice-Rolls-With-Target-Sum/1155.go)|[js](./src/1155-Number-of-Dice-Rolls-With-Target-Sum/1155.js)|||Medium|
|1156|[Swap For Longest Repeated Character Substring](https://leetcode.com/problems/swap-for-longest-repeated-character-substring/) || [c++](./src/1156-Swap-For-Longest-Repeated-Character-Substring/1156.cpp) |[python](./src/1156-Swap-For-Longest-Repeated-Character-Substring/1156.py)|[go](./src/1156-Swap-For-Longest-Repeated-Character-Substring/1156.go)|[js](./src/1156-Swap-For-Longest-Repeated-Character-Substring/1156.js)|||Medium|
|1157|[Online Majority Element In Subarray](https://leetcode.com/problems/online-majority-element-in-subarray/) || [c++](./src/1157-Online-Majority-Element-In-Subarray/1157.cpp) |[python](./src/1157-Online-Majority-Element-In-Subarray/1157.py)|[go](./src/1157-Online-Majority-Element-In-Subarray/1157.go)|[js](./src/1157-Online-Majority-Element-In-Subarray/1157.js)|||Hard|
|1160|[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/) || [c++](./src/1160-Find-Words-That-Can-Be-Formed-by-Characters/1160.cpp) |[python](./src/1160-Find-Words-That-Can-Be-Formed-by-Characters/1160.py)|[go](./src/1160-Find-Words-That-Can-Be-Formed-by-Characters/1160.go)|[js](./src/1160-Find-Words-That-Can-Be-Formed-by-Characters/1160.js)|||Easy|
|1161|[Maximum Level Sum of a Binary Tree](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/) || [c++](./src/1161-Maximum-Level-Sum-of-a-Binary-Tree/1161.cpp) |[python](./src/1161-Maximum-Level-Sum-of-a-Binary-Tree/1161.py)|[go](./src/1161-Maximum-Level-Sum-of-a-Binary-Tree/1161.go)|[js](./src/1161-Maximum-Level-Sum-of-a-Binary-Tree/1161.js)|||Medium|
|1162|[As Far from Land as Possible](https://leetcode.com/problems/as-far-from-land-as-possible/) || [c++](./src/1162-As-Far-from-Land-as-Possible/1162.cpp) |[python](./src/1162-As-Far-from-Land-as-Possible/1162.py)|[go](./src/1162-As-Far-from-Land-as-Possible/1162.go)|[js](./src/1162-As-Far-from-Land-as-Possible/1162.js)|||Medium|
|1163|[Last Substring in Lexicographical Order](https://leetcode.com/problems/last-substring-in-lexicographical-order/) || [c++](./src/1163-Last-Substring-in-Lexicographical-Order/1163.cpp) |[python](./src/1163-Last-Substring-in-Lexicographical-Order/1163.py)|[go](./src/1163-Last-Substring-in-Lexicographical-Order/1163.go)|[js](./src/1163-Last-Substring-in-Lexicographical-Order/1163.js)|||Hard|
|1165|[Single-Row Keyboard](https://leetcode.com/problems/single-row-keyboard/) || [c++](./src/1165-Single-Row-Keyboard/1165.cpp) |[python](./src/1165-Single-Row-Keyboard/1165.py)|[go](./src/1165-Single-Row-Keyboard/1165.go)|[js](./src/1165-Single-Row-Keyboard/1165.js)|||Easy|
|1166|[Design File System](https://leetcode.com/problems/design-file-system/) || [c++](./src/1166-Design-File-System/1166.cpp) |[python](./src/1166-Design-File-System/1166.py)|[go](./src/1166-Design-File-System/1166.go)|[js](./src/1166-Design-File-System/1166.js)|||Medium|
|1167|[Minimum Cost to Connect Sticks](https://leetcode.com/problems/minimum-cost-to-connect-sticks/) || [c++](./src/1167-Minimum-Cost-to-Connect-Sticks/1167.cpp) |[python](./src/1167-Minimum-Cost-to-Connect-Sticks/1167.py)|[go](./src/1167-Minimum-Cost-to-Connect-Sticks/1167.go)|[js](./src/1167-Minimum-Cost-to-Connect-Sticks/1167.js)|||Medium|
|1168|[Optimize Water Distribution in a Village](https://leetcode.com/problems/optimize-water-distribution-in-a-village/) || [c++](./src/1168-Optimize-Water-Distribution-in-a-Village/1168.cpp) |[python](./src/1168-Optimize-Water-Distribution-in-a-Village/1168.py)|[go](./src/1168-Optimize-Water-Distribution-in-a-Village/1168.go)|[js](./src/1168-Optimize-Water-Distribution-in-a-Village/1168.js)|||Hard|
|1169|[Invalid Transactions](https://leetcode.com/problems/invalid-transactions/) || [c++](./src/1169-Invalid-Transactions/1169.cpp) |[python](./src/1169-Invalid-Transactions/1169.py)|[go](./src/1169-Invalid-Transactions/1169.go)|[js](./src/1169-Invalid-Transactions/1169.js)|||Medium|
|1170|[Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/) || [c++](./src/1170-Compare-Strings-by-Frequency-of-the-Smallest-Character/1170.cpp) |[python](./src/1170-Compare-Strings-by-Frequency-of-the-Smallest-Character/1170.py)|[go](./src/1170-Compare-Strings-by-Frequency-of-the-Smallest-Character/1170.go)|[js](./src/1170-Compare-Strings-by-Frequency-of-the-Smallest-Character/1170.js)|||Easy|
|1171|[Remove Zero Sum Consecutive Nodes from Linked List](https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/) || [c++](./src/1171-Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/1171.cpp) |[python](./src/1171-Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/1171.py)|[go](./src/1171-Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/1171.go)|[js](./src/1171-Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/1171.js)|||Medium|
|1172|[Dinner Plate Stacks](https://leetcode.com/problems/dinner-plate-stacks/) || [c++](./src/1172-Dinner-Plate-Stacks/1172.cpp) |[python](./src/1172-Dinner-Plate-Stacks/1172.py)|[go](./src/1172-Dinner-Plate-Stacks/1172.go)|[js](./src/1172-Dinner-Plate-Stacks/1172.js)|||Hard|
|1175|[Prime Arrangements](https://leetcode.com/problems/prime-arrangements/) || [c++](./src/1175-Prime-Arrangements/1175.cpp) |[python](./src/1175-Prime-Arrangements/1175.py)|[go](./src/1175-Prime-Arrangements/1175.go)|[js](./src/1175-Prime-Arrangements/1175.js)|||Easy|
|1176|[Diet Plan Performance](https://leetcode.com/problems/diet-plan-performance/) || [c++](./src/1176-Diet-Plan-Performance/1176.cpp) |[python](./src/1176-Diet-Plan-Performance/1176.py)|[go](./src/1176-Diet-Plan-Performance/1176.go)|[js](./src/1176-Diet-Plan-Performance/1176.js)|||Easy|
|1184|[Distance Between Bus Stops](https://leetcode.com/problems/diet-plan-performance/) || [c++](./src/1184-Distance-Between-Bus-Stops/1184.cpp) |[python](./src/1184-Distance-Between-Bus-Stops/1184.py)|[go](./src/1184-Distance-Between-Bus-Stops/1184.go)|[js](./src/1184-Distance-Between-Bus-Stops/1184.js)|||Easy|
|1185|[Day of the Week](https://leetcode.com/problems/day-of-the-week/) || [c++](./src/1185-Day-of-the-Week/1185.cpp) |[python](./src/1185-Day-of-the-Week/1185.py)|[go](./src/1185-Day-of-the-Week/1185.go)|[js](./src/1185-Day-of-the-Week/1185.js)|||Easy|
|1186|[Maximum Subarray Sum with One Deletion](https://leetcode.com/problems/maximum-subarray-sum-with-one-deletion/) || [c++](./src/1186-Maximum-Subarray-Sum-with-One-Deletion/1186.cpp) |[python](./src/1186-Maximum-Subarray-Sum-with-One-Deletion/1186.py)|[go](./src/1186-Maximum-Subarray-Sum-with-One-Deletion/1186.go)|[js](./src/1186-Maximum-Subarray-Sum-with-One-Deletion/1186.js)|||Medium|
|1187|[Make Array Strictly Increasing](https://leetcode.com/problems/make-array-strictly-increasing/) || [c++](./src/1187-Make-Array-Strictly-Increasing/1187.cpp) |[python](./src/1187-Make-Array-Strictly-Increasing/1187.py)|[go](./src/1187-Make-Array-Strictly-Increasing/1187.go)|[js](./src/1187-Make-Array-Strictly-Increasing/1187.js)|||Hard|
|1189|[Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/) || [c++](./src/1189-Maximum-Number-of-Balloons/1189.cpp) |[python](./src/1189-Maximum-Number-of-Balloons/1189.py)|[go](./src/1189-Maximum-Number-of-Balloons/1189.go)|[js](./src/1189-Maximum-Number-of-Balloons/1189.js)|||Easy|
|1190|[Reverse Substrings Between Each Pair of Parentheses](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/) || [c++](./src/1190-Reverse-Substrings-Between-Each-Pair-of-Parentheses/1190.cpp) |[python](./src/1190-Reverse-Substrings-Between-Each-Pair-of-Parentheses/1190.py)|[go](./src/1190-Reverse-Substrings-Between-Each-Pair-of-Parentheses/1190.go)|[js](./src/1190-Reverse-Substrings-Between-Each-Pair-of-Parentheses/1190.js)|||Medium|
|1191|[K-Concatenation Maximum Sum](https://leetcode.com/problems/k-concatenation-maximum-sum/) || [c++](./src/1191-K-Concatenation-Maximum-Sum/1191.cpp) |[python](./src/1191-K-Concatenation-Maximum-Sum/1191.py)|[go](./src/1191-K-Concatenation-Maximum-Sum/1191.go)|[js](./src/1191-K-Concatenation-Maximum-Sum/1191.js)|||Medium|
|1192|[Critical Connections in a Network](https://leetcode.com/problems/critical-connections-in-a-network/) || [c++](./src/1192-Critical-Connections-in-a-Network/1192.cpp) |[python](./src/1192-Critical-Connections-in-a-Network/1192.py)|[go](./src/1192-Critical-Connections-in-a-Network/1192.go)|[js](./src/1192-Critical-Connections-in-a-Network/1192.js)|||Hard|
|1196|[How Many Apples Can You Put into the Basket](https://leetcode.com/contest/biweekly-contest-9/problems/how-many-apples-can-you-put-into-the-basket/) || [c++](./src/1196-How-Many-Apples-Can-You-Put-into-the-Basket/1196.cpp) |[python](./src/1196-How-Many-Apples-Can-You-Put-into-the-Basket/1196.py)|[go](./src/1196-How-Many-Apples-Can-You-Put-into-the-Basket/1196.go)|[js](./src/1196-How-Many-Apples-Can-You-Put-into-the-Basket/1196.js)|||Easy|
|1197|[Minimum Knight Moves](https://leetcode.com/contest/biweekly-contest-9/problems/minimum-knight-moves/) || [c++](./src/1197-Minimum-Knight-Moves/1197.cpp) |[python](./src/1197-Minimum-Knight-Moves/1197.py)|[go](./src/1197-Minimum-Knight-Moves/1197.go)|[js](./src/1197-Minimum-Knight-Moves/1197.js)|||Medium|
|1198|[Find Smallest Common Element in All Rows](https://leetcode.com/contest/biweekly-contest-9/problems/find-smallest-common-element-in-all-rows/) || [c++](./src/1198-Find-Smallest-Common-Element-in-All-Rows/1198.cpp) |[python](./src/1198-Find-Smallest-Common-Element-in-All-Rows/1198.py)|[go](./src/1198-Find-Smallest-Common-Element-in-All-Rows/1198.go)|[js](./src/1198-Find-Smallest-Common-Element-in-All-Rows/1198.js)|||Medium|
|1199|[Minimum Time to Build Blocks](https://leetcode.com/contest/biweekly-contest-9/problems/minimum-time-to-build-blocks/) || [c++](./src/1199-Minimum-Time-to-Build-Blocks/1199.cpp) |[python](./src/1199-Minimum-Time-to-Build-Blocks/1199.py)|[go](./src/1199-Minimum-Time-to-Build-Blocks/1199.go)|[js](./src/1199-Minimum-Time-to-Build-Blocks/1199.js)|||Hard|
|1200|[Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/) || [c++](./src/1200-Minimum-Absolute-Difference/1200.cpp) |[python](./src/1200-Minimum-Absolute-Difference/1200.py)|[go](./src/1200-Minimum-Absolute-Difference/1200.go)|[js](./src/1200-Minimum-Absolute-Difference/1200.js)|||Easy|
|1201|[Ugly Number III](https://leetcode.com/problems/ugly-number-iii/) || [c++](./src/1201-Ugly-Number-III/1201.cpp) |[python](./src/1201-Ugly-Number-III/1201.py)|[go](./src/1201-Ugly-Number-III/1201.go)|[js](./src/1201-Ugly-Number-III/1201.js)|||Medium|
|1202|[Smallest String With Swaps](https://leetcode.com/problems/smallest-string-with-swaps/) || [c++](./src/1202-Smallest-String-With-Swaps/1202.cpp) |[python](./src/1202-Smallest-String-With-Swaps/1202.py)|[go](./src/1202-Smallest-String-With-Swaps/1202.go)|[js](./src/1202-Smallest-String-With-Swaps/1202.js)|||Medium|
|1207|[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/) || [c++](./src/1207-Unique-Number-of-Occurrences/1207.cpp) |[python](./src/1207-Unique-Number-of-Occurrences/1207.py)|[go](./src/1207-Unique-Number-of-Occurrences/1207.go)|[js](./src/1207-Unique-Number-of-Occurrences/1207.js)|||Easy|
|1208|[Get Equal Substrings Within Budget](https://leetcode.com/problems/get-equal-substrings-within-budget/) || [c++](./src/1208-Get-Equal-Substrings-Within-Budget/1208.cpp) |[python](./src/1208-Get-Equal-Substrings-Within-Budget/1208.py)|[go](./src/1208-Get-Equal-Substrings-Within-Budget/1208.go)|[js](./src/1208-Get-Equal-Substrings-Within-Budget/1208.js)|||Medium|
|1209|[Remove All Adjacent Duplicates in String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/) || [c++](./src/1209-Remove-All-Adjacent-Duplicates-in-String-II/1209.cpp) |[python](./src/1209-Remove-All-Adjacent-Duplicates-in-String-II/1209.py)|[go](./src/1209-Remove-All-Adjacent-Duplicates-in-String-II/1209.go)|[js](./src/1209-Remove-All-Adjacent-Duplicates-in-String-II/1209.js)|||Medium|
|1210|[Minimum Moves to Reach Target with Rotations](https://leetcode.com/problems/minimum-moves-to-reach-target-with-rotations/) || [c++](./src/1210-Minimum-Moves-to-Reach-Target-with-Rotations/1210.cpp) |[python](./src/1210-Minimum-Moves-to-Reach-Target-with-Rotations/1210.py)|[go](./src/1210-Minimum-Moves-to-Reach-Target-with-Rotations/1210.go)|[js](./src/1210-Minimum-Moves-to-Reach-Target-with-Rotations/1210.js)|||Hard|
|1213|[Intersection of Three Sorted Arrays](https://leetcode.com/contest/biweekly-contest-10/problems/intersection-of-three-sorted-arrays/) || [c++](./src/1213-Intersection-of-Three-Sorted-Arrays/1213.cpp) |[python](./src/1213-Intersection-of-Three-Sorted-Arrays/1213.py)|[go](./src/1213-Intersection-of-Three-Sorted-Arrays/1213.go)|[js](./src/1213-Intersection-of-Three-Sorted-Arrays/1213.js)|||Easy|
|1214|[Two Sum BSTs](https://leetcode.com/contest/biweekly-contest-10/problems/two-sum-bsts/) || [c++](./src/1214-Two-Sum-BSTs/1214.cpp) |[python](./src/1214-Two-Sum-BSTs/1214.py)|[go](./src/1214-Two-Sum-BSTs/1214.go)|[js](./src/1214-Two-Sum-BSTs/1214.js)|||Medium|
|1215|[Stepping Numbers](https://leetcode.com/contest/biweekly-contest-10/problems/stepping-numbers/) || [c++](./src/1215-Stepping-Numbers/1215.cpp) |[python](./src/1215-Stepping-Numbers/1215.py)|[go](./src/1215-Stepping-Numbers/1215.go)|[js](./src/1215-Stepping-Numbers/1215.js)|||Medium|
|1216|[Valid Palindrome III](https://leetcode.com/contest/biweekly-contest-10/problems/valid-palindrome-iii/) || [c++](./src/1216-Valid-Palindrome-III/1216.cpp) |[python](./src/1216-Valid-Palindrome-III/1216.py)|[go](./src/1216-Valid-Palindrome-III/1216.go)|[js](./src/1216-Valid-Palindrome-III/1216.js)|||Hard|
|1217|[Play with Chips](https://leetcode.com/problems/play-with-chips/) || [c++](./src/1217-Play-with-Chips/1217.cpp) |[python](./src/1217-Play-with-Chips/1217.py)|[go](./src/1217-Play-with-Chips/1217.go)|[js](./src/1217-Play-with-Chips/1217.js)|||Easy|
|1218|[Longest Arithmetic Subsequence of Given Difference](https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference/) || [c++](./src/1218-Longest-Arithmetic-Subsequence-of-Given-Difference/1218.cpp) |[python](./src/1218-Longest-Arithmetic-Subsequence-of-Given-Difference/1218.py)|[go](./src/1218-Longest-Arithmetic-Subsequence-of-Given-Difference/1218.go)|[js](./src/1218-Longest-Arithmetic-Subsequence-of-Given-Difference/1218.js)|||Medium|
|1219|[Path with Maximum Gold](https://leetcode.com/problems/path-with-maximum-gold/) || [c++](./src/1219-Path-with-Maximum-Gold/1219.cpp) |[python](./src/1219-Path-with-Maximum-Gold/1219.py)|[go](./src/1219-Path-with-Maximum-Gold/1219.go)|[js](./src/1219-Path-with-Maximum-Gold/1219.js)|||Medium|
|1220|[Count Vowels Permutation](https://leetcode.com/problems/count-vowels-permutation/) || [c++](./src/1220-Count-Vowels-Permutation/1220.cpp) |[python](./src/1220-Count-Vowels-Permutation/1220.py)|[go](./src/1220-Count-Vowels-Permutation/1220.go)|[js](./src/1220-Count-Vowels-Permutation/1220.js)|||Hard|
|1221|[Split a String in Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings/) || [c++](./src/1221-Split-a-String-in-Balanced-Strings/1221.cpp) |[python](./src/1221-Split-a-String-in-Balanced-Strings/1221.py)|[go](./src/1221-Split-a-String-in-Balanced-Strings/1221.go)|[js](./src/1221-Split-a-String-in-Balanced-Strings/1221.js)|||Easy|
|1222|[Queens That Can Attack the King](https://leetcode.com/problems/queens-that-can-attack-the-king/) || [c++](./src/1222-Queens-That-Can-Attack-the-King/1222.cpp) |[python](./src/1222-Queens-That-Can-Attack-the-King/1222.py)|[go](./src/1222-Queens-That-Can-Attack-the-King/1222.go)|[js](./src/1222-Queens-That-Can-Attack-the-King/1222.js)|||Medium|
|1223|[Dice Roll Simulation](https://leetcode.com/problems/dice-roll-simulation/) || [c++](./src/1223-Dice-Roll-Simulation/1223.cpp) |[python](./src/1223-Dice-Roll-Simulation/1223.py)|[go](./src/1223-Dice-Roll-Simulation/1223.go)|[js](./src/1223-Dice-Roll-Simulation/1223.js)|||Medium|
|1224|[Maximum Equal Frequency](https://leetcode.com/problems/maximum-equal-frequency/) || [c++](./src/1224-Maximum-Equal-Frequency/1224.cpp) |[python](./src/1224-Maximum-Equal-Frequency/1224.py)|[go](./src/1224-Maximum-Equal-Frequency/1224.go)|[js](./src/1224-Maximum-Equal-Frequency/1224.js)|||Hard|
|1228|[Missing Number In Arithmetic Progression](https://leetcode.com/problems/missing-number-in-arithmetic-progression/) || [c++](./src/1228-Missing-Number-In-Arithmetic-Progression/1228.cpp) |[python](./src/1228-Missing-Number-In-Arithmetic-Progression/1228.py)|[go](./src/1228-Missing-Number-In-Arithmetic-Progression/1228.go)|[js](./src/1228-Missing-Number-In-Arithmetic-Progression/1228.js)|||Easy|
|1229|[Meeting Scheduler](https://leetcode.com/problems/meeting-scheduler/) || [c++](./src/1229-Meeting-Scheduler/1229.cpp) |[python](./src/1229-Meeting-Scheduler/1229.py)|[go](./src/1229-Meeting-Scheduler/1229.go)|[js](./src/1229-Meeting-Scheduler/1229.js)|||Medium|
|1230|[Toss Strange Coins](https://leetcode.com/problems/toss-strange-coins/) || [c++](./src/1230-Toss-Strange-Coins/1230.cpp) |[python](./src/1230-Toss-Strange-Coins/1230.py)|[go](./src/1230-Toss-Strange-Coins/1230.go)|[js](./src/1230-Toss-Strange-Coins/1230.js)|||Medium|
|1231|[Divide Chocolate](https://leetcode.com/problems/divide-chocolate/) || [c++](./src/1231-Divide-Chocolate/1231.cpp) |[python](./src/1231-Divide-Chocolate/1231.py)|[go](./src/1231-Divide-Chocolate/1231.go)|[js](./src/1231-Divide-Chocolate/1231.js)|||Hard|
|1232|[Check If It Is a Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line/) || [c++](./src/1232-Check-If-It-Is-a-Straight-Line/1232.cpp) |[python](./src/1232-Check-If-It-Is-a-Straight-Line/1232.py)|[go](./src/1232-Check-If-It-Is-a-Straight-Line/1232.go)|[js](./src/1232-Check-If-It-Is-a-Straight-Line/1232.js)|||Easy|
|1233|[Remove Sub-Folders from the Filesystem](https://leetcode.com/problems/remove-sub-folders-from-the-filesystem/) || [c++](./src/1233-Remove-Sub-Folders-from-the-Filesystem/1233.cpp) |[python](./src/1233-Remove-Sub-Folders-from-the-Filesystem/1233.py)|[go](./src/1233-Remove-Sub-Folders-from-the-Filesystem/1233.go)|[js](./src/1233-Remove-Sub-Folders-from-the-Filesystem/1233.js)|||Medium|
|1234|[Replace the Substring for Balanced String](https://leetcode.com/problems/replace-the-substring-for-balanced-string/) || [c++](./src/1234-Replace-the-Substring-for-Balanced-String/1234.cpp) |[python](./src/1234-Replace-the-Substring-for-Balanced-String/1234.py)|[go](./src/1234-Replace-the-Substring-for-Balanced-String/1234.go)|[js](./src/1234-Replace-the-Substring-for-Balanced-String/1234.js)|||Medium|
|1235|[Maximum Profit in Job Scheduling](https://leetcode.com/problems/maximum-profit-in-job-scheduling/) || [c++](./src/1235-Maximum-Profit-in-Job-Scheduling/1235.cpp) |[python](./src/1235-Maximum-Profit-in-Job-Scheduling/1235.py)|[go](./src/1235-Maximum-Profit-in-Job-Scheduling/1235.go)|[js](./src/1235-Maximum-Profit-in-Job-Scheduling/1235.js)|||Hard|
|1237|[Find Positive Integer Solution for a Given Equation](https://leetcode.com/problems/maximum-profit-in-job-scheduling/) || [c++](./src/1237-Find-Positive-Integer-Solution-for-a-Given-Equation/1237.cpp) |[python](./src/1237-Find-Positive-Integer-Solution-for-a-Given-Equation/1237.py)|[go](./src/1237-Find-Positive-Integer-Solution-for-a-Given-Equation/1237.go)|[js](./src/1237-Find-Positive-Integer-Solution-for-a-Given-Equation/1237.js)|||Easy|
|1238|[Circular Permutation in Binary Representation](https://leetcode.com/problems/circular-permutation-in-binary-representation/) || [c++](./src/1238-Circular-Permutation-in-Binary-Representation/1238.cpp) |[python](./src/1238-Circular-Permutation-in-Binary-Representation/1238.py)|[go](./src/1238-Circular-Permutation-in-Binary-Representation/1238.go)|[js](./src/1238-Circular-Permutation-in-Binary-Representation/1238.js)|||Medium|
|1239|[Maximum Length of a Concatenated String with Unique Characters](https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters/) || [c++](./src/1239-Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/1239.cpp) |[python](./src/1239-Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/1239.py)|[go](./src/1239-Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/1239.go)|[js](./src/1239-Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/1239.js)|||Medium|
|1240|[Tiling a Rectangle with the Fewest Squares](https://leetcode.com/problems/tiling-a-rectangle-with-the-fewest-squares/) || [c++](./src/1240-Tiling-a-Rectangle-with-the-Fewest-Squares/1240.cpp) |[python](./src/1240-Tiling-a-Rectangle-with-the-Fewest-Squares/1240.py)|[go](./src/1240-Tiling-a-Rectangle-with-the-Fewest-Squares/1240.go)|[js](./src/1240-Tiling-a-Rectangle-with-the-Fewest-Squares/1240.js)|||Hard|
|1243|[Array Transformation](https://leetcode.com/problems/array-transformation/)||[c++](./src/1243-Array-Transformation/1243.cpp)|[python](./src/1243-Array-Transformation/1243.py)|[go](./src/1243-Array-Transformation/1243.go)|[js](./src/1243-Array-Transformation/1243.js)|[java](./src/1243-Array-Transformation/1243.java)||Easy|
|1244|[Design A Leaderboard](https://leetcode.com/problems/design-a-leaderboard/)||[c++](./src/1244-Design-A-Leaderboard/1244.cpp)|[python](./src/1244-Design-A-Leaderboard/1244.py)|[go](./src/1244-Design-A-Leaderboard/1244.go)|[js](./src/1244-Design-A-Leaderboard/1244.js)|[java](./src/1244-Design-A-Leaderboard/1244.java)||Medium|
|1245|[Tree Diameter](https://leetcode.com/contest/biweekly-contest-12/problems/tree-diameter/)||[c++](./src/1245-Tree-Diameter/1245.cpp)|[python](./src/1245-Tree-Diameter/1245.py)|[go](./src/1245-Tree-Diameter/1245.go)|[js](./src/1245-Tree-Diameter/1245.js)|[java](./src/1245-Tree-Diameter/1245.java)||Medium|
|1246|[Palindrome Removal](https://leetcode.com/contest/biweekly-contest-12/problems/palindrome-removal/)||[c++](./src/1246-Palindrome-Removal/1246.cpp)|[python](./src/1246-Palindrome-Removal/1246.py)|[go](./src/1246-Palindrome-Removal/1246.go)|[js](./src/1246-Palindrome-Removal/1246.js)|[java](./src/1246-Palindrome-Removal/1246.java)||Hard|
|1247|[Minimum Swaps to Make Strings Equal](https://leetcode.com/problems/minimum-swaps-to-make-strings-equal/)||[c++](./src/1247-Minimum-Swaps-to-Make-Strings-Equal/1247.cpp)|[python](./src/1247-Minimum-Swaps-to-Make-Strings-Equal/1247.py)|[go](./src/1247-Minimum-Swaps-to-Make-Strings-Equal/1247.go)|[js](./src/1247-Minimum-Swaps-to-Make-Strings-Equal/1247.js)|[java](./src/1247-Minimum-Swaps-to-Make-Strings-Equal/1247.java)||Easy|
|1248|[Count Number of Nice Subarrays](https://leetcode.com/problems/count-number-of-nice-subarrays/)||[c++](./src/1248-Count-Number-of-Nice-Subarrays/1248.cpp)|[python](./src/1248-Count-Number-of-Nice-Subarrays/1248.py)|[go](./src/1248-Count-Number-of-Nice-Subarrays/1248.go)|[js](./src/1248-Count-Number-of-Nice-Subarrays/1248.js)|[java](./src/1248-Count-Number-of-Nice-Subarrays/1248.java)||Medium|
|1249|[Minimum Remove to Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/)||[c++](./src/1249-Minimum-Remove-to-Make-Valid-Parentheses/1249.cpp)|[python](./src/1249-Minimum-Remove-to-Make-Valid-Parentheses/1249.py)|[go](./src/1249-Minimum-Remove-to-Make-Valid-Parentheses/1249.go)|[js](./src/1249-Minimum-Remove-to-Make-Valid-Parentheses/1249.js)|[java](./src/1249-Minimum-Remove-to-Make-Valid-Parentheses/1249.java)||Medium|
|1250|[Check If It Is a Good Array](https://leetcode.com/problems/check-if-it-is-a-good-array/)||[c++](./src/1250-Check-If-It-Is-a-Good-Array/1250.cpp)|[python](./src/1250-Check-If-It-Is-a-Good-Array/1250.py)|[go](./src/1250-Check-If-It-Is-a-Good-Array/1250.go)|[js](./src/1250-Check-If-It-Is-a-Good-Array/1250.js)|[java](./src/1250-Check-If-It-Is-a-Good-Array/1250.java)||Hard|
|1252|[Cells with Odd Values in a Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/)||[c++](./src/1252-Cells-with-Odd-Values-in-a-Matrix/1252.cpp)|[python](./src/1252-Cells-with-Odd-Values-in-a-Matrix/1252.py)|[go](./src/1252-Cells-with-Odd-Values-in-a-Matrix/1252.go)|[js](./src/1252-Cells-with-Odd-Values-in-a-Matrix/1252.js)|[java](./src/1252-Cells-with-Odd-Values-in-a-Matrix/1252.java)||Easy|
|1253|[Reconstruct a 2-Row Binary Matrix](https://leetcode.com/problems/reconstruct-a-2-row-binary-matrix/)||[c++](./src/1253-Reconstruct-a-2-Row-Binary-Matrix/1253.cpp)|[python](./src/1253-Reconstruct-a-2-Row-Binary-Matrix/1253.py)|[go](./src/1253-Reconstruct-a-2-Row-Binary-Matrix/1253.go)|[js](./src/1253-Reconstruct-a-2-Row-Binary-Matrix/1253.js)|[java](./src/1253-Reconstruct-a-2-Row-Binary-Matrix/1253.java)||Medium|
|1254|[Number of Closed Islands](https://leetcode.com/problems/number-of-closed-islands/)||[c++](./src/1254-Number-of-Closed-Islands/1254.cpp)|[python](./src/1254-Number-of-Closed-Islands/1254.py)|[go](./src/1254-Number-of-Closed-Islands/1254.go)|[js](./src/1254-Number-of-Closed-Islands/1254.js)|[java](./src/1254-Number-of-Closed-Islands/1254.java)||Medium|
|1255|[Maximum Score Words Formed by Letters](https://leetcode.com/problems/maximum-score-words-formed-by-letters/)||[c++](./src/1255-Maximum-Score-Words-Formed-by-Letters/1255.cpp)|[python](./src/1255-Maximum-Score-Words-Formed-by-Letters/1255.py)|[go](./src/1255-Maximum-Score-Words-Formed-by-Letters/1255.go)|[js](./src/1255-Maximum-Score-Words-Formed-by-Letters/1255.js)|[java](./src/1255-Maximum-Score-Words-Formed-by-Letters/1255.java)||Hard|
|1256|[Encode Number](https://leetcode.com/contest/biweekly-contest-13/problems/encode-number/)||[c++](./src/1256-Encode-Number/1256.cpp)|[python](./src/1256-Encode-Number/1256.py)|[go](./src/1256-Encode-Number/1256.go)|[js](./src/1256-Encode-Number/1256.js)|[java](./src/1256-Encode-Number/1256.java)||Medium|
|1257|[Smallest Common Region](https://leetcode.com/contest/biweekly-contest-13/problems/smallest-common-region/)||[c++](./src/1257-Smallest-Common-Region/1257.cpp)|[python](./src/1257-Smallest-Common-Region/1257.py)|[go](./src/1257-Smallest-Common-Region/1257.go)|[js](./src/1257-Smallest-Common-Region/1257.js)|[java](./src/1257-Smallest-Common-Region/1257.java)||Medium|
|1258|[Synonymous Sentences](https://leetcode.com/contest/biweekly-contest-13/problems/synonymous-sentences/)||[c++](./src/1258-Synonymous-Sentences/1258.cpp)|[python](./src/1258-Synonymous-Sentences/1258.py)|[go](./src/1258-Synonymous-Sentences/1258.go)|[js](./src/1258-Synonymous-Sentences/1258.js)|[java](./src/1258-Synonymous-Sentences/1258.java)||Medium|
|1259|[Handshakes That Don't Cross](https://leetcode.com/contest/biweekly-contest-13/problems/handshakes-that-dont-cross/)||[c++](./src/1259-Handshakes-That-Don't-Cross/1259.cpp)|[python](./src/1259-Handshakes-That-Don't-Cross/1259.py)|[go](./src/1259-Handshakes-That-Don't-Cross/1259.go)||[java](./src/1259-Handshakes-That-Don't-Cross/1259.java)||Hard|
|1260|[Shift 2D Grid](https://leetcode.com/problems/shift-2d-grid/)||[c++](./src/1260-Shift-2D-Grid/1260.cpp)|[python](./src/1260-Shift-2D-Grid/1260.py)|[go](./src/1260-Shift-2D-Grid/1260.go)|[js](./src/1260-Shift-2D-Grid/1260.js)|[java](./src/1260-Shift-2D-Grid/1260.java)||Easy|
|1261|[Find Elements in a Contaminated Binary Tree](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/)||[c++](./src/1261-Find-Elements-in-a-Contaminated-Binary-Tree/1261.cpp)|[python](./src/1261-Find-Elements-in-a-Contaminated-Binary-Tree/1261.py)|[go](./src/1261-Find-Elements-in-a-Contaminated-Binary-Tree/1261.go)|[js](./src/1261-Find-Elements-in-a-Contaminated-Binary-Tree/1261.js)|[java](./src/1261-Find-Elements-in-a-Contaminated-Binary-Tree/1261.java)||Medium|
|1262|[Greatest Sum Divisible by Three](https://leetcode.com/problems/greatest-sum-divisible-by-three/)||[c++](./src/1262-Greatest-Sum-Divisible-by-Three/1262.cpp)|[python](./src/1262-Greatest-Sum-Divisible-by-Three/1262.py)|[go](./src/1262-Greatest-Sum-Divisible-by-Three/1262.go)|[js](./src/1262-Greatest-Sum-Divisible-by-Three/1262.js)|[java](./src/1262-Greatest-Sum-Divisible-by-Three/1262.java)||Medium|
|1263|[Minimum Moves to Move a Box to Their Target Location](https://leetcode.com/problems/minimum-moves-to-move-a-box-to-their-target-location/)||[c++](./src/1263-Minimum-Moves-to-Move-a-Box-to-Their-Target-Location/1263.cpp)|[python](./src/1263-Minimum-Moves-to-Move-a-Box-to-Their-Target-Location/1263.py)|[go](./src/1263-Minimum-Moves-to-Move-a-Box-to-Their-Target-Location/1263.go)|[js](./src/1263-Minimum-Moves-to-Move-a-Box-to-Their-Target-Location/1263.js)|[java](./src/1263-Minimum-Moves-to-Move-a-Box-to-Their-Target-Location/1263.java)||Hard|
|1266|[Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points/)||[c++](./src/1266-Minimum-Time-Visiting-All-Points/1266.cpp)|[python](./src/1266-Minimum-Time-Visiting-All-Points/1266.py)|[go](./src/1266-Minimum-Time-Visiting-All-Points/1266.go)|[js](./src/1266-Minimum-Time-Visiting-All-Points/1266.js)|[java](./src/1266-Minimum-Time-Visiting-All-Points/1266.java)||Easy|
|1267|[Count Servers that Communicate](https://leetcode.com/problems/count-servers-that-communicate/)||[c++](./src/1267-Count-Servers-that-Communicate/1267.cpp)|[python](./src/1267-Count-Servers-that-Communicate/1267.py)|[go](./src/1267-Count-Servers-that-Communicate/1267.go)|[js](./src/1267-Count-Servers-that-Communicate/1267.js)|[java](./src/1267-Count-Servers-that-Communicate/1267.java)||Medium|
|1268|[Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/)||[c++](./src/1268-Search-Suggestions-System/1268.cpp)|[python](./src/1268-Search-Suggestions-System/1268.py)|[go](./src/1268-Search-Suggestions-System/1268.go)|[js](./src/1268-Search-Suggestions-System/1268.js)|[java](./src/1268-Search-Suggestions-System/1268.java)||Medium|
|1269|[Number of Ways to Stay in the Same Place After Some Steps](https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/)||[c++](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.cpp)|[python](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.py)|[go](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.go)|[js](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.js)|[java](./src/1269-Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps/1269.java)||Hard|
|1271|[Hexspeak](https://leetcode.com/contest/biweekly-contest-14/problems/hexspeak/)||[c++](./src/1271-Hexspeak/1271.cpp)|[python](./src/1271-Hexspeak/1271.py)|[go](./src/1271-Hexspeak/1271.go)|[js](./src/1271-Hexspeak/1271.js)|[java](./src/1271-Hexspeak/1271.java)||Easy|
|1272|[Remove Interval](https://leetcode.com/contest/biweekly-contest-14/problems/remove-interval/)||[c++](./src/1272-Remove-Interval/1272.cpp)|[python](./src/1272-Remove-Interval/1272.py)|[go](./src/1272-Remove-Interval/1272.go)|[js](./src/1272-Remove-Interval/1272.js)|[java](./src/1272-Remove-Interval/1272.java)||Medium|
|1273|[Delete Tree Nodes](https://leetcode.com/contest/biweekly-contest-14/problems/delete-tree-nodes/)||[c++](./src/1273-Delete-Tree-Nodes/1273.cpp)|[python](./src/1273-Delete-Tree-Nodes/1273.py)|[go](./src/1273-Delete-Tree-Nodes/1273.go)|[js](./src/1273-Delete-Tree-Nodes/1273.js)|[java](./src/1273-Delete-Tree-Nodes/1273.java)||Medium|
|1274|[Number of Ships in a Rectangle](https://leetcode.com/contest/biweekly-contest-14/problems/number-of-ships-in-a-rectangle/)||[c++](./src/1274-Number-of-Ships-in-a-Rectangle/1274.cpp)|[python](./src/1274-Number-of-Ships-in-a-Rectangle/1274.py)||[js](./src/1274-Number-of-Ships-in-a-Rectangle/1274.js)|[java](./src/1274-Number-of-Ships-in-a-Rectangle/1274.java)||Hard|
|1275|[Find Winner on a Tic Tac Toe Game](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/)||[c++](./src/1275-Find-Winner-on-a-Tic-Tac-Toe-Game/1275.cpp)|[python](./src/1275-Find-Winner-on-a-Tic-Tac-Toe-Game/1275.py)|[go](./src/1275-Find-Winner-on-a-Tic-Tac-Toe-Game/1275.go)|[js](./src/1275-Find-Winner-on-a-Tic-Tac-Toe-Game/1275.js)|[java](./src/1275-Find-Winner-on-a-Tic-Tac-Toe-Game/1275.java)||Easy|
|1276|[Number of Burgers with No Waste of Ingredients](https://leetcode.com/problems/number-of-burgers-with-no-waste-of-ingredients/)||[c++](./src/1276-Number-of-Burgers-with-No-Waste-of-Ingredients/1276.cpp)|[python](./src/1276-Number-of-Burgers-with-No-Waste-of-Ingredients/1276.py)|[go](./src/1276-Number-of-Burgers-with-No-Waste-of-Ingredients/1276.go)|[js](./src/1276-Number-of-Burgers-with-No-Waste-of-Ingredients/1276.js)|[java](./src/1276-Number-of-Burgers-with-No-Waste-of-Ingredients/1276.java)||Medium|
|1277|[Count Square Submatrices with All Ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones/)||[c++](./src/1277-Count-Square-Submatrices-with-All-Ones/1277.cpp)|[python](./src/1277-Count-Square-Submatrices-with-All-Ones/1277.py)|[go](./src/1277-Count-Square-Submatrices-with-All-Ones/1277.go)|[js](./src/1277-Count-Square-Submatrices-with-All-Ones/1277.js)|[java](./src/1277-Count-Square-Submatrices-with-All-Ones/1277.java)||Medium|
|1278|[Palindrome Partitioning III](https://leetcode.com/problems/palindrome-partitioning-iii/)||[c++](./src/1278-Palindrome-Partitioning-III/1278.cpp)|[python](./src/1278-Palindrome-Partitioning-III/1278.py)|[go](./src/1278-Palindrome-Partitioning-III/1278.go)|[js](./src/1278-Palindrome-Partitioning-III/1278.js)|[java](./src/1278-Palindrome-Partitioning-III/1278.java)||Hard|
|1281|[Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/)||[c++](./src/1281-Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/1281.cpp)|[python](./src/1281-Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/1281.py)|[go](./src/1281-Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/1281.go)|[js](./src/1281-Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/1281.js)|[java](./src/1281-Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/1281.java)||Easy|
|1282|[Group the People Given the Group Size They Belong To](https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/)||[c++](./src/1282-Group-the-People-Given-the-Group-Size-They-Belong-To/1282.cpp)|[python](./src/1282-Group-the-People-Given-the-Group-Size-They-Belong-To/1282.py)|[go](./src/1282-Group-the-People-Given-the-Group-Size-They-Belong-To/1282.go)|[js](./src/1282-Group-the-People-Given-the-Group-Size-They-Belong-To/1282.js)|[java](./src/1282-Group-the-People-Given-the-Group-Size-They-Belong-To/1282.java)||Medium|
|1283|[Find the Smallest Divisor Given a Threshold](https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/)||[c++](./src/1283-Find-the-Smallest-Divisor-Given-a-Threshold/1283.cpp)|[python](./src/1283-Find-the-Smallest-Divisor-Given-a-Threshold/1283.py)|[go](./src/1283-Find-the-Smallest-Divisor-Given-a-Threshold/1283.go)|[js](./src/1283-Find-the-Smallest-Divisor-Given-a-Threshold/1283.js)|[java](./src/1283-Find-the-Smallest-Divisor-Given-a-Threshold/1283.java)||Medium|
|1284|[Minimum Number of Flips to Convert Binary Matrix to Zero Matrix](https://leetcode.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/)||[c++](./src/1284-Minimum-Number-of-Flips-to-Convert-Binary-Matrix-to-Zero-Matrix/1284.cpp)|[python](./src/1284-Minimum-Number-of-Flips-to-Convert-Binary-Matrix-to-Zero-Matrix/1284.py)|[go](./src/1284-Minimum-Number-of-Flips-to-Convert-Binary-Matrix-to-Zero-Matrix/1284.go)|[js](./src/1284-Minimum-Number-of-Flips-to-Convert-Binary-Matrix-to-Zero-Matrix/1284.js)|[java](./src/1284-Minimum-Number-of-Flips-to-Convert-Binary-Matrix-to-Zero-Matrix/1284.java)||Hard|
|1286|[Iterator for Combination](https://leetcode.com/problems/iterator-for-combination/)||[c++](./src/1286-Iterator-for-Combination/1286.cpp)|[python](./src/1286-Iterator-for-Combination/1286.py)|[go](./src/1286-Iterator-for-Combination/1286.go)|[js](./src/1286-Iterator-for-Combination/1286.js)|[java](./src/1286-Iterator-for-Combination/1286.java)||Medium|
|1287|[Element Appearing More Than 25% In Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/)||[c++](./src/1287-Element-Appearing-More-Than-25%-In-Sorted-Array/1287.cpp)|[python](./src/1287-Element-Appearing-More-Than-25%-In-Sorted-Array/1287.py)|[go](./src/1287-Element-Appearing-More-Than-25%-In-Sorted-Array/1287.go)|[js](./src/1287-Element-Appearing-More-Than-25%-In-Sorted-Array/1287.js)|[java](./src/1287-Element-Appearing-More-Than-25%-In-Sorted-Array/1287.java)||Easy|
|1288|[Remove Covered Intervals](https://leetcode.com/problems/remove-covered-intervals/)||[c++](./src/1288-Remove-Covered-Intervals/1288.cpp)|[python](./src/1288-Remove-Covered-Intervals/1288.py)|[go](./src/1288-Remove-Covered-Intervals/1288.go)|[js](./src/1288-Remove-Covered-Intervals/1288.js)|[java](./src/1288-Remove-Covered-Intervals/1288.java)||Medium|
|1289|[Minimum Falling Path Sum II](https://leetcode.com/problems/minimum-falling-path-sum-ii/)||[c++](./src/1289-Minimum-Falling-Path-Sum-II/1289.cpp)|[python](./src/1289-Minimum-Falling-Path-Sum-II/1289.py)|[go](./src/1289-Minimum-Falling-Path-Sum-II/1289.go)|[js](./src/1289-Minimum-Falling-Path-Sum-II/1289.js)|[java](./src/1289-Minimum-Falling-Path-Sum-II/1289.java)||Hard|
|1290|[Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/)||[c++](./src/1290-Convert-Binary-Number-in-a-Linked-List-to-Integer/1290.cpp)|[python](./src/1290-Convert-Binary-Number-in-a-Linked-List-to-Integer/1290.py)|[go](./src/1290-Convert-Binary-Number-in-a-Linked-List-to-Integer/1290.go)|[js](./src/1290-Convert-Binary-Number-in-a-Linked-List-to-Integer/1290.js)|[java](./src/1290-Convert-Binary-Number-in-a-Linked-List-to-Integer/1290.java)||Easy|
|1291|[Sequential Digits](https://leetcode.com/problems/sequential-digits/)||[c++](./src/1291-Sequential-Digits/1291.cpp)|[python](./src/1291-Sequential-Digits/1291.py)|[go](./src/1291-Sequential-Digits/1291.go)|[js](./src/1291-Sequential-Digits/1291.js)|[java](./src/1291-Sequential-Digits/1291.java)||Medium|
|1292|[Maximum Side Length of a Square with Sum Less than or Equal to Threshold](https://leetcode.com/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/)||[c++](./src/1292-Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold/1292.cpp)|[python](./src/1292-Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold/1292.py)|[go](./src/1292-Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold/1292.go)|[js](./src/1292-Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold/1292.js)|[java](./src/1292-Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold/1292.java)||Medium|
|1293|[Shortest Path in a Grid with Obstacles Elimination](https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/)||[c++](./src/1293-Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293.cpp)|[python](./src/1293-Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293.py)|[go](./src/1293-Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293.go)|[js](./src/1293-Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293.js)|[java](./src/1293-Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293.java)||Hard|
|1295|[Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/)||[c++](./src/1295-Find-Numbers-with-Even-Number-of-Digits/1295.cpp)|[python](./src/1295-Find-Numbers-with-Even-Number-of-Digits/1295.py)|[go](./src/1295-Find-Numbers-with-Even-Number-of-Digits/1295.go)|[js](./src/1295-Find-Numbers-with-Even-Number-of-Digits/1295.js)|[java](./src/1295-Find-Numbers-with-Even-Number-of-Digits/1295.java)||Easy|
|1296|[Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/)||[c++](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.cpp)|[python](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.py)|[go](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.go)|[js](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.js)|[java](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.java)||Medium|
|1297|[Maximum Number of Occurrences of a Substring](https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/)||[c++](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.cpp)|[python](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.py)|[go](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.go)|[js](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.js)|[java](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.java)||Medium|
|1298|[Maximum Candies You Can Get from Boxes](https://leetcode.com/problems/maximum-candies-you-can-get-from-boxes/)||[c++](./src/1298-Maximum-Candies-You-Can-Get-from-Boxes/1298.cpp)|[python](./src/1298-Maximum-Candies-You-Can-Get-from-Boxes/1298.py)|[go](./src/1298-Maximum-Candies-You-Can-Get-from-Boxes/1298.go)|[js](./src/1298-Maximum-Candies-You-Can-Get-from-Boxes/1298.js)|[java](./src/1298-Maximum-Candies-You-Can-Get-from-Boxes/1298.java)||Hard|
|1299|[Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/)||[c++](./src/1299-Replace-Elements-with-Greatest-Element-on-Right-Side/1299.cpp)|[python](./src/1299-Replace-Elements-with-Greatest-Element-on-Right-Side/1299.py)|[go](./src/1299-Replace-Elements-with-Greatest-Element-on-Right-Side/1299.go)|[js](./src/1299-Replace-Elements-with-Greatest-Element-on-Right-Side/1299.js)|[java](./src/1299-Replace-Elements-with-Greatest-Element-on-Right-Side/1299.java)||Easy|
|1300|[Sum of Mutated Array Closest to Target](https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/)||[c++](./src/1300-Sum-of-Mutated-Array-Closest-to-Target/1300.cpp)|[python](./src/1300-Sum-of-Mutated-Array-Closest-to-Target/1300.py)|[go](./src/1300-Sum-of-Mutated-Array-Closest-to-Target/1300.go)|[js](./src/1300-Sum-of-Mutated-Array-Closest-to-Target/1300.js)|[java](./src/1300-Sum-of-Mutated-Array-Closest-to-Target/1300.java)||Medium|
|1301|[Number of Paths with Max Score](https://leetcode.com/problems/number-of-paths-with-max-score/)||[c++](./src/1301-Number-of-Paths-with-Max-Score/1301.cpp)|[python](./src/1301-Number-of-Paths-with-Max-Score/1301.py)|[go](./src/1301-Number-of-Paths-with-Max-Score/1301.go)|[js](./src/1301-Number-of-Paths-with-Max-Score/1301.js)|[java](./src/1301-Number-of-Paths-with-Max-Score/1301.java)||Hard|
|1302|[Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/)||[c++](./src/1302-Deepest-Leaves-Sum/1302.cpp)|[python](./src/1302-Deepest-Leaves-Sum/1302.py)|[go](./src/1302-Deepest-Leaves-Sum/1302.go)|[js](./src/1302-Deepest-Leaves-Sum/1302.js)|[java](./src/1302-Deepest-Leaves-Sum/1302.java)||Medium|
|1304|[Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/)||[c++](./src/1304-Find-N-Unique-Integers-Sum-up-to-Zero/1304.cpp)|[python](./src/1304-Find-N-Unique-Integers-Sum-up-to-Zero/1304.py)|[go](./src/1304-Find-N-Unique-Integers-Sum-up-to-Zero/1304.go)|[js](./src/1304-Find-N-Unique-Integers-Sum-up-to-Zero/1304.js)|[java](./src/1304-Find-N-Unique-Integers-Sum-up-to-Zero/1304.java)||Easy|
|1305|[All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/)||[c++](./src/1305-All-Elements-in-Two-Binary-Search-Trees/1305.cpp)|[python](./src/1305-All-Elements-in-Two-Binary-Search-Trees/1305.py)|[go](./src/1305-All-Elements-in-Two-Binary-Search-Trees/1305.go)|[js](./src/1305-All-Elements-in-Two-Binary-Search-Trees/1305.js)|[java](./src/1305-All-Elements-in-Two-Binary-Search-Trees/1305.java)||Medium|
|1306|[Jump Game III](https://leetcode.com/problems/jump-game-iii/)||[c++](./src/1306-Jump-Game-III/1306.cpp)|[python](./src/1306-Jump-Game-III/1306.py)|[go](./src/1306-Jump-Game-III/1306.go)|[js](./src/1306-Jump-Game-III/1306.js)|[java](./src/1306-Jump-Game-III/1306.java)||Medium|
|1307|[Verbal Arithmetic Puzzle](https://leetcode.com/problems/verbal-arithmetic-puzzle/)||[c++](./src/1307-Verbal-Arithmetic-Puzzle/1307.cpp)|[python](./src/1307-Verbal-Arithmetic-Puzzle/1307.py)|[go](./src/1307-Verbal-Arithmetic-Puzzle/1307.go)|[js](./src/1307-Verbal-Arithmetic-Puzzle/1307.js)|[java](./src/1307-Verbal-Arithmetic-Puzzle/1307.java)||Hard|
|1309|[Decrypt String from Alphabet to Integer Mapping](https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping/)||[c++](./src/1309-Decrypt-String-from-Alphabet-to-Integer-Mapping/1309.cpp)|[python](./src/1309-Decrypt-String-from-Alphabet-to-Integer-Mapping/1309.py)|[go](./src/1309-Decrypt-String-from-Alphabet-to-Integer-Mapping/1309.go)|[js](./src/1309-Decrypt-String-from-Alphabet-to-Integer-Mapping/1309.js)|[java](./src/1309-Decrypt-String-from-Alphabet-to-Integer-Mapping/1309.java)||Easy|
|1310|[XOR Queries of a Subarray](https://leetcode.com/problems/xor-queries-of-a-subarray/)||[c++](./src/1310-XOR-Queries-of-a-Subarray/1310.cpp)|[python](./src/1310-XOR-Queries-of-a-Subarray/1310.py)|[go](./src/1310-XOR-Queries-of-a-Subarray/1310.go)|[js](./src/1310-XOR-Queries-of-a-Subarray/1310.js)|[java](./src/1310-XOR-Queries-of-a-Subarray/1310.java)||Medium|
|1311|[Get Watched Videos by Your Friends](https://leetcode.com/problems/get-watched-videos-by-your-friends/)||[c++](./src/1311-Get-Watched-Videos-by-Your-Friends/1311.cpp)|[python](./src/1311-Get-Watched-Videos-by-Your-Friends/1311.py)|[go](./src/1311-Get-Watched-Videos-by-Your-Friends/1311.go)|[js](./src/1311-Get-Watched-Videos-by-Your-Friends/1311.js)|[java](./src/1311-Get-Watched-Videos-by-Your-Friends/1311.java)||Medium|
|1313|[Decompress Run-Length Encoded List](https://leetcode.com/problems/decompress-run-length-encoded-list/)||[c++](./src/1313-Decompress-Run-Length-Encoded-List/1313.cpp)|[python](./src/1313-Decompress-Run-Length-Encoded-List/1313.py)|[go](./src/1313-Decompress-Run-Length-Encoded-List/1313.go)|[js](./src/1313-Decompress-Run-Length-Encoded-List/1313.js)|[java](./src/1313-Decompress-Run-Length-Encoded-List/1313.java)||Easy|
|1314|[Matrix Block Sum](https://leetcode.com/problems/matrix-block-sum/)||[c++](./src/1314-Matrix-Block-Sum/1314.cpp)|[python](./src/1314-Matrix-Block-Sum/1314.py)|[go](./src/1314-Matrix-Block-Sum/1314.go)|[js](./src/1314-Matrix-Block-Sum/1314.js)|[java](./src/1314-Matrix-Block-Sum/1314.java)||Medium|
|1315|[Sum of Nodes with Even-Valued Grandparent](https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/)||[c++](./src/1315-Sum-of-Nodes-with-Even-Valued-Grandparent/1315.cpp)|[python](./src/1315-Sum-of-Nodes-with-Even-Valued-Grandparent/1315.py)|[go](./src/1315-Sum-of-Nodes-with-Even-Valued-Grandparent/1315.go)|[js](./src/1315-Sum-of-Nodes-with-Even-Valued-Grandparent/1315.js)|[java](./src/1315-Sum-of-Nodes-with-Even-Valued-Grandparent/1315.java)||Medium|
|1316|[Distinct Echo Substrings](https://leetcode.com/problems/distinct-echo-substrings/)||[c++](./src/1316-Distinct-Echo-Substrings/1316.cpp)|[python](./src/1316-Distinct-Echo-Substrings/1316.py)|[go](./src/1316-Distinct-Echo-Substrings/1316.go)|[js](./src/1316-Distinct-Echo-Substrings/1316.js)|[java](./src/1316-Distinct-Echo-Substrings/1316.java)||Hard|
|1317|[Convert Integer to the Sum of Two No-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/)||[c++](./src/1317-Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers/1317.cpp)|[python](./src/1317-Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers/1317.py)|[go](./src/1317-Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers/1317.go)|[js](./src/1317-Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers/1317.js)|[java](./src/1317-Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers/1317.java)||Easy|
|1318|[Minimum Flips to Make a OR b Equal to c](https://leetcode.com/problems/minimum-flips-to-make-a-or-b-equal-to-c/)||[c++](./src/1318-Minimum-Flips-to-Make-a-OR-b-Equal-to-c/1318.cpp)|[python](./src/1318-Minimum-Flips-to-Make-a-OR-b-Equal-to-c/1318.py)|[go](./src/1318-Minimum-Flips-to-Make-a-OR-b-Equal-to-c/1318.go)|[js](./src/1318-Minimum-Flips-to-Make-a-OR-b-Equal-to-c/1318.js)|[java](./src/1318-Minimum-Flips-to-Make-a-OR-b-Equal-to-c/1318.java)||Medium|
|1319|[Number of Operations to Make Network Connected](https://leetcode.com/problems/number-of-operations-to-make-network-connected/)||[c++](./src/1319-Number-of-Operations-to-Make-Network-Connected/1319.cpp)|[python](./src/1319-Number-of-Operations-to-Make-Network-Connected/1319.py)|[go](./src/1319-Number-of-Operations-to-Make-Network-Connected/1319.go)|[js](./src/1319-Number-of-Operations-to-Make-Network-Connected/1319.js)|[java](./src/1319-Number-of-Operations-to-Make-Network-Connected/1319.java)||Medium|
|1320|[Minimum Distance to Type a Word Using Two Fingers](https://leetcode.com/problems/minimum-distance-to-type-a-word-using-two-fingers/)||[c++](./src/1320-Minimum-Distance-to-Type-a-Word-Using-Two-Fingers/1320.cpp)|[python](./src/1320-Minimum-Distance-to-Type-a-Word-Using-Two-Fingers/1320.py)|[go](./src/1320-Minimum-Distance-to-Type-a-Word-Using-Two-Fingers/1320.go)|[js](./src/1320-Minimum-Distance-to-Type-a-Word-Using-Two-Fingers/1320.js)|[java](./src/1320-Minimum-Distance-to-Type-a-Word-Using-Two-Fingers/1320.java)||Hard|
|1323|[Maximum 69 Number](https://leetcode.com/problems/maximum-69-number/)||[c++](./src/1323-Maximum-69-Number/1323.cpp)|[python](./src/1323-Maximum-69-Number/1323.py)|[go](./src/1323-Maximum-69-Number/1323.go)|[js](./src/1323-Maximum-69-Number/1323.js)|[java](./src/1323-Maximum-69-Number/1323.java)||Easy|
|1324|[Print Words Vertically](https://leetcode.com/problems/print-words-vertically/)||[c++](./src/1324-Print-Words-Vertically/1324.cpp)|[python](./src/1324-Print-Words-Vertically/1324.py)|[go](./src/1324-Print-Words-Vertically/1324.go)|[js](./src/1324-Print-Words-Vertically/1324.js)|[java](./src/1324-Print-Words-Vertically/1324.java)||Medium|
|1325|[Delete Leaves With a Given Value](https://leetcode.com/problems/delete-leaves-with-a-given-value/)||[c++](./src/1325-Delete-Leaves-With-a-Given-Value/1325.cpp)|[python](./src/1325-Delete-Leaves-With-a-Given-Value/1325.py)|[go](./src/1325-Delete-Leaves-With-a-Given-Value/1325.go)|[js](./src/1325-Delete-Leaves-With-a-Given-Value/1325.js)|[java](./src/1325-Delete-Leaves-With-a-Given-Value/1325.java)||Medium|
|1326|[Minimum Number of Taps to Open to Water a Garden](https://leetcode.com/problems/minimum-number-of-taps-to-open-to-water-a-garden/)||[c++](./src/1326-Minimum-Number-of-Taps-to-Open-to-Water-a-Garden/1326.cpp)|[python](./src/1326-Minimum-Number-of-Taps-to-Open-to-Water-a-Garden/1326.py)|[go](./src/1326-Minimum-Number-of-Taps-to-Open-to-Water-a-Garden/1326.go)|[js](./src/1326-Minimum-Number-of-Taps-to-Open-to-Water-a-Garden/1326.js)|[java](./src/1326-Minimum-Number-of-Taps-to-Open-to-Water-a-Garden/1326.java)||Hard|
|1328|[Break a Palindrome](https://leetcode.com/problems/break-a-palindrome/)||[c++](./src/1328-Break-a-Palindrome/1328.cpp)|[python](./src/1328-Break-a-Palindrome/1328.py)|[go](./src/1328-Break-a-Palindrome/1328.go)|[js](./src/1328-Break-a-Palindrome/1328.js)|[java](./src/1328-Break-a-Palindrome/1328.java)||Medium|
|1329|[Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/)||[c++](./src/1329-Sort-the-Matrix-Diagonally/1329.cpp)|[python](./src/1329-Sort-the-Matrix-Diagonally/1329.py)|[go](./src/1329-Sort-the-Matrix-Diagonally/1329.go)|[js](./src/1329-Sort-the-Matrix-Diagonally/1329.js)|[java](./src/1329-Sort-the-Matrix-Diagonally/1329.java)||Medium|
|1330|[Reverse Subarray To Maximize Array Value](https://leetcode.com/problems/reverse-subarray-to-maximize-array-value/)||[c++](./src/1330-Reverse-Subarray-To-Maximize-Array-Value/1330.cpp)|[python](./src/1330-Reverse-Subarray-To-Maximize-Array-Value/1330.py)|[go](./src/1330-Reverse-Subarray-To-Maximize-Array-Value/1330.go)|[js](./src/1330-Reverse-Subarray-To-Maximize-Array-Value/1330.js)|[java](./src/1330-Reverse-Subarray-To-Maximize-Array-Value/1330.java)||Hard|
|1331|[Rank Transform of an Array](https://leetcode.com/problems/rank-transform-of-an-array/)||[c++](./src/1331-Rank-Transform-of-an-Array/1331.cpp)|[python](./src/1331-Rank-Transform-of-an-Array/1331.py)|[go](./src/1331-Rank-Transform-of-an-Array/1331.go)|[js](./src/1331-Rank-Transform-of-an-Array/1331.js)|[java](./src/1331-Rank-Transform-of-an-Array/1331.java)||Easy|
|1332|[Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/)||[c++](./src/1332-Remove-Palindromic-Subsequences/1332.cpp)|[python](./src/1332-Remove-Palindromic-Subsequences/1332.py)|[go](./src/1332-Remove-Palindromic-Subsequences/1332.go)|[js](./src/1332-Remove-Palindromic-Subsequences/1332.js)|[java](./src/1332-Remove-Palindromic-Subsequences/1332.java)||Easy|
|1333|[Filter Restaurants by Vegan-Friendly, Price and Distance](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/)||[c++](./src/1333-Filter-Restaurants-by-Vegan-Friendly,-Price-and-Distance/1333.cpp)|[python](./src/1333-Filter-Restaurants-by-Vegan-Friendly,-Price-and-Distance/1333.py)|[go](./src/1333-Filter-Restaurants-by-Vegan-Friendly,-Price-and-Distance/1333.go)|[js](./src/1333-Filter-Restaurants-by-Vegan-Friendly,-Price-and-Distance/1333.js)|[java](./src/1333-Filter-Restaurants-by-Vegan-Friendly,-Price-and-Distance/1333.java)||Medium|
|1334|[Find the City With the Smallest Number of Neighbors at a Threshold Distance](https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/)||[c++](./src/1334-Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance/1334.cpp)|[python](./src/1334-Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance/1334.py)|[go](./src/1334-Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance/1334.go)|[js](./src/1334-Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance/1334.js)|[java](./src/1334-Find-the-City-With-the-Smallest-Number-of-Neighbors-at-a-Threshold-Distance/1334.java)||Medium|
|1335|[Minimum Difficulty of a Job Schedule](https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule/)||[c++](./src/1335-Minimum-Difficulty-of-a-Job-Schedule/1335.cpp)|[python](./src/1335-Minimum-Difficulty-of-a-Job-Schedule/1335.py)|[go](./src/1335-Minimum-Difficulty-of-a-Job-Schedule/1335.go)|[js](./src/1335-Minimum-Difficulty-of-a-Job-Schedule/1335.js)|[java](./src/1335-Minimum-Difficulty-of-a-Job-Schedule/1335.java)||Hard|
|1337|[The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/)||[c++](./src/1337-The-K-Weakest-Rows-in-a-Matrix/1337.cpp)|[python](./src/1337-The-K-Weakest-Rows-in-a-Matrix/1337.py)|[go](./src/1337-The-K-Weakest-Rows-in-a-Matrix/1337.go)|[js](./src/1337-The-K-Weakest-Rows-in-a-Matrix/1337.js)|[java](./src/1337-The-K-Weakest-Rows-in-a-Matrix/1337.java)||Easy|
|1338|[Reduce Array Size to The Half](https://leetcode.com/problems/reduce-array-size-to-the-half/)||[c++](./src/1338-Reduce-Array-Size-to-The-Half/1338.cpp)|[python](./src/1338-Reduce-Array-Size-to-The-Half/1338.py)|[go](./src/1338-Reduce-Array-Size-to-The-Half/1338.go)|[js](./src/1338-Reduce-Array-Size-to-The-Half/1338.js)|[java](./src/1338-Reduce-Array-Size-to-The-Half/1338.java)||Medium|
|1339|[Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/)||[c++](./src/1339-Maximum-Product-of-Splitted-Binary-Tree/1339.cpp)|[python](./src/1339-Maximum-Product-of-Splitted-Binary-Tree/1339.py)|[go](./src/1339-Maximum-Product-of-Splitted-Binary-Tree/1339.go)|[js](./src/1339-Maximum-Product-of-Splitted-Binary-Tree/1339.js)|[java](./src/1339-Maximum-Product-of-Splitted-Binary-Tree/1339.java)||Medium|
|1340|[Jump Game V](https://leetcode.com/problems/jump-game-v/)||[c++](./src/1340-Jump-Game-V/1340.cpp)|[python](./src/1340-Jump-Game-V/1340.py)|[go](./src/1340-Jump-Game-V/1340.go)|[js](./src/1340-Jump-Game-V/1340.js)|[java](./src/1340-Jump-Game-V/1340.java)||Hard|
|1342|[Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/)||[c++](./src/1342-Number-of-Steps-to-Reduce-a-Number-to-Zero/1342.cpp)|[python](./src/1342-Number-of-Steps-to-Reduce-a-Number-to-Zero/1342.py)|[go](./src/1342-Number-of-Steps-to-Reduce-a-Number-to-Zero/1342.go)|[js](./src/1342-Number-of-Steps-to-Reduce-a-Number-to-Zero/1342.js)|[java](./src/1342-Number-of-Steps-to-Reduce-a-Number-to-Zero/1342.java)||Easy|
|1343|[Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold](https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/)||[c++](./src/1343-Number-of-Sub-arrays-of-Size-K-and-Average-Greater-than-or-Equal-to-Threshold/1343.cpp)|[python](./src/1343-Number-of-Sub-arrays-of-Size-K-and-Average-Greater-than-or-Equal-to-Threshold/1343.py)|[go](./src/1343-Number-of-Sub-arrays-of-Size-K-and-Average-Greater-than-or-Equal-to-Threshold/1343.go)|[js](./src/1343-Number-of-Sub-arrays-of-Size-K-and-Average-Greater-than-or-Equal-to-Threshold/1343.js)|[java](./src/1343-Number-of-Sub-arrays-of-Size-K-and-Average-Greater-than-or-Equal-to-Threshold/1343.java)||Medium|
|1344|[Angle Between Hands of a Clock](https://leetcode.com/problems/angle-between-hands-of-a-clock/)||[c++](./src/1344-Angle-Between-Hands-of-a-Clock/1344.cpp)|[python](./src/1344-Angle-Between-Hands-of-a-Clock/1344.py)|[go](./src/1344-Angle-Between-Hands-of-a-Clock/1344.go)|[js](./src/1344-Angle-Between-Hands-of-a-Clock/1344.js)|[java](./src/1344-Angle-Between-Hands-of-a-Clock/1344.java)||Medium|
|1345|[Jump Game IV](https://leetcode.com/problems/jump-game-iv/)||[c++](./src/1345-Jump-Game-IV/1345.cpp)|[python](./src/1345-Jump-Game-IV/1345.py)|[go](./src/1345-Jump-Game-IV/1345.go)|[js](./src/1345-Jump-Game-IV/1345.js)|[java](./src/1345-Jump-Game-IV/1345.java)||Hard|
|1346|[Check If N and Its Double Exist](https://leetcode.com/problems/check-if-n-and-its-double-exist/)||[c++](./src/1346-Check-If-N-and-Its-Double-Exist/1346.cpp)|[python](./src/1346-Check-If-N-and-Its-Double-Exist/1346.py)|[go](./src/1346-Check-If-N-and-Its-Double-Exist/1346.go)|[js](./src/1346-Check-If-N-and-Its-Double-Exist/1346.js)|[java](./src/1346-Check-If-N-and-Its-Double-Exist/1346.java)||Easy|
|1347|[Minimum Number of Steps to Make Two Strings Anagram](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/)||[c++](./src/1347-Minimum-Number-of-Steps-to-Make-Two-Strings-Anagram/1347.cpp)|[python](./src/1347-Minimum-Number-of-Steps-to-Make-Two-Strings-Anagram/1347.py)|[go](./src/1347-Minimum-Number-of-Steps-to-Make-Two-Strings-Anagram/1347.go)|[js](./src/1347-Minimum-Number-of-Steps-to-Make-Two-Strings-Anagram/1347.js)|[java](./src/1347-Minimum-Number-of-Steps-to-Make-Two-Strings-Anagram/1347.java)||Medium|
|1348|[Tweet Counts Per Frequency](https://leetcode.com/problems/tweet-counts-per-frequency/)||[c++](./src/1348-Tweet-Counts-Per-Frequency/1348.cpp)|[python](./src/1348-Tweet-Counts-Per-Frequency/1348.py)|[go](./src/1348-Tweet-Counts-Per-Frequency/1348.go)|[js](./src/1348-Tweet-Counts-Per-Frequency/1348.js)|[java](./src/1348-Tweet-Counts-Per-Frequency/1348.java)||Medium|
|1349|[Maximum Students Taking Exam](https://leetcode.com/problems/maximum-students-taking-exam/)||[c++](./src/1349-Maximum-Students-Taking-Exam/1349.cpp)|[python](./src/1349-Maximum-Students-Taking-Exam/1349.py)|[go](./src/1349-Maximum-Students-Taking-Exam/1349.go)|[js](./src/1349-Maximum-Students-Taking-Exam/1349.js)|[java](./src/1349-Maximum-Students-Taking-Exam/1349.java)||Hard|
|1351|[Count Negative Numbers in a Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/)||[c++](./src/1351-Count-Negative-Numbers-in-a-Sorted-Matrix/1351.cpp)|[python](./src/1351-Count-Negative-Numbers-in-a-Sorted-Matrix/1351.py)|[go](./src/1351-Count-Negative-Numbers-in-a-Sorted-Matrix/1351.go)|[js](./src/1351-Count-Negative-Numbers-in-a-Sorted-Matrix/1351.js)|[java](./src/1351-Count-Negative-Numbers-in-a-Sorted-Matrix/1351.java)||Easy|
|1352|[Product of the Last K Numbers](https://leetcode.com/problems/product-of-the-last-k-numbers/)||[c++](./src/1352-Product-of-the-Last-K-Numbers/1352.cpp)|[python](./src/1352-Product-of-the-Last-K-Numbers/1352.py)|[go](./src/1352-Product-of-the-Last-K-Numbers/1352.go)|[js](./src/1352-Product-of-the-Last-K-Numbers/1352.js)|[java](./src/1352-Product-of-the-Last-K-Numbers/1352.java)||Medium|
|1353|[Maximum Number of Events That Can Be Attended](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/)||[c++](./src/1353-Maximum-Number-of-Events-That-Can-Be-Attended/1353.cpp)|[python](./src/1353-Maximum-Number-of-Events-That-Can-Be-Attended/1353.py)|[go](./src/1353-Maximum-Number-of-Events-That-Can-Be-Attended/1353.go)|[js](./src/1353-Maximum-Number-of-Events-That-Can-Be-Attended/1353.js)|[java](./src/1353-Maximum-Number-of-Events-That-Can-Be-Attended/1353.java)||Medium|
|1354|[Construct Target Array With Multiple Sums](https://leetcode.com/problems/construct-target-array-with-multiple-sums/)||[c++](./src/1354-Construct-Target-Array-With-Multiple-Sums/1354.cpp)|[python](./src/1354-Construct-Target-Array-With-Multiple-Sums/1354.py)|[go](./src/1354-Construct-Target-Array-With-Multiple-Sums/1354.go)|[js](./src/1354-Construct-Target-Array-With-Multiple-Sums/1354.js)|[java](./src/1354-Construct-Target-Array-With-Multiple-Sums/1354.java)||Hard|
|1356|[Sort Integers by The Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/)||[c++](./src/1356-Sort-Integers-by-The-Number-of-1-Bits/1356.cpp)|[python](./src/1356-Sort-Integers-by-The-Number-of-1-Bits/1356.py)|[go](./src/1356-Sort-Integers-by-The-Number-of-1-Bits/1356.go)|[js](./src/1356-Sort-Integers-by-The-Number-of-1-Bits/1356.js)|[java](./src/1356-Sort-Integers-by-The-Number-of-1-Bits/1356.java)||Easy|
|1357|[Apply Discount Every n Orders](https://leetcode.com/problems/apply-discount-every-n-orders/)||[c++](./src/1357-Apply-Discount-Every-n-Orders/1357.cpp)|[python](./src/1357-Apply-Discount-Every-n-Orders/1357.py)|[go](./src/1357-Apply-Discount-Every-n-Orders/1357.go)|[js](./src/1357-Apply-Discount-Every-n-Orders/1357.js)|[java](./src/1357-Apply-Discount-Every-n-Orders/1357.java)||Medium|
|1358|[Number of Substrings Containing All Three Characters](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/)||[c++](./src/1358-Number-of-Substrings-Containing-All-Three-Characters/1358.cpp)|[python](./src/1358-Number-of-Substrings-Containing-All-Three-Characters/1358.py)|[go](./src/1358-Number-of-Substrings-Containing-All-Three-Characters/1358.go)|[js](./src/1358-Number-of-Substrings-Containing-All-Three-Characters/1358.js)|[java](./src/1358-Number-of-Substrings-Containing-All-Three-Characters/1358.java)||Medium|
|1359|[Count All Valid Pickup and Delivery Options](https://leetcode.com/problems/count-all-valid-pickup-and-delivery-options/)||[c++](./src/1359-Count-All-Valid-Pickup-and-Delivery-Options/1359.cpp)|[python](./src/1359-Count-All-Valid-Pickup-and-Delivery-Options/1359.py)|[go](./src/1359-Count-All-Valid-Pickup-and-Delivery-Options/1359.go)|[js](./src/1359-Count-All-Valid-Pickup-and-Delivery-Options/1359.js)|[java](./src/1359-Count-All-Valid-Pickup-and-Delivery-Options/1359.java)||Hard|
|1360|[Number of Days Between Two Dates](https://leetcode.com/problems/number-of-days-between-two-dates/)||[c++](./src/1360-Number-of-Days-Between-Two-Dates/1360.cpp)|[python](./src/1360-Number-of-Days-Between-Two-Dates/1360.py)|[go](./src/1360-Number-of-Days-Between-Two-Dates/1360.go)|[js](./src/1360-Number-of-Days-Between-Two-Dates/1360.js)|[java](./src/1360-Number-of-Days-Between-Two-Dates/1360.java)||Easy|
|1361|[Validate Binary Tree Nodes](https://leetcode.com/problems/validate-binary-tree-nodes/)||[c++](./src/1361-Validate-Binary-Tree-Nodes/1361.cpp)|[python](./src/1361-Validate-Binary-Tree-Nodes/1361.py)|[go](./src/1361-Validate-Binary-Tree-Nodes/1361.go)|[js](./src/1361-Validate-Binary-Tree-Nodes/1361.js)|[java](./src/1361-Validate-Binary-Tree-Nodes/1361.java)||Medium|
|1362|[Closest Divisors](https://leetcode.com/problems/closest-divisors/)||[c++](./src/1362-Closest-Divisors/1362.cpp)|[python](./src/1362-Closest-Divisors/1362.py)|[go](./src/1362-Closest-Divisors/1362.go)|[js](./src/1362-Closest-Divisors/1362.js)|[java](./src/1362-Closest-Divisors/1362.java)||Medium|
|1363|[Largest Multiple of Three](https://leetcode.com/problems/largest-multiple-of-three/)||[c++](./src/1363-Largest-Multiple-of-Three/1363.cpp)|[python](./src/1363-Largest-Multiple-of-Three/1363.py)|[go](./src/1363-Largest-Multiple-of-Three/1363.go)|[js](./src/1363-Largest-Multiple-of-Three/1363.js)|[java](./src/1363-Largest-Multiple-of-Three/1363.java)||Hard|
|1365|[How Many Numbers Are Smaller Than the Current Number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/)||[c++](./src/1365-How-Many-Numbers-Are-Smaller-Than-the-Current-Number/1365.cpp)|[python](./src/1365-How-Many-Numbers-Are-Smaller-Than-the-Current-Number/1365.py)|[go](./src/1365-How-Many-Numbers-Are-Smaller-Than-the-Current-Number/1365.go)|[js](./src/1365-How-Many-Numbers-Are-Smaller-Than-the-Current-Number/1365.js)|[java](./src/1365-How-Many-Numbers-Are-Smaller-Than-the-Current-Number/1365.java)||Easy|
|1366|[Rank Teams by Votes](https://leetcode.com/problems/rank-teams-by-votes/)||[c++](./src/1366-Rank-Teams-by-Votes/1366.cpp)|[python](./src/1366-Rank-Teams-by-Votes/1366.py)|[go](./src/1366-Rank-Teams-by-Votes/1366.go)|[js](./src/1366-Rank-Teams-by-Votes/1366.js)|[java](./src/1366-Rank-Teams-by-Votes/1366.java)||Medium|
|1367|[Linked List in Binary Tree](https://leetcode.com/problems/linked-list-in-binary-tree/)||[c++](./src/1367-Linked-List-in-Binary-Tree/1367.cpp)|[python](./src/1367-Linked-List-in-Binary-Tree/1367.py)|[go](./src/1367-Linked-List-in-Binary-Tree/1367.go)|[js](./src/1367-Linked-List-in-Binary-Tree/1367.js)|[java](./src/1367-Linked-List-in-Binary-Tree/1367.java)||Medium|
|1368|[Minimum Cost to Make at Least One Valid Path in a Grid](https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/)||[c++](./src/1368-Minimum-Cost-to-Make-at-Least-One-Valid-Path-in-a-Grid/1368.cpp)|[python](./src/1368-Minimum-Cost-to-Make-at-Least-One-Valid-Path-in-a-Grid/1368.py)|[go](./src/1368-Minimum-Cost-to-Make-at-Least-One-Valid-Path-in-a-Grid/1368.go)|[js](./src/1368-Minimum-Cost-to-Make-at-Least-One-Valid-Path-in-a-Grid/1368.js)|[java](./src/1368-Minimum-Cost-to-Make-at-Least-One-Valid-Path-in-a-Grid/1368.java)||Hard|
|1370|[Increasing Decreasing String](https://leetcode.com/problems/increasing-decreasing-string/)||[c++](./src/1370-Increasing-Decreasing-String/1370.cpp)|[python](./src/1370-Increasing-Decreasing-String/1370.py)|[go](./src/1370-Increasing-Decreasing-String/1370.go)|[js](./src/1370-Increasing-Decreasing-String/1370.js)|[java](./src/1370-Increasing-Decreasing-String/1370.java)||Easy|
|1371|[Find the Longest Substring Containing Vowels in Even Counts](https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/)||[c++](./src/1371-Find-the-Longest-Substring-Containing-Vowels-in-Even-Counts/1371.cpp)|[python](./src/1371-Find-the-Longest-Substring-Containing-Vowels-in-Even-Counts/1371.py)|[go](./src/1371-Find-the-Longest-Substring-Containing-Vowels-in-Even-Counts/1371.go)|[js](./src/1371-Find-the-Longest-Substring-Containing-Vowels-in-Even-Counts/1371.js)|[java](./src/1371-Find-the-Longest-Substring-Containing-Vowels-in-Even-Counts/1371.java)||Medium|
|1372|[Longest ZigZag Path in a Binary Tree](https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/)||[c++](./src/1372-Longest-ZigZag-Path-in-a-Binary-Tree/1372.cpp)|[python](./src/1372-Longest-ZigZag-Path-in-a-Binary-Tree/1372.py)|[go](./src/1372-Longest-ZigZag-Path-in-a-Binary-Tree/1372.go)|[js](./src/1372-Longest-ZigZag-Path-in-a-Binary-Tree/1372.js)|[java](./src/1372-Longest-ZigZag-Path-in-a-Binary-Tree/1372.java)||Medium|
|1373|[Maximum Sum BST in Binary Tree](https://leetcode.com/problems/maximum-sum-bst-in-binary-tree/)||[c++](./src/1373-Maximum-Sum-BST-in-Binary-Tree/1373.cpp)|[python](./src/1373-Maximum-Sum-BST-in-Binary-Tree/1373.py)|[go](./src/1373-Maximum-Sum-BST-in-Binary-Tree/1373.go)|[js](./src/1373-Maximum-Sum-BST-in-Binary-Tree/1373.js)|[java](./src/1373-Maximum-Sum-BST-in-Binary-Tree/1373.java)||Hard|
|1374|[Generate a String With Characters That Have Odd Counts](https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/)||[c++](./src/1374-Generate-a-String-With-Characters-That-Have-Odd-Counts/1374.cpp)|[python](./src/1374-Generate-a-String-With-Characters-That-Have-Odd-Counts/1374.py)|[go](./src/1374-Generate-a-String-With-Characters-That-Have-Odd-Counts/1374.go)|[js](./src/1374-Generate-a-String-With-Characters-That-Have-Odd-Counts/1374.js)|[java](./src/1374-Generate-a-String-With-Characters-That-Have-Odd-Counts/1374.java)||Easy|
|1375|[Bulb Switcher III](https://leetcode.com/problems/bulb-switcher-iii/)||[c++](./src/1375-Bulb-Switcher-III/1375.cpp)|[python](./src/1375-Bulb-Switcher-III/1375.py)|[go](./src/1375-Bulb-Switcher-III/1375.go)|[js](./src/1375-Bulb-Switcher-III/1375.js)|[java](./src/1375-Bulb-Switcher-III/1375.java)||Medium|
|1376|[Time Needed to Inform All Employees](https://leetcode.com/problems/time-needed-to-inform-all-employees/)||[c++](./src/1376-Time-Needed-to-Inform-All-Employees/1376.cpp)|[python](./src/1376-Time-Needed-to-Inform-All-Employees/1376.py)|[go](./src/1376-Time-Needed-to-Inform-All-Employees/1376.go)|[js](./src/1376-Time-Needed-to-Inform-All-Employees/1376.js)|[java](./src/1376-Time-Needed-to-Inform-All-Employees/1376.java)||Medium|
|1377|[Frog Position After T Seconds](https://leetcode.com/problems/frog-position-after-t-seconds/)||[c++](./src/1377-Frog-Position-After-T-Seconds/1377.cpp)|[python](./src/1377-Frog-Position-After-T-Seconds/1377.py)|[go](./src/1377-Frog-Position-After-T-Seconds/1377.go)|[js](./src/1377-Frog-Position-After-T-Seconds/1377.js)|[java](./src/1377-Frog-Position-After-T-Seconds/1377.java)||Hard|
|1380|[Lucky Numbers in a Matrix](https://leetcode.com/problems/lucky-numbers-in-a-matrix/)||[c++](./src/1380-Lucky-Numbers-in-a-Matrix/1380.cpp)|[python](./src/1380-Lucky-Numbers-in-a-Matrix/1380.py)|[go](./src/1380-Lucky-Numbers-in-a-Matrix/1380.go)|[js](./src/1380-Lucky-Numbers-in-a-Matrix/1380.js)|[java](./src/1380-Lucky-Numbers-in-a-Matrix/1380.java)||Easy|
|1381|[Design a Stack With Increment Operation](https://leetcode.com/problems/design-a-stack-with-increment-operation/)||[c++](./src/1381-Design-a-Stack-With-Increment-Operation/1381.cpp)|[python](./src/1381-Design-a-Stack-With-Increment-Operation/1381.py)|[go](./src/1381-Design-a-Stack-With-Increment-Operation/1381.go)|[js](./src/1381-Design-a-Stack-With-Increment-Operation/1381.js)|[java](./src/1381-Design-a-Stack-With-Increment-Operation/1381.java)||Medium|
|1382|[Balance a Binary Search Tree](https://leetcode.com/problems/balance-a-binary-search-tree/)||[c++](./src/1382-Balance-a-Binary-Search-Tree/1382.cpp)|[python](./src/1382-Balance-a-Binary-Search-Tree/1382.py)|[go](./src/1382-Balance-a-Binary-Search-Tree/1382.go)|[js](./src/1382-Balance-a-Binary-Search-Tree/1382.js)|[java](./src/1382-Balance-a-Binary-Search-Tree/1382.java)||Medium|
|1383|[Maximum Performance of a Team](https://leetcode.com/problems/maximum-performance-of-a-team/)||[c++](./src/1383-Maximum-Performance-of-a-Team/1383.cpp)|[python](./src/1383-Maximum-Performance-of-a-Team/1383.py)|[go](./src/1383-Maximum-Performance-of-a-Team/1383.go)|[js](./src/1383-Maximum-Performance-of-a-Team/1383.js)|[java](./src/1383-Maximum-Performance-of-a-Team/1383.java)||Hard|
|1385|[Find the Distance Value Between Two Arrays](https://leetcode.com/problems/find-the-distance-value-between-two-arrays/)||[c++](./src/1385-Find-the-Distance-Value-Between-Two-Arrays/1385.cpp)|[python](./src/1385-Find-the-Distance-Value-Between-Two-Arrays/1385.py)|[go](./src/1385-Find-the-Distance-Value-Between-Two-Arrays/1385.go)|[js](./src/1385-Find-the-Distance-Value-Between-Two-Arrays/1385.js)|[java](./src/1385-Find-the-Distance-Value-Between-Two-Arrays/1385.java)||Easy|
|1386|[Cinema Seat Allocation](https://leetcode.com/problems/cinema-seat-allocation/)||[c++](./src/1386-Cinema-Seat-Allocation/1386.cpp)|[python](./src/1386-Cinema-Seat-Allocation/1386.py)|[go](./src/1386-Cinema-Seat-Allocation/1386.go)|[js](./src/1386-Cinema-Seat-Allocation/1386.js)|[java](./src/1386-Cinema-Seat-Allocation/1386.java)||Medium|
|1387|[Sort Integers by The Power Value](https://leetcode.com/problems/sort-integers-by-the-power-value/)||[c++](./src/1387-Sort-Integers-by-The-Power-Value/1387.cpp)|[python](./src/1387-Sort-Integers-by-The-Power-Value/1387.py)|[go](./src/1387-Sort-Integers-by-The-Power-Value/1387.go)|[js](./src/1387-Sort-Integers-by-The-Power-Value/1387.js)|[java](./src/1387-Sort-Integers-by-The-Power-Value/1387.java)||Medium|
|1388|[Pizza With 3n Slices](https://leetcode.com/problems/pizza-with-3n-slices/)||[c++](./src/1388-Pizza-With-3n-Slices/1388.cpp)|[python](./src/1388-Pizza-With-3n-Slices/1388.py)|[go](./src/1388-Pizza-With-3n-Slices/1388.go)|[js](./src/1388-Pizza-With-3n-Slices/1388.js)|[java](./src/1388-Pizza-With-3n-Slices/1388.java)||Hard|
|1389|[Create Target Array in the Given Order](https://leetcode.com/problems/create-target-array-in-the-given-order/)||[c++](./src/1389-Create-Target-Array-in-the-Given-Order/1389.cpp)|[python](./src/1389-Create-Target-Array-in-the-Given-Order/1389.py)|[go](./src/1389-Create-Target-Array-in-the-Given-Order/1389.go)|[js](./src/1389-Create-Target-Array-in-the-Given-Order/1389.js)|[java](./src/1389-Create-Target-Array-in-the-Given-Order/1389.java)||Easy|
|1390|[Four Divisors](https://leetcode.com/problems/four-divisors/)||[c++](./src/1390-Four-Divisors/1390.cpp)|[python](./src/1390-Four-Divisors/1390.py)|[go](./src/1390-Four-Divisors/1390.go)|[js](./src/1390-Four-Divisors/1390.js)|[java](./src/1390-Four-Divisors/1390.java)||Medium|
|1391|[Check if There is a Valid Path in a Grid](https://leetcode.com/problems/check-if-there-is-a-valid-path-in-a-grid/)||[c++](./src/1391-Check-if-There-is-a-Valid-Path-in-a-Grid/1391.cpp)|[python](./src/1391-Check-if-There-is-a-Valid-Path-in-a-Grid/1391.py)|[go](./src/1391-Check-if-There-is-a-Valid-Path-in-a-Grid/1391.go)|[js](./src/1391-Check-if-There-is-a-Valid-Path-in-a-Grid/1391.js)|[java](./src/1391-Check-if-There-is-a-Valid-Path-in-a-Grid/1391.java)||Medium|
|1392|[Longest Happy Prefix](https://leetcode.com/problems/longest-happy-prefix/)||[c++](./src/1392-Longest-Happy-Prefix/1392.cpp)|[python](./src/1392-Longest-Happy-Prefix/1392.py)|[go](./src/1392-Longest-Happy-Prefix/1392.go)|[js](./src/1392-Longest-Happy-Prefix/1392.js)|[java](./src/1392-Longest-Happy-Prefix/1392.java)||Hard|
|1394|[Find Lucky Integer in an Array](https://leetcode.com/problems/find-lucky-integer-in-an-array/)||[c++](./src/1394-Find-Lucky-Integer-in-an-Array/1394.cpp)|[python](./src/1394-Find-Lucky-Integer-in-an-Array/1394.py)|[go](./src/1394-Find-Lucky-Integer-in-an-Array/1394.go)|[js](./src/1394-Find-Lucky-Integer-in-an-Array/1394.js)|[java](./src/1394-Find-Lucky-Integer-in-an-Array/1394.java)||Easy|
|1395|[Count Number of Teams](https://leetcode.com/problems/count-number-of-teams/)||[c++](./src/1395-Count-Number-of-Teams/1395.cpp)|[python](./src/1395-Count-Number-of-Teams/1395.py)|[go](./src/1395-Count-Number-of-Teams/1395.go)|[js](./src/1395-Count-Number-of-Teams/1395.js)|[java](./src/1395-Count-Number-of-Teams/1395.java)||Medium|
|1396|[Design Underground System](https://leetcode.com/problems/design-underground-system/)||[c++](./src/1396-Design-Underground-System/1396.cpp)|[python](./src/1396-Design-Underground-System/1396.py)|[go](./src/1396-Design-Underground-System/1396.go)|[js](./src/1396-Design-Underground-System/1396.js)|[java](./src/1396-Design-Underground-System/1396.java)||Medium|
|1397|[Find All Good Strings](https://leetcode.com/problems/find-all-good-strings/)||[c++](./src/1397-Find-All-Good-Strings/1397.cpp)|[python](./src/1397-Find-All-Good-Strings/1397.py)|[go](./src/1397-Find-All-Good-Strings/1397.go)|[js](./src/1397-Find-All-Good-Strings/1397.js)|[java](./src/1397-Find-All-Good-Strings/1397.java)||Hard|
|1399|[Count Largest Group](https://leetcode.com/problems/count-largest-group/)||[c++](./src/1399-Count-Largest-Group/1399.cpp)|[python](./src/1399-Count-Largest-Group/1399.py)|[go](./src/1399-Count-Largest-Group/1399.go)|[js](./src/1399-Count-Largest-Group/1399.js)|[java](./src/1399-Count-Largest-Group/1399.java)||Easy|
|1400|[Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/)||[c++](./src/1400-Construct-K-Palindrome-Strings/1400.cpp)|[python](./src/1400-Construct-K-Palindrome-Strings/1400.py)|[go](./src/1400-Construct-K-Palindrome-Strings/1400.go)|[js](./src/1400-Construct-K-Palindrome-Strings/1400.js)|[java](./src/1400-Construct-K-Palindrome-Strings/1400.java)||Medium|
|1401|[Circle and Rectangle Overlapping](https://leetcode.com/problems/circle-and-rectangle-overlapping/)||[c++](./src/1401-Circle-and-Rectangle-Overlapping/1401.cpp)|[python](./src/1401-Circle-and-Rectangle-Overlapping/1401.py)|[go](./src/1401-Circle-and-Rectangle-Overlapping/1401.go)|[js](./src/1401-Circle-and-Rectangle-Overlapping/1401.js)|[java](./src/1401-Circle-and-Rectangle-Overlapping/1401.java)||Medium|
|1402|[Reducing Dishes](https://leetcode.com/problems/reducing-dishes/)||[c++](./src/1402-Reducing-Dishes/1402.cpp)|[python](./src/1402-Reducing-Dishes/1402.py)|[go](./src/1402-Reducing-Dishes/1402.go)|[js](./src/1402-Reducing-Dishes/1402.js)|[java](./src/1402-Reducing-Dishes/1402.java)||Hard|
|1403|[Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/)||[c++](./src/1403-Minimum-Subsequence-in-Non-Increasing-Order/1403.cpp)|[python](./src/1403-Minimum-Subsequence-in-Non-Increasing-Order/1403.py)|[go](./src/1403-Minimum-Subsequence-in-Non-Increasing-Order/1403.go)|[js](./src/1403-Minimum-Subsequence-in-Non-Increasing-Order/1403.js)|[java](./src/1403-Minimum-Subsequence-in-Non-Increasing-Order/1403.java)||Easy|
|1404|[Number of Steps to Reduce a Number in Binary Representation to One](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/)||[c++](./src/1404-Number-of-Steps-to-Reduce-a-Number-in-Binary-Representation-to-One/1404.cpp)|[python](./src/1404-Number-of-Steps-to-Reduce-a-Number-in-Binary-Representation-to-One/1404.py)|[go](./src/1404-Number-of-Steps-to-Reduce-a-Number-in-Binary-Representation-to-One/1404.go)|[js](./src/1404-Number-of-Steps-to-Reduce-a-Number-in-Binary-Representation-to-One/1404.js)|[java](./src/1404-Number-of-Steps-to-Reduce-a-Number-in-Binary-Representation-to-One/1404.java)||Medium|
|1405|[Longest Happy String](https://leetcode.com/problems/longest-happy-string/)||[c++](./src/1405-Longest-Happy-String/1405.cpp)|[python](./src/1405-Longest-Happy-String/1405.py)|[go](./src/1405-Longest-Happy-String/1405.go)|[js](./src/1405-Longest-Happy-String/1405.js)|[java](./src/1405-Longest-Happy-String/1405.java)||Medium|
|1406|[Stone Game III](https://leetcode.com/problems/stone-game-iii/)||[c++](./src/1406-Stone-Game-III/1406.cpp)|[python](./src/1406-Stone-Game-III/1406.py)|[go](./src/1406-Stone-Game-III/1406.go)|[js](./src/1406-Stone-Game-III/1406.js)|[java](./src/1406-Stone-Game-III/1406.java)||Hard|
|1408|[String Matching in an Array](https://leetcode.com/problems/string-matching-in-an-array/)||[c++](./src/1408-String-Matching-in-an-Array/1408.cpp)|[python](./src/1408-String-Matching-in-an-Array/1408.py)|[go](./src/1408-String-Matching-in-an-Array/1408.go)|[js](./src/1408-String-Matching-in-an-Array/1408.js)|[java](./src/1408-String-Matching-in-an-Array/1408.java)||Easy|
|1409|[Queries on a Permutation With Key](https://leetcode.com/problems/queries-on-a-permutation-with-key/)||[c++](./src/1409-Queries-on-a-Permutation-With-Key/1409.cpp)|[python](./src/1409-Queries-on-a-Permutation-With-Key/1409.py)|[go](./src/1409-Queries-on-a-Permutation-With-Key/1409.go)|[js](./src/1409-Queries-on-a-Permutation-With-Key/1409.js)|[java](./src/1409-Queries-on-a-Permutation-With-Key/1409.java)||Medium|
|1410|[HTML Entity Parser](https://leetcode.com/problems/html-entity-parser/)||[c++](./src/1410-HTML-Entity-Parser/1410.cpp)|[python](./src/1410-HTML-Entity-Parser/1410.py)|[go](./src/1410-HTML-Entity-Parser/1410.go)|[js](./src/1410-HTML-Entity-Parser/1410.js)|[java](./src/1410-HTML-Entity-Parser/1410.java)||Medium|
|1411|[Number of Ways to Paint N×3 Grid](https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid/)||[c++](./src/1411-Number-of-Ways-to-Paint-N×3-Grid/1411.cpp)|[python](./src/1411-Number-of-Ways-to-Paint-N×3-Grid/1411.py)|[go](./src/1411-Number-of-Ways-to-Paint-N×3-Grid/1411.go)|[js](./src/1411-Number-of-Ways-to-Paint-N×3-Grid/1411.js)|[java](./src/1411-Number-of-Ways-to-Paint-N×3-Grid/1411.java)||Hard|
|1413|[Minimum Value to Get Positive Step by Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/)||[c++](./src/1413-Minimum-Value-to-Get-Positive-Step-by-Step-Sum/1413.cpp)|[python](./src/1413-Minimum-Value-to-Get-Positive-Step-by-Step-Sum/1413.py)|[go](./src/1413-Minimum-Value-to-Get-Positive-Step-by-Step-Sum/1413.go)|[js](./src/1413-Minimum-Value-to-Get-Positive-Step-by-Step-Sum/1413.js)|[java](./src/1413-Minimum-Value-to-Get-Positive-Step-by-Step-Sum/1413.java)||Easy|
|1414|[Find the Minimum Number of Fibonacci Numbers Whose Sum Is K](https://leetcode.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/)||[c++](./src/1414-Find-the-Minimum-Number-of-Fibonacci-Numbers-Whose-Sum-Is-K/1414.cpp)|[python](./src/1414-Find-the-Minimum-Number-of-Fibonacci-Numbers-Whose-Sum-Is-K/1414.py)|[go](./src/1414-Find-the-Minimum-Number-of-Fibonacci-Numbers-Whose-Sum-Is-K/1414.go)|[js](./src/1414-Find-the-Minimum-Number-of-Fibonacci-Numbers-Whose-Sum-Is-K/1414.js)|[java](./src/1414-Find-the-Minimum-Number-of-Fibonacci-Numbers-Whose-Sum-Is-K/1414.java)||Medium|
|1415|[The k-th Lexicographical String of All Happy Strings of Length n](https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/)||[c++](./src/1415-The-k-th-Lexicographical-String-of-All-Happy-Strings-of-Length-n/1415.cpp)|[python](./src/1415-The-k-th-Lexicographical-String-of-All-Happy-Strings-of-Length-n/1415.py)|[go](./src/1415-The-k-th-Lexicographical-String-of-All-Happy-Strings-of-Length-n/1415.go)|[js](./src/1415-The-k-th-Lexicographical-String-of-All-Happy-Strings-of-Length-n/1415.js)|[java](./src/1415-The-k-th-Lexicographical-String-of-All-Happy-Strings-of-Length-n/1415.java)||Medium|
|1416|[Restore The Array](https://leetcode.com/problems/restore-the-array/)||[c++](./src/1416-Restore-The-Array/1416.cpp)|[python](./src/1416-Restore-The-Array/1416.py)|[go](./src/1416-Restore-The-Array/1416.go)|[js](./src/1416-Restore-The-Array/1416.js)|[java](./src/1416-Restore-The-Array/1416.java)||Hard|
|1417|[Reformat The String](https://leetcode.com/problems/reformat-the-string/)||[c++](./src/1417-Reformat-The-String/1417.cpp)|[python](./src/1417-Reformat-The-String/1417.py)|[go](./src/1417-Reformat-The-String/1417.go)|[js](./src/1417-Reformat-The-String/1417.js)|[java](./src/1417-Reformat-The-String/1417.java)||Easy|
|1418|[Display Table of Food Orders in a Restaurant](https://leetcode.com/problems/display-table-of-food-orders-in-a-restaurant/)||[c++](./src/1418-Display-Table-of-Food-Orders-in-a-Restaurant/1418.cpp)|[python](./src/1418-Display-Table-of-Food-Orders-in-a-Restaurant/1418.py)|[go](./src/1418-Display-Table-of-Food-Orders-in-a-Restaurant/1418.go)|[js](./src/1418-Display-Table-of-Food-Orders-in-a-Restaurant/1418.js)|[java](./src/1418-Display-Table-of-Food-Orders-in-a-Restaurant/1418.java)||Medium|
|1419|[Minimum Number of Frogs Croaking](https://leetcode.com/problems/minimum-number-of-frogs-croaking/)||[c++](./src/1419-Minimum-Number-of-Frogs-Croaking/1419.cpp)|[python](./src/1419-Minimum-Number-of-Frogs-Croaking/1419.py)|[go](./src/1419-Minimum-Number-of-Frogs-Croaking/1419.go)|[js](./src/1419-Minimum-Number-of-Frogs-Croaking/1419.js)|[java](./src/1419-Minimum-Number-of-Frogs-Croaking/1419.java)||Medium|
|1420|[Build Array Where You Can Find The Maximum Exactly K Comparisons](https://leetcode.com/problems/build-array-where-you-can-find-the-maximum-exactly-k-comparisons/)||[c++](./src/1420-Build-Array-Where-You-Can-Find-The-Maximum-Exactly-K-Comparisons/1420.cpp)|[python](./src/1420-Build-Array-Where-You-Can-Find-The-Maximum-Exactly-K-Comparisons/1420.py)|[go](./src/1420-Build-Array-Where-You-Can-Find-The-Maximum-Exactly-K-Comparisons/1420.go)|[js](./src/1420-Build-Array-Where-You-Can-Find-The-Maximum-Exactly-K-Comparisons/1420.js)|[java](./src/1420-Build-Array-Where-You-Can-Find-The-Maximum-Exactly-K-Comparisons/1420.java)||Hard|
|1422|[Maximum Score After Splitting a String](https://leetcode.com/problems/maximum-score-after-splitting-a-string/)||[c++](./src/1422-Maximum-Score-After-Splitting-a-String/1422.cpp)|[python](./src/1422-Maximum-Score-After-Splitting-a-String/1422.py)|[go](./src/1422-Maximum-Score-After-Splitting-a-String/1422.go)|[js](./src/1422-Maximum-Score-After-Splitting-a-String/1422.js)|[java](./src/1422-Maximum-Score-After-Splitting-a-String/1422.java)||Easy|
|1423|[Maximum Points You Can Obtain from Cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/)||[c++](./src/1423-Maximum-Points-You-Can-Obtain-from-Cards/1423.cpp)|[python](./src/1423-Maximum-Points-You-Can-Obtain-from-Cards/1423.py)|[go](./src/1423-Maximum-Points-You-Can-Obtain-from-Cards/1423.go)|[js](./src/1423-Maximum-Points-You-Can-Obtain-from-Cards/1423.js)|[java](./src/1423-Maximum-Points-You-Can-Obtain-from-Cards/1423.java)||Medium|
|1424|[Diagonal Traverse II](https://leetcode.com/problems/diagonal-traverse-ii/)||[c++](./src/1424-Diagonal-Traverse-II/1424.cpp)|[python](./src/1424-Diagonal-Traverse-II/1424.py)|[go](./src/1424-Diagonal-Traverse-II/1424.go)|[js](./src/1424-Diagonal-Traverse-II/1424.js)|[java](./src/1424-Diagonal-Traverse-II/1424.java)||Medium|
|1425|[Constrained Subsequence Sum](https://leetcode.com/problems/constrained-subsequence-sum/)||[c++](./src/1425-Constrained-Subsequence-Sum/1425.cpp)|[python](./src/1425-Constrained-Subsequence-Sum/1425.py)|[go](./src/1425-Constrained-Subsequence-Sum/1425.go)|[js](./src/1425-Constrained-Subsequence-Sum/1425.js)|[java](./src/1425-Constrained-Subsequence-Sum/1425.java)||Hard|
|1431|[Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/)||[c++](./src/1431-Kids-With-the-Greatest-Number-of-Candies/1431.cpp)|[python](./src/1431-Kids-With-the-Greatest-Number-of-Candies/1431.py)|[go](./src/1431-Kids-With-the-Greatest-Number-of-Candies/1431.go)|[js](./src/1431-Kids-With-the-Greatest-Number-of-Candies/1431.js)|[java](./src/1431-Kids-With-the-Greatest-Number-of-Candies/1431.java)||Easy|
|1432|[Max Difference You Can Get From Changing an Integer](https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer/)||[c++](./src/1432-Max-Difference-You-Can-Get-From-Changing-an-Integer/1432.cpp)|[python](./src/1432-Max-Difference-You-Can-Get-From-Changing-an-Integer/1432.py)|[go](./src/1432-Max-Difference-You-Can-Get-From-Changing-an-Integer/1432.go)|[js](./src/1432-Max-Difference-You-Can-Get-From-Changing-an-Integer/1432.js)|[java](./src/1432-Max-Difference-You-Can-Get-From-Changing-an-Integer/1432.java)||Medium|
|1433|[Check If a String Can Break Another String](https://leetcode.com/problems/check-if-a-string-can-break-another-string/)||[c++](./src/1433-Check-If-a-String-Can-Break-Another-String/1433.cpp)|[python](./src/1433-Check-If-a-String-Can-Break-Another-String/1433.py)|[go](./src/1433-Check-If-a-String-Can-Break-Another-String/1433.go)|[js](./src/1433-Check-If-a-String-Can-Break-Another-String/1433.js)|[java](./src/1433-Check-If-a-String-Can-Break-Another-String/1433.java)||Medium|
|1434|[Number of Ways to Wear Different Hats to Each Other](https://leetcode.com/problems/number-of-ways-to-wear-different-hats-to-each-other/)||[c++](./src/1434-Number-of-Ways-to-Wear-Different-Hats-to-Each-Other/1434.cpp)|[python](./src/1434-Number-of-Ways-to-Wear-Different-Hats-to-Each-Other/1434.py)|[go](./src/1434-Number-of-Ways-to-Wear-Different-Hats-to-Each-Other/1434.go)|[js](./src/1434-Number-of-Ways-to-Wear-Different-Hats-to-Each-Other/1434.js)|[java](./src/1434-Number-of-Ways-to-Wear-Different-Hats-to-Each-Other/1434.java)||Hard|
|1436|[Destination City](https://leetcode.com/problems/destination-city/)||[c++](./src/1436-Destination-City/1436.cpp)|[python](./src/1436-Destination-City/1436.py)|[go](./src/1436-Destination-City/1436.go)|[js](./src/1436-Destination-City/1436.js)|[java](./src/1436-Destination-City/1436.java)||Easy|
|1437|[Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/)||[c++](./src/1437-Check-If-All-1's-Are-at-Least-Length-K-Places-Away/1437.cpp)|[python](./src/1437-Check-If-All-1's-Are-at-Least-Length-K-Places-Away/1437.py)|[go](./src/1437-Check-If-All-1's-Are-at-Least-Length-K-Places-Away/1437.go)|[js](./src/1437-Check-If-All-1's-Are-at-Least-Length-K-Places-Away/1437.js)|[java](./src/1437-Check-If-All-1's-Are-at-Least-Length-K-Places-Away/1437.java)||Medium|
|1438|[Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/)||[c++](./src/1438-Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/1438.cpp)|[python](./src/1438-Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/1438.py)|[go](./src/1438-Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/1438.go)|[js](./src/1438-Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/1438.js)|[java](./src/1438-Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/1438.java)||Medium|
|1439|[Find the Kth Smallest Sum of a Matrix With Sorted Rows](https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/)||[c++](./src/1439-Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/1439.cpp)|[python](./src/1439-Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/1439.py)|[go](./src/1439-Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/1439.go)|[js](./src/1439-Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/1439.js)|[java](./src/1439-Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/1439.java)||Hard|
|1441|[Build an Array With Stack Operations](https://leetcode.com/problems/build-an-array-with-stack-operations/)||[c++](./src/1441-Build-an-Array-With-Stack-Operations/1441.cpp)|[python](./src/1441-Build-an-Array-With-Stack-Operations/1441.py)|[go](./src/1441-Build-an-Array-With-Stack-Operations/1441.go)|[js](./src/1441-Build-an-Array-With-Stack-Operations/1441.js)|[java](./src/1441-Build-an-Array-With-Stack-Operations/1441.java)||Easy|
|1442|[Count Triplets That Can Form Two Arrays of Equal XOR](https://leetcode.com/problems/count-triplets-that-can-form-two-arrays-of-equal-xor/)||[c++](./src/1442-Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/1442.cpp)|[python](./src/1442-Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/1442.py)|[go](./src/1442-Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/1442.go)|[js](./src/1442-Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/1442.js)|[java](./src/1442-Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/1442.java)||Medium|
|1443|[Minimum Time to Collect All Apples in a Tree](https://leetcode.com/problems/minimum-time-to-collect-all-apples-in-a-tree/)||[c++](./src/1443-Minimum-Time-to-Collect-All-Apples-in-a-Tree/1443.cpp)|[python](./src/1443-Minimum-Time-to-Collect-All-Apples-in-a-Tree/1443.py)|[go](./src/1443-Minimum-Time-to-Collect-All-Apples-in-a-Tree/1443.go)|[js](./src/1443-Minimum-Time-to-Collect-All-Apples-in-a-Tree/1443.js)|[java](./src/1443-Minimum-Time-to-Collect-All-Apples-in-a-Tree/1443.java)||Medium|
|1444|[Number of Ways of Cutting a Pizza](https://leetcode.com/problems/number-of-ways-of-cutting-a-pizza/)||[c++](./src/1444-Number-of-Ways-of-Cutting-a-Pizza/1444.cpp)|[python](./src/1444-Number-of-Ways-of-Cutting-a-Pizza/1444.py)|[go](./src/1444-Number-of-Ways-of-Cutting-a-Pizza/1444.go)|[js](./src/1444-Number-of-Ways-of-Cutting-a-Pizza/1444.js)|[java](./src/1444-Number-of-Ways-of-Cutting-a-Pizza/1444.java)||Hard|
|1470|[Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/)||[c++](./src/1470-Shuffle-the-Array/1470.cpp)||||||Easy|
|1472|[Design Browser History](https://leetcode.com/problems/design-browser-history/)||[c++](./src/1472-Design-Browser-History/1472.cpp)||||||Medium|
|1523|[Count Odd Numbers in an Interval Range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/)||[c++](./src/1523-Count-Odd-Numbers-in-an-Interval-Range/1523.cpp)||||||Easy|
|1546|[Maximum Number of Non-Overlapping Subarrays With Sum Equals Target](https://leetcode.com/problems/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target/)||[c++](./src/1546-Maximum-Number-of-Non-Overlapping-Subarrays-With-Sum-Equals-Target/maximum_number_of_nonoverlapping_with_sum_equals_target.cpp)||||||Medium|
|1574|[Shortest Subarray To Be Removed To Make Array Sorted](https://leetcode.cn/problems/shortest-subarray-to-be-removed-to-make-array-sorted/)||[c++](./src/1574-Shortest-Subarray-To-Be-Removed-To-Make-Array-Sorted/1574.cpp)||||||Medium|
|1604|[Alert Using Same Key-Card Three or More Times in a One Hour Period](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/)||[c++](./src/1604-Alert-Using-Same-Key-Card-Three-or-More-Times-in-a-One-Hour-Period/1604.cpp)||||||Medium|
|1616|[Split Two Strings to Make Palindrome](https://leetcode.com/problems/split-two-strings-to-make-palindrome/)||[c++](./src/1616-Split-Two-Strings-to-Make-Palindrome/1616.cpp)||||||Medium|
|1626|[Best Team With No Conflicts](https://leetcode.com/problems/best-team-with-no-conflicts/)||[c++](./src/1626-Best-Team-With-No-Conflicts/1626.cpp)||||||Medium|
|1657|[Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/)||[c++](./src/1657-Determine-if-Two-Strings-Are-Close/1657.cpp)||||||Medium|
|1658|[Minimum Operations to Reduce X to Zero](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/)||[c++](./src/1658-Minimum-Operations-to-Reduce-X-to-Zero/1658.cpp)||||||Medium|
|1664|[Ways to Make a Fair Array](https://leetcode.com/problems/ways-to-make-a-fair-array/)||[c++](./src/1664-Ways-to-Make-a-Fair-Array/1664.cpp)||||||Medium|
|1669|[Merge In Between Linked Lists](https://leetcode.com/problems/merge-in-between-linked-lists/)||[c++](./src/1669-Merge-In-Between-Linked-Lists/1669.cpp)||||||Medium|
|1673|[Find the Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence/)||[c++](./src/1673-Find-the-Most-Competitive-Subsequence/1673.cpp)||||||Medium|
|1691|[Maximum Height by Stacking Cuboids](https://leetcode.com/problems/maximum-height-by-stacking-cuboids/description/)||[c++](./src/1691-Maximum-Height-by-Stacking-Cuboids/1691.cpp)||||||Hard|
|1704|[Determine if String Halves Are Alike](https://leetcode.com/problems/determine-if-string-halves-are-alike/)||[c++](./src/1704-Determine-if-String-Halves-Are-Alike/1704.cpp)||||||Easy|
|1732|[Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude/)||[c++](./src/1732-Find-the-Highest-Altitude/1732.cpp)||||||Easy|
|1739|[Building Boxes](https://leetcode.com/problems/building-boxes/)||[c++](./src/1739-Building-Boxes/1739.cpp)||||||Hard|
|1742|[Maximum Number of Balls in a Box](https://leetcode.com/problems/maximum-number-of-balls-in-a-box/)||[c++](./src/1742-Maximum-Number-of-Balls-in-a-Box/1742.cpp)||||||Easy|
|1750|[Minimum Length of String After Deleting Similar Ends](https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/)||[c++](./src/1750-Minimum-Length-of-String-After-Deleting-Similar-Ends/1750.cpp)||||||Medium|
|1752|[Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/)||[c++](./src/1752-Check-if-Array-Is-Sorted-and-Rotated/1752.cpp)||||||Easy|
|1754|[Largest Merge Of Two Strings](https://leetcode.com/problems/largest-merge-of-two-strings/)||[c++](./src/1754-Largest-Merge-Of-Two-Strings/1754.cpp)||||||Medium|
|1758|[Minimum Changes To Make Alternating Binary String](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/)||[c++](./src/1758-Minimum-Changes-To-Make-Alternating-Binary-String/1758.cpp)||||||Easy|
|1759|[Count Number of Homogenous Substrings](https://leetcode.com/problems/count-number-of-homogenous-substrings/)||[c++](./src/1759-Count-Number-of-Homogenous-Substrings/1759.cpp)||||||Medium|
|1779|[Find Nearest Point That Has the Same X or Y Coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/)||[c++](./src/1779-Find-Nearest-Point-That-Has-the-Same-X-or-Y-Coordinate/1779.cpp)||||||Easy|
|1780|[Check if Number is a Sum of Powers of Three](https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/)||[c++](./src/1780-Check-if-Number-is-a-Sum-of-Powers-of-Three/1780.cpp)||||||Medium|
|1781|[Sum of Beauty of All Substrings](https://leetcode.com/problems/sum-of-beauty-of-all-substrings/)||[c++](./src/1781-Sum-of-Beauty-of-All-Substrings/1781.cpp)||||||Medium|
|1796|[Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string/)||[c++](./src/1796-Second-Largest-Digit-in-a-String/1796.cpp)||||||Easy|
|1798|[Maximum Number of Consecutive Values You Can Make](https://leetcode.com/problems/maximum-number-of-consecutive-values-you-can-make/)||[c++](./src/1798-Maximum-Number-of-Consecutive-Values-You-Can-Make/1798.cpp)||||||Medium|
|1801|[Number of Orders in the Backlog](https://leetcode.com/problems/number-of-orders-in-the-backlog/)||[c++](./src/1801-Number-of-Orders-in-the-Backlog/1801.cpp)||||||Medium|
|1802|[Maximum Value at a Given Index in a Bounded Array](https://leetcode.com/problems/maximum-value-at-a-given-index-in-a-bounded-array/)||[c++](./src/1802-Maximum-Value-at-a-Given-Index-in-a-Bounded-Array/1802.cpp)||||||Medium|
|1805|[Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string/)||[c++](./src/1805-Number-of-Different-Integers-in-a-String/1805.cpp)||||||Easy|
|1806|[Minimum Number of Operations to Reinitialize a Permutation](https://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation/)||[c++](./src/1806-Minimum-Number-of-Operations-to-Reinitialize-a-Permutation/1806.cpp)||||||Medium|
|1807|[Evaluate the Bracket Pairs of a String](https://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string/)||[c++](./src/1807-Evaluate-the-Bracket-Pairs-of-a-String/1807.cpp)||||||Medium|
|1812|[Determine Color of a Chessboard Square](https://leetcode.com/problems/determine-color-of-a-chessboard-square/)||[c++](./src/1812-Determine-Color-of-a-Chessboard-Square/1812.cpp)||||||Easy|
|1813|[Sentence Similarity III](https://leetcode.com/problems/sentence-similarity-iii/)||[c++](./src/1813-Sentence-Similarity-III/1813.cpp)||||||Medium|
|1814|[Count Nice Pairs in an Array](https://leetcode.com/problems/count-nice-pairs-in-an-array/)||[c++](./src/1814-Count-Nice-Pairs-in-an-Array/1814.cpp)||||||Medium|
|1819|[Number of Different Subsequences GCDs](https://leetcode.com/problems/number-of-different-subsequences-gcds/)||[c++](./src/1812-Determine-Color-of-a-Chessboard-Square/1812.cpp)||||||Hard|
|1827|[Minimum Operations to Make the Array Increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/)||[c++](./src/1827-Minimum-Operations-to-Make-the-Array-Increasing/1827.cpp)||||||Easy|
|1833|[Maximum Ice Cream Bars](https://leetcode.com/problems/maximum-ice-cream-bars/)||[c++](./src/1833-Maximum-Ice-Cream-Bars/1833.cpp)||||||Medium|
|1834|[Single-Threaded-CPU](https://leetcode.com/problems/single-threaded-cpu/)||[c++](./src/1834-Single-Threaded-CPU/1834.cpp)||||||Medium|
|1832|[Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram/)||[c++](./src/1832-Check-if-the-Sentence-is-Pangram/1832.cpp)|[python](./src/1832-Check-if-the-Sentence-is-Pangram/1832.py)|||||Easy|
|1926|[Nearest Exit from Entrance in Maze](https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/)||[c++](./src/1926-Nearest-Exit-from-Entrance-in-Maze/1926.cpp)||||||Medium|
|1962|[Remove Stones to Minimize the Total](https://leetcode.com/problems/remove-stones-to-minimize-the-total/)||[c++](./src/1962-Remove-Stones-to-Minimize-the-Total/1962.cpp)||||||Medium|
|2011|[Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/)||[c++](./src/2011-Final-Value-of-Variable-After-Performing-Operations/2011.cpp)||||||Easy|
|2027|[Minimum Moves to Convert String](https://leetcode.com/problems/minimum-moves-to-convert-string/)||[c++](./src/2027-Minimum-Moves-to-Convert-String/2027.cpp)||||||Easy|
|2032|[Two Out of Three](https://leetcode.com/problems/two-out-of-three/)||[c++](./src/2032-Two-Out-of-Three/2032.cpp)||||||Easy|
|2037|[Minimum Number of Moves to Seat Everyone](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/)||[c++](./src/2037-Minimum-Number-of-Moves-to-Seat-Everyone/2037.cpp)||||||Easy|
|2042|[Check if Numbers Are Ascending in a Sentence](https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence/)||[c++](./src/2042-Check-if-Numbers-Are-Ascending-in-a-Sentence/2042.cpp)||||||Easy|
|2180|[Count Integers With Even Digit Sum](https://leetcode.com/problems/count-integers-with-even-digit-sum/)||[c++](./src/2180-Count-Integers-With-Even-Digit-Sum/2180.cpp)||||||Easy|
|2185|[Counting Words With a Given Prefix](https://leetcode.com/problems/counting-words-with-a-given-prefix/)||[c++](./src/2185-Counting-Words-With-a-Given-Prefix/2185.cpp)||||||Easy|
|2225|[Find Players With Zero or One Losses](https://leetcode.com/problems/find-players-with-zero-or-one-losses/)||[c++](./src/2225-Find-Players-With-Zero-or-One-Losses/2225.cpp)||||||Medium|
|2244|[Minimum Rounds to Complete All Tasks](https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/)||[c++](./src/2244-Minimum-Rounds-to-Complete-All-Tasks/2244.cpp)||||||Medium|
|2256|[Minimum Average Difference](https://leetcode.com/problems/minimum-average-difference/)||[c++](./src/2256-Minimum-Average-Difference/2256.cpp)||||||Medium|
|2279|[Maximum Bags With Full Capacity of Rocks](https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks/)||[c++](./src/2279-Maximum-Bags-With-Full-Capacity-of-Rocks/2279.cpp)||||||Medium|
|2287|[Rearrange Characters to Make Target String](https://leetcode.com/problems/rearrange-characters-to-make-target-string/)||[c++](./src/2287-Rearrange-Characters-to-Make-Target-String/2287.cpp)||||||Easy|
|2293|[Min Max Game](https://leetcode.com/problems/min-max-game/)||[c++](./src/2293-Min-Max-Game/2293.cpp)||||||Easy|
|2315|[Count Asterisks](https://leetcode.com/problems/count-asterisks/)||[c++](./src/2315-Count-Asterisks/2315.cpp)||||||Easy|
|2319|[Check if Matrix Is X-Matrix](https://leetcode.com/problems/check-if-matrix-is-x-matrix/)||[c++](./src/2319-Check-if-Matrix-Is-X-Matrix/2319.cpp)||||||Easy|
|2325|[Decode the Message](https://leetcode.com/problems/decode-the-message/)||[c++](./src/2325-Decode-the-Message/2325.cpp)||||||Easy|
|2331|[Evaluate Boolean Binary Tree](https://leetcode.com/problems/evaluate-boolean-binary-tree/)||[c++](./src/2331-Evaluate-Boolean-Binary-Tree/2331.cpp)||||||Easy|
|2341|[Maximum Number of Pairs in Array](https://leetcode.com/problems/maximum-number-of-pairs-in-array/)||[c++](./src/2341-Maximum-Number-of-Pairs-in-Array/2341.cpp)||||||Easy|
|2347|[Best Poker Hand](https://leetcode.com/problems/best-poker-hand/)||[c++](./src/2347-Best-Poker-Hand/2347.cpp)||||||Easy|
|2351|[First Letter to Appear Twice](https://leetcode.com/problems/first-letter-to-appear-twice/)||[c++](./src/2351-First-Letter-to-Appear-Twice/2351.cpp)||||||Easy|
|2357|[Make Array Zero by Subtracting Equal Amounts](https://leetcode.com/problems/first-letter-to-appear-twice/)||[c++](./src/2351-First-Letter-to-Appear-Twice/2351.cpp)||||||Easy|
|2389|[Longest Subsequence With Limited Sum](https://leetcode.com/problems/longest-subsequence-with-limited-sum/)||[c++](./src/2389-Longest-Subsequence-With-Limited-Sum/2389.cpp)||||||Easy|
|2395|[Find Subarrays With Equal Sum](https://leetcode.com/problems/find-subarrays-with-equal-sum/)||[c++](./src/2395-Find-Subarrays-With-Equal-Sum/2395.cpp)||||||Easy|
|2427|[Number of Common Factors](https://leetcode.com/problems/number-of-common-factors/)||[c++](./src/2427-Number-of-Common-Factors/2427.cpp)||||||Easy|
|2439|[Minimize Maximum of Array](https://leetcode.com/problems/minimize-maximum-of-array/)||[c++](./src/2439-Minimize-Maximum-of-Array/2439.cpp)||||||Medium|
|2469|[Convert the temperature](https://leetcode.com/problems/convert-the-temperature/)||[c++](./src/2469-Convert-the-Temperature/2469.cpp)||||||Easy|
|2470|[Number of Subarrays With LCM Equal to K](https://leetcode.com/problems/number-of-subarrays-with-lcm-equal-to-k/)||[c++](./src/2470-Number-of-Subarrays-With-LCM-Equal-to-K/2470.cpp)||||||Medium|
|2471|[Minimum Number of Operations to Sort a Binary Tree by Level](https://leetcode.com/problems/minimum-number-of-operations-to-sort-a-binary-tree-by-level/)||[c++](./src/2471-Minimum-Number-of-Operations-to-Sort-a-Binary-Tree-by-Level/2471.cpp)||||||Medium|
|2477|[Minimum Fuel Cost to Report to the Capital](https://leetcode.com/problems/minimum-number-of-operations-to-sort-a-binary-tree-by-level/)||[c++](./src/2477-Minimum-Number-of-Operations-to-Sort-a-Binary-Tree-by-Level/2477.cpp)||||||Medium|
|2549|[Count Distinct Numbers on Board](https://leetcode.com/problems/count-distinct-numbers-on-board/)||[c++](./src/2549-Count-Distinct-Numbers-on-Board/2549.cpp)||||||Easy|
|2550|[Count Collisions of Monkeys on a Polygon](https://leetcode.com/problems/count-collisions-of-monkeys-on-a-polygon/)||[c++](./src/2550-Count-Collisions-of-Monkeys-on-a-Polygon/2550.cpp)||||||Medium|
|2551|[Put Marbles in Bags](https://leetcode.com/problems/put-marbles-in-bags/)||[c++](./src/2551-Put-Marbles-in-Bags/2551.cpp)||||||Hard|