https://github.com/suvraneel/leetcode

Documenting my LeetCode journey one problem at a time. Feel free to use this repository's public template
https://github.com/suvraneel/leetcode

leetcode leetcode-cpp leethub

Last synced: about 1 year ago
JSON representation

Documenting my LeetCode journey one problem at a time. Feel free to use this repository's public template

• Host: GitHub
• URL: https://github.com/suvraneel/leetcode
• Owner: Suvraneel
• License: mit
• Created: 2021-12-18T12:25:44.000Z (over 4 years ago)
• Default Branch: main
• Last Pushed: 2025-04-16T20:35:08.000Z (about 1 year ago)
• Last Synced: 2025-04-17T07:49:10.070Z (about 1 year ago)
• Topics: leetcode, leetcode-cpp, leethub
• Language: Java
• Homepage: https://suvraneel.tech/LeetCode/
• Size: 2.09 MB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          

# [![LeetCode](https://img.shields.io/badge/-LeetCode-da8200?style=for-the-badge&logo=LeetCode&logoColor=ffa116&labelColor=black)](https://leetcode.com/Suvraneel/)

Documenting my LeetCode journey one problem at a time


### [leetcode.com/Suvraneel](https://leetcode.com/Suvraneel/)

---

| Leetcode Problem | Problem Statement | C++ Solution |

|---:|:-----|:----:|

