LeetTrack

Solving 1 LeetCode Question a Day, Every Day!

The Mission

Enhance Coding Skills | Master Algorithms & Data Structures | Showcase Progress on GitHub!

Repository Overview

Daily LeetCode Solutions | Code Explanations | Progress Tracking

What	Where
Daily LeetCode Solutions	This Repository
Solution Explanations & Insights	#discussion

Repository Structure

Easy to Navigate, Simple to Contribute

• Daily Folders (Day001, Day002, ...)
  • Problem Statement (with LeetCode link)
  • Solution Code (in Python, Java, C)
  • Brief Explanation (for interesting solutions or learnings)
  • Example Use Cases (where applicable)

Engage with the Repository!

Star, Fork, Contribute, and Discuss

1. Star this repository to track progress
2. Fork and Contribute with your own solutions or suggestions
3. Discuss solutions and ask questions in the #discussion
4. Watch for updates to stay notified of new solutions

Star | Fork | Contribute | Discuss

Latest Solution: View Latest Folder

Discussion

Ask, Share, Discuss!

• Questions about solutions? Ask here!
• Better approach? Share your thoughts!
• Need help with a similar problem? Post a query!

LeetCode Topics

Hash Table

0952-word-subsets
1147-flip-columns-for-maximum-number-of-equal-rows
1468-check-if-n-and-its-double-exist
1502-construct-k-palindrome-strings
2059-unique-length-3-palindromic-subsequences
2300-construct-string-with-repeat-limit
2599-take-k-of-each-character-from-left-and-right
2640-maximum-number-of-integers-to-choose-from-a-range-i
2695-find-score-of-an-array-after-marking-all-elements
2766-find-the-prefix-common-array-of-two-arrays
3267-find-longest-special-substring-that-occurs-thrice-i
3455-minimum-length-of-string-after-operations

String

0952-word-subsets
1502-construct-k-palindrome-strings
1524-string-matching-in-an-array
1537-maximum-score-after-splitting-a-string
1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
1744-number-of-ways-to-form-a-target-string-given-a-dictionary
1895-minimum-number-of-operations-to-move-all-balls-to-each-box
2059-unique-length-3-palindromic-subsequences
2221-check-if-a-parentheses-string-can-be-valid
2232-adding-spaces-to-a-string
2292-counting-words-with-a-given-prefix
2300-construct-string-with-repeat-limit
2414-move-pieces-to-obtain-a-string
2465-shifting-letters-ii
2599-take-k-of-each-character-from-left-and-right
2691-count-vowel-strings-in-ranges
3018-make-string-a-subsequence-using-cyclic-increments
3267-find-longest-special-substring-that-occurs-thrice-i
3309-count-prefix-and-suffix-pairs-i
3455-minimum-length-of-string-after-operations

Sliding Window

2599-take-k-of-each-character-from-left-and-right
2868-continuous-subarrays
2891-maximum-beauty-of-an-array-after-applying-operation
3267-find-longest-special-substring-that-occurs-thrice-i

Array

0494-target-sum
0689-maximum-sum-of-3-non-overlapping-subarrays
0780-max-chunks-to-make-sorted
0787-sliding-puzzle
0952-word-subsets
1025-minimum-cost-for-tickets
1063-best-sightseeing-pair
1147-flip-columns-for-maximum-number-of-equal-rows
1468-check-if-n-and-its-double-exist
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
1524-string-matching-in-an-array
1570-final-prices-with-a-special-discount-in-a-shop
1744-number-of-ways-to-form-a-target-string-given-a-dictionary
1886-minimum-limit-of-balls-in-a-bag
1895-minimum-number-of-operations-to-move-all-balls-to-each-box
1917-maximum-average-pass-ratio
1972-rotating-the-box
2089-maximum-matrix-sum
2164-two-best-non-overlapping-events
2232-adding-spaces-to-a-string
2292-counting-words-with-a-given-prefix
2343-count-unguarded-cells-in-the-grid
2358-number-of-ways-to-split-array
2375-minimum-obstacle-removal-to-reach-corner
2465-shifting-letters-ii
2533-bitwise-xor-of-all-pairings
2640-maximum-number-of-integers-to-choose-from-a-range-i
2691-count-vowel-strings-in-ranges
2692-take-gifts-from-the-richest-pile
2695-find-score-of-an-array-after-marking-all-elements
2711-minimum-time-to-visit-a-cell-in-a-grid
2766-find-the-prefix-common-array-of-two-arrays
2792-neighboring-bitwise-xor
2868-continuous-subarrays
2891-maximum-beauty-of-an-array-after-applying-operation
3181-find-building-where-alice-and-bob-can-meet
3309-count-prefix-and-suffix-pairs-i
3427-special-array-ii
3517-shortest-distance-after-road-addition-queries-i
3555-final-array-state-after-k-multiplication-operations-i

Matrix

0787-sliding-puzzle
1147-flip-columns-for-maximum-number-of-equal-rows
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
1972-rotating-the-box
2089-maximum-matrix-sum
2343-count-unguarded-cells-in-the-grid
2375-minimum-obstacle-removal-to-reach-corner
2711-minimum-time-to-visit-a-cell-in-a-grid

Simulation

2232-adding-spaces-to-a-string
2343-count-unguarded-cells-in-the-grid
2692-take-gifts-from-the-richest-pile
2695-find-score-of-an-array-after-marking-all-elements
3555-final-array-state-after-k-multiplication-operations-i

Two Pointers

1468-check-if-n-and-its-double-exist
1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
1972-rotating-the-box
2232-adding-spaces-to-a-string
2414-move-pieces-to-obtain-a-string
3018-make-string-a-subsequence-using-cyclic-increments

