https://github.com/vickyy234/leetcode-solutions
Solutions for LeetCode problems
https://github.com/vickyy234/leetcode-solutions
c dsa-algorithm java problem-solving
Last synced: 6 months ago
JSON representation
Solutions for LeetCode problems
- Host: GitHub
- URL: https://github.com/vickyy234/leetcode-solutions
- Owner: vickyy234
- Created: 2025-01-31T17:42:20.000Z (11 months ago)
- Default Branch: main
- Last Pushed: 2025-06-14T16:49:12.000Z (6 months ago)
- Last Synced: 2025-06-14T17:37:55.748Z (6 months ago)
- Topics: c, dsa-algorithm, java, problem-solving
- Language: C
- Homepage: https://leetcode.com/u/vickyy234/
- Size: 825 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
| |
| ------- |
| [0001-two-sum](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0001-two-sum) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0048-rotate-image](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0048-rotate-image) |
| [0054-spiral-matrix](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0054-spiral-matrix) |
| [0055-jump-game](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0055-jump-game) |
| [0059-spiral-matrix-ii](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0059-spiral-matrix-ii) |
| [0066-plus-one](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0066-plus-one) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0118-pascals-triangle](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0118-pascals-triangle) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0189-rotate-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0189-rotate-array) |
| [0204-count-primes](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0204-count-primes) |
| [0217-contains-duplicate](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0217-contains-duplicate) |
| [0349-intersection-of-two-arrays](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0349-intersection-of-two-arrays) |
| [0442-find-all-duplicates-in-an-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0442-find-all-duplicates-in-an-array) |
| [0966-binary-subarrays-with-sum](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0966-binary-subarrays-with-sum) |
| [0979-di-string-match](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0979-di-string-match) |
| [1241-decompress-run-length-encoded-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1241-decompress-run-length-encoded-list) |
| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1560-number-of-students-doing-homework-at-a-given-time](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1560-number-of-students-doing-homework-at-a-given-time) |
| [1682-most-visited-sector-in-a-circular-track](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1682-most-visited-sector-in-a-circular-track) |
| [1878-check-if-array-is-sorted-and-rotated](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1878-check-if-array-is-sorted-and-rotated) |
| [1950-sign-of-the-product-of-an-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1950-sign-of-the-product-of-an-array) |
| [1988-minimize-maximum-pair-sum-in-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1988-minimize-maximum-pair-sum-in-array) |
| [2077-largest-number-after-mutating-substring](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2077-largest-number-after-mutating-substring) |
| [2159-two-out-of-three](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2159-two-out-of-three) |
| [2232-adding-spaces-to-a-string](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2232-adding-spaces-to-a-string) |
| [2265-partition-array-according-to-given-pivot](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2265-partition-array-according-to-given-pivot) |
| [2398-check-if-matrix-is-x-matrix](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2398-check-if-matrix-is-x-matrix) |
| [2411-spiral-matrix-iv](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2411-spiral-matrix-iv) |
| [2551-apply-operations-to-an-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2551-apply-operations-to-an-array) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2836-neither-minimum-nor-maximum](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2836-neither-minimum-nor-maximum) |
| [2845-find-the-value-of-the-partition](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2845-find-the-value-of-the-partition) |
| [3324-split-the-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3324-split-the-array) |
| [3372-longest-strictly-increasing-or-strictly-decreasing-subarray](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3372-longest-strictly-increasing-or-strictly-decreasing-subarray) |
| [3373-maximum-prime-difference](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3373-maximum-prime-difference) |
| [3429-special-array-i](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3429-special-array-i) |
| [3476-find-minimum-operations-to-make-all-elements-divisible-by-three](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3476-find-minimum-operations-to-make-all-elements-divisible-by-three) |
| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
| [3533-snake-in-matrix](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3533-snake-in-matrix) |
| [3621-minimum-operations-to-make-array-values-equal-to-k](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3621-minimum-operations-to-make-array-values-equal-to-k) |
| [3685-count-subarrays-of-length-three-with-a-condition](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3685-count-subarrays-of-length-three-with-a-condition) |
| [3747-maximum-difference-between-adjacent-elements-in-a-circular-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3747-maximum-difference-between-adjacent-elements-in-a-circular-array) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0001-two-sum) |
| [0003-longest-substring-without-repeating-characters](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0003-longest-substring-without-repeating-characters) |
| [0141-linked-list-cycle](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0142-linked-list-cycle-ii) |
| [0160-intersection-of-two-linked-lists](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0160-intersection-of-two-linked-lists) |
| [0217-contains-duplicate](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0217-contains-duplicate) |
| [0242-valid-anagram](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0242-valid-anagram) |
| [0349-intersection-of-two-arrays](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0349-intersection-of-two-arrays) |
| [0442-find-all-duplicates-in-an-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0442-find-all-duplicates-in-an-array) |
| [0966-binary-subarrays-with-sum](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0966-binary-subarrays-with-sum) |
| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |
| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |
| [1960-check-if-the-sentence-is-pangram](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1960-check-if-the-sentence-is-pangram) |
| [2025-redistribute-characters-to-make-all-strings-equal](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2025-redistribute-characters-to-make-all-strings-equal) |
| [2159-two-out-of-three](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2159-two-out-of-three) |
| [2406-decode-the-message](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2406-decode-the-message) |
| [2427-first-letter-to-appear-twice](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2427-first-letter-to-appear-twice) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [3324-split-the-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3324-split-the-array) |
| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
| [3621-minimum-operations-to-make-array-values-equal-to-k](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3621-minimum-operations-to-make-array-values-equal-to-k) |
## Two Pointers
| |
| ------- |
| [0019-remove-nth-node-from-end-of-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0061-rotate-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0061-rotate-list) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0082-remove-duplicates-from-sorted-list-ii) |
| [0086-partition-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0086-partition-list) |
| [0141-linked-list-cycle](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0142-linked-list-cycle-ii) |
| [0143-reorder-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0143-reorder-list) |
| [0160-intersection-of-two-linked-lists](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0160-intersection-of-two-linked-lists) |
| [0165-compare-version-numbers](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0165-compare-version-numbers) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0189-rotate-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0189-rotate-array) |
| [0234-palindrome-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0234-palindrome-linked-list) |
| [0349-intersection-of-two-arrays](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0349-intersection-of-two-arrays) |
| [0528-swapping-nodes-in-a-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0528-swapping-nodes-in-a-linked-list) |
| [0908-middle-of-the-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0908-middle-of-the-linked-list) |
| [0979-di-string-match](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0979-di-string-match) |
| [1988-minimize-maximum-pair-sum-in-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1988-minimize-maximum-pair-sum-in-array) |
| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2216-delete-the-middle-node-of-a-linked-list) |
| [2232-adding-spaces-to-a-string](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2232-adding-spaces-to-a-string) |
| [2236-maximum-twin-sum-of-a-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2236-maximum-twin-sum-of-a-linked-list) |
| [2265-partition-array-according-to-given-pivot](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2265-partition-array-according-to-given-pivot) |
| [2551-apply-operations-to-an-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2551-apply-operations-to-an-array) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2581-divide-players-into-teams-of-equal-skill) |
## Binary Search
| |
| ------- |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0222-count-complete-tree-nodes](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0222-count-complete-tree-nodes) |
| [0278-first-bad-version](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0278-first-bad-version) |
| [0349-intersection-of-two-arrays](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0349-intersection-of-two-arrays) |
## Sorting
| |
| ------- |
| [0217-contains-duplicate](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0217-contains-duplicate) |
| [0242-valid-anagram](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0242-valid-anagram) |
| [0349-intersection-of-two-arrays](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0349-intersection-of-two-arrays) |
| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |
| [1988-minimize-maximum-pair-sum-in-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1988-minimize-maximum-pair-sum-in-array) |
| [2581-divide-players-into-teams-of-equal-skill](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2581-divide-players-into-teams-of-equal-skill) |
| [2836-neither-minimum-nor-maximum](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2836-neither-minimum-nor-maximum) |
| [2845-find-the-value-of-the-partition](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2845-find-the-value-of-the-partition) |
| [2887-sort-vowels-in-a-string](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2887-sort-vowels-in-a-string) |
## String
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0003-longest-substring-without-repeating-characters) |
| [0014-longest-common-prefix](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0014-longest-common-prefix) |
| [0058-length-of-last-word](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0058-length-of-last-word) |
| [0165-compare-version-numbers](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0165-compare-version-numbers) |
| [0242-valid-anagram](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0242-valid-anagram) |
| [0742-to-lower-case](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0742-to-lower-case) |
| [0979-di-string-match](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0979-di-string-match) |
| [1543-simplified-fractions](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1543-simplified-fractions) |
| [1823-determine-if-string-halves-are-alike](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1823-determine-if-string-halves-are-alike) |
| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |
| [1960-check-if-the-sentence-is-pangram](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1960-check-if-the-sentence-is-pangram) |
| [2021-remove-all-occurrences-of-a-substring](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2021-remove-all-occurrences-of-a-substring) |
| [2025-redistribute-characters-to-make-all-strings-equal](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2025-redistribute-characters-to-make-all-strings-equal) |
| [2032-largest-odd-number-in-string](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2032-largest-odd-number-in-string) |
| [2077-largest-number-after-mutating-substring](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2077-largest-number-after-mutating-substring) |
| [2232-adding-spaces-to-a-string](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2232-adding-spaces-to-a-string) |
| [2406-decode-the-message](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2406-decode-the-message) |
| [2427-first-letter-to-appear-twice](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2427-first-letter-to-appear-twice) |
| [2819-remove-trailing-zeros-from-a-string](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2819-remove-trailing-zeros-from-a-string) |
| [2887-sort-vowels-in-a-string](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2887-sort-vowels-in-a-string) |
| [3337-count-substrings-starting-and-ending-with-given-character](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3337-count-substrings-starting-and-ending-with-given-character) |
| [3447-clear-digits](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3447-clear-digits) |
| [3533-snake-in-matrix](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3533-snake-in-matrix) |
| [3636-check-balanced-string](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3636-check-balanced-string) |
## Simulation
| |
| ------- |
| [0054-spiral-matrix](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0054-spiral-matrix) |
| [0059-spiral-matrix-ii](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0059-spiral-matrix-ii) |
| [0258-add-digits](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0258-add-digits) |
| [1682-most-visited-sector-in-a-circular-track](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1682-most-visited-sector-in-a-circular-track) |
| [2021-remove-all-occurrences-of-a-substring](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2021-remove-all-occurrences-of-a-substring) |
| [2232-adding-spaces-to-a-string](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2232-adding-spaces-to-a-string) |
| [2265-partition-array-according-to-given-pivot](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2265-partition-array-according-to-given-pivot) |
| [2299-merge-nodes-in-between-zeros](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2299-merge-nodes-in-between-zeros) |
| [2411-spiral-matrix-iv](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2411-spiral-matrix-iv) |
| [2551-apply-operations-to-an-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2551-apply-operations-to-an-array) |
| [3336-water-bottles-ii](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3336-water-bottles-ii) |
| [3447-clear-digits](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3447-clear-digits) |
| [3533-snake-in-matrix](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3533-snake-in-matrix) |
## Math
| |
| ------- |
| [0002-add-two-numbers](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0002-add-two-numbers) |
| [0048-rotate-image](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0048-rotate-image) |
| [0066-plus-one](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0066-plus-one) |
| [0189-rotate-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0189-rotate-array) |
| [0204-count-primes](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0204-count-primes) |
| [0258-add-digits](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0258-add-digits) |
| [0382-linked-list-random-node](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0382-linked-list-random-node) |
| [0445-add-two-numbers-ii](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0445-add-two-numbers-ii) |
| [0507-perfect-number](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0507-perfect-number) |
| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |
| [1444-number-of-steps-to-reduce-a-number-to-zero](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1444-number-of-steps-to-reduce-a-number-to-zero) |
| [1543-simplified-fractions](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1543-simplified-fractions) |
| [1817-calculate-money-in-leetcode-bank](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1817-calculate-money-in-leetcode-bank) |
| [1950-sign-of-the-product-of-an-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1950-sign-of-the-product-of-an-array) |
| [2032-largest-odd-number-in-string](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2032-largest-odd-number-in-string) |
| [2556-convert-the-temperature](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2556-convert-the-temperature) |
| [2610-closest-prime-numbers-in-range](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2610-closest-prime-numbers-in-range) |
| [2871-double-a-number-represented-as-a-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2871-double-a-number-represented-as-a-linked-list) |
| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |
| [3336-water-bottles-ii](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3336-water-bottles-ii) |
| [3337-count-substrings-starting-and-ending-with-given-character](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3337-count-substrings-starting-and-ending-with-given-character) |
| [3373-maximum-prime-difference](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3373-maximum-prime-difference) |
| [3476-find-minimum-operations-to-make-all-elements-divisible-by-three](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3476-find-minimum-operations-to-make-all-elements-divisible-by-three) |
| [3830-find-closest-person](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3830-find-closest-person) |
## Greedy
| |
| ------- |
| [0055-jump-game](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0055-jump-game) |
| [0979-di-string-match](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0979-di-string-match) |
| [1988-minimize-maximum-pair-sum-in-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1988-minimize-maximum-pair-sum-in-array) |
| [2032-largest-odd-number-in-string](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2032-largest-odd-number-in-string) |
| [2077-largest-number-after-mutating-substring](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2077-largest-number-after-mutating-substring) |
## Counting
| |
| ------- |
| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |
| [1823-determine-if-string-halves-are-alike](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1823-determine-if-string-halves-are-alike) |
| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |
| [2025-redistribute-characters-to-make-all-strings-equal](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2025-redistribute-characters-to-make-all-strings-equal) |
| [2427-first-letter-to-appear-twice](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2427-first-letter-to-appear-twice) |
| [3324-split-the-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3324-split-the-array) |
| [3337-count-substrings-starting-and-ending-with-given-character](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3337-count-substrings-starting-and-ending-with-given-character) |
## Matrix
| |
| ------- |
| [0048-rotate-image](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0048-rotate-image) |
| [0054-spiral-matrix](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0054-spiral-matrix) |
| [0059-spiral-matrix-ii](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0059-spiral-matrix-ii) |
| [2398-check-if-matrix-is-x-matrix](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2398-check-if-matrix-is-x-matrix) |
| [2411-spiral-matrix-iv](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2411-spiral-matrix-iv) |
## Number Theory
| |
| ------- |
| [0204-count-primes](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0204-count-primes) |
| [0258-add-digits](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0258-add-digits) |
| [1543-simplified-fractions](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1543-simplified-fractions) |
| [2610-closest-prime-numbers-in-range](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2610-closest-prime-numbers-in-range) |
| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |
| [3373-maximum-prime-difference](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3373-maximum-prime-difference) |
## Bit Manipulation
| |
| ------- |
| [0191-number-of-1-bits](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0191-number-of-1-bits) |
| [0222-count-complete-tree-nodes](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0222-count-complete-tree-nodes) |
| [1444-number-of-steps-to-reduce-a-number-to-zero](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1444-number-of-steps-to-reduce-a-number-to-zero) |
| [2159-two-out-of-three](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2159-two-out-of-three) |
| [2427-first-letter-to-appear-twice](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2427-first-letter-to-appear-twice) |
## Dynamic Programming
| |
| ------- |
| [0055-jump-game](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0055-jump-game) |
| [0118-pascals-triangle](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0118-pascals-triangle) |
## Stack
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0094-binary-tree-inorder-traversal) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0143-reorder-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0143-reorder-list) |
| [0144-binary-tree-preorder-traversal](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0145-binary-tree-postorder-traversal) |
| [0234-palindrome-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0234-palindrome-linked-list) |
| [0445-add-two-numbers-ii](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0445-add-two-numbers-ii) |
| [2021-remove-all-occurrences-of-a-substring](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2021-remove-all-occurrences-of-a-substring) |
| [2236-maximum-twin-sum-of-a-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2236-maximum-twin-sum-of-a-linked-list) |
| [2573-remove-nodes-from-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2573-remove-nodes-from-linked-list) |
| [2871-double-a-number-represented-as-a-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2871-double-a-number-represented-as-a-linked-list) |
| [3447-clear-digits](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3447-clear-digits) |
## Enumeration
| |
| ------- |
| [0204-count-primes](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0204-count-primes) |
## Interactive
| |
| ------- |
| [0278-first-bad-version](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0278-first-bad-version) |
## Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0094-binary-tree-inorder-traversal) |
| [0100-same-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0101-symmetric-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0104-maximum-depth-of-binary-tree) |
| [0111-minimum-depth-of-binary-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0111-minimum-depth-of-binary-tree) |
| [0112-path-sum](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0112-path-sum) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0144-binary-tree-preorder-traversal](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0145-binary-tree-postorder-traversal) |
| [0222-count-complete-tree-nodes](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0222-count-complete-tree-nodes) |
| [0226-invert-binary-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0226-invert-binary-tree) |
| [2493-reverse-odd-levels-of-binary-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2493-reverse-odd-levels-of-binary-tree) |
## Depth-First Search
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0094-binary-tree-inorder-traversal) |
| [0100-same-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0101-symmetric-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0104-maximum-depth-of-binary-tree) |
| [0111-minimum-depth-of-binary-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0111-minimum-depth-of-binary-tree) |
| [0112-path-sum](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0112-path-sum) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0144-binary-tree-preorder-traversal](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0145-binary-tree-postorder-traversal) |
| [0226-invert-binary-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0226-invert-binary-tree) |
| [2493-reverse-odd-levels-of-binary-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2493-reverse-odd-levels-of-binary-tree) |
## Breadth-First Search
| |
| ------- |
| [0100-same-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0101-symmetric-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0104-maximum-depth-of-binary-tree) |
| [0111-minimum-depth-of-binary-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0111-minimum-depth-of-binary-tree) |
| [0112-path-sum](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0112-path-sum) |
| [0226-invert-binary-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0226-invert-binary-tree) |
| [2493-reverse-odd-levels-of-binary-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2493-reverse-odd-levels-of-binary-tree) |
## Binary Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0094-binary-tree-inorder-traversal) |
| [0100-same-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0101-symmetric-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0104-maximum-depth-of-binary-tree) |
| [0111-minimum-depth-of-binary-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0111-minimum-depth-of-binary-tree) |
| [0112-path-sum](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0112-path-sum) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0144-binary-tree-preorder-traversal](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0145-binary-tree-postorder-traversal) |
| [0222-count-complete-tree-nodes](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0222-count-complete-tree-nodes) |
| [0226-invert-binary-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0226-invert-binary-tree) |
| [2493-reverse-odd-levels-of-binary-tree](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2493-reverse-odd-levels-of-binary-tree) |
## Linked List
| |
| ------- |
| [0002-add-two-numbers](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0002-add-two-numbers) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0021-merge-two-sorted-lists](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0021-merge-two-sorted-lists) |
| [0024-swap-nodes-in-pairs](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0024-swap-nodes-in-pairs) |
| [0061-rotate-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0061-rotate-list) |
| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0082-remove-duplicates-from-sorted-list-ii) |
| [0083-remove-duplicates-from-sorted-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0083-remove-duplicates-from-sorted-list) |
| [0086-partition-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0086-partition-list) |
| [0092-reverse-linked-list-ii](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0092-reverse-linked-list-ii) |
| [0114-flatten-binary-tree-to-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0114-flatten-binary-tree-to-linked-list) |
| [0141-linked-list-cycle](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0142-linked-list-cycle-ii) |
| [0143-reorder-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0143-reorder-list) |
| [0160-intersection-of-two-linked-lists](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0160-intersection-of-two-linked-lists) |
| [0203-remove-linked-list-elements](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0203-remove-linked-list-elements) |
| [0206-reverse-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0206-reverse-linked-list) |
| [0234-palindrome-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0234-palindrome-linked-list) |
| [0237-delete-node-in-a-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0237-delete-node-in-a-linked-list) |
| [0328-odd-even-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0328-odd-even-linked-list) |
| [0382-linked-list-random-node](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0382-linked-list-random-node) |
| [0445-add-two-numbers-ii](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0445-add-two-numbers-ii) |
| [0528-swapping-nodes-in-a-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0528-swapping-nodes-in-a-linked-list) |
| [0725-split-linked-list-in-parts](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0725-split-linked-list-in-parts) |
| [0908-middle-of-the-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0908-middle-of-the-linked-list) |
| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |
| [1765-merge-in-between-linked-lists](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1765-merge-in-between-linked-lists) |
| [2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points) |
| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2216-delete-the-middle-node-of-a-linked-list) |
| [2236-maximum-twin-sum-of-a-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2236-maximum-twin-sum-of-a-linked-list) |
| [2299-merge-nodes-in-between-zeros](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2299-merge-nodes-in-between-zeros) |
| [2411-spiral-matrix-iv](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2411-spiral-matrix-iv) |
| [2573-remove-nodes-from-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2573-remove-nodes-from-linked-list) |
| [2871-double-a-number-represented-as-a-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2871-double-a-number-represented-as-a-linked-list) |
| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |
| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/vickyy234/LeetCode-Solutions/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
## Recursion
| |
| ------- |
| [0002-add-two-numbers](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0002-add-two-numbers) |
| [0021-merge-two-sorted-lists](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0021-merge-two-sorted-lists) |
| [0024-swap-nodes-in-pairs](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0024-swap-nodes-in-pairs) |
| [0143-reorder-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0143-reorder-list) |
| [0203-remove-linked-list-elements](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0203-remove-linked-list-elements) |
| [0206-reverse-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0206-reverse-linked-list) |
| [0234-palindrome-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0234-palindrome-linked-list) |
| [2573-remove-nodes-from-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2573-remove-nodes-from-linked-list) |
## Database
| |
| ------- |
| [0595-big-countries](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0595-big-countries) |
| [1153-product-sales-analysis-i](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1153-product-sales-analysis-i) |
| [1258-article-views-i](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1258-article-views-i) |
| [1509-replace-employee-id-with-the-unique-identifier](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1509-replace-employee-id-with-the-unique-identifier) |
| [1724-customer-who-visited-but-did-not-make-any-transactions](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1724-customer-who-visited-but-did-not-make-any-transactions) |
| [1827-invalid-tweets](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1827-invalid-tweets) |
| [1908-recyclable-and-low-fat-products](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1908-recyclable-and-low-fat-products) |
## Monotonic Stack
| |
| ------- |
| [2573-remove-nodes-from-linked-list](https://github.com/vickyy234/LeetCode-Solutions/tree/master/2573-remove-nodes-from-linked-list) |
## Divide and Conquer
| |
| ------- |
| [0191-number-of-1-bits](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0191-number-of-1-bits) |
## Reservoir Sampling
| |
| ------- |
| [0382-linked-list-random-node](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0382-linked-list-random-node) |
## Randomized
| |
| ------- |
| [0382-linked-list-random-node](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0382-linked-list-random-node) |
## Trie
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0014-longest-common-prefix) |
## Sliding Window
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0003-longest-substring-without-repeating-characters) |
| [0966-binary-subarrays-with-sum](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0966-binary-subarrays-with-sum) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
## Prefix Sum
| |
| ------- |
| [0966-binary-subarrays-with-sum](https://github.com/vickyy234/LeetCode-Solutions/tree/master/0966-binary-subarrays-with-sum) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/vickyy234/LeetCode-Solutions/tree/master/1538-maximum-points-you-can-obtain-from-cards) |