https://github.com/anshulkansal121/leetcode
https://github.com/anshulkansal121/leetcode
cpp dsa leetcode-cpp leetcode-solutions potd-leetcode
Last synced: 3 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/anshulkansal121/leetcode
- Owner: anshulkansal121
- Created: 2024-08-07T04:16:20.000Z (10 months ago)
- Default Branch: main
- Last Pushed: 2025-02-05T11:37:56.000Z (4 months ago)
- Last Synced: 2025-02-05T12:32:50.674Z (4 months ago)
- Topics: cpp, dsa, leetcode-cpp, leetcode-solutions, potd-leetcode
- Language: C++
- Homepage:
- Size: 306 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)
# LeetCode Topics
## Array
| |
| ------- |
| [0018-4sum](https://github.com/anshulkansal121/LeetCode/tree/master/0018-4sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0033-search-in-rotated-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0033-search-in-rotated-sorted-array) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/anshulkansal121/LeetCode/tree/master/0035-search-insert-position) |
| [0039-combination-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0039-combination-sum) |
| [0040-combination-sum-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0040-combination-sum-ii) |
| [0046-permutations](https://github.com/anshulkansal121/LeetCode/tree/master/0046-permutations) |
| [0047-permutations-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0047-permutations-ii) |
| [0048-rotate-image](https://github.com/anshulkansal121/LeetCode/tree/master/0048-rotate-image) |
| [0051-n-queens](https://github.com/anshulkansal121/LeetCode/tree/master/0051-n-queens) |
| [0054-spiral-matrix](https://github.com/anshulkansal121/LeetCode/tree/master/0054-spiral-matrix) |
| [0078-subsets](https://github.com/anshulkansal121/LeetCode/tree/master/0078-subsets) |
| [0081-search-in-rotated-sorted-array-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0081-search-in-rotated-sorted-array-ii) |
| [0090-subsets-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0090-subsets-ii) |
| [0128-longest-consecutive-sequence](https://github.com/anshulkansal121/LeetCode/tree/master/0128-longest-consecutive-sequence) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0162-find-peak-element](https://github.com/anshulkansal121/LeetCode/tree/master/0162-find-peak-element) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/anshulkansal121/LeetCode/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0189-rotate-array](https://github.com/anshulkansal121/LeetCode/tree/master/0189-rotate-array) |
| [0204-count-primes](https://github.com/anshulkansal121/LeetCode/tree/master/0204-count-primes) |
| [0209-minimum-size-subarray-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0209-minimum-size-subarray-sum) |
| [0216-combination-sum-iii](https://github.com/anshulkansal121/LeetCode/tree/master/0216-combination-sum-iii) |
| [0229-majority-element-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0229-majority-element-ii) |
| [0485-max-consecutive-ones](https://github.com/anshulkansal121/LeetCode/tree/master/0485-max-consecutive-ones) |
| [0496-next-greater-element-i](https://github.com/anshulkansal121/LeetCode/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0503-next-greater-element-ii) |
| [0540-single-element-in-a-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0540-single-element-in-a-sorted-array) |
| [0560-subarray-sum-equals-k](https://github.com/anshulkansal121/LeetCode/tree/master/0560-subarray-sum-equals-k) |
| [0624-maximum-distance-in-arrays](https://github.com/anshulkansal121/LeetCode/tree/master/0624-maximum-distance-in-arrays) |
| [0643-maximum-average-subarray-i](https://github.com/anshulkansal121/LeetCode/tree/master/0643-maximum-average-subarray-i) |
| [0724-find-pivot-index](https://github.com/anshulkansal121/LeetCode/tree/master/0724-find-pivot-index) |
| [0735-asteroid-collision](https://github.com/anshulkansal121/LeetCode/tree/master/0735-asteroid-collision) |
| [0870-magic-squares-in-grid](https://github.com/anshulkansal121/LeetCode/tree/master/0870-magic-squares-in-grid) |
| [0890-lemonade-change](https://github.com/anshulkansal121/LeetCode/tree/master/0890-lemonade-change) |
| [0921-spiral-matrix-iii](https://github.com/anshulkansal121/LeetCode/tree/master/0921-spiral-matrix-iii) |
| [0943-sum-of-subarray-minimums](https://github.com/anshulkansal121/LeetCode/tree/master/0943-sum-of-subarray-minimums) |
| [0966-binary-subarrays-with-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0966-binary-subarrays-with-sum) |
| [1002-maximum-width-ramp](https://github.com/anshulkansal121/LeetCode/tree/master/1002-maximum-width-ramp) |
| [1063-best-sightseeing-pair](https://github.com/anshulkansal121/LeetCode/tree/master/1063-best-sightseeing-pair) |
| [1370-count-number-of-nice-subarrays](https://github.com/anshulkansal121/LeetCode/tree/master/1370-count-number-of-nice-subarrays) |
| [1392-find-the-difference-of-two-arrays](https://github.com/anshulkansal121/LeetCode/tree/master/1392-find-the-difference-of-two-arrays) |
| [1468-check-if-n-and-its-double-exist](https://github.com/anshulkansal121/LeetCode/tree/master/1468-check-if-n-and-its-double-exist) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/anshulkansal121/LeetCode/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/anshulkansal121/LeetCode/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/anshulkansal121/LeetCode/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
| [1694-make-sum-divisible-by-p](https://github.com/anshulkansal121/LeetCode/tree/master/1694-make-sum-divisible-by-p) |
| [1798-max-number-of-k-sum-pairs](https://github.com/anshulkansal121/LeetCode/tree/master/1798-max-number-of-k-sum-pairs) |
| [1833-find-the-highest-altitude](https://github.com/anshulkansal121/LeetCode/tree/master/1833-find-the-highest-altitude) |
| [1878-check-if-array-is-sorted-and-rotated](https://github.com/anshulkansal121/LeetCode/tree/master/1878-check-if-array-is-sorted-and-rotated) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/anshulkansal121/LeetCode/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [2067-maximum-number-of-points-with-cost](https://github.com/anshulkansal121/LeetCode/tree/master/2067-maximum-number-of-points-with-cost) |
| [2132-convert-1d-array-into-2d-array](https://github.com/anshulkansal121/LeetCode/tree/master/2132-convert-1d-array-into-2d-array) |
| [2227-sum-of-subarray-ranges](https://github.com/anshulkansal121/LeetCode/tree/master/2227-sum-of-subarray-ranges) |
| [2232-adding-spaces-to-a-string](https://github.com/anshulkansal121/LeetCode/tree/master/2232-adding-spaces-to-a-string) |
| [2428-equal-row-and-column-pairs](https://github.com/anshulkansal121/LeetCode/tree/master/2428-equal-row-and-column-pairs) |
| [2616-maximal-score-after-applying-k-operations](https://github.com/anshulkansal121/LeetCode/tree/master/2616-maximal-score-after-applying-k-operations) |
| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/anshulkansal121/LeetCode/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/anshulkansal121/LeetCode/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
| [2764-maximum-number-of-fish-in-a-grid](https://github.com/anshulkansal121/LeetCode/tree/master/2764-maximum-number-of-fish-in-a-grid) |
| [3427-special-array-ii](https://github.com/anshulkansal121/LeetCode/tree/master/3427-special-array-ii) |
| [3526-minimum-number-of-flips-to-make-binary-grid-palindromic-i](https://github.com/anshulkansal121/LeetCode/tree/master/3526-minimum-number-of-flips-to-make-binary-grid-palindromic-i) |
## Matrix
| |
| ------- |
| [0048-rotate-image](https://github.com/anshulkansal121/LeetCode/tree/master/0048-rotate-image) |
| [0054-spiral-matrix](https://github.com/anshulkansal121/LeetCode/tree/master/0054-spiral-matrix) |
| [0870-magic-squares-in-grid](https://github.com/anshulkansal121/LeetCode/tree/master/0870-magic-squares-in-grid) |
| [0921-spiral-matrix-iii](https://github.com/anshulkansal121/LeetCode/tree/master/0921-spiral-matrix-iii) |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/anshulkansal121/LeetCode/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
| [2132-convert-1d-array-into-2d-array](https://github.com/anshulkansal121/LeetCode/tree/master/2132-convert-1d-array-into-2d-array) |
| [2428-equal-row-and-column-pairs](https://github.com/anshulkansal121/LeetCode/tree/master/2428-equal-row-and-column-pairs) |
| [2764-maximum-number-of-fish-in-a-grid](https://github.com/anshulkansal121/LeetCode/tree/master/2764-maximum-number-of-fish-in-a-grid) |
| [3526-minimum-number-of-flips-to-make-binary-grid-palindromic-i](https://github.com/anshulkansal121/LeetCode/tree/master/3526-minimum-number-of-flips-to-make-binary-grid-palindromic-i) |
## Simulation
| |
| ------- |
| [0054-spiral-matrix](https://github.com/anshulkansal121/LeetCode/tree/master/0054-spiral-matrix) |
| [0735-asteroid-collision](https://github.com/anshulkansal121/LeetCode/tree/master/0735-asteroid-collision) |
| [0921-spiral-matrix-iii](https://github.com/anshulkansal121/LeetCode/tree/master/0921-spiral-matrix-iii) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/anshulkansal121/LeetCode/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [2132-convert-1d-array-into-2d-array](https://github.com/anshulkansal121/LeetCode/tree/master/2132-convert-1d-array-into-2d-array) |
| [2232-adding-spaces-to-a-string](https://github.com/anshulkansal121/LeetCode/tree/master/2232-adding-spaces-to-a-string) |
| [2428-equal-row-and-column-pairs](https://github.com/anshulkansal121/LeetCode/tree/master/2428-equal-row-and-column-pairs) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/anshulkansal121/LeetCode/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
## Math
| |
| ------- |
| [0029-divide-two-integers](https://github.com/anshulkansal121/LeetCode/tree/master/0029-divide-two-integers) |
| [0048-rotate-image](https://github.com/anshulkansal121/LeetCode/tree/master/0048-rotate-image) |
| [0050-powx-n](https://github.com/anshulkansal121/LeetCode/tree/master/0050-powx-n) |
| [0070-climbing-stairs](https://github.com/anshulkansal121/LeetCode/tree/master/0070-climbing-stairs) |
| [0189-rotate-array](https://github.com/anshulkansal121/LeetCode/tree/master/0189-rotate-array) |
| [0204-count-primes](https://github.com/anshulkansal121/LeetCode/tree/master/0204-count-primes) |
| [0231-power-of-two](https://github.com/anshulkansal121/LeetCode/tree/master/0231-power-of-two) |
| [0273-integer-to-english-words](https://github.com/anshulkansal121/LeetCode/tree/master/0273-integer-to-english-words) |
| [0650-2-keys-keyboard](https://github.com/anshulkansal121/LeetCode/tree/master/0650-2-keys-keyboard) |
| [0870-magic-squares-in-grid](https://github.com/anshulkansal121/LeetCode/tree/master/0870-magic-squares-in-grid) |
| [1370-count-number-of-nice-subarrays](https://github.com/anshulkansal121/LeetCode/tree/master/1370-count-number-of-nice-subarrays) |
## String
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/anshulkansal121/LeetCode/tree/master/0003-longest-substring-without-repeating-characters) |
| [0008-string-to-integer-atoi](https://github.com/anshulkansal121/LeetCode/tree/master/0008-string-to-integer-atoi) |
| [0022-generate-parentheses](https://github.com/anshulkansal121/LeetCode/tree/master/0022-generate-parentheses) |
| [0072-edit-distance](https://github.com/anshulkansal121/LeetCode/tree/master/0072-edit-distance) |
| [0131-palindrome-partitioning](https://github.com/anshulkansal121/LeetCode/tree/master/0131-palindrome-partitioning) |
| [0151-reverse-words-in-a-string](https://github.com/anshulkansal121/LeetCode/tree/master/0151-reverse-words-in-a-string) |
| [0273-integer-to-english-words](https://github.com/anshulkansal121/LeetCode/tree/master/0273-integer-to-english-words) |
| [0402-remove-k-digits](https://github.com/anshulkansal121/LeetCode/tree/master/0402-remove-k-digits) |
| [0424-longest-repeating-character-replacement](https://github.com/anshulkansal121/LeetCode/tree/master/0424-longest-repeating-character-replacement) |
| [0451-sort-characters-by-frequency](https://github.com/anshulkansal121/LeetCode/tree/master/0451-sort-characters-by-frequency) |
| [0920-uncommon-words-from-two-sentences](https://github.com/anshulkansal121/LeetCode/tree/master/0920-uncommon-words-from-two-sentences) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/anshulkansal121/LeetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/anshulkansal121/LeetCode/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |
| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/anshulkansal121/LeetCode/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |
| [1777-determine-if-two-strings-are-close](https://github.com/anshulkansal121/LeetCode/tree/master/1777-determine-if-two-strings-are-close) |
| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/anshulkansal121/LeetCode/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |
| [2232-adding-spaces-to-a-string](https://github.com/anshulkansal121/LeetCode/tree/master/2232-adding-spaces-to-a-string) |
| [3018-make-string-a-subsequence-using-cyclic-increments](https://github.com/anshulkansal121/LeetCode/tree/master/3018-make-string-a-subsequence-using-cyclic-increments) |
## Recursion
| |
| ------- |
| [0025-reverse-nodes-in-k-group](https://github.com/anshulkansal121/LeetCode/tree/master/0025-reverse-nodes-in-k-group) |
| [0050-powx-n](https://github.com/anshulkansal121/LeetCode/tree/master/0050-powx-n) |
| [0231-power-of-two](https://github.com/anshulkansal121/LeetCode/tree/master/0231-power-of-two) |
| [0273-integer-to-english-words](https://github.com/anshulkansal121/LeetCode/tree/master/0273-integer-to-english-words) |
## Prefix Sum
| |
| ------- |
| [0209-minimum-size-subarray-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0209-minimum-size-subarray-sum) |
| [0560-subarray-sum-equals-k](https://github.com/anshulkansal121/LeetCode/tree/master/0560-subarray-sum-equals-k) |
| [0724-find-pivot-index](https://github.com/anshulkansal121/LeetCode/tree/master/0724-find-pivot-index) |
| [0966-binary-subarrays-with-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0966-binary-subarrays-with-sum) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/anshulkansal121/LeetCode/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1694-make-sum-divisible-by-p](https://github.com/anshulkansal121/LeetCode/tree/master/1694-make-sum-divisible-by-p) |
| [1833-find-the-highest-altitude](https://github.com/anshulkansal121/LeetCode/tree/master/1833-find-the-highest-altitude) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/anshulkansal121/LeetCode/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [3427-special-array-ii](https://github.com/anshulkansal121/LeetCode/tree/master/3427-special-array-ii) |
## Sliding Window
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/anshulkansal121/LeetCode/tree/master/0003-longest-substring-without-repeating-characters) |
| [0209-minimum-size-subarray-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0209-minimum-size-subarray-sum) |
| [0424-longest-repeating-character-replacement](https://github.com/anshulkansal121/LeetCode/tree/master/0424-longest-repeating-character-replacement) |
| [0643-maximum-average-subarray-i](https://github.com/anshulkansal121/LeetCode/tree/master/0643-maximum-average-subarray-i) |
| [0966-binary-subarrays-with-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0966-binary-subarrays-with-sum) |
| [1370-count-number-of-nice-subarrays](https://github.com/anshulkansal121/LeetCode/tree/master/1370-count-number-of-nice-subarrays) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/anshulkansal121/LeetCode/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/anshulkansal121/LeetCode/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |
## Dynamic Programming
| |
| ------- |
| [0022-generate-parentheses](https://github.com/anshulkansal121/LeetCode/tree/master/0022-generate-parentheses) |
| [0070-climbing-stairs](https://github.com/anshulkansal121/LeetCode/tree/master/0070-climbing-stairs) |
| [0072-edit-distance](https://github.com/anshulkansal121/LeetCode/tree/master/0072-edit-distance) |
| [0131-palindrome-partitioning](https://github.com/anshulkansal121/LeetCode/tree/master/0131-palindrome-partitioning) |
| [0650-2-keys-keyboard](https://github.com/anshulkansal121/LeetCode/tree/master/0650-2-keys-keyboard) |
| [0943-sum-of-subarray-minimums](https://github.com/anshulkansal121/LeetCode/tree/master/0943-sum-of-subarray-minimums) |
| [1063-best-sightseeing-pair](https://github.com/anshulkansal121/LeetCode/tree/master/1063-best-sightseeing-pair) |
| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/anshulkansal121/LeetCode/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |
| [2067-maximum-number-of-points-with-cost](https://github.com/anshulkansal121/LeetCode/tree/master/2067-maximum-number-of-points-with-cost) |
## Hash Table
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/anshulkansal121/LeetCode/tree/master/0003-longest-substring-without-repeating-characters) |
| [0128-longest-consecutive-sequence](https://github.com/anshulkansal121/LeetCode/tree/master/0128-longest-consecutive-sequence) |
| [0160-intersection-of-two-linked-lists](https://github.com/anshulkansal121/LeetCode/tree/master/0160-intersection-of-two-linked-lists) |
| [0229-majority-element-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0229-majority-element-ii) |
| [0424-longest-repeating-character-replacement](https://github.com/anshulkansal121/LeetCode/tree/master/0424-longest-repeating-character-replacement) |
| [0451-sort-characters-by-frequency](https://github.com/anshulkansal121/LeetCode/tree/master/0451-sort-characters-by-frequency) |
| [0496-next-greater-element-i](https://github.com/anshulkansal121/LeetCode/tree/master/0496-next-greater-element-i) |
| [0560-subarray-sum-equals-k](https://github.com/anshulkansal121/LeetCode/tree/master/0560-subarray-sum-equals-k) |
| [0870-magic-squares-in-grid](https://github.com/anshulkansal121/LeetCode/tree/master/0870-magic-squares-in-grid) |
| [0920-uncommon-words-from-two-sentences](https://github.com/anshulkansal121/LeetCode/tree/master/0920-uncommon-words-from-two-sentences) |
| [0966-binary-subarrays-with-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0966-binary-subarrays-with-sum) |
| [1370-count-number-of-nice-subarrays](https://github.com/anshulkansal121/LeetCode/tree/master/1370-count-number-of-nice-subarrays) |
| [1392-find-the-difference-of-two-arrays](https://github.com/anshulkansal121/LeetCode/tree/master/1392-find-the-difference-of-two-arrays) |
| [1468-check-if-n-and-its-double-exist](https://github.com/anshulkansal121/LeetCode/tree/master/1468-check-if-n-and-its-double-exist) |
| [1694-make-sum-divisible-by-p](https://github.com/anshulkansal121/LeetCode/tree/master/1694-make-sum-divisible-by-p) |
| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/anshulkansal121/LeetCode/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |
| [1777-determine-if-two-strings-are-close](https://github.com/anshulkansal121/LeetCode/tree/master/1777-determine-if-two-strings-are-close) |
| [1798-max-number-of-k-sum-pairs](https://github.com/anshulkansal121/LeetCode/tree/master/1798-max-number-of-k-sum-pairs) |
| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/anshulkansal121/LeetCode/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |
| [2428-equal-row-and-column-pairs](https://github.com/anshulkansal121/LeetCode/tree/master/2428-equal-row-and-column-pairs) |
| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/anshulkansal121/LeetCode/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/anshulkansal121/LeetCode/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
## Two Pointers
| |
| ------- |
| [0018-4sum](https://github.com/anshulkansal121/LeetCode/tree/master/0018-4sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0061-rotate-list](https://github.com/anshulkansal121/LeetCode/tree/master/0061-rotate-list) |
| [0086-partition-list](https://github.com/anshulkansal121/LeetCode/tree/master/0086-partition-list) |
| [0148-sort-list](https://github.com/anshulkansal121/LeetCode/tree/master/0148-sort-list) |
| [0151-reverse-words-in-a-string](https://github.com/anshulkansal121/LeetCode/tree/master/0151-reverse-words-in-a-string) |
| [0160-intersection-of-two-linked-lists](https://github.com/anshulkansal121/LeetCode/tree/master/0160-intersection-of-two-linked-lists) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/anshulkansal121/LeetCode/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0189-rotate-array](https://github.com/anshulkansal121/LeetCode/tree/master/0189-rotate-array) |
| [0528-swapping-nodes-in-a-linked-list](https://github.com/anshulkansal121/LeetCode/tree/master/0528-swapping-nodes-in-a-linked-list) |
| [1468-check-if-n-and-its-double-exist](https://github.com/anshulkansal121/LeetCode/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/anshulkansal121/LeetCode/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |
| [1798-max-number-of-k-sum-pairs](https://github.com/anshulkansal121/LeetCode/tree/master/1798-max-number-of-k-sum-pairs) |
| [2232-adding-spaces-to-a-string](https://github.com/anshulkansal121/LeetCode/tree/master/2232-adding-spaces-to-a-string) |
| [3018-make-string-a-subsequence-using-cyclic-increments](https://github.com/anshulkansal121/LeetCode/tree/master/3018-make-string-a-subsequence-using-cyclic-increments) |
| [3526-minimum-number-of-flips-to-make-binary-grid-palindromic-i](https://github.com/anshulkansal121/LeetCode/tree/master/3526-minimum-number-of-flips-to-make-binary-grid-palindromic-i) |
## Sorting
| |
| ------- |
| [0018-4sum](https://github.com/anshulkansal121/LeetCode/tree/master/0018-4sum) |
| [0148-sort-list](https://github.com/anshulkansal121/LeetCode/tree/master/0148-sort-list) |
| [0229-majority-element-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0229-majority-element-ii) |
| [0451-sort-characters-by-frequency](https://github.com/anshulkansal121/LeetCode/tree/master/0451-sort-characters-by-frequency) |
| [1468-check-if-n-and-its-double-exist](https://github.com/anshulkansal121/LeetCode/tree/master/1468-check-if-n-and-its-double-exist) |
| [1777-determine-if-two-strings-are-close](https://github.com/anshulkansal121/LeetCode/tree/master/1777-determine-if-two-strings-are-close) |
| [1798-max-number-of-k-sum-pairs](https://github.com/anshulkansal121/LeetCode/tree/master/1798-max-number-of-k-sum-pairs) |
| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/anshulkansal121/LeetCode/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/anshulkansal121/LeetCode/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
## Counting
| |
| ------- |
| [0229-majority-element-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0229-majority-element-ii) |
| [0451-sort-characters-by-frequency](https://github.com/anshulkansal121/LeetCode/tree/master/0451-sort-characters-by-frequency) |
| [0920-uncommon-words-from-two-sentences](https://github.com/anshulkansal121/LeetCode/tree/master/0920-uncommon-words-from-two-sentences) |
| [1777-determine-if-two-strings-are-close](https://github.com/anshulkansal121/LeetCode/tree/master/1777-determine-if-two-strings-are-close) |
| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/anshulkansal121/LeetCode/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |
## Union Find
| |
| ------- |
| [0128-longest-consecutive-sequence](https://github.com/anshulkansal121/LeetCode/tree/master/0128-longest-consecutive-sequence) |
| [2583-divide-nodes-into-the-maximum-number-of-groups](https://github.com/anshulkansal121/LeetCode/tree/master/2583-divide-nodes-into-the-maximum-number-of-groups) |
| [2764-maximum-number-of-fish-in-a-grid](https://github.com/anshulkansal121/LeetCode/tree/master/2764-maximum-number-of-fish-in-a-grid) |
## Linked List
| |
| ------- |
| [0025-reverse-nodes-in-k-group](https://github.com/anshulkansal121/LeetCode/tree/master/0025-reverse-nodes-in-k-group) |
| [0061-rotate-list](https://github.com/anshulkansal121/LeetCode/tree/master/0061-rotate-list) |
| [0086-partition-list](https://github.com/anshulkansal121/LeetCode/tree/master/0086-partition-list) |
| [0092-reverse-linked-list-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0092-reverse-linked-list-ii) |
| [0148-sort-list](https://github.com/anshulkansal121/LeetCode/tree/master/0148-sort-list) |
| [0160-intersection-of-two-linked-lists](https://github.com/anshulkansal121/LeetCode/tree/master/0160-intersection-of-two-linked-lists) |
| [0328-odd-even-linked-list](https://github.com/anshulkansal121/LeetCode/tree/master/0328-odd-even-linked-list) |
| [0528-swapping-nodes-in-a-linked-list](https://github.com/anshulkansal121/LeetCode/tree/master/0528-swapping-nodes-in-a-linked-list) |
## Tree
| |
| ------- |
| [0112-path-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0112-path-sum) |
| [0113-path-sum-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0113-path-sum-ii) |
| [0776-n-ary-tree-postorder-traversal](https://github.com/anshulkansal121/LeetCode/tree/master/0776-n-ary-tree-postorder-traversal) |
## Depth-First Search
| |
| ------- |
| [0112-path-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0112-path-sum) |
| [0113-path-sum-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0113-path-sum-ii) |
| [0776-n-ary-tree-postorder-traversal](https://github.com/anshulkansal121/LeetCode/tree/master/0776-n-ary-tree-postorder-traversal) |
| [0820-find-eventual-safe-states](https://github.com/anshulkansal121/LeetCode/tree/master/0820-find-eventual-safe-states) |
| [1558-course-schedule-iv](https://github.com/anshulkansal121/LeetCode/tree/master/1558-course-schedule-iv) |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/anshulkansal121/LeetCode/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
| [2246-maximum-employees-to-be-invited-to-a-meeting](https://github.com/anshulkansal121/LeetCode/tree/master/2246-maximum-employees-to-be-invited-to-a-meeting) |
| [2764-maximum-number-of-fish-in-a-grid](https://github.com/anshulkansal121/LeetCode/tree/master/2764-maximum-number-of-fish-in-a-grid) |
## Breadth-First Search
| |
| ------- |
| [0112-path-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0112-path-sum) |
| [0820-find-eventual-safe-states](https://github.com/anshulkansal121/LeetCode/tree/master/0820-find-eventual-safe-states) |
| [1558-course-schedule-iv](https://github.com/anshulkansal121/LeetCode/tree/master/1558-course-schedule-iv) |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/anshulkansal121/LeetCode/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
| [2583-divide-nodes-into-the-maximum-number-of-groups](https://github.com/anshulkansal121/LeetCode/tree/master/2583-divide-nodes-into-the-maximum-number-of-groups) |
| [2764-maximum-number-of-fish-in-a-grid](https://github.com/anshulkansal121/LeetCode/tree/master/2764-maximum-number-of-fish-in-a-grid) |
## Binary Tree
| |
| ------- |
| [0112-path-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0112-path-sum) |
| [0113-path-sum-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0113-path-sum-ii) |
## Backtracking
| |
| ------- |
| [0022-generate-parentheses](https://github.com/anshulkansal121/LeetCode/tree/master/0022-generate-parentheses) |
| [0039-combination-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0039-combination-sum) |
| [0040-combination-sum-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0040-combination-sum-ii) |
| [0046-permutations](https://github.com/anshulkansal121/LeetCode/tree/master/0046-permutations) |
| [0047-permutations-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0047-permutations-ii) |
| [0051-n-queens](https://github.com/anshulkansal121/LeetCode/tree/master/0051-n-queens) |
| [0078-subsets](https://github.com/anshulkansal121/LeetCode/tree/master/0078-subsets) |
| [0090-subsets-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0090-subsets-ii) |
| [0113-path-sum-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0113-path-sum-ii) |
| [0131-palindrome-partitioning](https://github.com/anshulkansal121/LeetCode/tree/master/0131-palindrome-partitioning) |
| [0216-combination-sum-iii](https://github.com/anshulkansal121/LeetCode/tree/master/0216-combination-sum-iii) |
| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/anshulkansal121/LeetCode/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |
## Strongly Connected Component
| |
| ------- |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/anshulkansal121/LeetCode/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
## Binary Search
| |
| ------- |
| [0033-search-in-rotated-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0033-search-in-rotated-sorted-array) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/anshulkansal121/LeetCode/tree/master/0035-search-insert-position) |
| [0081-search-in-rotated-sorted-array-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0081-search-in-rotated-sorted-array-ii) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0162-find-peak-element](https://github.com/anshulkansal121/LeetCode/tree/master/0162-find-peak-element) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/anshulkansal121/LeetCode/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0209-minimum-size-subarray-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0209-minimum-size-subarray-sum) |
| [0540-single-element-in-a-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0540-single-element-in-a-sorted-array) |
| [1468-check-if-n-and-its-double-exist](https://github.com/anshulkansal121/LeetCode/tree/master/1468-check-if-n-and-its-double-exist) |
| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/anshulkansal121/LeetCode/tree/master/2006-find-the-student-that-will-replace-the-chalk) |
| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/anshulkansal121/LeetCode/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |
| [3427-special-array-ii](https://github.com/anshulkansal121/LeetCode/tree/master/3427-special-array-ii) |
## Divide and Conquer
| |
| ------- |
| [0148-sort-list](https://github.com/anshulkansal121/LeetCode/tree/master/0148-sort-list) |
## Merge Sort
| |
| ------- |
| [0148-sort-list](https://github.com/anshulkansal121/LeetCode/tree/master/0148-sort-list) |
## Heap (Priority Queue)
| |
| ------- |
| [0451-sort-characters-by-frequency](https://github.com/anshulkansal121/LeetCode/tree/master/0451-sort-characters-by-frequency) |
| [2616-maximal-score-after-applying-k-operations](https://github.com/anshulkansal121/LeetCode/tree/master/2616-maximal-score-after-applying-k-operations) |
| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/anshulkansal121/LeetCode/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |
## Bucket Sort
| |
| ------- |
| [0451-sort-characters-by-frequency](https://github.com/anshulkansal121/LeetCode/tree/master/0451-sort-characters-by-frequency) |
## Stack
| |
| ------- |
| [0155-min-stack](https://github.com/anshulkansal121/LeetCode/tree/master/0155-min-stack) |
| [0402-remove-k-digits](https://github.com/anshulkansal121/LeetCode/tree/master/0402-remove-k-digits) |
| [0496-next-greater-element-i](https://github.com/anshulkansal121/LeetCode/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0503-next-greater-element-ii) |
| [0735-asteroid-collision](https://github.com/anshulkansal121/LeetCode/tree/master/0735-asteroid-collision) |
| [0776-n-ary-tree-postorder-traversal](https://github.com/anshulkansal121/LeetCode/tree/master/0776-n-ary-tree-postorder-traversal) |
| [0943-sum-of-subarray-minimums](https://github.com/anshulkansal121/LeetCode/tree/master/0943-sum-of-subarray-minimums) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/anshulkansal121/LeetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1002-maximum-width-ramp](https://github.com/anshulkansal121/LeetCode/tree/master/1002-maximum-width-ramp) |
| [2227-sum-of-subarray-ranges](https://github.com/anshulkansal121/LeetCode/tree/master/2227-sum-of-subarray-ranges) |
## Design
| |
| ------- |
| [0155-min-stack](https://github.com/anshulkansal121/LeetCode/tree/master/0155-min-stack) |
## Greedy
| |
| ------- |
| [0402-remove-k-digits](https://github.com/anshulkansal121/LeetCode/tree/master/0402-remove-k-digits) |
| [0624-maximum-distance-in-arrays](https://github.com/anshulkansal121/LeetCode/tree/master/0624-maximum-distance-in-arrays) |
| [0890-lemonade-change](https://github.com/anshulkansal121/LeetCode/tree/master/0890-lemonade-change) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/anshulkansal121/LeetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [2616-maximal-score-after-applying-k-operations](https://github.com/anshulkansal121/LeetCode/tree/master/2616-maximal-score-after-applying-k-operations) |
| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/anshulkansal121/LeetCode/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |
## Monotonic Stack
| |
| ------- |
| [0402-remove-k-digits](https://github.com/anshulkansal121/LeetCode/tree/master/0402-remove-k-digits) |
| [0496-next-greater-element-i](https://github.com/anshulkansal121/LeetCode/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0503-next-greater-element-ii) |
| [0943-sum-of-subarray-minimums](https://github.com/anshulkansal121/LeetCode/tree/master/0943-sum-of-subarray-minimums) |
| [1002-maximum-width-ramp](https://github.com/anshulkansal121/LeetCode/tree/master/1002-maximum-width-ramp) |
| [2227-sum-of-subarray-ranges](https://github.com/anshulkansal121/LeetCode/tree/master/2227-sum-of-subarray-ranges) |
## Bit Manipulation
| |
| ------- |
| [0029-divide-two-integers](https://github.com/anshulkansal121/LeetCode/tree/master/0029-divide-two-integers) |
| [0078-subsets](https://github.com/anshulkansal121/LeetCode/tree/master/0078-subsets) |
| [0090-subsets-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0090-subsets-ii) |
| [0231-power-of-two](https://github.com/anshulkansal121/LeetCode/tree/master/0231-power-of-two) |
| [2323-minimum-bit-flips-to-convert-number](https://github.com/anshulkansal121/LeetCode/tree/master/2323-minimum-bit-flips-to-convert-number) |
## Enumeration
| |
| ------- |
| [0204-count-primes](https://github.com/anshulkansal121/LeetCode/tree/master/0204-count-primes) |
## Number Theory
| |
| ------- |
| [0204-count-primes](https://github.com/anshulkansal121/LeetCode/tree/master/0204-count-primes) |
## Memoization
| |
| ------- |
| [0070-climbing-stairs](https://github.com/anshulkansal121/LeetCode/tree/master/0070-climbing-stairs) |
## String Matching
| |
| ------- |
| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/anshulkansal121/LeetCode/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |
## Graph
| |
| ------- |
| [0820-find-eventual-safe-states](https://github.com/anshulkansal121/LeetCode/tree/master/0820-find-eventual-safe-states) |
| [1558-course-schedule-iv](https://github.com/anshulkansal121/LeetCode/tree/master/1558-course-schedule-iv) |
| [2246-maximum-employees-to-be-invited-to-a-meeting](https://github.com/anshulkansal121/LeetCode/tree/master/2246-maximum-employees-to-be-invited-to-a-meeting) |
| [2583-divide-nodes-into-the-maximum-number-of-groups](https://github.com/anshulkansal121/LeetCode/tree/master/2583-divide-nodes-into-the-maximum-number-of-groups) |
## Topological Sort
| |
| ------- |
| [0820-find-eventual-safe-states](https://github.com/anshulkansal121/LeetCode/tree/master/0820-find-eventual-safe-states) |
| [1558-course-schedule-iv](https://github.com/anshulkansal121/LeetCode/tree/master/1558-course-schedule-iv) |
| [2246-maximum-employees-to-be-invited-to-a-meeting](https://github.com/anshulkansal121/LeetCode/tree/master/2246-maximum-employees-to-be-invited-to-a-meeting) |