leetcode-solution

A collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2

LeetCode Topics

String


0010-regular-expression-matching
0030-substring-with-concatenation-of-all-words
0557-reverse-words-in-a-string-iii
1189-maximum-number-of-balloons
1358-number-of-substrings-containing-all-three-characters
1967-number-of-strings-that-appear-as-substrings-in-word
3110-score-of-a-string
3120-count-the-number-of-special-characters-i
3501-maximize-active-section-with-trade-ii
3612-process-string-with-special-operations-i
3614-process-string-with-special-operations-ii
3756-concatenate-non-zero-digits-and-multiply-by-sum-ii
3838-weighted-word-mapping

Array


0004-median-of-two-sorted-arrays
0037-sudoku-solver
0041-first-missing-positive
0283-move-zeroes
1051-height-checker
1260-shift-2d-grid
1288-remove-covered-intervals
1301-number-of-paths-with-max-score
1331-rank-transform-of-an-array
1732-find-the-highest-altitude
1840-maximum-building-height
1846-maximum-element-after-decreasing-and-rearranging
1967-number-of-strings-that-appear-as-substrings-in-word
1979-find-greatest-common-divisor-of-array
2089-find-target-indices-after-sorting-array
2144-minimum-cost-of-buying-candies-with-discount
2161-partition-array-according-to-given-pivot
2176-count-equal-and-divisible-pairs-in-an-array
2196-create-binary-tree-from-descriptions
2574-left-and-right-sum-differences
2812-find-the-safest-path-in-a-grid
3020-find-the-maximum-number-of-elements-in-subset
3232-find-if-digit-game-can-be-won
3286-find-a-safe-walk-through-a-grid
3312-sorted-gcd-pair-queries
3501-maximize-active-section-with-trade-ii
3534-path-existence-queries-in-a-graph-ii
3559-number-of-ways-to-assign-edge-weights-ii
3620-network-recovery-pathways
3633-earliest-finish-time-for-land-and-water-rides-i
3635-earliest-finish-time-for-land-and-water-rides-ii
3689-maximum-total-subarray-value-i
3691-maximum-total-subarray-value-ii
3737-count-subarrays-with-majority-element-i
3739-count-subarrays-with-majority-element-ii
3838-weighted-word-mapping
3867-sum-of-gcd-of-formed-pairs

Sorting


1051-height-checker
1288-remove-covered-intervals
1331-rank-transform-of-an-array
1840-maximum-building-height
1846-maximum-element-after-decreasing-and-rearranging
2089-find-target-indices-after-sorting-array
2144-minimum-cost-of-buying-candies-with-discount
3534-path-existence-queries-in-a-graph-ii
3536-maximum-product-of-two-digits
3633-earliest-finish-time-for-land-and-water-rides-i
3635-earliest-finish-time-for-land-and-water-rides-ii
3867-sum-of-gcd-of-formed-pairs

Counting Sort


1051-height-checker
1189-maximum-number-of-balloons
3312-sorted-gcd-pair-queries
3737-count-subarrays-with-majority-element-i

Two Pointers


0283-move-zeroes
0557-reverse-words-in-a-string-iii
2095-delete-the-middle-node-of-a-linked-list
2130-maximum-twin-sum-of-a-linked-list
2161-partition-array-according-to-given-pivot
3534-path-existence-queries-in-a-graph-ii
3633-earliest-finish-time-for-land-and-water-rides-i
3635-earliest-finish-time-for-land-and-water-rides-ii
3867-sum-of-gcd-of-formed-pairs

Tree


0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0226-invert-binary-tree
0543-diameter-of-binary-tree
0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree
2196-create-binary-tree-from-descriptions
3558-number-of-ways-to-assign-edge-weights-i
3559-number-of-ways-to-assign-edge-weights-ii

Depth-First Search


0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0226-invert-binary-tree
0543-diameter-of-binary-tree
2492-minimum-score-of-a-path-between-two-cities
2685-count-the-number-of-complete-components
3558-number-of-ways-to-assign-edge-weights-i
3559-number-of-ways-to-assign-edge-weights-ii

Breadth-First Search


0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0226-invert-binary-tree
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

Binary Tree


0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0226-invert-binary-tree
0543-diameter-of-binary-tree
0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree
2196-create-binary-tree-from-descriptions

