Daily_DSA

LeetCode Topics

Array

0037-sudoku-solver
0039-combination-sum
0040-combination-sum-ii
0041-first-missing-positive
0042-trapping-rain-water
0045-jump-game-ii
0046-permutations
0047-permutations-ii
0048-rotate-image
0049-group-anagrams
0051-n-queens
0054-spiral-matrix
0055-jump-game
0056-merge-intervals
0057-insert-interval
0059-spiral-matrix-ii
0063-unique-paths-ii
0064-minimum-path-sum
0068-text-justification
0073-set-matrix-zeroes
0074-search-a-2d-matrix
0075-sort-colors
0078-subsets
0079-word-search
0080-remove-duplicates-from-sorted-array-ii
0081-search-in-rotated-sorted-array-ii
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0088-merge-sorted-array
0090-subsets-ii
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0119-pascals-triangle-ii
0120-triangle
0121-best-time-to-buy-and-sell-stock
0486-predict-the-winner
0628-maximum-product-of-three-numbers
0877-stone-game
1260-shift-2d-grid
1288-remove-covered-intervals
1301-number-of-paths-with-max-score
1331-rank-transform-of-an-array
1406-stone-game-iii
1464-maximum-product-of-two-elements-in-an-array
1846-maximum-element-after-decreasing-and-rearranging
1967-number-of-strings-that-appear-as-substrings-in-word
1979-find-greatest-common-divisor-of-array
2812-find-the-safest-path-in-a-grid
3020-find-the-maximum-number-of-elements-in-subset
3286-find-a-safe-walk-through-a-grid
3312-sorted-gcd-pair-queries
3336-find-the-number-of-subsequences-with-equal-gcd
3501-maximize-active-section-with-trade-ii
3513-number-of-unique-xor-triplets-i
3514-number-of-unique-xor-triplets-ii
3532-path-existence-queries-in-a-graph-i
3534-path-existence-queries-in-a-graph-ii
3620-network-recovery-pathways
3731-find-missing-elements
3737-count-subarrays-with-majority-element-i
3739-count-subarrays-with-majority-element-ii
3867-sum-of-gcd-of-formed-pairs

Hash Table

0037-sudoku-solver
0041-first-missing-positive
0049-group-anagrams
0073-set-matrix-zeroes
0076-minimum-window-substring
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
1331-rank-transform-of-an-array
1358-number-of-substrings-containing-all-three-characters
3016-minimum-number-of-pushes-to-type-word-ii
3020-find-the-maximum-number-of-elements-in-subset
3312-sorted-gcd-pair-queries
3518-smallest-palindromic-rearrangement-ii
3532-path-existence-queries-in-a-graph-i
3731-find-missing-elements
3737-count-subarrays-with-majority-element-i
3739-count-subarrays-with-majority-element-ii

Backtracking

0037-sudoku-solver
0039-combination-sum
0040-combination-sum-ii
0046-permutations
0047-permutations-ii
0051-n-queens
0052-n-queens-ii
0077-combinations
0078-subsets
0079-word-search
0089-gray-code
0090-subsets-ii
0093-restore-ip-addresses
0095-unique-binary-search-trees-ii
0113-path-sum-ii
3348-smallest-divisible-digit-product-ii

Matrix

0037-sudoku-solver
0048-rotate-image
0054-spiral-matrix
0059-spiral-matrix-ii
0063-unique-paths-ii
0064-minimum-path-sum
0073-set-matrix-zeroes
0074-search-a-2d-matrix
0079-word-search
0085-maximal-rectangle
1260-shift-2d-grid
1301-number-of-paths-with-max-score
2812-find-the-safest-path-in-a-grid
3286-find-a-safe-walk-through-a-grid

Math

0043-multiply-strings
0048-rotate-image
0050-powx-n
0060-permutation-sequence
0062-unique-paths
0067-add-binary
0069-sqrtx
0070-climbing-stairs
0089-gray-code
0096-unique-binary-search-trees
0486-predict-the-winner
0628-maximum-product-of-three-numbers
0877-stone-game
1406-stone-game-iii
1979-find-greatest-common-divisor-of-array
3014-minimum-number-of-pushes-to-type-word-i
3312-sorted-gcd-pair-queries
3336-find-the-number-of-subsequences-with-equal-gcd
3345-smallest-divisible-digit-product-i
3348-smallest-divisible-digit-product-ii
3513-number-of-unique-xor-triplets-i
3514-number-of-unique-xor-triplets-ii
3518-smallest-palindromic-rearrangement-ii
3536-maximum-product-of-two-digits
3658-gcd-of-odd-and-even-sums
3700-number-of-zigzag-arrays-ii
3754-concatenate-non-zero-digits-and-multiply-by-sum-i
3756-concatenate-non-zero-digits-and-multiply-by-sum-ii
3867-sum-of-gcd-of-formed-pairs

