https://github.com/deepakkumar55/leetcode-question
https://github.com/deepakkumar55/leetcode-question
Last synced: over 1 year ago
JSON representation
- Host: GitHub
- URL: https://github.com/deepakkumar55/leetcode-question
- Owner: deepakkumar55
- Created: 2024-08-06T02:54:45.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2024-10-24T00:44:52.000Z (over 1 year ago)
- Last Synced: 2024-10-24T15:16:49.920Z (over 1 year ago)
- Language: Java
- Homepage:
- Size: 466 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode Topics
## Hash Table
| |
| ------- |
| [0432-all-oone-data-structure](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0432-all-oone-data-structure) |
| [0567-permutation-in-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0567-permutation-in-string) |
| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0632-smallest-range-covering-elements-from-k-lists) |
| [0870-magic-squares-in-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0870-magic-squares-in-grid) |
| [0905-length-of-longest-fibonacci-subsequence](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0905-length-of-longest-fibonacci-subsequence) |
| [0906-walking-robot-simulation](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0906-walking-robot-simulation) |
| [0920-uncommon-words-from-two-sentences](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0920-uncommon-words-from-two-sentences) |
| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |
| [0952-word-subsets](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0952-word-subsets) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [0999-regions-cut-by-slashes](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0999-regions-cut-by-slashes) |
| [1147-flip-columns-for-maximum-number-of-equal-rows](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1147-flip-columns-for-maximum-number-of-equal-rows) |
| [1160-letter-tile-possibilities](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1160-letter-tile-possibilities) |
| [1256-rank-transform-of-an-array](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1256-rank-transform-of-an-array) |
| [1364-tuple-with-same-product](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1364-tuple-with-same-product) |
| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1460-number-of-substrings-containing-all-three-characters) |
| [1468-check-if-n-and-its-double-exist](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1468-check-if-n-and-its-double-exist) |
| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |
| [1502-construct-k-palindrome-strings](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1502-construct-k-palindrome-strings) |
| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |
| [1694-make-sum-divisible-by-p](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1694-make-sum-divisible-by-p) |
| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |
| [1786-count-the-number-of-consistent-strings](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1786-count-the-number-of-consistent-strings) |
| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |
| [2054-the-number-of-the-smallest-unoccupied-chair](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2054-the-number-of-the-smallest-unoccupied-chair) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2059-unique-length-3-palindromic-subsequences) |
| [2107-find-unique-binary-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2107-find-unique-binary-string) |
| [2300-construct-string-with-repeat-limit](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2300-construct-string-with-repeat-limit) |
| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |
| [2434-design-a-number-container-system](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2434-design-a-number-container-system) |
| [2448-count-number-of-bad-pairs](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2448-count-number-of-bad-pairs) |
| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |
| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2599-take-k-of-each-character-from-left-and-right](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2599-take-k-of-each-character-from-left-and-right) |
| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |
| [2677-cousins-in-binary-tree-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2677-cousins-in-binary-tree-ii) |
| [2685-first-completely-painted-row-or-column](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2685-first-completely-painted-row-or-column) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
| [2707-merge-two-2d-arrays-by-summing-values](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2707-merge-two-2d-arrays-by-summing-values) |
| [2755-extra-characters-in-a-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2755-extra-characters-in-a-string) |
| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |
| [3227-find-missing-and-repeated-values](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3227-find-missing-and-repeated-values) |
| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
| [3329-find-the-length-of-the-longest-common-prefix](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3329-find-the-length-of-the-longest-common-prefix) |
| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |
| [3455-minimum-length-of-string-after-operations](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3455-minimum-length-of-string-after-operations) |
| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
| [3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii) |
## String
| |
| ------- |
| [0022-generate-parentheses](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0022-generate-parentheses) |
| [0179-largest-number](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0179-largest-number) |
| [0214-shortest-palindrome](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0214-shortest-palindrome) |
| [0241-different-ways-to-add-parentheses](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0241-different-ways-to-add-parentheses) |
| [0273-integer-to-english-words](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0273-integer-to-english-words) |
| [0539-minimum-time-difference](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0539-minimum-time-difference) |
| [0567-permutation-in-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0567-permutation-in-string) |
| [0592-fraction-addition-and-subtraction](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0592-fraction-addition-and-subtraction) |
| [0664-strange-printer](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0664-strange-printer) |
| [0812-rotate-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0812-rotate-string) |
| [0920-uncommon-words-from-two-sentences](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0920-uncommon-words-from-two-sentences) |
| [0952-word-subsets](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0952-word-subsets) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1093-recover-a-tree-from-preorder-traversal](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1093-recover-a-tree-from-preorder-traversal) |
| [1160-letter-tile-possibilities](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1160-letter-tile-possibilities) |
| [1170-shortest-common-supersequence](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1170-shortest-common-supersequence) |
| [1197-parsing-a-boolean-expression](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1197-parsing-a-boolean-expression) |
| [1302-delete-characters-to-make-fancy-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1302-delete-characters-to-make-fancy-string) |
| [1304-longest-happy-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1304-longest-happy-string) |
| [1350-remove-sub-folders-from-the-filesystem](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1350-remove-sub-folders-from-the-filesystem) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1460-number-of-substrings-containing-all-three-characters) |
| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |
| [1502-construct-k-palindrome-strings](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1502-construct-k-palindrome-strings) |
| [1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) |
| [1524-string-matching-in-an-array](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1524-string-matching-in-an-array) |
| [1537-maximum-score-after-splitting-a-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1537-maximum-score-after-splitting-a-string) |
| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |
| [1667-find-kth-bit-in-nth-binary-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1667-find-kth-bit-in-nth-binary-string) |
| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |
| [1744-number-of-ways-to-form-a-target-string-given-a-dictionary](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1744-number-of-ways-to-form-a-target-string-given-a-dictionary) |
| [1786-count-the-number-of-consistent-strings](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1786-count-the-number-of-consistent-strings) |
| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |
| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |
| [1923-sentence-similarity-iii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1923-sentence-similarity-iii) |
| [2021-remove-all-occurrences-of-a-substring](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2021-remove-all-occurrences-of-a-substring) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2059-unique-length-3-palindromic-subsequences) |
| [2076-sum-of-digits-of-string-after-convert](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2076-sum-of-digits-of-string-after-convert) |
| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |
| [2107-find-unique-binary-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2107-find-unique-binary-string) |
| [2221-check-if-a-parentheses-string-can-be-valid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2221-check-if-a-parentheses-string-can-be-valid) |
| [2232-adding-spaces-to-a-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2232-adding-spaces-to-a-string) |
| [2292-counting-words-with-a-given-prefix](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2292-counting-words-with-a-given-prefix) |
| [2300-construct-string-with-repeat-limit](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2300-construct-string-with-repeat-limit) |
| [2414-move-pieces-to-obtain-a-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2414-move-pieces-to-obtain-a-string) |
| [2456-construct-smallest-number-from-di-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2456-construct-smallest-number-from-di-string) |
| [2463-minimum-recolors-to-get-k-consecutive-black-blocks](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2463-minimum-recolors-to-get-k-consecutive-black-blocks) |
| [2465-shifting-letters-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2465-shifting-letters-ii) |
| [2494-sum-of-prefix-scores-of-strings](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2494-sum-of-prefix-scores-of-strings) |
| [2580-circular-sentence](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2580-circular-sentence) |
| [2599-take-k-of-each-character-from-left-and-right](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2599-take-k-of-each-character-from-left-and-right) |
| [2691-count-vowel-strings-in-ranges](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2691-count-vowel-strings-in-ranges) |
| [2755-extra-characters-in-a-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2755-extra-characters-in-a-string) |
| [3018-make-string-a-subsequence-using-cyclic-increments](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3018-make-string-a-subsequence-using-cyclic-increments) |
| [3195-separate-black-and-white-balls](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3195-separate-black-and-white-balls) |
| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3309-count-prefix-and-suffix-pairs-i) |
| [3329-find-the-length-of-the-longest-common-prefix](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3329-find-the-length-of-the-longest-common-prefix) |
| [3447-clear-digits](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3447-clear-digits) |
| [3451-string-compression-iii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3451-string-compression-iii) |
| [3455-minimum-length-of-string-after-operations](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3455-minimum-length-of-string-after-operations) |
| [3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii) |
## Greedy
| |
| ------- |
| [0179-largest-number](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0179-largest-number) |
| [0624-maximum-distance-in-arrays](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0624-maximum-distance-in-arrays) |
| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0632-smallest-range-covering-elements-from-k-lists) |
| [0670-maximum-swap](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0670-maximum-swap) |
| [0780-max-chunks-to-make-sorted](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0780-max-chunks-to-make-sorted) |
| [0890-lemonade-change](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0890-lemonade-change) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1304-longest-happy-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1304-longest-happy-string) |
| [1502-construct-k-palindrome-strings](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1502-construct-k-palindrome-strings) |
| [1917-maximum-average-pass-ratio](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1917-maximum-average-pass-ratio) |
| [2089-maximum-matrix-sum](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2089-maximum-matrix-sum) |
| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |
| [2221-check-if-a-parentheses-string-can-be-valid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2221-check-if-a-parentheses-string-can-be-valid) |
| [2300-construct-string-with-repeat-limit](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2300-construct-string-with-repeat-limit) |
| [2456-construct-smallest-number-from-di-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2456-construct-smallest-number-from-di-string) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2509-minimize-xor](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2509-minimize-xor) |
| [2616-maximal-score-after-applying-k-operations](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2616-maximal-score-after-applying-k-operations) |
| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |
| [2716-prime-subtraction-operation](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2716-prime-subtraction-operation) |
| [3195-separate-black-and-white-balls](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3195-separate-black-and-white-balls) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
## Sorting
| |
| ------- |
| [0179-largest-number](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0179-largest-number) |
| [0539-minimum-time-difference](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0539-minimum-time-difference) |
| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0632-smallest-range-covering-elements-from-k-lists) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0719-find-k-th-smallest-pair-distance) |
| [0780-max-chunks-to-make-sorted](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0780-max-chunks-to-make-sorted) |
| [1256-rank-transform-of-an-array](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1256-rank-transform-of-an-array) |
| [1468-check-if-n-and-its-double-exist](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1468-check-if-n-and-its-double-exist) |
| [2164-two-best-non-overlapping-events](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2164-two-best-non-overlapping-events) |
| [2179-most-beautiful-item-for-each-query](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2179-most-beautiful-item-for-each-query) |
| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2554-minimum-total-distance-traveled](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2554-minimum-total-distance-traveled) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
| [2699-count-the-number-of-fair-pairs](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2699-count-the-number-of-fair-pairs) |
| [2891-maximum-beauty-of-an-array-after-applying-operation](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2891-maximum-beauty-of-an-array-after-applying-operation) |
| [3219-make-lexicographically-smallest-array-by-swapping-elements](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3219-make-lexicographically-smallest-array-by-swapping-elements) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
| [3291-find-if-array-can-be-sorted](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3291-find-if-array-can-be-sorted) |
## Counting
| |
| ------- |
| [0920-uncommon-words-from-two-sentences](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0920-uncommon-words-from-two-sentences) |
| [1160-letter-tile-possibilities](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1160-letter-tile-possibilities) |
| [1364-tuple-with-same-product](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1364-tuple-with-same-product) |
| [1396-count-servers-that-communicate](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1396-count-servers-that-communicate) |
| [1502-construct-k-palindrome-strings](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1502-construct-k-palindrome-strings) |
| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |
| [1786-count-the-number-of-consistent-strings](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1786-count-the-number-of-consistent-strings) |
| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |
| [2300-construct-string-with-repeat-limit](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2300-construct-string-with-repeat-limit) |
| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |
| [2448-count-number-of-bad-pairs](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2448-count-number-of-bad-pairs) |
| [2494-sum-of-prefix-scores-of-strings](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2494-sum-of-prefix-scores-of-strings) |
| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |
| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
| [3455-minimum-length-of-string-after-operations](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3455-minimum-length-of-string-after-operations) |
## Array
| |
| ------- |
| [0040-combination-sum-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0040-combination-sum-ii) |
| [0179-largest-number](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0179-largest-number) |
| [0407-trapping-rain-water-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0407-trapping-rain-water-ii) |
| [0494-target-sum](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0494-target-sum) |
| [0539-minimum-time-difference](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0539-minimum-time-difference) |
| [0624-maximum-distance-in-arrays](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0624-maximum-distance-in-arrays) |
| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0632-smallest-range-covering-elements-from-k-lists) |
| [0689-maximum-sum-of-3-non-overlapping-subarrays](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0689-maximum-sum-of-3-non-overlapping-subarrays) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0719-find-k-th-smallest-pair-distance) |
| [0729-my-calendar-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0729-my-calendar-i) |
| [0731-my-calendar-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0731-my-calendar-ii) |
| [0780-max-chunks-to-make-sorted](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0780-max-chunks-to-make-sorted) |
| [0787-sliding-puzzle](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0787-sliding-puzzle) |
| [0854-making-a-large-island](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0854-making-a-large-island) |
| [0859-design-circular-deque](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0859-design-circular-deque) |
| [0870-magic-squares-in-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0870-magic-squares-in-grid) |
| [0890-lemonade-change](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0890-lemonade-change) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [0905-length-of-longest-fibonacci-subsequence](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0905-length-of-longest-fibonacci-subsequence) |
| [0906-walking-robot-simulation](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0906-walking-robot-simulation) |
| [0921-spiral-matrix-iii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0921-spiral-matrix-iii) |
| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |
| [0952-word-subsets](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0952-word-subsets) |
| [0999-regions-cut-by-slashes](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0999-regions-cut-by-slashes) |
| [1025-minimum-cost-for-tickets](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1025-minimum-cost-for-tickets) |
| [1063-best-sightseeing-pair](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1063-best-sightseeing-pair) |
| [1147-flip-columns-for-maximum-number-of-equal-rows](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1147-flip-columns-for-maximum-number-of-equal-rows) |
| [1240-stone-game-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1240-stone-game-ii) |
| [1256-rank-transform-of-an-array](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1256-rank-transform-of-an-array) |
| [1325-path-with-maximum-probability](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1325-path-with-maximum-probability) |
| [1335-maximum-candies-allocated-to-k-children](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1335-maximum-candies-allocated-to-k-children) |
| [1350-remove-sub-folders-from-the-filesystem](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1350-remove-sub-folders-from-the-filesystem) |
| [1364-tuple-with-same-product](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1364-tuple-with-same-product) |
| [1396-count-servers-that-communicate](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1396-count-servers-that-communicate) |
| [1402-count-square-submatrices-with-all-ones](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1402-count-square-submatrices-with-all-ones) |
| [1435-xor-queries-of-a-subarray](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1435-xor-queries-of-a-subarray) |
| [1468-check-if-n-and-its-double-exist](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1468-check-if-n-and-its-double-exist) |
| [1477-product-of-the-last-k-numbers](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1477-product-of-the-last-k-numbers) |
| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |
| [1497-design-a-stack-with-increment-operation](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1497-design-a-stack-with-increment-operation) |
| [1524-string-matching-in-an-array](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1524-string-matching-in-an-array) |
| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |
| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |
| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1631-number-of-sub-arrays-with-odd-sum) |
| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
| [1694-make-sum-divisible-by-p](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1694-make-sum-divisible-by-p) |
| [1744-number-of-ways-to-form-a-target-string-given-a-dictionary](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1744-number-of-ways-to-form-a-target-string-given-a-dictionary) |
| [1755-defuse-the-bomb](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1755-defuse-the-bomb) |
| [1786-count-the-number-of-consistent-strings](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1786-count-the-number-of-consistent-strings) |
| [1819-construct-the-lexicographically-largest-valid-sequence](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1819-construct-the-lexicographically-largest-valid-sequence) |
| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1849-maximum-absolute-sum-of-any-subarray) |
| [1876-map-of-highest-peak](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1876-map-of-highest-peak) |
| [1878-check-if-array-is-sorted-and-rotated](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1878-check-if-array-is-sorted-and-rotated) |
| [1886-minimum-limit-of-balls-in-a-bag](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1886-minimum-limit-of-balls-in-a-bag) |
| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |
| [1917-maximum-average-pass-ratio](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1917-maximum-average-pass-ratio) |
| [1923-sentence-similarity-iii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1923-sentence-similarity-iii) |
| [1927-maximum-ascending-subarray-sum](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1927-maximum-ascending-subarray-sum) |
| [1940-maximum-xor-for-each-query](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1940-maximum-xor-for-each-query) |
| [1972-rotating-the-box](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1972-rotating-the-box) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [2035-count-sub-islands](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2035-count-sub-islands) |
| [2054-the-number-of-the-smallest-unoccupied-chair](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2054-the-number-of-the-smallest-unoccupied-chair) |
| [2089-maximum-matrix-sum](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2089-maximum-matrix-sum) |
| [2107-find-unique-binary-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2107-find-unique-binary-string) |
| [2132-convert-1d-array-into-2d-array](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2132-convert-1d-array-into-2d-array) |
| [2145-grid-game](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2145-grid-game) |
| [2155-find-missing-observations](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2155-find-missing-observations) |
| [2164-two-best-non-overlapping-events](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2164-two-best-non-overlapping-events) |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
| [2179-most-beautiful-item-for-each-query](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2179-most-beautiful-item-for-each-query) |
| [2188-minimized-maximum-of-products-distributed-to-any-store](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2188-minimized-maximum-of-products-distributed-to-any-store) |
| [2232-adding-spaces-to-a-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2232-adding-spaces-to-a-string) |
| [2265-partition-array-according-to-given-pivot](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2265-partition-array-according-to-given-pivot) |
| [2292-counting-words-with-a-given-prefix](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2292-counting-words-with-a-given-prefix) |
| [2343-count-unguarded-cells-in-the-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2343-count-unguarded-cells-in-the-grid) |
| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |
| [2358-number-of-ways-to-split-array](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2358-number-of-ways-to-split-array) |
| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |
| [2411-spiral-matrix-iv](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2411-spiral-matrix-iv) |
| [2448-count-number-of-bad-pairs](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2448-count-number-of-bad-pairs) |
| [2465-shifting-letters-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2465-shifting-letters-ii) |
| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2494-sum-of-prefix-scores-of-strings](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2494-sum-of-prefix-scores-of-strings) |
| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |
| [2533-bitwise-xor-of-all-pairings](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2533-bitwise-xor-of-all-pairings) |
| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |
| [2551-apply-operations-to-an-array](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2551-apply-operations-to-an-array) |
| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |
| [2554-minimum-total-distance-traveled](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2554-minimum-total-distance-traveled) |
| [2564-most-profitable-path-in-a-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2564-most-profitable-path-in-a-tree) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |
| [2616-maximal-score-after-applying-k-operations](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2616-maximal-score-after-applying-k-operations) |
| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |
| [2685-first-completely-painted-row-or-column](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2685-first-completely-painted-row-or-column) |
| [2691-count-vowel-strings-in-ranges](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2691-count-vowel-strings-in-ranges) |
| [2692-take-gifts-from-the-richest-pile](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2692-take-gifts-from-the-richest-pile) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
| [2699-count-the-number-of-fair-pairs](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2699-count-the-number-of-fair-pairs) |
| [2707-merge-two-2d-arrays-by-summing-values](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2707-merge-two-2d-arrays-by-summing-values) |
| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |
| [2716-prime-subtraction-operation](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2716-prime-subtraction-operation) |
| [2755-extra-characters-in-a-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2755-extra-characters-in-a-string) |
| [2764-maximum-number-of-fish-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2764-maximum-number-of-fish-in-a-grid) |
| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |
| [2792-neighboring-bitwise-xor](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2792-neighboring-bitwise-xor) |
| [2794-maximum-number-of-moves-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2794-maximum-number-of-moves-in-a-grid) |
| [2868-continuous-subarrays](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2868-continuous-subarrays) |
| [2891-maximum-beauty-of-an-array-after-applying-operation](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2891-maximum-beauty-of-an-array-after-applying-operation) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
| [3211-find-maximum-non-decreasing-array-length](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3211-find-maximum-non-decreasing-array-length) |
| [3219-make-lexicographically-smallest-array-by-swapping-elements](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3219-make-lexicographically-smallest-array-by-swapping-elements) |
| [3227-find-missing-and-repeated-values](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3227-find-missing-and-repeated-values) |
| [3291-find-if-array-can-be-sorted](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3291-find-if-array-can-be-sorted) |
| [3309-count-prefix-and-suffix-pairs-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3309-count-prefix-and-suffix-pairs-i) |
| [3329-find-the-length-of-the-longest-common-prefix](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3329-find-the-length-of-the-longest-common-prefix) |
| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |
| [3372-longest-strictly-increasing-or-strictly-decreasing-subarray](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3372-longest-strictly-increasing-or-strictly-decreasing-subarray) |
| [3380-shortest-subarray-with-or-at-least-k-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3380-shortest-subarray-with-or-at-least-k-ii) |
| [3427-special-array-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3427-special-array-ii) |
| [3429-special-array-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3429-special-array-i) |
| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |
| [3483-alternating-groups-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3483-alternating-groups-ii) |
| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
| [3517-shortest-distance-after-road-addition-queries-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3517-shortest-distance-after-road-addition-queries-i) |
| [3522-find-the-power-of-k-size-subarrays-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3522-find-the-power-of-k-size-subarrays-i) |
| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |
| [3643-zero-array-transformation-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3643-zero-array-transformation-ii) |
## Binary Search
| |
| ------- |
| [0719-find-k-th-smallest-pair-distance](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0719-find-k-th-smallest-pair-distance) |
| [0729-my-calendar-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0729-my-calendar-i) |
| [0731-my-calendar-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0731-my-calendar-ii) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [1335-maximum-candies-allocated-to-k-children](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1335-maximum-candies-allocated-to-k-children) |
| [1468-check-if-n-and-its-double-exist](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1468-check-if-n-and-its-double-exist) |
| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |
| [1886-minimum-limit-of-balls-in-a-bag](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1886-minimum-limit-of-balls-in-a-bag) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [2164-two-best-non-overlapping-events](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2164-two-best-non-overlapping-events) |
| [2179-most-beautiful-item-for-each-query](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2179-most-beautiful-item-for-each-query) |
| [2188-minimized-maximum-of-products-distributed-to-any-store](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2188-minimized-maximum-of-products-distributed-to-any-store) |
| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |
| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |
| [2699-count-the-number-of-fair-pairs](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2699-count-the-number-of-fair-pairs) |
| [2716-prime-subtraction-operation](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2716-prime-subtraction-operation) |
| [2891-maximum-beauty-of-an-array-after-applying-operation](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2891-maximum-beauty-of-an-array-after-applying-operation) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
| [3211-find-maximum-non-decreasing-array-length](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3211-find-maximum-non-decreasing-array-length) |
| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |
| [3427-special-array-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3427-special-array-ii) |
| [3643-zero-array-transformation-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3643-zero-array-transformation-ii) |
## Dynamic Programming
| |
| ------- |
| [0022-generate-parentheses](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0022-generate-parentheses) |
| [0241-different-ways-to-add-parentheses](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0241-different-ways-to-add-parentheses) |
| [0494-target-sum](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0494-target-sum) |
| [0650-2-keys-keyboard](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0650-2-keys-keyboard) |
| [0664-strange-printer](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0664-strange-printer) |
| [0689-maximum-sum-of-3-non-overlapping-subarrays](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0689-maximum-sum-of-3-non-overlapping-subarrays) |
| [0905-length-of-longest-fibonacci-subsequence](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0905-length-of-longest-fibonacci-subsequence) |
| [1025-minimum-cost-for-tickets](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1025-minimum-cost-for-tickets) |
| [1063-best-sightseeing-pair](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1063-best-sightseeing-pair) |
| [1170-shortest-common-supersequence](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1170-shortest-common-supersequence) |
| [1240-stone-game-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1240-stone-game-ii) |
| [1402-count-square-submatrices-with-all-ones](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1402-count-square-submatrices-with-all-ones) |
| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1631-number-of-sub-arrays-with-odd-sum) |
| [1744-number-of-ways-to-form-a-target-string-given-a-dictionary](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1744-number-of-ways-to-form-a-target-string-given-a-dictionary) |
| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1849-maximum-absolute-sum-of-any-subarray) |
| [2164-two-best-non-overlapping-events](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2164-two-best-non-overlapping-events) |
| [2554-minimum-total-distance-traveled](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2554-minimum-total-distance-traveled) |
| [2562-count-ways-to-build-good-strings](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2562-count-ways-to-build-good-strings) |
| [2755-extra-characters-in-a-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2755-extra-characters-in-a-string) |
| [2794-maximum-number-of-moves-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2794-maximum-number-of-moves-in-a-grid) |
| [3211-find-maximum-non-decreasing-array-length](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3211-find-maximum-non-decreasing-array-length) |
## Stack
| |
| ------- |
| [0145-binary-tree-postorder-traversal](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0145-binary-tree-postorder-traversal) |
| [0780-max-chunks-to-make-sorted](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0780-max-chunks-to-make-sorted) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1197-parsing-a-boolean-expression](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1197-parsing-a-boolean-expression) |
| [1497-design-a-stack-with-increment-operation](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1497-design-a-stack-with-increment-operation) |
| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |
| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |
| [2021-remove-all-occurrences-of-a-substring](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2021-remove-all-occurrences-of-a-substring) |
| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |
| [2221-check-if-a-parentheses-string-can-be-valid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2221-check-if-a-parentheses-string-can-be-valid) |
| [2456-construct-smallest-number-from-di-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2456-construct-smallest-number-from-di-string) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
| [3211-find-maximum-non-decreasing-array-length](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3211-find-maximum-non-decreasing-array-length) |
| [3447-clear-digits](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3447-clear-digits) |
## Queue
| |
| ------- |
| [0859-design-circular-deque](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0859-design-circular-deque) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [2868-continuous-subarrays](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2868-continuous-subarrays) |
| [3211-find-maximum-non-decreasing-array-length](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3211-find-maximum-non-decreasing-array-length) |
## Monotonic Stack
| |
| ------- |
| [0780-max-chunks-to-make-sorted](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0780-max-chunks-to-make-sorted) |
| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |
| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
| [3211-find-maximum-non-decreasing-array-length](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3211-find-maximum-non-decreasing-array-length) |
## Monotonic Queue
| |
| ------- |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [2868-continuous-subarrays](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2868-continuous-subarrays) |
| [3211-find-maximum-non-decreasing-array-length](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3211-find-maximum-non-decreasing-array-length) |
## Math
| |
| ------- |
| [0050-powx-n](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0050-powx-n) |
| [0241-different-ways-to-add-parentheses](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0241-different-ways-to-add-parentheses) |
| [0273-integer-to-english-words](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0273-integer-to-english-words) |
| [0539-minimum-time-difference](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0539-minimum-time-difference) |
| [0592-fraction-addition-and-subtraction](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0592-fraction-addition-and-subtraction) |
| [0650-2-keys-keyboard](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0650-2-keys-keyboard) |
| [0670-maximum-swap](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0670-maximum-swap) |
| [0870-magic-squares-in-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0870-magic-squares-in-grid) |
| [1240-stone-game-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1240-stone-game-ii) |
| [1477-product-of-the-last-k-numbers](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1477-product-of-the-last-k-numbers) |
| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1631-number-of-sub-arrays-with-odd-sum) |
| [1889-check-if-number-is-a-sum-of-powers-of-three](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1889-check-if-number-is-a-sum-of-powers-of-three) |
| [2155-find-missing-observations](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2155-find-missing-observations) |
| [2448-count-number-of-bad-pairs](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2448-count-number-of-bad-pairs) |
| [2610-closest-prime-numbers-in-range](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2610-closest-prime-numbers-in-range) |
| [2649-count-total-number-of-colored-cells](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2649-count-total-number-of-colored-cells) |
| [2716-prime-subtraction-operation](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2716-prime-subtraction-operation) |
| [2802-find-the-punishment-number-of-an-integer](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2802-find-the-punishment-number-of-an-integer) |
| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |
| [3227-find-missing-and-repeated-values](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3227-find-missing-and-repeated-values) |
| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |
## Recursion
| |
| ------- |
| [0050-powx-n](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0050-powx-n) |
| [0241-different-ways-to-add-parentheses](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0241-different-ways-to-add-parentheses) |
| [0273-integer-to-english-words](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0273-integer-to-english-words) |
| [1197-parsing-a-boolean-expression](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1197-parsing-a-boolean-expression) |
| [1667-find-kth-bit-in-nth-binary-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1667-find-kth-bit-in-nth-binary-string) |
## Matrix
| |
| ------- |
| [0407-trapping-rain-water-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0407-trapping-rain-water-ii) |
| [0787-sliding-puzzle](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0787-sliding-puzzle) |
| [0854-making-a-large-island](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0854-making-a-large-island) |
| [0870-magic-squares-in-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0870-magic-squares-in-grid) |
| [0921-spiral-matrix-iii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0921-spiral-matrix-iii) |
| [0999-regions-cut-by-slashes](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0999-regions-cut-by-slashes) |
| [1147-flip-columns-for-maximum-number-of-equal-rows](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1147-flip-columns-for-maximum-number-of-equal-rows) |
| [1396-count-servers-that-communicate](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1396-count-servers-that-communicate) |
| [1402-count-square-submatrices-with-all-ones](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1402-count-square-submatrices-with-all-ones) |
| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
| [1876-map-of-highest-peak](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1876-map-of-highest-peak) |
| [1972-rotating-the-box](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1972-rotating-the-box) |
| [2035-count-sub-islands](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2035-count-sub-islands) |
| [2089-maximum-matrix-sum](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2089-maximum-matrix-sum) |
| [2132-convert-1d-array-into-2d-array](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2132-convert-1d-array-into-2d-array) |
| [2145-grid-game](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2145-grid-game) |
| [2343-count-unguarded-cells-in-the-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2343-count-unguarded-cells-in-the-grid) |
| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |
| [2411-spiral-matrix-iv](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2411-spiral-matrix-iv) |
| [2685-first-completely-painted-row-or-column](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2685-first-completely-painted-row-or-column) |
| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |
| [2764-maximum-number-of-fish-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2764-maximum-number-of-fish-in-a-grid) |
| [2794-maximum-number-of-moves-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2794-maximum-number-of-moves-in-a-grid) |
| [3227-find-missing-and-repeated-values](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3227-find-missing-and-repeated-values) |
## Simulation
| |
| ------- |
| [0592-fraction-addition-and-subtraction](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0592-fraction-addition-and-subtraction) |
| [0906-walking-robot-simulation](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0906-walking-robot-simulation) |
| [0921-spiral-matrix-iii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0921-spiral-matrix-iii) |
| [1667-find-kth-bit-in-nth-binary-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1667-find-kth-bit-in-nth-binary-string) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [2021-remove-all-occurrences-of-a-substring](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2021-remove-all-occurrences-of-a-substring) |
| [2076-sum-of-digits-of-string-after-convert](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2076-sum-of-digits-of-string-after-convert) |
| [2132-convert-1d-array-into-2d-array](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2132-convert-1d-array-into-2d-array) |
| [2155-find-missing-observations](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2155-find-missing-observations) |
| [2232-adding-spaces-to-a-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2232-adding-spaces-to-a-string) |
| [2265-partition-array-according-to-given-pivot](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2265-partition-array-according-to-given-pivot) |
| [2343-count-unguarded-cells-in-the-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2343-count-unguarded-cells-in-the-grid) |
| [2411-spiral-matrix-iv](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2411-spiral-matrix-iv) |
| [2551-apply-operations-to-an-array](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2551-apply-operations-to-an-array) |
| [2692-take-gifts-from-the-richest-pile](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2692-take-gifts-from-the-richest-pile) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |
| [3434-find-the-number-of-distinct-colors-among-the-balls](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls) |
| [3447-clear-digits](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3447-clear-digits) |
| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |
## Depth-First Search
| |
| ------- |
| [0145-binary-tree-postorder-traversal](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0145-binary-tree-postorder-traversal) |
| [0386-lexicographical-numbers](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0386-lexicographical-numbers) |
| [0515-find-largest-value-in-each-tree-row](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0515-find-largest-value-in-each-tree-row) |
| [0684-redundant-connection](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0684-redundant-connection) |
| [0820-find-eventual-safe-states](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0820-find-eventual-safe-states) |
| [0854-making-a-large-island](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0854-making-a-large-island) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [0988-flip-equivalent-binary-trees](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0988-flip-equivalent-binary-trees) |
| [0999-regions-cut-by-slashes](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0999-regions-cut-by-slashes) |
| [1093-recover-a-tree-from-preorder-traversal](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1093-recover-a-tree-from-preorder-traversal) |
| [1350-remove-sub-folders-from-the-filesystem](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1350-remove-sub-folders-from-the-filesystem) |
| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |
| [1396-count-servers-that-communicate](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1396-count-servers-that-communicate) |
| [1484-linked-list-in-binary-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1484-linked-list-in-binary-tree) |
| [1558-course-schedule-iv](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1558-course-schedule-iv) |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
| [2035-count-sub-islands](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2035-count-sub-islands) |
| [2201-valid-arrangement-of-pairs](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2201-valid-arrangement-of-pairs) |
| [2246-maximum-employees-to-be-invited-to-a-meeting](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2246-maximum-employees-to-be-invited-to-a-meeting) |
| [2493-reverse-odd-levels-of-binary-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2493-reverse-odd-levels-of-binary-tree) |
| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |
| [2564-most-profitable-path-in-a-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2564-most-profitable-path-in-a-tree) |
| [2677-cousins-in-binary-tree-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2677-cousins-in-binary-tree-ii) |
| [2764-maximum-number-of-fish-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2764-maximum-number-of-fish-in-a-grid) |
| [3058-maximum-number-of-k-divisible-components](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3058-maximum-number-of-k-divisible-components) |
| [3439-find-minimum-diameter-after-merging-two-trees](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3439-find-minimum-diameter-after-merging-two-trees) |
## Breadth-First Search
| |
| ------- |
| [0407-trapping-rain-water-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0407-trapping-rain-water-ii) |
| [0515-find-largest-value-in-each-tree-row](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0515-find-largest-value-in-each-tree-row) |
| [0684-redundant-connection](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0684-redundant-connection) |
| [0787-sliding-puzzle](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0787-sliding-puzzle) |
| [0820-find-eventual-safe-states](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0820-find-eventual-safe-states) |
| [0854-making-a-large-island](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0854-making-a-large-island) |
| [0999-regions-cut-by-slashes](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0999-regions-cut-by-slashes) |
| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |
| [1396-count-servers-that-communicate](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1396-count-servers-that-communicate) |
| [1484-linked-list-in-binary-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1484-linked-list-in-binary-tree) |
| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |
| [1558-course-schedule-iv](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1558-course-schedule-iv) |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
| [1876-map-of-highest-peak](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1876-map-of-highest-peak) |
| [2035-count-sub-islands](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2035-count-sub-islands) |
| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |
| [2493-reverse-odd-levels-of-binary-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2493-reverse-odd-levels-of-binary-tree) |
| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |
| [2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level) |
| [2564-most-profitable-path-in-a-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2564-most-profitable-path-in-a-tree) |
| [2583-divide-nodes-into-the-maximum-number-of-groups](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2583-divide-nodes-into-the-maximum-number-of-groups) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
| [2677-cousins-in-binary-tree-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2677-cousins-in-binary-tree-ii) |
| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |
| [2764-maximum-number-of-fish-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2764-maximum-number-of-fish-in-a-grid) |
| [3439-find-minimum-diameter-after-merging-two-trees](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3439-find-minimum-diameter-after-merging-two-trees) |
| [3517-shortest-distance-after-road-addition-queries-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3517-shortest-distance-after-road-addition-queries-i) |
## Union Find
| |
| ------- |
| [0684-redundant-connection](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0684-redundant-connection) |
| [0854-making-a-large-island](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0854-making-a-large-island) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [0999-regions-cut-by-slashes](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0999-regions-cut-by-slashes) |
| [1396-count-servers-that-communicate](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1396-count-servers-that-communicate) |
| [2035-count-sub-islands](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2035-count-sub-islands) |
| [2583-divide-nodes-into-the-maximum-number-of-groups](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2583-divide-nodes-into-the-maximum-number-of-groups) |
| [2764-maximum-number-of-fish-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2764-maximum-number-of-fish-in-a-grid) |
| [3219-make-lexicographically-smallest-array-by-swapping-elements](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3219-make-lexicographically-smallest-array-by-swapping-elements) |
## Strongly Connected Component
| |
| ------- |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
## Backtracking
| |
| ------- |
| [0022-generate-parentheses](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0022-generate-parentheses) |
| [0040-combination-sum-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0040-combination-sum-ii) |
| [0494-target-sum](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0494-target-sum) |
| [1160-letter-tile-possibilities](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1160-letter-tile-possibilities) |
| [1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) |
| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |
| [1819-construct-the-lexicographically-largest-valid-sequence](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1819-construct-the-lexicographically-largest-valid-sequence) |
| [2107-find-unique-binary-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2107-find-unique-binary-string) |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
| [2456-construct-smallest-number-from-di-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2456-construct-smallest-number-from-di-string) |
| [2802-find-the-punishment-number-of-an-integer](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2802-find-the-punishment-number-of-an-integer) |
## Tree
| |
| ------- |
| [0145-binary-tree-postorder-traversal](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0145-binary-tree-postorder-traversal) |
| [0515-find-largest-value-in-each-tree-row](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0515-find-largest-value-in-each-tree-row) |
| [0789-kth-largest-element-in-a-stream](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0789-kth-largest-element-in-a-stream) |
| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |
| [0988-flip-equivalent-binary-trees](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0988-flip-equivalent-binary-trees) |
| [1093-recover-a-tree-from-preorder-traversal](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1093-recover-a-tree-from-preorder-traversal) |
| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |
| [1484-linked-list-in-binary-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1484-linked-list-in-binary-tree) |
| [2493-reverse-odd-levels-of-binary-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2493-reverse-odd-levels-of-binary-tree) |
| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |
| [2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level) |
| [2564-most-profitable-path-in-a-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2564-most-profitable-path-in-a-tree) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
| [2677-cousins-in-binary-tree-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2677-cousins-in-binary-tree-ii) |
| [3058-maximum-number-of-k-divisible-components](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3058-maximum-number-of-k-divisible-components) |
| [3439-find-minimum-diameter-after-merging-two-trees](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3439-find-minimum-diameter-after-merging-two-trees) |
## Design
| |
| ------- |
| [0432-all-oone-data-structure](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0432-all-oone-data-structure) |
| [0729-my-calendar-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0729-my-calendar-i) |
| [0731-my-calendar-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0731-my-calendar-ii) |
| [0789-kth-largest-element-in-a-stream](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0789-kth-largest-element-in-a-stream) |
| [0859-design-circular-deque](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0859-design-circular-deque) |
| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |
| [1477-product-of-the-last-k-numbers](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1477-product-of-the-last-k-numbers) |
| [1497-design-a-stack-with-increment-operation](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1497-design-a-stack-with-increment-operation) |
| [2434-design-a-number-container-system](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2434-design-a-number-container-system) |
## Binary Search Tree
| |
| ------- |
| [0789-kth-largest-element-in-a-stream](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0789-kth-largest-element-in-a-stream) |
## Heap (Priority Queue)
| |
| ------- |
| [0407-trapping-rain-water-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0407-trapping-rain-water-ii) |
| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0632-smallest-range-covering-elements-from-k-lists) |
| [0789-kth-largest-element-in-a-stream](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0789-kth-largest-element-in-a-stream) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [1304-longest-happy-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1304-longest-happy-string) |
| [1325-path-with-maximum-probability](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1325-path-with-maximum-probability) |
| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |
| [1917-maximum-average-pass-ratio](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1917-maximum-average-pass-ratio) |
| [2054-the-number-of-the-smallest-unoccupied-chair](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2054-the-number-of-the-smallest-unoccupied-chair) |
| [2164-two-best-non-overlapping-events](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2164-two-best-non-overlapping-events) |
| [2300-construct-string-with-repeat-limit](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2300-construct-string-with-repeat-limit) |
| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |
| [2434-design-a-number-container-system](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2434-design-a-number-container-system) |
| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2616-maximal-score-after-applying-k-operations](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2616-maximal-score-after-applying-k-operations) |
| [2692-take-gifts-from-the-richest-pile](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2692-take-gifts-from-the-richest-pile) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |
| [2803-modify-graph-edge-weights](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2803-modify-graph-edge-weights) |
| [2868-continuous-subarrays](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2868-continuous-subarrays) |
| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3181-find-building-where-alice-and-bob-can-meet) |
| [3332-minimum-operations-to-exceed-threshold-value-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3332-minimum-operations-to-exceed-threshold-value-ii) |
| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |
## Binary Tree
| |
| ------- |
| [0145-binary-tree-postorder-traversal](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0145-binary-tree-postorder-traversal) |
| [0515-find-largest-value-in-each-tree-row](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0515-find-largest-value-in-each-tree-row) |
| [0789-kth-largest-element-in-a-stream](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0789-kth-largest-element-in-a-stream) |
| [0925-construct-binary-tree-from-preorder-and-postorder-traversal](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0925-construct-binary-tree-from-preorder-and-postorder-traversal) |
| [0988-flip-equivalent-binary-trees](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0988-flip-equivalent-binary-trees) |
| [1093-recover-a-tree-from-preorder-traversal](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1093-recover-a-tree-from-preorder-traversal) |
| [1387-find-elements-in-a-contaminated-binary-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1387-find-elements-in-a-contaminated-binary-tree) |
| [1484-linked-list-in-binary-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1484-linked-list-in-binary-tree) |
| [2493-reverse-odd-levels-of-binary-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2493-reverse-odd-levels-of-binary-tree) |
| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |
| [2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
| [2677-cousins-in-binary-tree-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2677-cousins-in-binary-tree-ii) |
## Data Stream
| |
| ------- |
| [0789-kth-largest-element-in-a-stream](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0789-kth-largest-element-in-a-stream) |
| [1477-product-of-the-last-k-numbers](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1477-product-of-the-last-k-numbers) |
## Two Pointers
| |
| ------- |
| [0567-permutation-in-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0567-permutation-in-string) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0719-find-k-th-smallest-pair-distance) |
| [1468-check-if-n-and-its-double-exist](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1468-check-if-n-and-its-double-exist) |
| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |
| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |
| [1923-sentence-similarity-iii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1923-sentence-similarity-iii) |
| [1972-rotating-the-box](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1972-rotating-the-box) |
| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |
| [2232-adding-spaces-to-a-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2232-adding-spaces-to-a-string) |
| [2265-partition-array-according-to-given-pivot](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2265-partition-array-according-to-given-pivot) |
| [2414-move-pieces-to-obtain-a-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2414-move-pieces-to-obtain-a-string) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2551-apply-operations-to-an-array](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2551-apply-operations-to-an-array) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2699-count-the-number-of-fair-pairs](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2699-count-the-number-of-fair-pairs) |
| [2707-merge-two-2d-arrays-by-summing-values](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2707-merge-two-2d-arrays-by-summing-values) |
| [3018-make-string-a-subsequence-using-cyclic-increments](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3018-make-string-a-subsequence-using-cyclic-increments) |
| [3195-separate-black-and-white-balls](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3195-separate-black-and-white-balls) |
## Prefix Sum
| |
| ------- |
| [0731-my-calendar-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0731-my-calendar-ii) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [1240-stone-game-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1240-stone-game-ii) |
| [1435-xor-queries-of-a-subarray](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1435-xor-queries-of-a-subarray) |
| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |
| [1477-product-of-the-last-k-numbers](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1477-product-of-the-last-k-numbers) |
| [1537-maximum-score-after-splitting-a-string](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1537-maximum-score-after-splitting-a-string) |
| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1631-number-of-sub-arrays-with-odd-sum) |
| [1694-make-sum-divisible-by-p](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1694-make-sum-divisible-by-p) |
| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |
| [1940-maximum-xor-for-each-query](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1940-maximum-xor-for-each-query) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2059-unique-length-3-palindromic-subsequences) |
| [2145-grid-game](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2145-grid-game) |
| [2358-number-of-ways-to-split-array](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2358-number-of-ways-to-split-array) |
| [2465-shifting-letters-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2465-shifting-letters-ii) |
| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |
| [2691-count-vowel-strings-in-ranges](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2691-count-vowel-strings-in-ranges) |
| [3427-special-array-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3427-special-array-ii) |
| [3643-zero-array-transformation-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3643-zero-array-transformation-ii) |
## Game Theory
| |
| ------- |
| [1240-stone-game-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1240-stone-game-ii) |
## Bit Manipulation
| |
| ------- |
| [0476-number-complement](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0476-number-complement) |
| [1435-xor-queries-of-a-subarray](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1435-xor-queries-of-a-subarray) |
| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |
| [1786-count-the-number-of-consistent-strings](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1786-count-the-number-of-consistent-strings) |
| [1940-maximum-xor-for-each-query](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1940-maximum-xor-for-each-query) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2059-unique-length-3-palindromic-subsequences) |
| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |
| [2323-minimum-bit-flips-to-convert-number](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2323-minimum-bit-flips-to-convert-number) |
| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |
| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |
| [2509-minimize-xor](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2509-minimize-xor) |
| [2533-bitwise-xor-of-all-pairings](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2533-bitwise-xor-of-all-pairings) |
| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |
| [2792-neighboring-bitwise-xor](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2792-neighboring-bitwise-xor) |
| [3291-find-if-array-can-be-sorted](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3291-find-if-array-can-be-sorted) |
| [3380-shortest-subarray-with-or-at-least-k-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3380-shortest-subarray-with-or-at-least-k-ii) |
| [3394-minimum-array-end](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3394-minimum-array-end) |
## Graph
| |
| ------- |
| [0684-redundant-connection](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0684-redundant-connection) |
| [0820-find-eventual-safe-states](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0820-find-eventual-safe-states) |
| [0984-most-stones-removed-with-same-row-or-column](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0984-most-stones-removed-with-same-row-or-column) |
| [1325-path-with-maximum-probability](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1325-path-with-maximum-probability) |
| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |
| [1558-course-schedule-iv](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1558-course-schedule-iv) |
| [2201-valid-arrangement-of-pairs](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2201-valid-arrangement-of-pairs) |
| [2246-maximum-employees-to-be-invited-to-a-meeting](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2246-maximum-employees-to-be-invited-to-a-meeting) |
| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |
| [2564-most-profitable-path-in-a-tree](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2564-most-profitable-path-in-a-tree) |
| [2583-divide-nodes-into-the-maximum-number-of-groups](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2583-divide-nodes-into-the-maximum-number-of-groups) |
| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |
| [2803-modify-graph-edge-weights](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2803-modify-graph-edge-weights) |
| [3189-find-champion-ii](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3189-find-champion-ii) |
| [3439-find-minimum-diameter-after-merging-two-trees](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3439-find-minimum-diameter-after-merging-two-trees) |
| [3517-shortest-distance-after-road-addition-queries-i](https://github.com/deepakkumar55/Leetcode-Question/tree/master/3517-shortest-distance-after-road-addition-queries-i) |
## Shortest Path
| |
| ------- |
| [1325-path-with-maximum-probability](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1325-path-with-maximum-probability) |
| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |
| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |
| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |
| [2803-modify-graph-edge-weights](https://github.com/deepakkumar55/Leetcode-Question/tree/master/2803-modify-graph-edge-weights) |
## Linked List
| |
| ------- |
| [0432-all-oone-data-structure](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0432-all-oone-data-structure) |
| [0725-split-linked-list-in-parts](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0725-split-linked-list-in-parts) |
| [0859-design-circular-deque](https://github.com/deepakkumar55/Leetcode-Question/tree/master/0859-design-circular-deque) |
| [1484-linked-list-in-binary-tree](https://gi