Hash Table


0030-substring-with-concatenation-of-all-words
0037-sudoku-solver
0041-first-missing-positive
1189-maximum-number-of-balloons
1331-rank-transform-of-an-array
1358-number-of-substrings-containing-all-three-characters
2196-create-binary-tree-from-descriptions
3020-find-the-maximum-number-of-elements-in-subset
3120-count-the-number-of-special-characters-i
3312-sorted-gcd-pair-queries
3737-count-subarrays-with-majority-element-i
3739-count-subarrays-with-majority-element-ii

Linked List


0002-add-two-numbers
0023-merge-k-sorted-lists
0025-reverse-nodes-in-k-group
0114-flatten-binary-tree-to-linked-list
2095-delete-the-middle-node-of-a-linked-list
2130-maximum-twin-sum-of-a-linked-list

Stack


0094-binary-tree-inorder-traversal
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
2130-maximum-twin-sum-of-a-linked-list

Binary Search


0004-median-of-two-sorted-arrays
2089-find-target-indices-after-sorting-array
2812-find-the-safest-path-in-a-grid
3312-sorted-gcd-pair-queries
3501-maximize-active-section-with-trade-ii
3534-path-existence-queries-in-a-graph-ii
3620-network-recovery-pathways
3633-earliest-finish-time-for-land-and-water-rides-i
3635-earliest-finish-time-for-land-and-water-rides-ii

Greedy


1846-maximum-element-after-decreasing-and-rearranging
2144-minimum-cost-of-buying-candies-with-discount
3534-path-existence-queries-in-a-graph-ii
3633-earliest-finish-time-for-land-and-water-rides-i
3635-earliest-finish-time-for-land-and-water-rides-ii
3689-maximum-total-subarray-value-i
3691-maximum-total-subarray-value-ii

Math


0002-add-two-numbers
1344-angle-between-hands-of-a-clock
1688-count-of-matches-in-tournament
1840-maximum-building-height
1979-find-greatest-common-divisor-of-array
3232-find-if-digit-game-can-be-won
3312-sorted-gcd-pair-queries
3536-maximum-product-of-two-digits
3558-number-of-ways-to-assign-edge-weights-i
3559-number-of-ways-to-assign-edge-weights-ii
3658-gcd-of-odd-and-even-sums
3700-number-of-zigzag-arrays-ii
3751-total-waviness-of-numbers-in-range-i
3753-total-waviness-of-numbers-in-range-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


0010-regular-expression-matching
1301-number-of-paths-with-max-score
3534-path-existence-queries-in-a-graph-ii
3559-number-of-ways-to-assign-edge-weights-ii
3620-network-recovery-pathways
3699-number-of-zigzag-arrays-i
3700-number-of-zigzag-arrays-ii
3751-total-waviness-of-numbers-in-range-i
3753-total-waviness-of-numbers-in-range-ii

Enumeration


1291-sequential-digits
3020-find-the-maximum-number-of-elements-in-subset
3751-total-waviness-of-numbers-in-range-i

Prefix Sum


1732-find-the-highest-altitude
2574-left-and-right-sum-differences
3312-sorted-gcd-pair-queries
3699-number-of-zigzag-arrays-i
3737-count-subarrays-with-majority-element-i
3739-count-subarrays-with-majority-element-ii
3756-concatenate-non-zero-digits-and-multiply-by-sum-ii

Binary Search Tree


0098-validate-binary-search-tree
0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree

Simulation


1260-shift-2d-grid
1688-count-of-matches-in-tournament
2161-partition-array-according-to-given-pivot
3612-process-string-with-special-operations-i
3614-process-string-with-special-operations-ii
3838-weighted-word-mapping
3867-sum-of-gcd-of-formed-pairs

Segment Tree


3501-maximize-active-section-with-trade-ii
3691-maximum-total-subarray-value-ii
3737-count-subarrays-with-majority-element-i
3739-count-subarrays-with-majority-element-ii

Heap (Priority Queue)


0023-merge-k-sorted-lists
2812-find-the-safest-path-in-a-grid
3286-find-a-safe-walk-through-a-grid
3620-network-recovery-pathways
3691-maximum-total-subarray-value-ii

Bit Manipulation


3534-path-existence-queries-in-a-graph-ii
3559-number-of-ways-to-assign-edge-weights-ii