| [1](https://leetcode.com/problems/two-sum/) | [Two Sum](./1-two-sum) | **[Solution](./1-two-sum/1-two-sum.cpp)**  

| [2](https://leetcode.com/problems/add-two-numbers/) | [Add Two Numbers](./2-add-two-numbers) | **[Solution](./2-add-two-numbers/2-add-two-numbers.cpp)**  

| [7](https://leetcode.com/problems/reverse-integer/) | [Reverse Integer](./0007-reverse-integer) | **[Solution](./0007-reverse-integer/0007-reverse-integer.cpp)**  

| [8](https://leetcode.com/problems/string-to-integer-atoi/) | [String to Integer Atoi](./8-string-to-integer-atoi) | **[Solution](./8-string-to-integer-atoi/8-string-to-integer-atoi.cpp)**  

| [9](https://leetcode.com/problems/palindrome-number/) | [Palindrome Number](./0009-palindrome-number) | **[Solution](./0009-palindrome-number/0009-palindrome-number.cpp)**  

| [11](https://leetcode.com/problems/container-with-most-water/) | [Container With most Water](./11-container-with-most-water) | **[Solution](./11-container-with-most-water/11-container-with-most-water.cpp)**  

| [12](https://leetcode.com/problems/integer-to-roman/) | [Integer to Roman](./0012-integer-to-roman) | **[Solution](./0012-integer-to-roman/0012-integer-to-roman.cpp)**  

| [13](https://leetcode.com/problems/roman-to-integer/) | [Roman to Integer](./13-roman-to-integer) | **[Solution](./13-roman-to-integer/13-roman-to-integer.cpp)**  

| [16](https://leetcode.com/problems/3sum-closest/) | [3sum Closest](./16-3sum-closest) | **[Solution](./16-3sum-closest/16-3sum-closest.cpp)**  

| [17](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | [Letter Combinations of a Phone Number](./0017-letter-combinations-of-a-phone-number) | **[Solution](./0017-letter-combinations-of-a-phone-number/0017-letter-combinations-of-a-phone-number.cpp)**  

| [19](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | [Remove Nth Node from End of List](./19-remove-nth-node-from-end-of-list) | **[Solution](./19-remove-nth-node-from-end-of-list/19-remove-nth-node-from-end-of-list.cpp)**  

| [21](https://leetcode.com/problems/merge-two-sorted-lists/) | [Merge Two Sorted Lists](./21-merge-two-sorted-lists) | **[Solution](./21-merge-two-sorted-lists/21-merge-two-sorted-lists.cpp)**  

| [23](https://leetcode.com/problems/merge-k-sorted-lists/) | [Merge K Sorted Lists](./23-merge-k-sorted-lists) | **[Solution](./23-merge-k-sorted-lists/23-merge-k-sorted-lists.cpp)**  

| [24](https://leetcode.com/problems/swap-nodes-in-pairs/) | [Swap Nodes in Pairs](./24-swap-nodes-in-pairs) | **[Solution](./24-swap-nodes-in-pairs/24-swap-nodes-in-pairs.cpp)**  

| [26](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | [Remove Duplicates from Sorted Array](./26-remove-duplicates-from-sorted-array) | **[Solution](./26-remove-duplicates-from-sorted-array/26-remove-duplicates-from-sorted-array.cpp)**  

| [28](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/) | [Find the Index of the First Occurrence in a String](./0028-find-the-index-of-the-first-occurrence-in-a-string) | **[Solution](./0028-find-the-index-of-the-first-occurrence-in-a-string/0028-find-the-index-of-the-first-occurrence-in-a-string.cpp)**  

| [30](https://leetcode.com/problems/substring-with-concatenation-of-all-words/) | [Substring With Concatenation of all Words](./30-substring-with-concatenation-of-all-words) | **[Solution](./30-substring-with-concatenation-of-all-words/30-substring-with-concatenation-of-all-words.cpp)**  

| [32](https://leetcode.com/problems/longest-valid-parentheses/) | [Longest Valid Parentheses](./32-longest-valid-parentheses) | **[Solution](./32-longest-valid-parentheses/32-longest-valid-parentheses.cpp)**  

| [33](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [Search in Rotated Sorted Array](./0033-search-in-rotated-sorted-array) | **[Solution](./0033-search-in-rotated-sorted-array/0033-search-in-rotated-sorted-array.cpp)**  

| [35](https://leetcode.com/problems/search-insert-position/) | [Search Insert Position](./0035-search-insert-position) | **[Solution](./0035-search-insert-position/0035-search-insert-position.cpp)**  

| [36](https://leetcode.com/problems/valid-sudoku/) | [Valid Sudoku](./0036-valid-sudoku) | **[Solution](./0036-valid-sudoku/0036-valid-sudoku.cpp)**  

| [38](https://leetcode.com/problems/count-and-say/) | [Count and Say](./0038-count-and-say) | **[Solution](./0038-count-and-say/0038-count-and-say.cpp)**  

| [39](https://leetcode.com/problems/combination-sum/) | [Combination Sum](./0039-combination-sum) | **[Solution](./0039-combination-sum/0039-combination-sum.cpp)**  

| [40](https://leetcode.com/problems/combination-sum-ii/) | [Combination Sum II](./0040-combination-sum-ii) | **[Solution](./0040-combination-sum-ii/0040-combination-sum-ii.cpp)**  

| [42](https://leetcode.com/problems/trapping-rain-water/) | [Trapping Rain Water](./42-trapping-rain-water) | **[Solution](./42-trapping-rain-water/42-trapping-rain-water.cpp)**  

| [48](https://leetcode.com/problems/rotate-image/) | [Rotate Image](./48-rotate-image) | **[Solution](./48-rotate-image/48-rotate-image.cpp)**  

| [49](https://leetcode.com/problems/group-anagrams/) | [Group Anagrams](./0049-group-anagrams) | **[Solution](./0049-group-anagrams/0049-group-anagrams.cpp)**  

| [53](https://leetcode.com/problems/maximum-subarray/) | [Maximum Subarray](./0053-maximum-subarray) | **[Solution](./0053-maximum-subarray/0053-maximum-subarray.cpp)**  

| [56](https://leetcode.com/problems/merge-intervals/) | [Merge Intervals](./56-merge-intervals) | **[Solution](./56-merge-intervals/56-merge-intervals.cpp)**  

| [62](https://leetcode.com/problems/unique-paths/) | [Unique Paths](./62-unique-paths) | **[Solution](./62-unique-paths/62-unique-paths.cpp)**  

| [67](https://leetcode.com/problems/add-binary/) | [Add Binary](./67-add-binary) | **[Solution](./67-add-binary/67-add-binary.cpp)**  

| [68](https://leetcode.com/problems/text-justification/) | [Text Justification](./0068-text-justification) | **[Solution](./0068-text-justification/0068-text-justification.cpp)**  

| [69](https://leetcode.com/problems/sqrtx/) | [Sqrtx](./69-sqrtx) | **[Solution](./69-sqrtx/69-sqrtx.cpp)**  

| [70](https://leetcode.com/problems/climbing-stairs/) | [Climbing Stairs](./0070-climbing-stairs) | **[Solution](./0070-climbing-stairs/0070-climbing-stairs.cpp)**  

| [72](https://leetcode.com/problems/edit-distance/) | [Edit Distance](./0072-edit-distance) | **[Solution](./0072-edit-distance/0072-edit-distance.cpp)**  

| [74](https://leetcode.com/problems/search-a-2d-matrix/) | [Search a 2d Matrix](./0074-search-a-2d-matrix) | **[Solution](./0074-search-a-2d-matrix/0074-search-a-2d-matrix.cpp)**  

| [75](https://leetcode.com/problems/sort-colors/) | [Sort Colors](./75-sort-colors) | **[Solution](./75-sort-colors/75-sort-colors.cpp)**  

| [76](https://leetcode.com/problems/minimum-window-substring/) | [Minimum Window Substring](./76-minimum-window-substring) | **[Solution](./76-minimum-window-substring/76-minimum-window-substring.cpp)**  

| [77](https://leetcode.com/problems/combinations/) | [Combinations](./0077-combinations) | **[Solution](./0077-combinations/0077-combinations.cpp)**  

| [78](https://leetcode.com/problems/subsets/) | [Subsets](./78-subsets) | **[Solution](./78-subsets/78-subsets.cpp)**  

| [79](https://leetcode.com/problems/word-search/) | [Word Search](./0079-word-search) | **[Solution](./0079-word-search/0079-word-search.cpp)**  

| [80](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) | [Remove Duplicates from Sorted Array II](./80-remove-duplicates-from-sorted-array-ii) | **[Solution](./80-remove-duplicates-from-sorted-array-ii/80-remove-duplicates-from-sorted-array-ii.cpp)**  

| [84](https://leetcode.com/problems/largest-rectangle-in-histogram/) | [Largest Rectangle in Histogram](./84-largest-rectangle-in-histogram) | **[Solution](./84-largest-rectangle-in-histogram/84-largest-rectangle-in-histogram.cpp)**  

| [88](https://leetcode.com/problems/merge-sorted-array/) | [Merge Sorted Array](./0088-merge-sorted-array) | **[Solution](./0088-merge-sorted-array/0088-merge-sorted-array.cpp)**  

| [91](https://leetcode.com/problems/decode-ways/) | [Decode Ways](./91-decode-ways) | **[Solution](./91-decode-ways/91-decode-ways.cpp)**  

| [94](https://leetcode.com/problems/binary-tree-inorder-traversal/) | [Binary Tree Inorder Traversal](./94-binary-tree-inorder-traversal) | **[Solution](./94-binary-tree-inorder-traversal/94-binary-tree-inorder-traversal.cpp)**  

| [95](https://leetcode.com/problems/unique-binary-search-trees-ii/) | [Unique Binary Search Trees II](./0095-unique-binary-search-trees-ii) | **[Solution](./0095-unique-binary-search-trees-ii/0095-unique-binary-search-trees-ii.cpp)**  

| [97](https://leetcode.com/problems/interleaving-string/) | [Interleaving String](./0097-interleaving-string) | **[Solution](./0097-interleaving-string/0097-interleaving-string.cpp)**  

| [98](https://leetcode.com/problems/validate-binary-search-tree/) | [Validate Binary Search Tree](./98-validate-binary-search-tree) | **[Solution](./98-validate-binary-search-tree/98-validate-binary-search-tree.cpp)**  

| [99](https://leetcode.com/problems/recover-binary-search-tree/) | [Recover Binary Search Tree](./99-recover-binary-search-tree) | **[Solution](./99-recover-binary-search-tree/99-recover-binary-search-tree.cpp)**  

| [100](https://leetcode.com/problems/same-tree/) | [Same Tree](./0100-same-tree) | **[Solution](./0100-same-tree/0100-same-tree.cpp)**  

| [103](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/) | [Binary Tree Zigzag Level Order Traversal](./0103-binary-tree-zigzag-level-order-traversal) | **[Solution](./0103-binary-tree-zigzag-level-order-traversal/0103-binary-tree-zigzag-level-order-traversal.cpp)**  

| [104](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | [Maximum Depth of Binary Tree](./104-maximum-depth-of-binary-tree) | **[Solution](./104-maximum-depth-of-binary-tree/104-maximum-depth-of-binary-tree.cpp)**  

| [108](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) | [Convert Sorted Array to Binary Search Tree](./108-convert-sorted-array-to-binary-search-tree) | **[Solution](./108-convert-sorted-array-to-binary-search-tree/108-convert-sorted-array-to-binary-search-tree.cpp)**  

| [109](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/) | [Convert Sorted List to Binary Search Tree](./0109-convert-sorted-list-to-binary-search-tree) | **[Solution](./0109-convert-sorted-list-to-binary-search-tree/0109-convert-sorted-list-to-binary-search-tree.cpp)**  

| [111](https://leetcode.com/problems/minimum-depth-of-binary-tree/) | [Minimum Depth of Binary Tree](./0111-minimum-depth-of-binary-tree) | **[Solution](./0111-minimum-depth-of-binary-tree/0111-minimum-depth-of-binary-tree.cpp)**  

| [112](https://leetcode.com/problems/path-sum/) | [Path Sum](./112-path-sum) | **[Solution](./112-path-sum/112-path-sum.cpp)**  

| [113](https://leetcode.com/problems/path-sum-ii/) | [Path Sum II](./113-path-sum-ii) | **[Solution](./113-path-sum-ii/113-path-sum-ii.cpp)**  

| [116](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) | [Populating Next Right Pointers in each Node](./116-populating-next-right-pointers-in-each-node) | **[Solution](./116-populating-next-right-pointers-in-each-node/116-populating-next-right-pointers-in-each-node.cpp)**  

| [118](https://leetcode.com/problems/pascals-triangle/) | [Pascals Triangle](./0118-pascals-triangle) | **[Solution](./0118-pascals-triangle/0118-pascals-triangle.cpp)**  

| [119](https://leetcode.com/problems/pascals-triangle-ii/) | [Pascals Triangle II](./0119-pascals-triangle-ii) | **[Solution](./0119-pascals-triangle-ii/0119-pascals-triangle-ii.cpp)**  

| [121](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [Best Time to Buy and Sell Stock](./121-best-time-to-buy-and-sell-stock) | **[Solution](./121-best-time-to-buy-and-sell-stock/121-best-time-to-buy-and-sell-stock.cpp)**  

| [125](https://leetcode.com/problems/valid-palindrome/) | [Valid Palindrome](./125-valid-palindrome) | **[Solution](./125-valid-palindrome/125-valid-palindrome.cpp)**  

| [126](https://leetcode.com/problems/word-ladder-ii/) | [Word Ladder II](./126-word-ladder-ii) | **[Solution](./126-word-ladder-ii/126-word-ladder-ii.cpp)**  

| [131](https://leetcode.com/problems/palindrome-partitioning/) | [Palindrome Partitioning](./131-palindrome-partitioning) | **[Solution](./131-palindrome-partitioning/131-palindrome-partitioning.cpp)**  

| [134](https://leetcode.com/problems/gas-station/) | [Gas Station](./134-gas-station) | **[Solution](./134-gas-station/134-gas-station.cpp)**  

| [136](https://leetcode.com/problems/single-number/) | [Single Number](./136-single-number) | **[Solution](./136-single-number/136-single-number.cpp)**  

| [137](https://leetcode.com/problems/single-number-ii/) | [Single Number II](./0137-single-number-ii) | **[Solution](./0137-single-number-ii/0137-single-number-ii.cpp)**  

| [139](https://leetcode.com/problems/word-break/) | [Word Break](./0139-word-break) | **[Solution](./0139-word-break/0139-word-break.cpp)**  

| [141](https://leetcode.com/problems/linked-list-cycle/) | [Linked List Cycle](./141-linked-list-cycle) | **[Solution](./141-linked-list-cycle/141-linked-list-cycle.cpp)**  

| [142](https://leetcode.com/problems/linked-list-cycle-ii/) | [Linked List Cycle II](./142-linked-list-cycle-ii) | **[Solution](./142-linked-list-cycle-ii/142-linked-list-cycle-ii.cpp)**  

| [143](https://leetcode.com/problems/reorder-list/) | [Reorder List](./143-reorder-list) | **[Solution](./143-reorder-list/143-reorder-list.cpp)**  

| [144](https://leetcode.com/problems/binary-tree-preorder-traversal/) | [Binary Tree Preorder Traversal](./0144-binary-tree-preorder-traversal) | **[Solution](./0144-binary-tree-preorder-traversal/0144-binary-tree-preorder-traversal.cpp)**  

| [145](https://leetcode.com/problems/binary-tree-postorder-traversal/) | [Binary Tree Postorder Traversal](./0145-binary-tree-postorder-traversal) | **[Solution](./0145-binary-tree-postorder-traversal/0145-binary-tree-postorder-traversal.cpp)**  

| [147](https://leetcode.com/problems/insertion-sort-list/) | [Insertion Sort List](./147-insertion-sort-list) | **[Solution](./147-insertion-sort-list/147-insertion-sort-list.cpp)**  

| [149](https://leetcode.com/problems/max-points-on-a-line/) | [Max Points on a Line](./0149-max-points-on-a-line) | **[Solution](./0149-max-points-on-a-line/0149-max-points-on-a-line.cpp)**  

| [150](https://leetcode.com/problems/evaluate-reverse-polish-notation/) | [Evaluate Reverse Polish Notation](./0150-evaluate-reverse-polish-notation) | **[Solution](./0150-evaluate-reverse-polish-notation/0150-evaluate-reverse-polish-notation.cpp)**  

| [151](https://leetcode.com/problems/reverse-words-in-a-string/) | [Reverse Words in a String](./0151-reverse-words-in-a-string) | **[Solution](./0151-reverse-words-in-a-string/0151-reverse-words-in-a-string.cpp)**  

| [160](https://leetcode.com/problems/intersection-of-two-linked-lists/) | [Intersection of Two Linked Lists](./160-intersection-of-two-linked-lists) | **[Solution](./160-intersection-of-two-linked-lists/160-intersection-of-two-linked-lists.cpp)**  

| [173](https://leetcode.com/problems/binary-search-tree-iterator/) | [Binary Search Tree Iterator](./173-binary-search-tree-iterator) | **[Solution](./173-binary-search-tree-iterator/173-binary-search-tree-iterator.cpp)**  

| [175](https://leetcode.com/problems/combine-two-tables/) | [Combine Two Tables](./0175-combine-two-tables) | **[Solution](./0175-combine-two-tables/0175-combine-two-tables.cpp)**  

| [179](https://leetcode.com/problems/largest-number/) | [Largest Number](./0179-largest-number) | **[Solution](./0179-largest-number/0179-largest-number.cpp)**  

| [188](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/) | [Best Time to Buy and Sell Stock IV](./188-best-time-to-buy-and-sell-stock-iv) | **[Solution](./188-best-time-to-buy-and-sell-stock-iv/188-best-time-to-buy-and-sell-stock-iv.cpp)**  

| [189](https://leetcode.com/problems/rotate-array/) | [Rotate Array](./189-rotate-array) | **[Solution](./189-rotate-array/189-rotate-array.cpp)**  

| [198](https://leetcode.com/problems/house-robber/) | [House Robber](./0198-house-robber) | **[Solution](./0198-house-robber/0198-house-robber.cpp)**  

| [200](https://leetcode.com/problems/number-of-islands/) | [Number of Islands](./200-number-of-islands) | **[Solution](./200-number-of-islands/200-number-of-islands.cpp)**  

| [203](https://leetcode.com/problems/remove-linked-list-elements/) | [Remove Linked List Elements](./203-remove-linked-list-elements) | **[Solution](./203-remove-linked-list-elements/203-remove-linked-list-elements.cpp)**  

| [209](https://leetcode.com/problems/minimum-size-subarray-sum/) | [Minimum Size Subarray Sum](./0209-minimum-size-subarray-sum) | **[Solution](./0209-minimum-size-subarray-sum/0209-minimum-size-subarray-sum.cpp)**  

| [210](https://leetcode.com/problems/course-schedule-ii/) | [Course Schedule II](./210-course-schedule-ii) | **[Solution](./210-course-schedule-ii/210-course-schedule-ii.cpp)**  

| [212](https://leetcode.com/problems/word-search-ii/) | [Word Search II](./0212-word-search-ii) | **[Solution](./0212-word-search-ii/0212-word-search-ii.cpp)**  

| [214](https://leetcode.com/problems/shortest-palindrome/) | [Shortest Palindrome](./0214-shortest-palindrome) | **[Solution](./0214-shortest-palindrome/0214-shortest-palindrome.cpp)**  

| [218](https://leetcode.com/problems/the-skyline-problem/) | [The Skyline Problem](./218-the-skyline-problem) | **[Solution](./218-the-skyline-problem/218-the-skyline-problem.cpp)**  

| [219](https://leetcode.com/problems/contains-duplicate-ii/) | [Contains Duplicate II](./219-contains-duplicate-ii) | **[Solution](./219-contains-duplicate-ii/219-contains-duplicate-ii.cpp)**  

| [221](https://leetcode.com/problems/maximal-square/) | [Maximal Square](./221-maximal-square) | **[Solution](./221-maximal-square/221-maximal-square.cpp)**  

| [222](https://leetcode.com/problems/count-complete-tree-nodes/) | [Count Complete Tree Nodes](./0222-count-complete-tree-nodes) | **[Solution](./0222-count-complete-tree-nodes/0222-count-complete-tree-nodes.cpp)**  

| [223](https://leetcode.com/problems/rectangle-area/) | [Rectangle Area](./0223-rectangle-area) | **[Solution](./0223-rectangle-area/0223-rectangle-area.cpp)**  

| [224](https://leetcode.com/problems/basic-calculator/) | [Basic Calculator](./0224-basic-calculator) | **[Solution](./0224-basic-calculator/0224-basic-calculator.cpp)**  

| [226](https://leetcode.com/problems/invert-binary-tree/) | [Invert Binary Tree](./0226-invert-binary-tree) | **[Solution](./0226-invert-binary-tree/0226-invert-binary-tree.cpp)**  

| [227](https://leetcode.com/problems/basic-calculator-ii/) | [Basic Calculator II](./227-basic-calculator-ii) | **[Solution](./227-basic-calculator-ii/227-basic-calculator-ii.cpp)**  

| [230](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) | [Kth Smallest Element in a Bst](./230-kth-smallest-element-in-a-bst) | **[Solution](./230-kth-smallest-element-in-a-bst/230-kth-smallest-element-in-a-bst.cpp)**  

| [234](https://leetcode.com/problems/palindrome-linked-list/) | [Palindrome Linked List](./234-palindrome-linked-list) | **[Solution](./234-palindrome-linked-list/234-palindrome-linked-list.cpp)**  

| [235](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | [Lowest Common Ancestor of a Binary Search Tree](./235-lowest-common-ancestor-of-a-binary-search-tree) | **[Solution](./235-lowest-common-ancestor-of-a-binary-search-tree/235-lowest-common-ancestor-of-a-binary-search-tree.cpp)**  

| [236](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | [Lowest Common Ancestor of a Binary Tree](./236-lowest-common-ancestor-of-a-binary-tree) | **[Solution](./236-lowest-common-ancestor-of-a-binary-tree/236-lowest-common-ancestor-of-a-binary-tree.cpp)**  

| [237](https://leetcode.com/problems/delete-node-in-a-linked-list/) | [Delete Node in a Linked List](./237-delete-node-in-a-linked-list) | **[Solution](./237-delete-node-in-a-linked-list/237-delete-node-in-a-linked-list.cpp)**  

| [238](https://leetcode.com/problems/product-of-array-except-self/) | [Product of Array Except Self](./0238-product-of-array-except-self) | **[Solution](./0238-product-of-array-except-self/0238-product-of-array-except-self.cpp)**  

| [239](https://leetcode.com/problems/sliding-window-maximum/) | [Sliding Window Maximum](./239-sliding-window-maximum) | **[Solution](./239-sliding-window-maximum/239-sliding-window-maximum.cpp)**  

| [241](https://leetcode.com/problems/different-ways-to-add-parentheses/) | [Different Ways to Add Parentheses](./0241-different-ways-to-add-parentheses) | **[Solution](./0241-different-ways-to-add-parentheses/0241-different-ways-to-add-parentheses.cpp)**  

| [242](https://leetcode.com/problems/valid-anagram/) | [Valid Anagram](./242-valid-anagram) | **[Solution](./242-valid-anagram/242-valid-anagram.cpp)**  

| [258](https://leetcode.com/problems/add-digits/) | [Add Digits](./258-add-digits) | **[Solution](./258-add-digits/258-add-digits.cpp)**  

| [260](https://leetcode.com/problems/single-number-iii/) | [Single Number III](./0260-single-number-iii) | **[Solution](./0260-single-number-iii/0260-single-number-iii.cpp)**  

| [263](https://leetcode.com/problems/ugly-number/) | [Ugly Number](./0263-ugly-number) | **[Solution](./0263-ugly-number/0263-ugly-number.cpp)**  

| [264](https://leetcode.com/problems/ugly-number-ii/) | [Ugly Number II](./0264-ugly-number-ii) | **[Solution](./0264-ugly-number-ii/0264-ugly-number-ii.cpp)**  

| [273](https://leetcode.com/problems/integer-to-english-words/) | [Integer to English Words](./0273-integer-to-english-words) | **[Solution](./0273-integer-to-english-words/0273-integer-to-english-words.cpp)**  

| [278](https://leetcode.com/problems/first-bad-version/) | [First Bad Version](./278-first-bad-version) | **[Solution](./278-first-bad-version/278-first-bad-version.cpp)**  

| [279](https://leetcode.com/problems/perfect-squares/) | [Perfect Squares](./0279-perfect-squares) | **[Solution](./0279-perfect-squares/0279-perfect-squares.cpp)**  

| [283](https://leetcode.com/problems/move-zeroes/) | [Move Zeroes](./0283-move-zeroes) | **[Solution](./0283-move-zeroes/0283-move-zeroes.cpp)**  

| [287](https://leetcode.com/problems/find-the-duplicate-number/) | [Find the Duplicate Number](./0287-find-the-duplicate-number) | **[Solution](./0287-find-the-duplicate-number/0287-find-the-duplicate-number.cpp)**  

| [290](https://leetcode.com/problems/word-pattern/) | [Word Pattern](./290-word-pattern) | **[Solution](./290-word-pattern/290-word-pattern.cpp)**  

| [295](https://leetcode.com/problems/find-median-from-data-stream/) | [Find Median from Data Stream](./0295-find-median-from-data-stream) | **[Solution](./0295-find-median-from-data-stream/0295-find-median-from-data-stream.cpp)**  

| [300](https://leetcode.com/problems/longest-increasing-subsequence/) | [Longest Increasing Subsequence](./300-longest-increasing-subsequence) | **[Solution](./300-longest-increasing-subsequence/300-longest-increasing-subsequence.cpp)**  

| [307](https://leetcode.com/problems/range-sum-query-mutable/) | [Range Sum Query Mutable](./307-range-sum-query-mutable) | **[Solution](./307-range-sum-query-mutable/307-range-sum-query-mutable.cpp)**  

| [309](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/) | [Best Time to Buy and Sell Stock With Cooldown](./0309-best-time-to-buy-and-sell-stock-with-cooldown) | **[Solution](./0309-best-time-to-buy-and-sell-stock-with-cooldown/0309-best-time-to-buy-and-sell-stock-with-cooldown.cpp)**  

| [310](https://leetcode.com/problems/minimum-height-trees/) | [Minimum Height Trees](./310-minimum-height-trees) | **[Solution](./310-minimum-height-trees/310-minimum-height-trees.cpp)**  

| [312](https://leetcode.com/problems/burst-balloons/) | [Burst Balloons](./312-burst-balloons) | **[Solution](./312-burst-balloons/312-burst-balloons.cpp)**  

| [319](https://leetcode.com/problems/bulb-switcher/) | [Bulb Switcher](./0319-bulb-switcher) | **[Solution](./0319-bulb-switcher/0319-bulb-switcher.cpp)**  

| [326](https://leetcode.com/problems/power-of-three/) | [Power of Three](./326-power-of-three) | **[Solution](./326-power-of-three/326-power-of-three.cpp)**  

| [329](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/) | [Longest Increasing Path in a Matrix](./0329-longest-increasing-path-in-a-matrix) | **[Solution](./0329-longest-increasing-path-in-a-matrix/0329-longest-increasing-path-in-a-matrix.cpp)**  

| [330](https://leetcode.com/problems/patching-array/) | [Patching Array](./0330-patching-array) | **[Solution](./0330-patching-array/0330-patching-array.cpp)**  

| [334](https://leetcode.com/problems/increasing-triplet-subsequence/) | [Increasing Triplet Subsequence](./0334-increasing-triplet-subsequence) | **[Solution](./0334-increasing-triplet-subsequence/0334-increasing-triplet-subsequence.cpp)**  

| [336](https://leetcode.com/problems/palindrome-pairs/) | [Palindrome Pairs](./336-palindrome-pairs) | **[Solution](./336-palindrome-pairs/336-palindrome-pairs.cpp)**  

| [338](https://leetcode.com/problems/counting-bits/) | [Counting Bits](./0338-counting-bits) | **[Solution](./0338-counting-bits/0338-counting-bits.cpp)**  

| [342](https://leetcode.com/problems/power-of-four/) | [Power of Four](./342-power-of-four) | **[Solution](./342-power-of-four/342-power-of-four.cpp)**  

| [344](https://leetcode.com/problems/reverse-string/) | [Reverse String](./344-reverse-string) | **[Solution](./344-reverse-string/344-reverse-string.cpp)**  

| [345](https://leetcode.com/problems/reverse-vowels-of-a-string/) | [Reverse Vowels of a String](./0345-reverse-vowels-of-a-string) | **[Solution](./0345-reverse-vowels-of-a-string/0345-reverse-vowels-of-a-string.cpp)**  

| [349](https://leetcode.com/problems/intersection-of-two-arrays/) | [Intersection of Two Arrays](./0349-intersection-of-two-arrays) | **[Solution](./0349-intersection-of-two-arrays/0349-intersection-of-two-arrays.cpp)**  

| [350](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | [Intersection of Two Arrays II](./0350-intersection-of-two-arrays-ii) | **[Solution](./0350-intersection-of-two-arrays-ii/0350-intersection-of-two-arrays-ii.cpp)**  

| [363](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/) | [Max Sum of Rectangle no Larger than K](./363-max-sum-of-rectangle-no-larger-than-k) | **[Solution](./363-max-sum-of-rectangle-no-larger-than-k/363-max-sum-of-rectangle-no-larger-than-k.cpp)**  

| [368](https://leetcode.com/problems/largest-divisible-subset/) | [Largest Divisible Subset](./0368-largest-divisible-subset) | **[Solution](./0368-largest-divisible-subset/0368-largest-divisible-subset.cpp)**  

| [373](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/) | [Find K Pairs With Smallest Sums](./0373-find-k-pairs-with-smallest-sums) | **[Solution](./0373-find-k-pairs-with-smallest-sums/0373-find-k-pairs-with-smallest-sums.cpp)**  

| [374](https://leetcode.com/problems/guess-number-higher-or-lower/) | [Guess Number Higher or Lower](./0374-guess-number-higher-or-lower) | **[Solution](./0374-guess-number-higher-or-lower/0374-guess-number-higher-or-lower.cpp)**  

| [377](https://leetcode.com/problems/combination-sum-iv/) | [Combination Sum IV](./377-combination-sum-iv) | **[Solution](./377-combination-sum-iv/377-combination-sum-iv.cpp)**  

| [378](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/) | [Kth Smallest Element in a Sorted Matrix](./378-kth-smallest-element-in-a-sorted-matrix) | **[Solution](./378-kth-smallest-element-in-a-sorted-matrix/378-kth-smallest-element-in-a-sorted-matrix.cpp)**  

| [380](https://leetcode.com/problems/insert-delete-getrandom-o1/) | [Insert Delete Getrandom O1](./0380-insert-delete-getrandom-o1) | **[Solution](./0380-insert-delete-getrandom-o1/0380-insert-delete-getrandom-o1.cpp)**  

| [382](https://leetcode.com/problems/linked-list-random-node/) | [Linked List Random Node](./382-linked-list-random-node) | **[Solution](./382-linked-list-random-node/382-linked-list-random-node.cpp)**  

| [383](https://leetcode.com/problems/ransom-note/) | [Ransom Note](./383-ransom-note) | **[Solution](./383-ransom-note/383-ransom-note.cpp)**  

| [386](https://leetcode.com/problems/lexicographical-numbers/) | [Lexicographical Numbers](./0386-lexicographical-numbers) | **[Solution](./0386-lexicographical-numbers/0386-lexicographical-numbers.cpp)**  

| [387](https://leetcode.com/problems/first-unique-character-in-a-string/) | [First Unique Character in a String](./387-first-unique-character-in-a-string) | **[Solution](./387-first-unique-character-in-a-string/387-first-unique-character-in-a-string.cpp)**  

| [389](https://leetcode.com/problems/find-the-difference/) | [Find the Difference](./389-find-the-difference) | **[Solution](./389-find-the-difference/389-find-the-difference.cpp)**  

| [392](https://leetcode.com/problems/is-subsequence/) | [IS Subsequence](./0392-is-subsequence) | **[Solution](./0392-is-subsequence/0392-is-subsequence.cpp)**  

| [393](https://leetcode.com/problems/utf-8-validation/) | [Utf 8 Validation](./393-utf-8-validation) | **[Solution](./393-utf-8-validation/393-utf-8-validation.cpp)**  

| [394](https://leetcode.com/problems/decode-string/) | [Decode String](./394-decode-string) | **[Solution](./394-decode-string/394-decode-string.cpp)**  

| [399](https://leetcode.com/problems/evaluate-division/) | [Evaluate Division](./0399-evaluate-division) | **[Solution](./0399-evaluate-division/0399-evaluate-division.cpp)**  

| [402](https://leetcode.com/problems/remove-k-digits/) | [Remove K Digits](./402-remove-k-digits) | **[Solution](./402-remove-k-digits/402-remove-k-digits.cpp)**  

| [409](https://leetcode.com/problems/longest-palindrome/) | [Longest Palindrome](./0409-longest-palindrome) | **[Solution](./0409-longest-palindrome/0409-longest-palindrome.cpp)**  

| [416](https://leetcode.com/problems/partition-equal-subset-sum/) | [Partition Equal Subset Sum](./0416-partition-equal-subset-sum) | **[Solution](./0416-partition-equal-subset-sum/0416-partition-equal-subset-sum.cpp)**  

| [427](https://leetcode.com/problems/construct-quad-tree/) | [Construct Quad Tree](./0427-construct-quad-tree) | **[Solution](./0427-construct-quad-tree/0427-construct-quad-tree.cpp)**  

| [429](https://leetcode.com/problems/n-ary-tree-level-order-traversal/) | [N Ary Tree Level Order Traversal](./429-n-ary-tree-level-order-traversal) | **[Solution](./429-n-ary-tree-level-order-traversal/429-n-ary-tree-level-order-traversal.cpp)**  

| [432](https://leetcode.com/problems/all-oone-data-structure/) | [All Oone Data Structure](./0432-all-oone-data-structure) | **[Solution](./0432-all-oone-data-structure/0432-all-oone-data-structure.cpp)**  

| [433](https://leetcode.com/problems/minimum-genetic-mutation/) | [Minimum Genetic Mutation](./0433-minimum-genetic-mutation) | **[Solution](./0433-minimum-genetic-mutation/0433-minimum-genetic-mutation.cpp)**  

| [438](https://leetcode.com/problems/find-all-anagrams-in-a-string/) | [Find all Anagrams in a String](./438-find-all-anagrams-in-a-string) | **[Solution](./438-find-all-anagrams-in-a-string/438-find-all-anagrams-in-a-string.cpp)**  

| [440](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/) | [K Th Smallest in Lexicographical Order](./0440-k-th-smallest-in-lexicographical-order) | **[Solution](./0440-k-th-smallest-in-lexicographical-order/0440-k-th-smallest-in-lexicographical-order.cpp)**  

| [441](https://leetcode.com/problems/arranging-coins/) | [Arranging Coins](./0441-arranging-coins) | **[Solution](./0441-arranging-coins/0441-arranging-coins.cpp)**  

| [443](https://leetcode.com/problems/string-compression/) | [String Compression](./0443-string-compression) | **[Solution](./0443-string-compression/0443-string-compression.cpp)**  

| [446](https://leetcode.com/problems/arithmetic-slices-ii-subsequence/) | [Arithmetic Slices II Subsequence](./0446-arithmetic-slices-ii-subsequence) | **[Solution](./0446-arithmetic-slices-ii-subsequence/0446-arithmetic-slices-ii-subsequence.cpp)**  

| [451](https://leetcode.com/problems/sort-characters-by-frequency/) | [Sort Characters by Frequency](./0451-sort-characters-by-frequency) | **[Solution](./0451-sort-characters-by-frequency/0451-sort-characters-by-frequency.cpp)**  

| [452](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/) | [Minimum Number of Arrows to Burst Balloons](./452-minimum-number-of-arrows-to-burst-balloons) | **[Solution](./452-minimum-number-of-arrows-to-burst-balloons/452-minimum-number-of-arrows-to-burst-balloons.cpp)**  

| [458](https://leetcode.com/problems/poor-pigs/) | [Poor Pigs](./458-poor-pigs) | **[Solution](./458-poor-pigs/458-poor-pigs.cpp)**  

| [472](https://leetcode.com/problems/concatenated-words/) | [Concatenated Words](./0472-concatenated-words) | **[Solution](./0472-concatenated-words/0472-concatenated-words.cpp)**  

| [476](https://leetcode.com/problems/number-complement/) | [Number Complement](./476-number-complement) | **[Solution](./476-number-complement/476-number-complement.cpp)**  

| [485](https://leetcode.com/problems/max-consecutive-ones/) | [Max Consecutive Ones](./0485-max-consecutive-ones) | **[Solution](./0485-max-consecutive-ones/0485-max-consecutive-ones.cpp)**  

| [486](https://leetcode.com/problems/predict-the-winner/) | [Predict the Winner](./0486-predict-the-winner) | **[Solution](./0486-predict-the-winner/0486-predict-the-winner.cpp)**  

| [494](https://leetcode.com/problems/target-sum/) | [Target Sum](./0494-target-sum) | **[Solution](./0494-target-sum/0494-target-sum.cpp)**  

| [502](https://leetcode.com/problems/ipo/) | [IPO](./0502-ipo) | **[Solution](./0502-ipo/0502-ipo.cpp)**  

| [509](https://leetcode.com/problems/fibonacci-number/) | [Fibonacci Number](./0509-fibonacci-number) | **[Solution](./0509-fibonacci-number/0509-fibonacci-number.cpp)**  

| [515](https://leetcode.com/problems/find-largest-value-in-each-tree-row/) | [Find Largest Value in each Tree Row](./0515-find-largest-value-in-each-tree-row) | **[Solution](./0515-find-largest-value-in-each-tree-row/0515-find-largest-value-in-each-tree-row.cpp)**  

| [518](https://leetcode.com/problems/coin-change-ii/) | [Coin Change II](./0518-coin-change-ii) | **[Solution](./0518-coin-change-ii/0518-coin-change-ii.cpp)**  

| [520](https://leetcode.com/problems/detect-capital/) | [Detect Capital](./520-detect-capital) | **[Solution](./520-detect-capital/520-detect-capital.cpp)**  

| [523](https://leetcode.com/problems/continuous-subarray-sum/) | [Continuous Subarray Sum](./0523-continuous-subarray-sum) | **[Solution](./0523-continuous-subarray-sum/0523-continuous-subarray-sum.cpp)**  

| [525](https://leetcode.com/problems/contiguous-array/) | [Contiguous Array](./525-contiguous-array) | **[Solution](./525-contiguous-array/525-contiguous-array.cpp)**  

| [532](https://leetcode.com/problems/k-diff-pairs-in-an-array/) | [K Diff Pairs in an Array](./532-k-diff-pairs-in-an-array) | **[Solution](./532-k-diff-pairs-in-an-array/532-k-diff-pairs-in-an-array.cpp)**  

| [535](https://leetcode.com/problems/encode-and-decode-tinyurl/) | [Encode and Decode Tinyurl](./535-encode-and-decode-tinyurl) | **[Solution](./535-encode-and-decode-tinyurl/535-encode-and-decode-tinyurl.cpp)**  

| [539](https://leetcode.com/problems/minimum-time-difference/) | [Minimum Time Difference](./0539-minimum-time-difference) | **[Solution](./0539-minimum-time-difference/0539-minimum-time-difference.cpp)**  

| [540](https://leetcode.com/problems/single-element-in-a-sorted-array/) | [Single Element in a Sorted Array](./0540-single-element-in-a-sorted-array) | **[Solution](./0540-single-element-in-a-sorted-array/0540-single-element-in-a-sorted-array.cpp)**  

| [547](https://leetcode.com/problems/number-of-provinces/) | [Number of Provinces](./0547-number-of-provinces) | **[Solution](./0547-number-of-provinces/0547-number-of-provinces.cpp)**  

| [557](https://leetcode.com/problems/reverse-words-in-a-string-iii/) | [Reverse Words in a String III](./557-reverse-words-in-a-string-iii) | **[Solution](./557-reverse-words-in-a-string-iii/557-reverse-words-in-a-string-iii.cpp)**  

| [560](https://leetcode.com/problems/subarray-sum-equals-k/) | [Subarray Sum Equals K](./560-subarray-sum-equals-k) | **[Solution](./560-subarray-sum-equals-k/560-subarray-sum-equals-k.cpp)**  

| [564](https://leetcode.com/problems/find-the-closest-palindrome/) | [Find the Closest Palindrome](./0564-find-the-closest-palindrome) | **[Solution](./0564-find-the-closest-palindrome/0564-find-the-closest-palindrome.cpp)**  

| [567](https://leetcode.com/problems/permutation-in-string/) | [Permutation in String](./0567-permutation-in-string) | **[Solution](./0567-permutation-in-string/0567-permutation-in-string.cpp)**  

| [587](https://leetcode.com/problems/erect-the-fence/) | [Erect the Fence](./0587-erect-the-fence) | **[Solution](./0587-erect-the-fence/0587-erect-the-fence.cpp)**  

| [590](https://leetcode.com/problems/n-ary-tree-postorder-traversal/) | [N Ary Tree Postorder Traversal](./0590-n-ary-tree-postorder-traversal) | **[Solution](./0590-n-ary-tree-postorder-traversal/0590-n-ary-tree-postorder-traversal.cpp)**  

| [592](https://leetcode.com/problems/fraction-addition-and-subtraction/) | [Fraction Addition and Subtraction](./0592-fraction-addition-and-subtraction) | **[Solution](./0592-fraction-addition-and-subtraction/0592-fraction-addition-and-subtraction.cpp)**  

| [605](https://leetcode.com/problems/can-place-flowers/) | [Can Place Flowers](./605-can-place-flowers) | **[Solution](./605-can-place-flowers/605-can-place-flowers.cpp)**  

| [606](https://leetcode.com/problems/construct-string-from-binary-tree/) | [Construct String from Binary Tree](./606-construct-string-from-binary-tree) | **[Solution](./606-construct-string-from-binary-tree/606-construct-string-from-binary-tree.cpp)**  

| [609](https://leetcode.com/problems/find-duplicate-file-in-system/) | [Find Duplicate File in System](./609-find-duplicate-file-in-system) | **[Solution](./609-find-duplicate-file-in-system/609-find-duplicate-file-in-system.cpp)**  

| [622](https://leetcode.com/problems/design-circular-queue/) | [Design Circular Queue](./622-design-circular-queue) | **[Solution](./622-design-circular-queue/622-design-circular-queue.cpp)**  

| [623](https://leetcode.com/problems/add-one-row-to-tree/) | [Add One Row to Tree](./623-add-one-row-to-tree) | **[Solution](./623-add-one-row-to-tree/623-add-one-row-to-tree.cpp)**  

| [624](https://leetcode.com/problems/maximum-distance-in-arrays/) | [Maximum Distance in Arrays](./0624-maximum-distance-in-arrays) | **[Solution](./0624-maximum-distance-in-arrays/0624-maximum-distance-in-arrays.cpp)**  

| [632](https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/) | [Smallest Range Covering Elements from K Lists](./0632-smallest-range-covering-elements-from-k-lists) | **[Solution](./0632-smallest-range-covering-elements-from-k-lists/0632-smallest-range-covering-elements-from-k-lists.cpp)**  

| [633](https://leetcode.com/problems/sum-of-square-numbers/) | [Sum of Square Numbers](./0633-sum-of-square-numbers) | **[Solution](./0633-sum-of-square-numbers/0633-sum-of-square-numbers.cpp)**  

| [637](https://leetcode.com/problems/average-of-levels-in-binary-tree/) | [Average of Levels in Binary Tree](./637-average-of-levels-in-binary-tree) | **[Solution](./637-average-of-levels-in-binary-tree/637-average-of-levels-in-binary-tree.cpp)**  

| [641](https://leetcode.com/problems/design-circular-deque/) | [Design Circular Deque](./0641-design-circular-deque) | **[Solution](./0641-design-circular-deque/0641-design-circular-deque.cpp)**  

| [643](https://leetcode.com/problems/maximum-average-subarray-i/) | [Maximum Average Subarray I](./643-maximum-average-subarray-i) | **[Solution](./643-maximum-average-subarray-i/643-maximum-average-subarray-i.cpp)**  

| [645](https://leetcode.com/problems/set-mismatch/) | [Set Mismatch](./0645-set-mismatch) | **[Solution](./0645-set-mismatch/0645-set-mismatch.cpp)**  

| [648](https://leetcode.com/problems/replace-words/) | [Replace Words](./0648-replace-words) | **[Solution](./0648-replace-words/0648-replace-words.cpp)**  

| [650](https://leetcode.com/problems/2-keys-keyboard/) | [2 Keys Keyboard](./0650-2-keys-keyboard) | **[Solution](./0650-2-keys-keyboard/0650-2-keys-keyboard.cpp)**  

| [652](https://leetcode.com/problems/find-duplicate-subtrees/) | [Find Duplicate Subtrees](./0652-find-duplicate-subtrees) | **[Solution](./0652-find-duplicate-subtrees/0652-find-duplicate-subtrees.cpp)**  

| [653](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/) | [Two Sum IV Input IS a Bst](./653-two-sum-iv-input-is-a-bst) | **[Solution](./653-two-sum-iv-input-is-a-bst/653-two-sum-iv-input-is-a-bst.cpp)**  

| [658](https://leetcode.com/problems/find-k-closest-elements/) | [Find K Closest Elements](./658-find-k-closest-elements) | **[Solution](./658-find-k-closest-elements/658-find-k-closest-elements.cpp)**  

| [659](https://leetcode.com/problems/split-array-into-consecutive-subsequences/) | [Split Array Into Consecutive Subsequences](./659-split-array-into-consecutive-subsequences) | **[Solution](./659-split-array-into-consecutive-subsequences/659-split-array-into-consecutive-subsequences.cpp)**  

| [664](https://leetcode.com/problems/strange-printer/) | [Strange Printer](./0664-strange-printer) | **[Solution](./0664-strange-printer/0664-strange-printer.cpp)**  

| [670](https://leetcode.com/problems/maximum-swap/) | [Maximum Swap](./0670-maximum-swap) | **[Solution](./0670-maximum-swap/0670-maximum-swap.cpp)**  

| [684](https://leetcode.com/problems/redundant-connection/) | [Redundant Connection](./0684-redundant-connection) | **[Solution](./0684-redundant-connection/0684-redundant-connection.cpp)**  

| [689](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays/) | [Maximum Sum of 3 Non Overlapping Subarrays](./0689-maximum-sum-of-3-non-overlapping-subarrays) | **[Solution](./0689-maximum-sum-of-3-non-overlapping-subarrays/0689-maximum-sum-of-3-non-overlapping-subarrays.cpp)**  

| [692](https://leetcode.com/problems/top-k-frequent-words/) | [Top K Frequent Words](./0692-top-k-frequent-words) | **[Solution](./0692-top-k-frequent-words/0692-top-k-frequent-words.cpp)**  

| [701](https://leetcode.com/problems/insert-into-a-binary-search-tree/) | [Insert Into a Binary Search Tree](./701-insert-into-a-binary-search-tree) | **[Solution](./701-insert-into-a-binary-search-tree/701-insert-into-a-binary-search-tree.cpp)**  

| [703](https://leetcode.com/problems/kth-largest-element-in-a-stream/) | [Kth Largest Element in a Stream](./0703-kth-largest-element-in-a-stream) | **[Solution](./0703-kth-largest-element-in-a-stream/0703-kth-largest-element-in-a-stream.cpp)**  

| [704](https://leetcode.com/problems/binary-search/) | [Binary Search](./0704-binary-search) | **[Solution](./0704-binary-search/0704-binary-search.cpp)**  

| [705](https://leetcode.com/problems/design-hashset/) | [Design Hashset](./705-design-hashset) | **[Solution](./705-design-hashset/705-design-hashset.cpp)**  

| [712](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/) | [Minimum Ascii Delete Sum for Two Strings](./0712-minimum-ascii-delete-sum-for-two-strings) | **[Solution](./0712-minimum-ascii-delete-sum-for-two-strings/0712-minimum-ascii-delete-sum-for-two-strings.cpp)**  

| [718](https://leetcode.com/problems/maximum-length-of-repeated-subarray/) | [Maximum Length of Repeated Subarray](./718-maximum-length-of-repeated-subarray) | **[Solution](./718-maximum-length-of-repeated-subarray/718-maximum-length-of-repeated-subarray.cpp)**  

| [719](https://leetcode.com/problems/find-k-th-smallest-pair-distance/) | [Find K Th Smallest Pair Distance](./0719-find-k-th-smallest-pair-distance) | **[Solution](./0719-find-k-th-smallest-pair-distance/0719-find-k-th-smallest-pair-distance.cpp)**  

| [725](https://leetcode.com/problems/split-linked-list-in-parts/) | [Split Linked List in Parts](./0725-split-linked-list-in-parts) | **[Solution](./0725-split-linked-list-in-parts/0725-split-linked-list-in-parts.cpp)**  

| [726](https://leetcode.com/problems/number-of-atoms/) | [Number of Atoms](./0726-number-of-atoms) | **[Solution](./0726-number-of-atoms/0726-number-of-atoms.cpp)**  

| [729](https://leetcode.com/problems/my-calendar-i/) | [My Calendar I](./0729-my-calendar-i) | **[Solution](./0729-my-calendar-i/0729-my-calendar-i.cpp)**  

| [731](https://leetcode.com/problems/my-calendar-ii/) | [My Calendar II](./0731-my-calendar-ii) | **[Solution](./0731-my-calendar-ii/0731-my-calendar-ii.cpp)**  

| [732](https://leetcode.com/problems/my-calendar-iii/) | [My Calendar III](./732-my-calendar-iii) | **[Solution](./732-my-calendar-iii/732-my-calendar-iii.cpp)**  

| [739](https://leetcode.com/problems/daily-temperatures/) | [Daily Temperatures](./0739-daily-temperatures) | **[Solution](./0739-daily-temperatures/0739-daily-temperatures.cpp)**  

| [743](https://leetcode.com/problems/network-delay-time/) | [Network Delay Time](./0743-network-delay-time) | **[Solution](./0743-network-delay-time/0743-network-delay-time.cpp)**  

| [763](https://leetcode.com/problems/partition-labels/) | [Partition Labels](./763-partition-labels) | **[Solution](./763-partition-labels/763-partition-labels.cpp)**  

| [766](https://leetcode.com/problems/toeplitz-matrix/) | [Toeplitz Matrix](./0766-toeplitz-matrix) | **[Solution](./0766-toeplitz-matrix/0766-toeplitz-matrix.cpp)**  

| [769](https://leetcode.com/problems/max-chunks-to-make-sorted/) | [Max Chunks to Make Sorted](./0769-max-chunks-to-make-sorted) | **[Solution](./0769-max-chunks-to-make-sorted/0769-max-chunks-to-make-sorted.cpp)**  

| [771](https://leetcode.com/problems/jewels-and-stones/) | [Jewels and Stones](./771-jewels-and-stones) | **[Solution](./771-jewels-and-stones/771-jewels-and-stones.cpp)**  

| [773](https://leetcode.com/problems/sliding-puzzle/) | [Sliding Puzzle](./0773-sliding-puzzle) | **[Solution](./0773-sliding-puzzle/0773-sliding-puzzle.cpp)**  

| [781](https://leetcode.com/problems/rabbits-in-forest/) | [Rabbits in Forest](./0781-rabbits-in-forest) | **[Solution](./0781-rabbits-in-forest/0781-rabbits-in-forest.cpp)**  

| [783](https://leetcode.com/problems/minimum-distance-between-bst-nodes/) | [Minimum Distance Between Bst Nodes](./0783-minimum-distance-between-bst-nodes) | **[Solution](./0783-minimum-distance-between-bst-nodes/0783-minimum-distance-between-bst-nodes.cpp)**  

| [787](https://leetcode.com/problems/cheapest-flights-within-k-stops/) | [Cheapest Flights Within K Stops](./0787-cheapest-flights-within-k-stops) | **[Solution](./0787-cheapest-flights-within-k-stops/0787-cheapest-flights-within-k-stops.cpp)**  

| [790](https://leetcode.com/problems/domino-and-tromino-tiling/) | [Domino and Tromino Tiling](./0790-domino-and-tromino-tiling) | **[Solution](./0790-domino-and-tromino-tiling/0790-domino-and-tromino-tiling.cpp)**  

| [796](https://leetcode.com/problems/rotate-string/) | [Rotate String](./0796-rotate-string) | **[Solution](./0796-rotate-string/0796-rotate-string.cpp)**  

| [797](https://leetcode.com/problems/all-paths-from-source-to-target/) | [All Paths from Source to Target](./0797-all-paths-from-source-to-target) | **[Solution](./0797-all-paths-from-source-to-target/0797-all-paths-from-source-to-target.cpp)**  

| [802](https://leetcode.com/problems/k-th-smallest-prime-fraction/) | [K Th Smallest Prime Fraction](./0802-k-th-smallest-prime-fraction) | **[Solution](./0802-k-th-smallest-prime-fraction/0802-k-th-smallest-prime-fraction.cpp)**  

| [804](https://leetcode.com/problems/unique-morse-code-words/) | [Unique Morse Code Words](./804-unique-morse-code-words) | **[Solution](./804-unique-morse-code-words/804-unique-morse-code-words.cpp)**  

| [814](https://leetcode.com/problems/binary-tree-pruning/) | [Binary Tree Pruning](./814-binary-tree-pruning) | **[Solution](./814-binary-tree-pruning/814-binary-tree-pruning.cpp)**  

| [826](https://leetcode.com/problems/most-profit-assigning-work/) | [Most Profit Assigning Work](./0826-most-profit-assigning-work) | **[Solution](./0826-most-profit-assigning-work/0826-most-profit-assigning-work.cpp)**  

| [827](https://leetcode.com/problems/making-a-large-island/) | [Making a Large Island](./0827-making-a-large-island) | **[Solution](./0827-making-a-large-island/0827-making-a-large-island.cpp)**  

| [834](https://leetcode.com/problems/sum-of-distances-in-tree/) | [Sum of Distances in Tree](./0834-sum-of-distances-in-tree) | **[Solution](./0834-sum-of-distances-in-tree/0834-sum-of-distances-in-tree.cpp)**  

| [835](https://leetcode.com/problems/image-overlap/) | [Image Overlap](./0835-image-overlap) | **[Solution](./0835-image-overlap/0835-image-overlap.cpp)**  

| [838](https://leetcode.com/problems/push-dominoes/) | [Push Dominoes](./838-push-dominoes) | **[Solution](./838-push-dominoes/838-push-dominoes.cpp)**  

| [840](https://leetcode.com/problems/magic-squares-in-grid/) | [Magic Squares in Grid](./0840-magic-squares-in-grid) | **[Solution](./0840-magic-squares-in-grid/0840-magic-squares-in-grid.cpp)**  

| [841](https://leetcode.com/problems/keys-and-rooms/) | [Keys and Rooms](./841-keys-and-rooms) | **[Solution](./841-keys-and-rooms/841-keys-and-rooms.cpp)**  

| [846](https://leetcode.com/problems/hand-of-straights/) | [Hand of Straights](./0846-hand-of-straights) | **[Solution](./0846-hand-of-straights/0846-hand-of-straights.cpp)**  

| [851](https://leetcode.com/problems/loud-and-rich/) | [Loud and Rich](./0851-loud-and-rich) | **[Solution](./0851-loud-and-rich/0851-loud-and-rich.cpp)**  

| [858](https://leetcode.com/problems/mirror-reflection/) | [Mirror Reflection](./858-mirror-reflection) | **[Solution](./858-mirror-reflection/858-mirror-reflection.cpp)**  

| [860](https://leetcode.com/problems/lemonade-change/) | [Lemonade Change](./0860-lemonade-change) | **[Solution](./0860-lemonade-change/0860-lemonade-change.cpp)**  

| [862](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/) | [Shortest Subarray With Sum at Least K](./0862-shortest-subarray-with-sum-at-least-k) | **[Solution](./0862-shortest-subarray-with-sum-at-least-k/0862-shortest-subarray-with-sum-at-least-k.cpp)**  

| [869](https://leetcode.com/problems/reordered-power-of-2/) | [Reordered Power of 2](./869-reordered-power-of-2) | **[Solution](./869-reordered-power-of-2/869-reordered-power-of-2.cpp)**  

| [871](https://leetcode.com/problems/minimum-number-of-refueling-stops/) | [Minimum Number of Refueling Stops](./871-minimum-number-of-refueling-stops) | **[Solution](./871-minimum-number-of-refueling-stops/871-minimum-number-of-refueling-stops.cpp)**  

| [873](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence/) | [Length of Longest Fibonacci Subsequence](./0873-length-of-longest-fibonacci-subsequence) | **[Solution](./0873-length-of-longest-fibonacci-subsequence/0873-length-of-longest-fibonacci-subsequence.cpp)**  

| [874](https://leetcode.com/problems/walking-robot-simulation/) | [Walking Robot Simulation](./0874-walking-robot-simulation) | **[Solution](./0874-walking-robot-simulation/0874-walking-robot-simulation.cpp)**  

| [875](https://leetcode.com/problems/koko-eating-bananas/) | [Koko Eating Bananas](./875-koko-eating-bananas) | **[Solution](./875-koko-eating-bananas/875-koko-eating-bananas.cpp)**  

| [876](https://leetcode.com/problems/middle-of-the-linked-list/) | [Middle of the Linked List](./876-middle-of-the-linked-list) | **[Solution](./876-middle-of-the-linked-list/876-middle-of-the-linked-list.cpp)**  

| [879](https://leetcode.com/problems/profitable-schemes/) | [Profitable Schemes](./0879-profitable-schemes) | **[Solution](./0879-profitable-schemes/0879-profitable-schemes.cpp)**  

| [884](https://leetcode.com/problems/uncommon-words-from-two-sentences/) | [Uncommon Words from Two Sentences](./0884-uncommon-words-from-two-sentences) | **[Solution](./0884-uncommon-words-from-two-sentences/0884-uncommon-words-from-two-sentences.cpp)**  

| [885](https://leetcode.com/problems/spiral-matrix-iii/) | [Spiral Matrix III](./0885-spiral-matrix-iii) | **[Solution](./0885-spiral-matrix-iii/0885-spiral-matrix-iii.cpp)**  

| [886](https://leetcode.com/problems/possible-bipartition/) | [Possible Bipartition](./0886-possible-bipartition) | **[Solution](./0886-possible-bipartition/0886-possible-bipartition.cpp)**  

| [890](https://leetcode.com/problems/find-and-replace-pattern/) | [Find and Replace Pattern](./890-find-and-replace-pattern) | **[Solution](./890-find-and-replace-pattern/890-find-and-replace-pattern.cpp)**  

| [893](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/) | [All Nodes Distance K in Binary Tree](./0893-all-nodes-distance-k-in-binary-tree) | **[Solution](./0893-all-nodes-distance-k-in-binary-tree/0893-all-nodes-distance-k-in-binary-tree.cpp)**  

| [895](https://leetcode.com/problems/maximum-frequency-stack/) | [Maximum Frequency Stack](./0895-maximum-frequency-stack) | **[Solution](./0895-maximum-frequency-stack/0895-maximum-frequency-stack.cpp)**  

| [897](https://leetcode.com/problems/increasing-order-search-tree/) | [Increasing Order Search Tree](./897-increasing-order-search-tree) | **[Solution](./897-increasing-order-search-tree/897-increasing-order-search-tree.cpp)**  

| [899](https://leetcode.com/problems/orderly-queue/) | [Orderly Queue](./0899-orderly-queue) | **[Solution](./0899-orderly-queue/0899-orderly-queue.cpp)**  

| [901](https://leetcode.com/problems/online-stock-span/) | [Online Stock Span](./0901-online-stock-span) | **[Solution](./0901-online-stock-span/0901-online-stock-span.cpp)**  

| [902](https://leetcode.com/problems/numbers-at-most-n-given-digit-set/) | [Numbers at most N Given Digit Set](./902-numbers-at-most-n-given-digit-set) | **[Solution](./902-numbers-at-most-n-given-digit-set/902-numbers-at-most-n-given-digit-set.cpp)**  

| [904](https://leetcode.com/problems/fruit-into-baskets/) | [Fruit Into Baskets](./904-fruit-into-baskets) | **[Solution](./904-fruit-into-baskets/904-fruit-into-baskets.cpp)**  

| [907](https://leetcode.com/problems/sum-of-subarray-minimums/) | [Sum of Subarray Minimums](./0907-sum-of-subarray-minimums) | **[Solution](./0907-sum-of-subarray-minimums/0907-sum-of-subarray-minimums.cpp)**  

| [908](https://leetcode.com/problems/middle-of-the-linked-list/) | [Middle of the Linked List](./0908-middle-of-the-linked-list) | **[Solution](./0908-middle-of-the-linked-list/0908-middle-of-the-linked-list.cpp)**  

| [909](https://leetcode.com/problems/snakes-and-ladders/) | [Snakes and Ladders](./0909-snakes-and-ladders) | **[Solution](./0909-snakes-and-ladders/0909-snakes-and-ladders.cpp)**  

| [912](https://leetcode.com/problems/sort-an-array/) | [Sort an Array](./0912-sort-an-array) | **[Solution](./0912-sort-an-array/0912-sort-an-array.cpp)**  

| [916](https://leetcode.com/problems/word-subsets/) | [Word Subsets](./916-word-subsets) | **[Solution](./916-word-subsets/916-word-subsets.cpp)**  

| [918](https://leetcode.com/problems/maximum-sum-circular-subarray/) | [Maximum Sum Circular Subarray](./0918-maximum-sum-circular-subarray) | **[Solution](./0918-maximum-sum-circular-subarray/0918-maximum-sum-circular-subarray.cpp)**  

| [921](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/) | [Minimum Add to Make Parentheses Valid](./0921-minimum-add-to-make-parentheses-valid) | **[Solution](./0921-minimum-add-to-make-parentheses-valid/0921-minimum-add-to-make-parentheses-valid.cpp)**  

| [922](https://leetcode.com/problems/sort-array-by-parity-ii/) | [Sort Array by Parity II](./922-sort-array-by-parity-ii) | **[Solution](./922-sort-array-by-parity-ii/922-sort-array-by-parity-ii.cpp)**  

| [936](https://leetcode.com/problems/stamping-the-sequence/) | [Stamping the Sequence](./936-stamping-the-sequence) | **[Solution](./936-stamping-the-sequence/936-stamping-the-sequence.cpp)**  

| [941](https://leetcode.com/problems/valid-mountain-array/) | [Valid Mountain Array](./941-valid-mountain-array) | **[Solution](./941-valid-mountain-array/941-valid-mountain-array.cpp)**  

| [944](https://leetcode.com/problems/delete-columns-to-make-sorted/) | [Delete Columns to Make Sorted](./0944-delete-columns-to-make-sorted) | **[Solution](./0944-delete-columns-to-make-sorted/0944-delete-columns-to-make-sorted.cpp)**  

| [945](https://leetcode.com/problems/minimum-increment-to-make-array-unique/) | [Minimum Increment to Make Array Unique](./0945-minimum-increment-to-make-array-unique) | **[Solution](./0945-minimum-increment-to-make-array-unique/0945-minimum-increment-to-make-array-unique.cpp)**  

| [947](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/) | [Most Stones Removed With same Row or Column](./0947-most-stones-removed-with-same-row-or-column) | **[Solution](./0947-most-stones-removed-with-same-row-or-column/0947-most-stones-removed-with-same-row-or-column.cpp)**  

| [948](https://leetcode.com/problems/bag-of-tokens/) | [Bag of Tokens](./948-bag-of-tokens) | **[Solution](./948-bag-of-tokens/948-bag-of-tokens.cpp)**  

| [951](https://leetcode.com/problems/flip-equivalent-binary-trees/) | [Flip Equivalent Binary Trees](./0951-flip-equivalent-binary-trees) | **[Solution](./0951-flip-equivalent-binary-trees/0951-flip-equivalent-binary-trees.cpp)**  

| [956](https://leetcode.com/problems/number-of-music-playlists/) | [Number of Music Playlists](./0956-number-of-music-playlists) | **[Solution](./0956-number-of-music-playlists/0956-number-of-music-playlists.cpp)**  

| [958](https://leetcode.com/problems/sort-array-by-parity-ii/) | [Sort Array by Parity II](./0958-sort-array-by-parity-ii) | **[Solution](./0958-sort-array-by-parity-ii/0958-sort-array-by-parity-ii.cpp)**  

| [959](https://leetcode.com/problems/regions-cut-by-slashes/) | [Regions Cut by Slashes](./0959-regions-cut-by-slashes) | **[Solution](./0959-regions-cut-by-slashes/0959-regions-cut-by-slashes.cpp)**  

| [962](https://leetcode.com/problems/maximum-width-ramp/) | [Maximum Width Ramp](./0962-maximum-width-ramp) | **[Solution](./0962-maximum-width-ramp/0962-maximum-width-ramp.cpp)**  

| [967](https://leetcode.com/problems/numbers-with-same-consecutive-differences/) | [Numbers With same Consecutive Differences](./967-numbers-with-same-consecutive-differences) | **[Solution](./967-numbers-with-same-consecutive-differences/967-numbers-with-same-consecutive-differences.cpp)**  

| [973](https://leetcode.com/problems/k-closest-points-to-origin/) | [K Closest Points to Origin](./973-k-closest-points-to-origin) | **[Solution](./973-k-closest-points-to-origin/973-k-closest-points-to-origin.cpp)**  

| [974](https://leetcode.com/problems/subarray-sums-divisible-by-k/) | [Subarray Sums Divisible by K](./0974-subarray-sums-divisible-by-k) | **[Solution](./0974-subarray-sums-divisible-by-k/0974-subarray-sums-divisible-by-k.cpp)**  

| [976](https://leetcode.com/problems/largest-perimeter-triangle/) | [Largest Perimeter Triangle](./0976-largest-perimeter-triangle) | **[Solution](./0976-largest-perimeter-triangle/0976-largest-perimeter-triangle.cpp)**  

| [980](https://leetcode.com/problems/unique-paths-iii/) | [Unique Paths III](./0980-unique-paths-iii) | **[Solution](./0980-unique-paths-iii/0980-unique-paths-iii.cpp)**  

| [981](https://leetcode.com/problems/time-based-key-value-store/) | [Time Based Key Value Store](./981-time-based-key-value-store) | **[Solution](./981-time-based-key-value-store/981-time-based-key-value-store.cpp)**  

| [983](https://leetcode.com/problems/minimum-cost-for-tickets/) | [Minimum Cost for Tickets](./0983-minimum-cost-for-tickets) | **[Solution](./0983-minimum-cost-for-tickets/0983-minimum-cost-for-tickets.cpp)**  

| [985](https://leetcode.com/problems/sum-of-even-numbers-after-queries/) | [Sum of Even Numbers After Queries](./985-sum-of-even-numbers-after-queries) | **[Solution](./985-sum-of-even-numbers-after-queries/985-sum-of-even-numbers-after-queries.cpp)**  

| [987](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/) | [Vertical Order Traversal of a Binary Tree](./987-vertical-order-traversal-of-a-binary-tree) | **[Solution](./987-vertical-order-traversal-of-a-binary-tree/987-vertical-order-traversal-of-a-binary-tree.cpp)**  

| [989](https://leetcode.com/problems/add-to-array-form-of-integer/) | [Add to Array Form of Integer](./0989-add-to-array-form-of-integer) | **[Solution](./0989-add-to-array-form-of-integer/0989-add-to-array-form-of-integer.cpp)**  

| [990](https://leetcode.com/problems/satisfiability-of-equality-equations/) | [Satisfiability of Equality Equations](./990-satisfiability-of-equality-equations) | **[Solution](./990-satisfiability-of-equality-equations/990-satisfiability-of-equality-equations.cpp)**  

| [994](https://leetcode.com/problems/rotting-oranges/) | [Rotting Oranges](./0994-rotting-oranges) | **[Solution](./0994-rotting-oranges/0994-rotting-oranges.cpp)**  

| [995](https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/) | [Minimum Number of K Consecutive Bit Flips](./0995-minimum-number-of-k-consecutive-bit-flips) | **[Solution](./0995-minimum-number-of-k-consecutive-bit-flips/0995-minimum-number-of-k-consecutive-bit-flips.cpp)**  

| [997](https://leetcode.com/problems/find-the-town-judge/) | [Find the Town Judge](./997-find-the-town-judge) | **[Solution](./997-find-the-town-judge/997-find-the-town-judge.cpp)**  

| [1002](https://leetcode.com/problems/find-common-characters/) | [Find Common Characters](./1002-find-common-characters) | **[Solution](./1002-find-common-characters/1002-find-common-characters.cpp)**  

| [1004](https://leetcode.com/problems/max-consecutive-ones-iii/) | [Max Consecutive Ones III](./1004-max-consecutive-ones-iii) | **[Solution](./1004-max-consecutive-ones-iii/1004-max-consecutive-ones-iii.cpp)**  

| [1009](https://leetcode.com/problems/complement-of-base-10-integer/) | [Complement of Base 10 Integer](./1009-complement-of-base-10-integer) | **[Solution](./1009-complement-of-base-10-integer/1009-complement-of-base-10-integer.cpp)**  

| [1010](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/) | [Pairs of Songs With Total Durations Divisible by 60](./1010-pairs-of-songs-with-total-durations-divisible-by-60) | **[Solution](./1010-pairs-of-songs-with-total-durations-divisible-by-60/1010-pairs-of-songs-with-total-durations-divisible-by-60.cpp)**  

| [1011](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/) | [Capacity to Ship Packages Within D Days](./1011-capacity-to-ship-packages-within-d-days) | **[Solution](./1011-capacity-to-ship-packages-within-d-days/1011-capacity-to-ship-packages-within-d-days.cpp)**  

| [1014](https://leetcode.com/problems/best-sightseeing-pair/) | [Best Sightseeing Pair](./1014-best-sightseeing-pair) | **[Solution](./1014-best-sightseeing-pair/1014-best-sightseeing-pair.cpp)**  

| [1015](https://leetcode.com/problems/smallest-integer-divisible-by-k/) | [Smallest Integer Divisible by K](./1015-smallest-integer-divisible-by-k) | **[Solution](./1015-smallest-integer-divisible-by-k/1015-smallest-integer-divisible-by-k.cpp)**  

| [1022](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/) | [Sum of Root to Leaf Binary Numbers](./1022-sum-of-root-to-leaf-binary-numbers) | **[Solution](./1022-sum-of-root-to-leaf-binary-numbers/1022-sum-of-root-to-leaf-binary-numbers.cpp)**  

| [1026](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/) | [Maximum Difference Between Node and Ancestor](./1026-maximum-difference-between-node-and-ancestor) | **[Solution](./1026-maximum-difference-between-node-and-ancestor/1026-maximum-difference-between-node-and-ancestor.cpp)**  

| [1028](https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/) | [Recover a Tree from Preorder Traversal](./1028-recover-a-tree-from-preorder-traversal) | **[Solution](./1028-recover-a-tree-from-preorder-traversal/1028-recover-a-tree-from-preorder-traversal.cpp)**  

| [1038](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/) | [Binary Search Tree to Greater Sum Tree](./1038-binary-search-tree-to-greater-sum-tree) | **[Solution](./1038-binary-search-tree-to-greater-sum-tree/1038-binary-search-tree-to-greater-sum-tree.cpp)**  

| [1041](https://leetcode.com/problems/robot-bounded-in-circle/) | [Robot Bounded in Circle](./1041-robot-bounded-in-circle) | **[Solution](./1041-robot-bounded-in-circle/1041-robot-bounded-in-circle.cpp)**  

| [1047](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/) | [Remove all Adjacent Duplicates in String](./1047-remove-all-adjacent-duplicates-in-string) | **[Solution](./1047-remove-all-adjacent-duplicates-in-string/1047-remove-all-adjacent-duplicates-in-string.cpp)**  

| [1051](https://leetcode.com/problems/height-checker/) | [Height Checker](./1051-height-checker) | **[Solution](./1051-height-checker/1051-height-checker.cpp)**  

| [1052](https://leetcode.com/problems/grumpy-bookstore-owner/) | [Grumpy Bookstore Owner](./1052-grumpy-bookstore-owner) | **[Solution](./1052-grumpy-bookstore-owner/1052-grumpy-bookstore-owner.cpp)**  

| [1071](https://leetcode.com/problems/greatest-common-divisor-of-strings/) | [Greatest Common Divisor of Strings](./1071-greatest-common-divisor-of-strings) | **[Solution](./1071-greatest-common-divisor-of-strings/1071-greatest-common-divisor-of-strings.cpp)**  

| [1072](https://leetcode.com/problems/flip-columns-for-maximum-number-of-equal-rows/) | [Flip Columns for Maximum Number of Equal Rows](./1072-flip-columns-for-maximum-number-of-equal-rows) | **[Solution](./1072-flip-columns-for-maximum-number-of-equal-rows/1072-flip-columns-for-maximum-number-of-equal-rows.cpp)**  

| [1079](https://leetcode.com/problems/letter-tile-possibilities/) | [Letter Tile Possibilities](./1079-letter-tile-possibilities) | **[Solution](./1079-letter-tile-possibilities/1079-letter-tile-possibilities.cpp)**  

| [1092](https://leetcode.com/problems/shortest-common-supersequence/) | [Shortest Common Supersequence](./1092-shortest-common-supersequence) | **[Solution](./1092-shortest-common-supersequence/1092-shortest-common-supersequence.cpp)**  

| [1094](https://leetcode.com/problems/car-pooling/) | [Car Pooling](./1094-car-pooling) | **[Solution](./1094-car-pooling/1094-car-pooling.cpp)**  

| [1105](https://leetcode.com/problems/filling-bookcase-shelves/) | [Filling Bookcase Shelves](./1105-filling-bookcase-shelves) | **[Solution](./1105-filling-bookcase-shelves/1105-filling-bookcase-shelves.cpp)**  

| [1106](https://leetcode.com/problems/parsing-a-boolean-expression/) | [Parsing a Boolean Expression](./1106-parsing-a-boolean-expression) | **[Solution](./1106-parsing-a-boolean-expression/1106-parsing-a-boolean-expression.cpp)**  

| [1110](https://leetcode.com/problems/delete-nodes-and-return-forest/) | [Delete Nodes and Return Forest](./1110-delete-nodes-and-return-forest) | **[Solution](./1110-delete-nodes-and-return-forest/1110-delete-nodes-and-return-forest.cpp)**  

| [1123](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/) | [Lowest Common Ancestor of Deepest Leaves](./1123-lowest-common-ancestor-of-deepest-leaves) | **[Solution](./1123-lowest-common-ancestor-of-deepest-leaves/1123-lowest-common-ancestor-of-deepest-leaves.cpp)**  

| [1129](https://leetcode.com/problems/shortest-path-with-alternating-colors/) | [Shortest Path With Alternating Colors](./1129-shortest-path-with-alternating-colors) | **[Solution](./1129-shortest-path-with-alternating-colors/1129-shortest-path-with-alternating-colors.cpp)**  

| [1137](https://leetcode.com/problems/n-th-tribonacci-number/) | [N Th Tribonacci Number](./1137-n-th-tribonacci-number) | **[Solution](./1137-n-th-tribonacci-number/1137-n-th-tribonacci-number.cpp)**  

| [1140](https://leetcode.com/problems/stone-game-ii/) | [Stone Game II](./1140-stone-game-ii) | **[Solution](./1140-stone-game-ii/1140-stone-game-ii.cpp)**  

| [1155](https://leetcode.com/problems/number-of-dice-rolls-with-target-sum/) | [Number of Dice Rolls With Target Sum](./1155-number-of-dice-rolls-with-target-sum) | **[Solution](./1155-number-of-dice-rolls-with-target-sum/1155-number-of-dice-rolls-with-target-sum.cpp)**  

| [1162](https://leetcode.com/problems/as-far-from-land-as-possible/) | [As Far from Land As Possible](./1162-as-far-from-land-as-possible) | **[Solution](./1162-as-far-from-land-as-possible/1162-as-far-from-land-as-possible.cpp)**  

| [1190](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/) | [Reverse Substrings Between each Pair of Parentheses](./1190-reverse-substrings-between-each-pair-of-parentheses) | **[Solution](./1190-reverse-substrings-between-each-pair-of-parentheses/1190-reverse-substrings-between-each-pair-of-parentheses.cpp)**  

| [1200](https://leetcode.com/problems/minimum-absolute-difference/) | [Minimum Absolute Difference](./1200-minimum-absolute-difference) | **[Solution](./1200-minimum-absolute-difference/1200-minimum-absolute-difference.cpp)**  

| [1202](https://leetcode.com/problems/smallest-string-with-swaps/) | [Smallest String With Swaps](./1202-smallest-string-with-swaps) | **[Solution](./1202-smallest-string-with-swaps/1202-smallest-string-with-swaps.cpp)**  

| [1207](https://leetcode.com/problems/unique-number-of-occurrences/) | [Unique Number of Occurrences](./1207-unique-number-of-occurrences) | **[Solution](./1207-unique-number-of-occurrences/1207-unique-number-of-occurrences.cpp)**  

| [1208](https://leetcode.com/problems/get-equal-substrings-within-budget/) | [Get Equal Substrings Within Budget](./1208-get-equal-substrings-within-budget) | **[Solution](./1208-get-equal-substrings-within-budget/1208-get-equal-substrings-within-budget.cpp)**  

| [1233](https://leetcode.com/problems/remove-sub-folders-from-the-filesystem/) | [Remove Sub Folders from the Filesystem](./1233-remove-sub-folders-from-the-filesystem) | **[Solution](./1233-remove-sub-folders-from-the-filesystem/1233-remove-sub-folders-from-the-filesystem.cpp)**  

| [1235](https://leetcode.com/problems/maximum-profit-in-job-scheduling/) | [Maximum Profit in Job Scheduling](./1235-maximum-profit-in-job-scheduling) | **[Solution](./1235-maximum-profit-in-job-scheduling/1235-maximum-profit-in-job-scheduling.cpp)**  

| [1239](https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters/) | [Maximum Length of a Concatenated String With Unique Characters](./1239-maximum-length-of-a-concatenated-string-with-unique-characters) | **[Solution](./1239-maximum-length-of-a-concatenated-string-with-unique-characters/1239-maximum-length-of-a-concatenated-string-with-unique-characters.cpp)**  

| [1248](https://leetcode.com/problems/count-number-of-nice-subarrays/) | [Count Number of Nice Subarrays](./1248-count-number-of-nice-subarrays) | **[Solution](./1248-count-number-of-nice-subarrays/1248-count-number-of-nice-subarrays.cpp)**  

| [1261](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/) | [Find Elements in a Contaminated Binary Tree](./1261-find-elements-in-a-contaminated-binary-tree) | **[Solution](./1261-find-elements-in-a-contaminated-binary-tree/1261-find-elements-in-a-contaminated-binary-tree.cpp)**  

| [1267](https://leetcode.com/problems/count-servers-that-communicate/) | [Count Servers That Communicate](./1267-count-servers-that-communicate) | **[Solution](./1267-count-servers-that-communicate/1267-count-servers-that-communicate.cpp)**  

| [1277](https://leetcode.com/problems/count-square-submatrices-with-all-ones/) | [Count Square Submatrices With all Ones](./1277-count-square-submatrices-with-all-ones) | **[Solution](./1277-count-square-submatrices-with-all-ones/1277-count-square-submatrices-with-all-ones.cpp)**  

| [1291](https://leetcode.com/problems/sequential-digits/) | [Sequential Digits](./1291-sequential-digits) | **[Solution](./1291-sequential-digits/1291-sequential-digits.cpp)**  

| [1293](https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/) | [Shortest Path in a Grid With Obstacles Elimination](./1293-shortest-path-in-a-grid-with-obstacles-elimination) | **[Solution](./1293-shortest-path-in-a-grid-with-obstacles-elimination/1293-shortest-path-in-a-grid-with-obstacles-elimination.cpp)**  

| [1304](https://leetcode.com/problems/longest-happy-string/) | [Longest Happy String](./1304-longest-happy-string) | **[Solution](./1304-longest-happy-string/1304-longest-happy-string.cpp)**  

| [1305](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/) | [All Elements in Two Binary Search Trees](./1305-all-elements-in-two-binary-search-trees) | **[Solution](./1305-all-elements-in-two-binary-search-trees/1305-all-elements-in-two-binary-search-trees.cpp)**  

| [1310](https://leetcode.com/problems/xor-queries-of-a-subarray/) | [Xor Queries of a Subarray](./1310-xor-queries-of-a-subarray) | **[Solution](./1310-xor-queries-of-a-subarray/1310-xor-queries-of-a-subarray.cpp)**  

| [1312](https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/) | [Minimum Insertion Steps to Make a String Palindrome](./1312-minimum-insertion-steps-to-make-a-string-palindrome) | **[Solution](./1312-minimum-insertion-steps-to-make-a-string-palindrome/1312-minimum-insertion-steps-to-make-a-string-palindrome.cpp)**  

| [1323](https://leetcode.com/problems/maximum-69-number/) | [Maximum 69 Number](./1323-maximum-69-number) | **[Solution](./1323-maximum-69-number/1323-maximum-69-number.cpp)**  

| [1328](https://leetcode.com/problems/break-a-palindrome/) | [Break a Palindrome](./1328-break-a-palindrome) | **[Solution](./1328-break-a-palindrome/1328-break-a-palindrome.cpp)**  

| [1329](https://leetcode.com/problems/sort-the-matrix-diagonally/) | [Sort the Matrix Diagonally](./1329-sort-the-matrix-diagonally) | **[Solution](./1329-sort-the-matrix-diagonally/1329-sort-the-matrix-diagonally.cpp)**  

| [1331](https://leetcode.com/problems/rank-transform-of-an-array/) | [Rank Transform of an Array](./1331-rank-transform-of-an-array) | **[Solution](./1331-rank-transform-of-an-array/1331-rank-transform-of-an-array.cpp)**  

| [1334](https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/) | [Find the City With the Smallest Number of Neighbors at a Threshold Distance](./1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) | **[Solution](./1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.cpp)**  

| [1335](https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule/) | [Minimum Difficulty of a Job Schedule](./1335-minimum-difficulty-of-a-job-schedule) | **[Solution](./1335-minimum-difficulty-of-a-job-schedule/1335-minimum-difficulty-of-a-job-schedule.cpp)**  

| [1338](https://leetcode.com/problems/reduce-array-size-to-the-half/) | [Reduce Array Size to the Half](./1338-reduce-array-size-to-the-half) | **[Solution](./1338-reduce-array-size-to-the-half/1338-reduce-array-size-to-the-half.cpp)**  

| [1345](https://leetcode.com/problems/jump-game-iv/) | [Jump Game IV](./1345-jump-game-iv) | **[Solution](./1345-jump-game-iv/1345-jump-game-iv.cpp)**  

| [1346](https://leetcode.com/problems/check-if-n-and-its-double-exist/) | [Check IF N and ITS Double Exist](./1346-check-if-n-and-its-double-exist) | **[Solution](./1346-check-if-n-and-its-double-exist/1346-check-if-n-and-its-double-exist.cpp)**  

| [1352](https://leetcode.com/problems/product-of-the-last-k-numbers/) | [Product of the Last K Numbers](./1352-product-of-the-last-k-numbers) | **[Solution](./1352-product-of-the-last-k-numbers/1352-product-of-the-last-k-numbers.cpp)**  

| [1358](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/) | [Number of Substrings Containing all Three Characters](./1358-number-of-substrings-containing-all-three-characters) | **[Solution](./1358-number-of-substrings-containing-all-three-characters/1358-number-of-substrings-containing-all-three-characters.cpp)**  

| [1365](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/) | [How Many Numbers Are Smaller than the Current Number](./1365-how-many-numbers-are-smaller-than-the-current-number) | **[Solution](./1365-how-many-numbers-are-smaller-than-the-current-number/1365-how-many-numbers-are-smaller-than-the-current-number.cpp)**  

| [1367](https://leetcode.com/problems/linked-list-in-binary-tree/) | [Linked List in Binary Tree](./1367-linked-list-in-binary-tree) | **[Solution](./1367-linked-list-in-binary-tree/1367-linked-list-in-binary-tree.cpp)**  

| [1371](https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/) | [Find the Longest Substring Containing Vowels in Even Counts](./1371-find-the-longest-substring-containing-vowels-in-even-counts) | **[Solution](./1371-find-the-longest-substring-containing-vowels-in-even-counts/1371-find-the-longest-substring-containing-vowels-in-even-counts.cpp)**  

| [1380](https://leetcode.com/problems/lucky-numbers-in-a-matrix/) | [Lucky Numbers in a Matrix](./1380-lucky-numbers-in-a-matrix) | **[Solution](./1380-lucky-numbers-in-a-matrix/1380-lucky-numbers-in-a-matrix.cpp)**  

| [1381](https://leetcode.com/problems/design-a-stack-with-increment-operation/) | [Design a Stack With Increment Operation](./1381-design-a-stack-with-increment-operation) | **[Solution](./1381-design-a-stack-with-increment-operation/1381-design-a-stack-with-increment-operation.cpp)**  

| [1382](https://leetcode.com/problems/balance-a-binary-search-tree/) | [Balance a Binary Search Tree](./1382-balance-a-binary-search-tree) | **[Solution](./1382-balance-a-binary-search-tree/1382-balance-a-binary-search-tree.cpp)**  

| [1395](https://leetcode.com/problems/count-number-of-teams/) | [Count Number of Teams](./1395-count-number-of-teams) | **[Solution](./1395-count-number-of-teams/1395-count-number-of-teams.cpp)**  

| [1396](https://leetcode.com/problems/design-underground-system/) | [Design Underground System](./1396-design-underground-system) | **[Solution](./1396-design-underground-system/1396-design-underground-system.cpp)**  

| [1400](https://leetcode.com/problems/construct-k-palindrome-strings/) | [Construct K Palindrome Strings](./1400-construct-k-palindrome-strings) | **[Solution](./1400-construct-k-palindrome-strings/1400-construct-k-palindrome-strings.cpp)**  

| [1404](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/) | [Number of Steps to Reduce a Number in Binary Representation to One](./1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one) | **[Solution](./1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one/1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one.cpp)**  

| [1405](https://leetcode.com/problems/longest-happy-string/) | [Longest Happy String](./1405-longest-happy-string) | **[Solution](./1405-longest-happy-string/1405-longest-happy-string.cpp)**  

| [1408](https://leetcode.com/problems/string-matching-in-an-array/) | [String Matching in an Array](./1408-string-matching-in-an-array) | **[Solution](./1408-string-matching-in-an-array/1408-string-matching-in-an-array.cpp)**  

| [1415](https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/) | [The K Th Lexicographical String of all Happy Strings of Length N](./1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) | **[Solution](./1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.cpp)**  

| [1416](https://leetcode.com/problems/restore-the-array/) | [Restore the Array](./1416-restore-the-array) | **[Solution](./1416-restore-the-array/1416-restore-the-array.cpp)**  

| [1418](https://leetcode.com/problems/fair-distribution-of-cookies/) | [Fair Distribution of Cookies](./1418-fair-distribution-of-cookies) | **[Solution](./1418-fair-distribution-of-cookies/1418-fair-distribution-of-cookies.cpp)**  

| [1422](https://leetcode.com/problems/maximum-score-after-splitting-a-string/) | [Maximum Score After Splitting a String](./1422-maximum-score-after-splitting-a-string) | **[Solution](./1422-maximum-score-after-splitting-a-string/1422-maximum-score-after-splitting-a-string.cpp)**  

| [1438](https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/) | [Longest Continuous Subarray With Absolute Diff Less than or Equal to Limit](./1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) | **[Solution](./1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.cpp)**  

| [1443](https://leetcode.com/problems/minimum-time-to-collect-all-apples-in-a-tree/) | [Minimum Time to Collect all Apples in a Tree](./1443-minimum-time-to-collect-all-apples-in-a-tree) | **[Solution](./1443-minimum-time-to-collect-all-apples-in-a-tree/1443-minimum-time-to-collect-all-apples-in-a-tree.cpp)**  

| [1448](https://leetcode.com/problems/count-good-nodes-in-binary-tree/) | [Count Good Nodes in Binary Tree](./1448-count-good-nodes-in-binary-tree) | **[Solution](./1448-count-good-nodes-in-binary-tree/1448-count-good-nodes-in-binary-tree.cpp)**  

| [1455](https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/) | [Check IF a Word Occurs As a Prefix of any Word in a Sentence](./1455-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) | **[Solution](./1455-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/1455-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence.cpp)**  

| [1457](https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/) | [Pseudo Palindromic Paths in a Binary Tree](./1457-pseudo-palindromic-paths-in-a-binary-tree) | **[Solution](./1457-pseudo-palindromic-paths-in-a-binary-tree/1457-pseudo-palindromic-paths-in-a-binary-tree.cpp)**  

| [1460](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-subarrays/) | [Make Two Arrays Equal by Reversing Subarrays](./1460-make-two-arrays-equal-by-reversing-subarrays) | **[Solution](./1460-make-two-arrays-equal-by-reversing-subarrays/1460-make-two-arrays-equal-by-reversing-subarrays.cpp)**  

| [1462](https://leetcode.com/problems/course-schedule-iv/) | [Course Schedule IV](./1462-course-schedule-iv) | **[Solution](./1462-course-schedule-iv/1462-course-schedule-iv.cpp)**  

| [1463](https://leetcode.com/problems/cherry-pickup-ii/) | [Cherry Pickup II](./1463-cherry-pickup-ii) | **[Solution](./1463-cherry-pickup-ii/1463-cherry-pickup-ii.cpp)**  

| [1475](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/) | [Final Prices With a Special Discount in a Shop](./1475-final-prices-with-a-special-discount-in-a-shop) | **[Solution](./1475-final-prices-with-a-special-discount-in-a-shop/1475-final-prices-with-a-special-discount-in-a-shop.cpp)**  

| [1482](https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/) | [Minimum Number of Days to Make M Bouquets](./1482-minimum-number-of-days-to-make-m-bouquets) | **[Solution](./1482-minimum-number-of-days-to-make-m-bouquets/1482-minimum-number-of-days-to-make-m-bouquets.cpp)**  

| [1497](https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k/) | [Check IF Array Pairs Are Divisible by K](./1497-check-if-array-pairs-are-divisible-by-k) | **[Solution](./1497-check-if-array-pairs-are-divisible-by-k/1497-check-if-array-pairs-are-divisible-by-k.cpp)**  

| [1508](https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/) | [Range Sum of Sorted Subarray Sums](./1508-range-sum-of-sorted-subarray-sums) | **[Solution](./1508-range-sum-of-sorted-subarray-sums/1508-range-sum-of-sorted-subarray-sums.cpp)**  

| [1509](https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves/) | [Minimum Difference Between Largest and Smallest Value in Three Moves](./1509-minimum-difference-between-largest-and-smallest-value-in-three-moves) | **[Solution](./1509-minimum-difference-between-largest-and-smallest-value-in-three-moves/1509-minimum-difference-between-largest-and-smallest-value-in-three-moves.cpp)**  

| [1510](https://leetcode.com/problems/stone-game-iv/) | [Stone Game IV](./1510-stone-game-iv) | **[Solution](./1510-stone-game-iv/1510-stone-game-iv.cpp)**  

| [1514](https://leetcode.com/problems/path-with-maximum-probability/) | [Path With Maximum Probability](./1514-path-with-maximum-probability) | **[Solution](./1514-path-with-maximum-probability/1514-path-with-maximum-probability.cpp)**  

| [1518](https://leetcode.com/problems/water-bottles/) | [Water Bottles](./1518-water-bottles) | **[Solution](./1518-water-bottles/1518-water-bottles.cpp)**  

| [1519](https://leetcode.com/problems/number-of-nodes-in-the-sub-tree-with-the-same-label/) | [Number of Nodes in the Sub Tree With the same Label](./1519-number-of-nodes-in-the-sub-tree-with-the-same-label) | **[Solution](./1519-number-of-nodes-in-the-sub-tree-with-the-same-label/1519-number-of-nodes-in-the-sub-tree-with-the-same-label.cpp)**  

| [1523](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/) | [Count Odd Numbers in an Interval Range](./1523-count-odd-numbers-in-an-interval-range) | **[Solution](./1523-count-odd-numbers-in-an-interval-range/1523-count-odd-numbers-in-an-interval-range.cpp)**  

| [1524](https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/) | [Number of Sub Arrays With Odd Sum](./1524-number-of-sub-arrays-with-odd-sum) | **[Solution](./1524-number-of-sub-arrays-with-odd-sum/1524-number-of-sub-arrays-with-odd-sum.cpp)**  

| [1530](https://leetcode.com/problems/number-of-good-leaf-nodes-pairs/) | [Number of Good Leaf Nodes Pairs](./1530-number-of-good-leaf-nodes-pairs) | **[Solution](./1530-number-of-good-leaf-nodes-pairs/1530-number-of-good-leaf-nodes-pairs.cpp)**  

| [1531](https://leetcode.com/problems/string-compression-ii/) | [String Compression II](./1531-string-compression-ii) | **[Solution](./1531-string-compression-ii/1531-string-compression-ii.cpp)**  

| [1534](https://leetcode.com/problems/count-good-triplets/) | [Count Good Triplets](./1534-count-good-triplets) | **[Solution](./1534-count-good-triplets/1534-count-good-triplets.cpp)**  

| [1544](https://leetcode.com/problems/make-the-string-great/) | [Make the String Great](./1544-make-the-string-great) | **[Solution](./1544-make-the-string-great/1544-make-the-string-great.cpp)**  

| [1545](https://leetcode.com/problems/find-kth-bit-in-nth-binary-string/) | [Find Kth Bit in Nth Binary String](./1545-find-kth-bit-in-nth-binary-string) | **[Solution](./1545-find-kth-bit-in-nth-binary-string/1545-find-kth-bit-in-nth-binary-string.cpp)**  

| [1550](https://leetcode.com/problems/three-consecutive-odds/) | [Three Consecutive Odds](./1550-three-consecutive-odds) | **[Solution](./1550-three-consecutive-odds/1550-three-consecutive-odds.cpp)**  

| [1552](https://leetcode.com/problems/magnetic-force-between-two-balls/) | [Magnetic Force Between Two Balls](./1552-magnetic-force-between-two-balls) | **[Solution](./1552-magnetic-force-between-two-balls/1552-magnetic-force-between-two-balls.cpp)**  

| [1568](https://leetcode.com/problems/minimum-number-of-days-to-disconnect-island/) | [Minimum Number of Days to Disconnect Island](./1568-minimum-number-of-days-to-disconnect-island) | **[Solution](./1568-minimum-number-of-days-to-disconnect-island/1568-minimum-number-of-days-to-disconnect-island.cpp)**  

| [1574](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/) | [Shortest Subarray to Be Removed to Make Array Sorted](./1574-shortest-subarray-to-be-removed-to-make-array-sorted) | **[Solution](./1574-shortest-subarray-to-be-removed-to-make-array-sorted/1574-shortest-subarray-to-be-removed-to-make-array-sorted.cpp)**  

| [1578](https://leetcode.com/problems/minimum-time-to-make-rope-colorful/) | [Minimum Time to Make Rope Colorful](./1578-minimum-time-to-make-rope-colorful) | **[Solution](./1578-minimum-time-to-make-rope-colorful/1578-minimum-time-to-make-rope-colorful.cpp)**  

| [1579](https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/) | [Remove Max Number of Edges to Keep Graph Fully Traversable](./1579-remove-max-number-of-edges-to-keep-graph-fully-traversable) | **[Solution](./1579-remove-max-number-of-edges-to-keep-graph-fully-traversable/1579-remove-max-number-of-edges-to-keep-graph-fully-traversable.cpp)**  

| [1584](https://leetcode.com/problems/min-cost-to-connect-all-points/) | [Min Cost to Connect all Points](./1584-min-cost-to-connect-all-points) | **[Solution](./1584-min-cost-to-connect-all-points/1584-min-cost-to-connect-all-points.cpp)**  

| [1586](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/) | [Longest Subarray of 1s After Deleting One Element](./1586-longest-subarray-of-1s-after-deleting-one-element) | **[Solution](./1586-longest-subarray-of-1s-after-deleting-one-element/1586-longest-subarray-of-1s-after-deleting-one-element.cpp)**  

| [1590](https://leetcode.com/problems/make-sum-divisible-by-p/) | [Make Sum Divisible by P](./1590-make-sum-divisible-by-p) | **[Solution](./1590-make-sum-divisible-by-p/1590-make-sum-divisible-by-p.cpp)**  

| [1593](https://leetcode.com/problems/split-a-string-into-the-max-number-of-unique-substrings/) | [Split a String Into the Max Number of Unique Substrings](./1593-split-a-string-into-the-max-number-of-unique-substrings) | **[Solution](./1593-split-a-string-into-the-max-number-of-unique-substrings/1593-split-a-string-into-the-max-number-of-unique-substrings.cpp)**  

| [1598](https://leetcode.com/problems/crawler-log-folder/) | [Crawler Log Folder](./1598-crawler-log-folder) | **[Solution](./1598-crawler-log-folder/1598-crawler-log-folder.cpp)**  

| [1605](https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/) | [Minimum Number of Days to Make M Bouquets](./1605-minimum-number-of-days-to-make-m-bouquets) | **[Solution](./1605-minimum-number-of-days-to-make-m-bouquets/1605-minimum-number-of-days-to-make-m-bouquets.cpp)**  

| [1608](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/) | [Special Array With X Elements Greater than or Equal X](./1608-special-array-with-x-elements-greater-than-or-equal-x) | **[Solution](./1608-special-array-with-x-elements-greater-than-or-equal-x/1608-special-array-with-x-elements-greater-than-or-equal-x.cpp)**  

| [1627](https://leetcode.com/problems/last-moment-before-all-ants-fall-out-of-a-plank/) | [Last Moment Before all Ants Fall out of a Plank](./1627-last-moment-before-all-ants-fall-out-of-a-plank) | **[Solution](./1627-last-moment-before-all-ants-fall-out-of-a-plank/1627-last-moment-before-all-ants-fall-out-of-a-plank.cpp)**  

| [1636](https://leetcode.com/problems/sort-array-by-increasing-frequency/) | [Sort Array by Increasing Frequency](./1636-sort-array-by-increasing-frequency) | **[Solution](./1636-sort-array-by-increasing-frequency/1636-sort-array-by-increasing-frequency.cpp)**  

| [1639](https://leetcode.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary/) | [Number of Ways to Form a Target String Given a Dictionary](./1639-number-of-ways-to-form-a-target-string-given-a-dictionary) | **[Solution](./1639-number-of-ways-to-form-a-target-string-given-a-dictionary/1639-number-of-ways-to-form-a-target-string-given-a-dictionary.cpp)**  

| [1652](https://leetcode.com/problems/defuse-the-bomb/) | [Defuse the Bomb](./1652-defuse-the-bomb) | **[Solution](./1652-defuse-the-bomb/1652-defuse-the-bomb.cpp)**  

| [1653](https://leetcode.com/problems/minimum-deletions-to-make-string-balanced/) | [Minimum Deletions to Make String Balanced](./1653-minimum-deletions-to-make-string-balanced) | **[Solution](./1653-minimum-deletions-to-make-string-balanced/1653-minimum-deletions-to-make-string-balanced.cpp)**  

| [1657](https://leetcode.com/problems/determine-if-two-strings-are-close/) | [Determine IF Two Strings Are Close](./1657-determine-if-two-strings-are-close) | **[Solution](./1657-determine-if-two-strings-are-close/1657-determine-if-two-strings-are-close.cpp)**  

| [1662](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/) | [Check IF Two String Arrays Are Equivalent](./1662-check-if-two-string-arrays-are-equivalent) | **[Solution](./1662-check-if-two-string-arrays-are-equivalent/1662-check-if-two-string-arrays-are-equivalent.cpp)**  

| [1671](https://leetcode.com/problems/minimum-number-of-removals-to-make-mountain-array/) | [Minimum Number of Removals to Make Mountain Array](./1671-minimum-number-of-removals-to-make-mountain-array) | **[Solution](./1671-minimum-number-of-removals-to-make-mountain-array/1671-minimum-number-of-removals-to-make-mountain-array.cpp)**  

| [1672](https://leetcode.com/problems/richest-customer-wealth/) | [Richest Customer Wealth](./1672-richest-customer-wealth) | **[Solution](./1672-richest-customer-wealth/1672-richest-customer-wealth.cpp)**  

| [1680](https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/) | [Concatenation of Consecutive Binary Numbers](./1680-concatenation-of-consecutive-binary-numbers) | **[Solution](./1680-concatenation-of-consecutive-binary-numbers/1680-concatenation-of-consecutive-binary-numbers.cpp)**  

| [1684](https://leetcode.com/problems/count-the-number-of-consistent-strings/) | [Count the Number of Consistent Strings](./1684-count-the-number-of-consistent-strings) | **[Solution](./1684-count-the-number-of-consistent-strings/1684-count-the-number-of-consistent-strings.cpp)**  

| [1701](https://leetcode.com/problems/average-waiting-time/) | [Average Waiting Time](./1701-average-waiting-time) | **[Solution](./1701-average-waiting-time/1701-average-waiting-time.cpp)**  

| [1704](https://leetcode.com/problems/determine-if-string-halves-are-alike/) | [Determine IF String Halves Are Alike](./1704-determine-if-string-halves-are-alike) | **[Solution](./1704-determine-if-string-halves-are-alike/1704-determine-if-string-halves-are-alike.cpp)**  

| [1706](https://leetcode.com/problems/where-will-the-ball-fall/) | [Where will the Ball Fall](./1706-where-will-the-ball-fall) | **[Solution](./1706-where-will-the-ball-fall/1706-where-will-the-ball-fall.cpp)**  

| [1711](https://leetcode.com/problems/find-valid-matrix-given-row-and-column-sums/) | [Find Valid Matrix Given Row and Column Sums](./1711-find-valid-matrix-given-row-and-column-sums) | **[Solution](./1711-find-valid-matrix-given-row-and-column-sums/1711-find-valid-matrix-given-row-and-column-sums.cpp)**  

| [1717](https://leetcode.com/problems/maximum-score-from-removing-substrings/) | [Maximum Score from Removing Substrings](./1717-maximum-score-from-removing-substrings) | **[Solution](./1717-maximum-score-from-removing-substrings/1717-maximum-score-from-removing-substrings.cpp)**  

| [1718](https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/) | [Construct the Lexicographically Largest Valid Sequence](./1718-construct-the-lexicographically-largest-valid-sequence) | **[Solution](./1718-construct-the-lexicographically-largest-valid-sequence/1718-construct-the-lexicographically-largest-valid-sequence.cpp)**  

| [1723](https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests/) | [Maximum Number of Achievable Transfer Requests](./1723-maximum-number-of-achievable-transfer-requests) | **[Solution](./1723-maximum-number-of-achievable-transfer-requests/1723-maximum-number-of-achievable-transfer-requests.cpp)**  

| [1726](https://leetcode.com/problems/tuple-with-same-product/) | [Tuple With same Product](./1726-tuple-with-same-product) | **[Solution](./1726-tuple-with-same-product/1726-tuple-with-same-product.cpp)**  

| [1749](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/) | [Maximum Absolute Sum of any Subarray](./1749-maximum-absolute-sum-of-any-subarray) | **[Solution](./1749-maximum-absolute-sum-of-any-subarray/1749-maximum-absolute-sum-of-any-subarray.cpp)**  

| [1752](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/) | [Check IF Array IS Sorted and Rotated](./1752-check-if-array-is-sorted-and-rotated) | **[Solution](./1752-check-if-array-is-sorted-and-rotated/1752-check-if-array-is-sorted-and-rotated.cpp)**  

| [1760](https://leetcode.com/problems/minimum-limit-of-balls-in-a-bag/) | [Minimum Limit of Balls in a Bag](./1760-minimum-limit-of-balls-in-a-bag) | **[Solution](./1760-minimum-limit-of-balls-in-a-bag/1760-minimum-limit-of-balls-in-a-bag.cpp)**  

| [1765](https://leetcode.com/problems/map-of-highest-peak/) | [Map of Highest Peak](./1765-map-of-highest-peak) | **[Solution](./1765-map-of-highest-peak/1765-map-of-highest-peak.cpp)**  

| [1769](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/) | [Minimum Number of Operations to Move all Balls to each Box](./1769-minimum-number-of-operations-to-move-all-balls-to-each-box) | **[Solution](./1769-minimum-number-of-operations-to-move-all-balls-to-each-box/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.cpp)**  

| [1770](https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique/) | [Minimum Deletions to Make Character Frequencies Unique](./1770-minimum-deletions-to-make-character-frequencies-unique) | **[Solution](./1770-minimum-deletions-to-make-character-frequencies-unique/1770-minimum-deletions-to-make-character-frequencies-unique.cpp)**  

| [1776](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/) | [Minimum Operations to Reduce X to Zero](./1776-minimum-operations-to-reduce-x-to-zero) | **[Solution](./1776-minimum-operations-to-reduce-x-to-zero/1776-minimum-operations-to-reduce-x-to-zero.cpp)**  

| [1780](https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/) | [Check IF Number IS a Sum of Powers of Three](./1780-check-if-number-is-a-sum-of-powers-of-three) | **[Solution](./1780-check-if-number-is-a-sum-of-powers-of-three/1780-check-if-number-is-a-sum-of-powers-of-three.cpp)**  

| [1790](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/) | [Check IF One String Swap can Make Strings Equal](./1790-check-if-one-string-swap-can-make-strings-equal) | **[Solution](./1790-check-if-one-string-swap-can-make-strings-equal/1790-check-if-one-string-swap-can-make-strings-equal.cpp)**  

| [1791](https://leetcode.com/problems/find-center-of-star-graph/) | [Find Center of Star Graph](./1791-find-center-of-star-graph) | **[Solution](./1791-find-center-of-star-graph/1791-find-center-of-star-graph.cpp)**  

| [1792](https://leetcode.com/problems/maximum-average-pass-ratio/) | [Maximum Average Pass Ratio](./1792-maximum-average-pass-ratio) | **[Solution](./1792-maximum-average-pass-rat