Greedy

0780-max-chunks-to-make-sorted
1502-construct-k-palindrome-strings
1917-maximum-average-pass-ratio
2089-maximum-matrix-sum
2221-check-if-a-parentheses-string-can-be-valid
2300-construct-string-with-repeat-limit
2509-minimize-xor
2640-maximum-number-of-integers-to-choose-from-a-range-i

Breadth-First Search

0515-find-largest-value-in-each-tree-row
0787-sliding-puzzle
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
2375-minimum-obstacle-removal-to-reach-corner
2493-reverse-odd-levels-of-binary-tree
2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level
2711-minimum-time-to-visit-a-cell-in-a-grid
3439-find-minimum-diameter-after-merging-two-trees
3517-shortest-distance-after-road-addition-queries-i

Graph

1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
2201-valid-arrangement-of-pairs
2375-minimum-obstacle-removal-to-reach-corner
2711-minimum-time-to-visit-a-cell-in-a-grid
3189-find-champion-ii
3439-find-minimum-diameter-after-merging-two-trees
3517-shortest-distance-after-road-addition-queries-i

Heap (Priority Queue)

1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
1917-maximum-average-pass-ratio
2164-two-best-non-overlapping-events
2300-construct-string-with-repeat-limit
2375-minimum-obstacle-removal-to-reach-corner
2692-take-gifts-from-the-richest-pile
2695-find-score-of-an-array-after-marking-all-elements
2711-minimum-time-to-visit-a-cell-in-a-grid
2868-continuous-subarrays
3181-find-building-where-alice-and-bob-can-meet
3555-final-array-state-after-k-multiplication-operations-i

Shortest Path

1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
2375-minimum-obstacle-removal-to-reach-corner
2711-minimum-time-to-visit-a-cell-in-a-grid

Depth-First Search

0515-find-largest-value-in-each-tree-row
2201-valid-arrangement-of-pairs
2493-reverse-odd-levels-of-binary-tree
3058-maximum-number-of-k-divisible-components
3439-find-minimum-diameter-after-merging-two-trees

Eulerian Circuit

2201-valid-arrangement-of-pairs

Binary Search

1468-check-if-n-and-its-double-exist
1886-minimum-limit-of-balls-in-a-bag
2164-two-best-non-overlapping-events
2640-maximum-number-of-integers-to-choose-from-a-range-i
2891-maximum-beauty-of-an-array-after-applying-operation
3181-find-building-where-alice-and-bob-can-meet
3267-find-longest-special-substring-that-occurs-thrice-i
3427-special-array-ii

Sorting

0780-max-chunks-to-make-sorted
1468-check-if-n-and-its-double-exist
2164-two-best-non-overlapping-events
2640-maximum-number-of-integers-to-choose-from-a-range-i
2695-find-score-of-an-array-after-marking-all-elements
2891-maximum-beauty-of-an-array-after-applying-operation

String Matching

1524-string-matching-in-an-array
1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
2292-counting-words-with-a-given-prefix
3309-count-prefix-and-suffix-pairs-i

Dynamic Programming

0494-target-sum
0689-maximum-sum-of-3-non-overlapping-subarrays
1025-minimum-cost-for-tickets
1063-best-sightseeing-pair
1744-number-of-ways-to-form-a-target-string-given-a-dictionary
2164-two-best-non-overlapping-events
2562-count-ways-to-build-good-strings

Prefix Sum

1537-maximum-score-after-splitting-a-string
1895-minimum-number-of-operations-to-move-all-balls-to-each-box
2059-unique-length-3-palindromic-subsequences
2358-number-of-ways-to-split-array
2465-shifting-letters-ii
2691-count-vowel-strings-in-ranges
3427-special-array-ii

Counting

1502-construct-k-palindrome-strings
2300-construct-string-with-repeat-limit
3267-find-longest-special-substring-that-occurs-thrice-i
3455-minimum-length-of-string-after-operations

Queue

2868-continuous-subarrays

Ordered Set

2868-continuous-subarrays

Monotonic Queue

2868-continuous-subarrays

Math

3555-final-array-state-after-k-multiplication-operations-i

Stack

0780-max-chunks-to-make-sorted
1570-final-prices-with-a-special-discount-in-a-shop
2221-check-if-a-parentheses-string-can-be-valid
3181-find-building-where-alice-and-bob-can-meet

Monotonic Stack

0780-max-chunks-to-make-sorted
1570-final-prices-with-a-special-discount-in-a-shop
3181-find-building-where-alice-and-bob-can-meet

Tree

0515-find-largest-value-in-each-tree-row
2493-reverse-odd-levels-of-binary-tree
2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level
3058-maximum-number-of-k-divisible-components
3439-find-minimum-diameter-after-merging-two-trees

Binary Tree

0515-find-largest-value-in-each-tree-row
2493-reverse-odd-levels-of-binary-tree
2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level

Binary Indexed Tree

3181-find-building-where-alice-and-bob-can-meet

Segment Tree

3181-find-building-where-alice-and-bob-can-meet

Backtracking

0494-target-sum

Bit Manipulation

2059-unique-length-3-palindromic-subsequences
2509-minimize-xor
2533-bitwise-xor-of-all-pairings
2766-find-the-prefix-common-array-of-two-arrays
2792-neighboring-bitwise-xor

Trie

3309-count-prefix-and-suffix-pairs-i

Rolling Hash

3309-count-prefix-and-suffix-pairs-i

Hash Function

3309-count-prefix-and-suffix-pairs-i

Brainteaser

2533-bitwise-xor-of-all-pairings