Dynamic Programming

0042-trapping-rain-water
0044-wildcard-matching
0045-jump-game-ii
0055-jump-game
0062-unique-paths
0063-unique-paths-ii
0064-minimum-path-sum
0070-climbing-stairs
0072-edit-distance
0085-maximal-rectangle
0087-scramble-string
0091-decode-ways
0095-unique-binary-search-trees-ii
0096-unique-binary-search-trees
0097-interleaving-string
0115-distinct-subsequences
0119-pascals-triangle-ii
0120-triangle
0121-best-time-to-buy-and-sell-stock
0486-predict-the-winner
0877-stone-game
1301-number-of-paths-with-max-score
1406-stone-game-iii
3336-find-the-number-of-subsequences-with-equal-gcd
3534-path-existence-queries-in-a-graph-ii
3620-network-recovery-pathways
3700-number-of-zigzag-arrays-ii

Divide and Conquer

0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
3737-count-subarrays-with-majority-element-i
3739-count-subarrays-with-majority-element-ii

Segment Tree

3501-maximize-active-section-with-trade-ii
3737-count-subarrays-with-majority-element-i
3739-count-subarrays-with-majority-element-ii

Merge Sort

3737-count-subarrays-with-majority-element-i
3739-count-subarrays-with-majority-element-ii

Counting

3016-minimum-number-of-pushes-to-type-word-ii
3312-sorted-gcd-pair-queries
3518-smallest-palindromic-rearrangement-ii
3737-count-subarrays-with-majority-element-i

Prefix Sum

3312-sorted-gcd-pair-queries
3737-count-subarrays-with-majority-element-i
3739-count-subarrays-with-majority-element-ii
3756-concatenate-non-zero-digits-and-multiply-by-sum-ii

String

0038-count-and-say
0043-multiply-strings
0044-wildcard-matching
0049-group-anagrams
0058-length-of-last-word
0065-valid-number
0067-add-binary
0068-text-justification
0071-simplify-path
0072-edit-distance
0076-minimum-window-substring
0079-word-search
0087-scramble-string
0091-decode-ways
0093-restore-ip-addresses
0097-interleaving-string
0115-distinct-subsequences
1081-smallest-subsequence-of-distinct-characters
1358-number-of-substrings-containing-all-three-characters
1967-number-of-strings-that-appear-as-substrings-in-word
3014-minimum-number-of-pushes-to-type-word-i
3016-minimum-number-of-pushes-to-type-word-ii
3348-smallest-divisible-digit-product-ii
3499-maximize-active-section-with-trade-i
3501-maximize-active-section-with-trade-ii
3517-smallest-palindromic-rearrangement-i
3518-smallest-palindromic-rearrangement-ii
3756-concatenate-non-zero-digits-and-multiply-by-sum-ii

Two Pointers

0042-trapping-rain-water
0061-rotate-list
0075-sort-colors
0080-remove-duplicates-from-sorted-array-ii
0082-remove-duplicates-from-sorted-list-ii
0086-partition-list
0088-merge-sorted-array
3534-path-existence-queries-in-a-graph-ii
3867-sum-of-gcd-of-formed-pairs

Stack

0042-trapping-rain-water
0071-simplify-path
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0114-flatten-binary-tree-to-linked-list
1081-smallest-subsequence-of-distinct-characters

Monotonic Stack

0042-trapping-rain-water
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
1081-smallest-subsequence-of-distinct-characters

Simulation

0043-multiply-strings
0054-spiral-matrix
0059-spiral-matrix-ii
0067-add-binary
0068-text-justification
1260-shift-2d-grid
3867-sum-of-gcd-of-formed-pairs

Greedy

0044-wildcard-matching
0045-jump-game-ii
0055-jump-game
1081-smallest-subsequence-of-distinct-characters
1846-maximum-element-after-decreasing-and-rearranging
3014-minimum-number-of-pushes-to-type-word-i
3016-minimum-number-of-pushes-to-type-word-ii
3348-smallest-divisible-digit-product-ii
3534-path-existence-queries-in-a-graph-ii

Recursion

0044-wildcard-matching
0050-powx-n
0060-permutation-sequence
0486-predict-the-winner

Sorting

0047-permutations-ii
0049-group-anagrams
0056-merge-intervals
0075-sort-colors
0088-merge-sorted-array
0628-maximum-product-of-three-numbers
1288-remove-covered-intervals
1331-rank-transform-of-an-array
1464-maximum-product-of-two-elements-in-an-array
1846-maximum-element-after-decreasing-and-rearranging
3016-minimum-number-of-pushes-to-type-word-ii
3517-smallest-palindromic-rearrangement-i
3534-path-existence-queries-in-a-graph-ii
3536-maximum-product-of-two-digits
3731-find-missing-elements
3867-sum-of-gcd-of-formed-pairs

Enumeration

1291-sequential-digits
3020-find-the-maximum-number-of-elements-in-subset
3345-smallest-divisible-digit-product-i
3499-maximize-active-section-with-trade-i
3514-number-of-unique-xor-triplets-ii

Sliding Window

0076-minimum-window-substring
1358-number-of-substrings-containing-all-three-characters

Linked List

0061-rotate-list
0082-remove-duplicates-from-sorted-list-ii
0083-remove-duplicates-from-sorted-list
0086-partition-list
0092-reverse-linked-list-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii

Combinatorics

0062-unique-paths
3312-sorted-gcd-pair-queries
3518-smallest-palindromic-rearrangement-ii

Binary Search

0069-sqrtx
0074-search-a-2d-matrix
0081-search-in-rotated-sorted-array-ii
2812-find-the-safest-path-in-a-grid
3312-sorted-gcd-pair-queries
3501-maximize-active-section-with-trade-ii
3532-path-existence-queries-in-a-graph-i
3534-path-existence-queries-in-a-graph-ii
3620-network-recovery-pathways

Breadth-First Search

0100-same-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0107-binary-tree-level-order-traversal-ii
0111-minimum-depth-of-binary-tree
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
2492-minimum-score-of-a-path-between-two-cities
2685-count-the-number-of-complete-components
2812-find-the-safest-path-in-a-grid
3286-find-a-safe-walk-through-a-grid
3310-remove-methods-from-project

Union-Find

2492-minimum-score-of-a-path-between-two-cities
2685-count-the-number-of-complete-components
2812-find-the-safest-path-in-a-grid
3532-path-existence-queries-in-a-graph-i

Heap (Priority Queue)

1464-maximum-product-of-two-elements-in-an-array
2812-find-the-safest-path-in-a-grid
3286-find-a-safe-walk-through-a-grid
3620-network-recovery-pathways

Bit Manipulation

0067-add-binary
0078-subsets
0089-gray-code
0090-subsets-ii
3513-number-of-unique-xor-triplets-i
3514-number-of-unique-xor-triplets-ii
3534-path-existence-queries-in-a-graph-ii

Memoization

0070-climbing-stairs

Graph Theory

2492-minimum-score-of-a-path-between-two-cities
2685-count-the-number-of-complete-components
3286-find-a-safe-walk-through-a-grid
3310-remove-methods-from-project
3532-path-existence-queries-in-a-graph-i
3534-path-existence-queries-in-a-graph-ii
3620-network-recovery-pathways

Shortest Path

3286-find-a-safe-walk-through-a-grid
3620-network-recovery-pathways

Topological Sort

3620-network-recovery-pathways

Depth-First Search

0079-word-search
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
2492-minimum-score-of-a-path-between-two-cities
2685-count-the-number-of-complete-components
3310-remove-methods-from-project

Number Theory

1979-find-greatest-common-divisor-of-array
3312-sorted-gcd-pair-queries
3336-find-the-number-of-subsequences-with-equal-gcd
3348-smallest-divisible-digit-product-ii
3658-gcd-of-odd-and-even-sums
3867-sum-of-gcd-of-formed-pairs

Database

0175-combine-two-tables
0176-second-highest-salary
0178-rank-scores
0180-consecutive-numbers
0181-employees-earning-more-than-their-managers
0182-duplicate-emails
0183-customers-who-never-order
0184-department-highest-salary
0185-department-top-three-salaries
0196-delete-duplicate-emails
0197-rising-temperature
0262-trips-and-users
0550-game-play-analysis-iv

Tree

0095-unique-binary-search-trees-ii
0096-unique-binary-search-trees
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0107-binary-tree-level-order-traversal-ii
0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii

Binary Search Tree

0095-unique-binary-search-trees-ii
0096-unique-binary-search-trees
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0108-convert-sorted-array-to-binary-search-tree

Binary Tree

0095-unique-binary-search-trees-ii
0096-unique-binary-search-trees
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0107-binary-tree-level-order-traversal-ii
0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii

Counting Sort

3517-smallest-palindromic-rearrangement-i

Game Theory

0486-predict-the-winner
0877-stone-game
1406-stone-game-iii