Divide and Conquer


0004-median-of-two-sorted-arrays
0023-merge-k-sorted-lists
3737-count-subarrays-with-majority-element-i
3739-count-subarrays-with-majority-element-ii

Merge Sort


0023-merge-k-sorted-lists
3737-count-subarrays-with-majority-element-i
3739-count-subarrays-with-majority-element-ii

Recursion


0002-add-two-numbers
0010-regular-expression-matching
0025-reverse-nodes-in-k-group

Sliding Window


0030-substring-with-concatenation-of-all-words
1358-number-of-substrings-containing-all-three-characters

Backtracking


0037-sudoku-solver

Matrix


0037-sudoku-solver
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

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

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
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

Number Theory


1979-find-greatest-common-divisor-of-array
3312-sorted-gcd-pair-queries
3658-gcd-of-odd-and-even-sums
3867-sum-of-gcd-of-formed-pairs

Combinatorics


3312-sorted-gcd-pair-queries

Name	Name	Last commit message	Last commit date
Latest commit History 364 Commits 364 Commits
0002-add-two-numbers	0002-add-two-numbers
0004-median-of-two-sorted-arrays	0004-median-of-two-sorted-arrays
0010-regular-expression-matching	0010-regular-expression-matching
0023-merge-k-sorted-lists	0023-merge-k-sorted-lists
0025-reverse-nodes-in-k-group	0025-reverse-nodes-in-k-group
0030-substring-with-concatenation-of-all-words	0030-substring-with-concatenation-of-all-words
0032-longest-valid-parentheses	0032-longest-valid-parentheses
0037-sudoku-solver	0037-sudoku-solver
0041-first-missing-positive	0041-first-missing-positive
0094-binary-tree-inorder-traversal	0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree	0098-validate-binary-search-tree
0100-same-tree	0100-same-tree
0101-symmetric-tree	0101-symmetric-tree
0102-binary-tree-level-order-traversal	0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree	0104-maximum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree	0111-minimum-depth-of-binary-tree
0112-path-sum	0112-path-sum
0114-flatten-binary-tree-to-linked-list	0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal	0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal	0145-binary-tree-postorder-traversal
0226-invert-binary-tree	0226-invert-binary-tree
0283-move-zeroes	0283-move-zeroes
0543-diameter-of-binary-tree	0543-diameter-of-binary-tree
0557-reverse-words-in-a-string-iii	0557-reverse-words-in-a-string-iii
0700-search-in-a-binary-search-tree	0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree	0701-insert-into-a-binary-search-tree
1051-height-checker	1051-height-checker
1189-maximum-number-of-balloons	1189-maximum-number-of-balloons
1260-shift-2d-grid	1260-shift-2d-grid
1288-remove-covered-intervals	1288-remove-covered-intervals
1291-sequential-digits	1291-sequential-digits
1301-number-of-paths-with-max-score	1301-number-of-paths-with-max-score
1331-rank-transform-of-an-array	1331-rank-transform-of-an-array
1344-angle-between-hands-of-a-clock	1344-angle-between-hands-of-a-clock
1358-number-of-substrings-containing-all-three-characters	1358-number-of-substrings-containing-all-three-characters
1688-count-of-matches-in-tournament	1688-count-of-matches-in-tournament
1732-find-the-highest-altitude	1732-find-the-highest-altitude
1833-maximum-ice-cream-bars	1833-maximum-ice-cream-bars
1840-maximum-building-height	1840-maximum-building-height
1846-maximum-element-after-decreasing-and-rearranging	1846-maximum-element-after-decreasing-and-rearranging
1967-number-of-strings-that-appear-as-substrings-in-word	1967-number-of-strings-that-appear-as-substrings-in-word
1979-find-greatest-common-divisor-of-array	1979-find-greatest-common-divisor-of-array
2089-find-target-indices-after-sorting-array	2089-find-target-indices-after-sorting-array
2095-delete-the-middle-node-of-a-linked-list	2095-delete-the-middle-node-of-a-linked-list
2130-maximum-twin-sum-of-a-linked-list	2130-maximum-twin-sum-of-a-linked-list
2144-minimum-cost-of-buying-candies-with-discount	2144-minimum-cost-of-buying-candies-with-discount
2161-partition-array-according-to-given-pivot	2161-partition-array-according-to-given-pivot
2176-count-equal-and-divisible-pairs-in-an-array	2176-count-equal-and-divisible-pairs-in-an-array
2196-create-binary-tree-from-descriptions	2196-create-binary-tree-from-descriptions
2492-minimum-score-of-a-path-between-two-cities	2492-minimum-score-of-a-path-between-two-cities
2574-left-and-right-sum-differences	2574-left-and-right-sum-differences
2685-count-the-number-of-complete-components	2685-count-the-number-of-complete-components
2812-find-the-safest-path-in-a-grid	2812-find-the-safest-path-in-a-grid
3020-find-the-maximum-number-of-elements-in-subset	3020-find-the-maximum-number-of-elements-in-subset
3110-score-of-a-string	3110-score-of-a-string
3120-count-the-number-of-special-characters-i	3120-count-the-number-of-special-characters-i
3232-find-if-digit-game-can-be-won	3232-find-if-digit-game-can-be-won
3286-find-a-safe-walk-through-a-grid	3286-find-a-safe-walk-through-a-grid
3312-sorted-gcd-pair-queries	3312-sorted-gcd-pair-queries
3501-maximize-active-section-with-trade-ii	3501-maximize-active-section-with-trade-ii
3534-path-existence-queries-in-a-graph-ii	3534-path-existence-queries-in-a-graph-ii
3536-maximum-product-of-two-digits	3536-maximum-product-of-two-digits
3558-number-of-ways-to-assign-edge-weights-i	3558-number-of-ways-to-assign-edge-weights-i
3559-number-of-ways-to-assign-edge-weights-ii	3559-number-of-ways-to-assign-edge-weights-ii
3612-process-string-with-special-operations-i	3612-process-string-with-special-operations-i
3614-process-string-with-special-operations-ii	3614-process-string-with-special-operations-ii
3620-network-recovery-pathways	3620-network-recovery-pathways
3633-earliest-finish-time-for-land-and-water-rides-i	3633-earliest-finish-time-for-land-and-water-rides-i
3635-earliest-finish-time-for-land-and-water-rides-ii	3635-earliest-finish-time-for-land-and-water-rides-ii
3658-gcd-of-odd-and-even-sums	3658-gcd-of-odd-and-even-sums
3689-maximum-total-subarray-value-i	3689-maximum-total-subarray-value-i
3691-maximum-total-subarray-value-ii	3691-maximum-total-subarray-value-ii
3699-number-of-zigzag-arrays-i	3699-number-of-zigzag-arrays-i
3700-number-of-zigzag-arrays-ii	3700-number-of-zigzag-arrays-ii
3737-count-subarrays-with-majority-element-i	3737-count-subarrays-with-majority-element-i
3739-count-subarrays-with-majority-element-ii	3739-count-subarrays-with-majority-element-ii
3751-total-waviness-of-numbers-in-range-i	3751-total-waviness-of-numbers-in-range-i
3753-total-waviness-of-numbers-in-range-ii	3753-total-waviness-of-numbers-in-range-ii
3754-concatenate-non-zero-digits-and-multiply-by-sum-i	3754-concatenate-non-zero-digits-and-multiply-by-sum-i
3756-concatenate-non-zero-digits-and-multiply-by-sum-ii	3756-concatenate-non-zero-digits-and-multiply-by-sum-ii
3838-weighted-word-mapping	3838-weighted-word-mapping
3867-sum-of-gcd-of-formed-pairs	3867-sum-of-gcd-of-formed-pairs
README.md	README.md
stats.json	stats.json

Search code, repositories, users, issues, pull requests...

Folders and files

Latest commit

History

Repository files navigation

leetcode-solution

LeetCode Topics

String

Array

Sorting

Counting Sort

Two Pointers

Tree

Depth-First Search

Breadth-First Search

Binary Tree

Hash Table

Linked List

Stack

Binary Search

Greedy

Math

Dynamic Programming

Enumeration

Prefix Sum

Binary Search Tree

Simulation

Segment Tree

Heap (Priority Queue)

Bit Manipulation

Divide and Conquer

Merge Sort

Recursion

Sliding Window

Backtracking

Matrix

Union-Find

Graph Theory

Shortest Path

Topological Sort

Number Theory

Combinatorics

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages