LeetCode_Problem

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub

LeetCode_Problem

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub

LeetCode_Problem

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub

LeetCode_Problem

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub

LeetCode_Problem

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub

LeetCode_Problem

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub

LeetCode_Problem

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub

LeetCode_Problem

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub

Name		Name	Last commit message	Last commit date
0 - 1 Knapsack Problem - GFG		0 - 1 Knapsack Problem - GFG
1-two-sum		1-two-sum
10-regular-expression-matching		10-regular-expression-matching
100-same-tree		100-same-tree
101-symmetric-tree		101-symmetric-tree
1011-capacity-to-ship-packages-within-d-days		1011-capacity-to-ship-packages-within-d-days
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1021-remove-outermost-parentheses		1021-remove-outermost-parentheses
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1047-remove-all-adjacent-duplicates-in-string		1047-remove-all-adjacent-duplicates-in-string
1048-longest-string-chain		1048-longest-string-chain
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
1074-number-of-submatrices-that-sum-to-target		1074-number-of-submatrices-that-sum-to-target
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
109-convert-sorted-list-to-binary-search-tree		109-convert-sorted-list-to-binary-search-tree
1094-car-pooling		1094-car-pooling
11-container-with-most-water		11-container-with-most-water
112-path-sum		112-path-sum
1122-relative-sort-array		1122-relative-sort-array
113-path-sum-ii		113-path-sum-ii
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
115-distinct-subsequences		115-distinct-subsequences
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
1177-can-make-palindrome-from-substring		1177-can-make-palindrome-from-substring
118-pascals-triangle		118-pascals-triangle
119-pascals-triangle-ii		119-pascals-triangle-ii
1192-critical-connections-in-a-network		1192-critical-connections-in-a-network
12-integer-to-roman		12-integer-to-roman
120-triangle		120-triangle
1209-remove-all-adjacent-duplicates-in-string-ii		1209-remove-all-adjacent-duplicates-in-string-ii
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
1220-count-vowels-permutation		1220-count-vowels-permutation
123-best-time-to-buy-and-sell-stock-iii		123-best-time-to-buy-and-sell-stock-iii
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
126-word-ladder-ii		126-word-ladder-ii
127-word-ladder		127-word-ladder
128-longest-consecutive-sequence		128-longest-consecutive-sequence
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
1295-find-numbers-with-even-number-of-digits		1295-find-numbers-with-even-number-of-digits
1299-replace-elements-with-greatest-element-on-right-side		1299-replace-elements-with-greatest-element-on-right-side
130-surrounded-regions		130-surrounded-regions
1305-all-elements-in-two-binary-search-trees		1305-all-elements-in-two-binary-search-trees
131-palindrome-partitioning		131-palindrome-partitioning
1312-minimum-insertion-steps-to-make-a-string-palindrome		1312-minimum-insertion-steps-to-make-a-string-palindrome
1313-decompress-run-length-encoded-list		1313-decompress-run-length-encoded-list
1329-sort-the-matrix-diagonally		1329-sort-the-matrix-diagonally
133-clone-graph		133-clone-graph
1332-remove-palindromic-subsequences		1332-remove-palindromic-subsequences
1337-the-k-weakest-rows-in-a-matrix		1337-the-k-weakest-rows-in-a-matrix
1338-reduce-array-size-to-the-half		1338-reduce-array-size-to-the-half
134-gas-station		134-gas-station
1342-number-of-steps-to-reduce-a-number-to-zero		1342-number-of-steps-to-reduce-a-number-to-zero
1351-count-negative-numbers-in-a-sorted-matrix		1351-count-negative-numbers-in-a-sorted-matrix
1354-construct-target-array-with-multiple-sums		1354-construct-target-array-with-multiple-sums
136-single-number		136-single-number
137-single-number-ii		137-single-number-ii
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
1383-maximum-performance-of-a-team		1383-maximum-performance-of-a-team
139-word-break		139-word-break
1395-count-number-of-teams		1395-count-number-of-teams
14-longest-common-prefix		14-longest-common-prefix
140-word-break-ii		140-word-break-ii
1405-longest-happy-string		1405-longest-happy-string
141-linked-list-cycle		141-linked-list-cycle
142-linked-list-cycle-ii		142-linked-list-cycle-ii
1423-maximum-points-you-can-obtain-from-cards		1423-maximum-points-you-can-obtain-from-cards
1424-diagonal-traverse-ii		1424-diagonal-traverse-ii
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
1448-count-good-nodes-in-binary-tree		1448-count-good-nodes-in-binary-tree
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
1457-pseudo-palindromic-paths-in-a-binary-tree		1457-pseudo-palindromic-paths-in-a-binary-tree
1461-check-if-a-string-contains-all-binary-codes-of-size-k		1461-check-if-a-string-contains-all-binary-codes-of-size-k
1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts		1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts
147-insertion-sort-list		147-insertion-sort-list
1473-paint-house-iii		1473-paint-house-iii
148-sort-list		148-sort-list
1480-running-sum-of-1d-array		1480-running-sum-of-1d-array
1482-minimum-number-of-days-to-make-m-bouquets		1482-minimum-number-of-days-to-make-m-bouquets
149-max-points-on-a-line		149-max-points-on-a-line
1497-check-if-array-pairs-are-divisible-by-k		1497-check-if-array-pairs-are-divisible-by-k
15-3sum		15-3sum
150-evaluate-reverse-polish-notation		150-evaluate-reverse-polish-notation
151-reverse-words-in-a-string		151-reverse-words-in-a-string
1512-number-of-good-pairs		1512-number-of-good-pairs
152-maximum-product-subarray		152-maximum-product-subarray
1547-minimum-cost-to-cut-a-stick		1547-minimum-cost-to-cut-a-stick
155-min-stack		155-min-stack
160-intersection-of-two-linked-lists		160-intersection-of-two-linked-lists
1614-maximum-nesting-depth-of-the-parentheses		1614-maximum-nesting-depth-of-the-parentheses
162-find-peak-element		162-find-peak-element
1636-sort-array-by-increasing-frequency		1636-sort-array-by-increasing-frequency
1642-furthest-building-you-can-reach		1642-furthest-building-you-can-reach
1649-create-sorted-array-through-instructions		1649-create-sorted-array-through-instructions
1658-minimum-operations-to-reduce-x-to-zero		1658-minimum-operations-to-reduce-x-to-zero
167-two-sum-ii-input-array-is-sorted		167-two-sum-ii-input-array-is-sorted
1679-max-number-of-k-sum-pairs		1679-max-number-of-k-sum-pairs
168-excel-sheet-column-title		168-excel-sheet-column-title
1680-concatenation-of-consecutive-binary-numbers		1680-concatenation-of-consecutive-binary-numbers

Name		Name	Last commit message	Last commit date
0 - 1 Knapsack Problem - GFG		0 - 1 Knapsack Problem - GFG
1-two-sum		1-two-sum
10-regular-expression-matching		10-regular-expression-matching
100-same-tree		100-same-tree
101-symmetric-tree		101-symmetric-tree
1011-capacity-to-ship-packages-within-d-days		1011-capacity-to-ship-packages-within-d-days
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1021-remove-outermost-parentheses		1021-remove-outermost-parentheses
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1047-remove-all-adjacent-duplicates-in-string		1047-remove-all-adjacent-duplicates-in-string
1048-longest-string-chain		1048-longest-string-chain
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
1074-number-of-submatrices-that-sum-to-target		1074-number-of-submatrices-that-sum-to-target
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
109-convert-sorted-list-to-binary-search-tree		109-convert-sorted-list-to-binary-search-tree
1094-car-pooling		1094-car-pooling
11-container-with-most-water		11-container-with-most-water
112-path-sum		112-path-sum
1122-relative-sort-array		1122-relative-sort-array
113-path-sum-ii		113-path-sum-ii
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
115-distinct-subsequences		115-distinct-subsequences
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
1177-can-make-palindrome-from-substring		1177-can-make-palindrome-from-substring
118-pascals-triangle		118-pascals-triangle
119-pascals-triangle-ii		119-pascals-triangle-ii
1192-critical-connections-in-a-network		1192-critical-connections-in-a-network
12-integer-to-roman		12-integer-to-roman
120-triangle		120-triangle
1209-remove-all-adjacent-duplicates-in-string-ii		1209-remove-all-adjacent-duplicates-in-string-ii
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
1220-count-vowels-permutation		1220-count-vowels-permutation
123-best-time-to-buy-and-sell-stock-iii		123-best-time-to-buy-and-sell-stock-iii
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
126-word-ladder-ii		126-word-ladder-ii
127-word-ladder		127-word-ladder
128-longest-consecutive-sequence		128-longest-consecutive-sequence
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
1295-find-numbers-with-even-number-of-digits		1295-find-numbers-with-even-number-of-digits
1299-replace-elements-with-greatest-element-on-right-side		1299-replace-elements-with-greatest-element-on-right-side
130-surrounded-regions		130-surrounded-regions
1305-all-elements-in-two-binary-search-trees		1305-all-elements-in-two-binary-search-trees
131-palindrome-partitioning		131-palindrome-partitioning
1312-minimum-insertion-steps-to-make-a-string-palindrome		1312-minimum-insertion-steps-to-make-a-string-palindrome
1313-decompress-run-length-encoded-list		1313-decompress-run-length-encoded-list
1329-sort-the-matrix-diagonally		1329-sort-the-matrix-diagonally
133-clone-graph		133-clone-graph
1332-remove-palindromic-subsequences		1332-remove-palindromic-subsequences
1337-the-k-weakest-rows-in-a-matrix		1337-the-k-weakest-rows-in-a-matrix
1338-reduce-array-size-to-the-half		1338-reduce-array-size-to-the-half
134-gas-station		134-gas-station
1342-number-of-steps-to-reduce-a-number-to-zero		1342-number-of-steps-to-reduce-a-number-to-zero
1351-count-negative-numbers-in-a-sorted-matrix		1351-count-negative-numbers-in-a-sorted-matrix
1354-construct-target-array-with-multiple-sums		1354-construct-target-array-with-multiple-sums
136-single-number		136-single-number
137-single-number-ii		137-single-number-ii
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
1383-maximum-performance-of-a-team		1383-maximum-performance-of-a-team
139-word-break		139-word-break
1395-count-number-of-teams		1395-count-number-of-teams
14-longest-common-prefix		14-longest-common-prefix
140-word-break-ii		140-word-break-ii
1405-longest-happy-string		1405-longest-happy-string
141-linked-list-cycle		141-linked-list-cycle
142-linked-list-cycle-ii		142-linked-list-cycle-ii
1423-maximum-points-you-can-obtain-from-cards		1423-maximum-points-you-can-obtain-from-cards
1424-diagonal-traverse-ii		1424-diagonal-traverse-ii
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
1448-count-good-nodes-in-binary-tree		1448-count-good-nodes-in-binary-tree
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
1457-pseudo-palindromic-paths-in-a-binary-tree		1457-pseudo-palindromic-paths-in-a-binary-tree
1461-check-if-a-string-contains-all-binary-codes-of-size-k		1461-check-if-a-string-contains-all-binary-codes-of-size-k
1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts		1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts
147-insertion-sort-list		147-insertion-sort-list
1473-paint-house-iii		1473-paint-house-iii
148-sort-list		148-sort-list
1480-running-sum-of-1d-array		1480-running-sum-of-1d-array
1482-minimum-number-of-days-to-make-m-bouquets		1482-minimum-number-of-days-to-make-m-bouquets
149-max-points-on-a-line		149-max-points-on-a-line
1497-check-if-array-pairs-are-divisible-by-k		1497-check-if-array-pairs-are-divisible-by-k
15-3sum		15-3sum
150-evaluate-reverse-polish-notation		150-evaluate-reverse-polish-notation
151-reverse-words-in-a-string		151-reverse-words-in-a-string
1512-number-of-good-pairs		1512-number-of-good-pairs
152-maximum-product-subarray		152-maximum-product-subarray
1547-minimum-cost-to-cut-a-stick		1547-minimum-cost-to-cut-a-stick
155-min-stack		155-min-stack
160-intersection-of-two-linked-lists		160-intersection-of-two-linked-lists
1614-maximum-nesting-depth-of-the-parentheses		1614-maximum-nesting-depth-of-the-parentheses
162-find-peak-element		162-find-peak-element
1636-sort-array-by-increasing-frequency		1636-sort-array-by-increasing-frequency
1642-furthest-building-you-can-reach		1642-furthest-building-you-can-reach
1649-create-sorted-array-through-instructions		1649-create-sorted-array-through-instructions
1658-minimum-operations-to-reduce-x-to-zero		1658-minimum-operations-to-reduce-x-to-zero
167-two-sum-ii-input-array-is-sorted		167-two-sum-ii-input-array-is-sorted
1679-max-number-of-k-sum-pairs		1679-max-number-of-k-sum-pairs
168-excel-sheet-column-title		168-excel-sheet-column-title
1680-concatenation-of-consecutive-binary-numbers		1680-concatenation-of-consecutive-binary-numbers

Name		Name	Last commit message	Last commit date
0 - 1 Knapsack Problem - GFG		0 - 1 Knapsack Problem - GFG
1-two-sum		1-two-sum
10-regular-expression-matching		10-regular-expression-matching
100-same-tree		100-same-tree
101-symmetric-tree		101-symmetric-tree
1011-capacity-to-ship-packages-within-d-days		1011-capacity-to-ship-packages-within-d-days
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1021-remove-outermost-parentheses		1021-remove-outermost-parentheses
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1047-remove-all-adjacent-duplicates-in-string		1047-remove-all-adjacent-duplicates-in-string
1048-longest-string-chain		1048-longest-string-chain
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
1074-number-of-submatrices-that-sum-to-target		1074-number-of-submatrices-that-sum-to-target
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
109-convert-sorted-list-to-binary-search-tree		109-convert-sorted-list-to-binary-search-tree
1094-car-pooling		1094-car-pooling
11-container-with-most-water		11-container-with-most-water
112-path-sum		112-path-sum
1122-relative-sort-array		1122-relative-sort-array
113-path-sum-ii		113-path-sum-ii
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
115-distinct-subsequences		115-distinct-subsequences
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
1177-can-make-palindrome-from-substring		1177-can-make-palindrome-from-substring
118-pascals-triangle		118-pascals-triangle
119-pascals-triangle-ii		119-pascals-triangle-ii
1192-critical-connections-in-a-network		1192-critical-connections-in-a-network
12-integer-to-roman		12-integer-to-roman
120-triangle		120-triangle
1209-remove-all-adjacent-duplicates-in-string-ii		1209-remove-all-adjacent-duplicates-in-string-ii
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
1220-count-vowels-permutation		1220-count-vowels-permutation
123-best-time-to-buy-and-sell-stock-iii		123-best-time-to-buy-and-sell-stock-iii
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
126-word-ladder-ii		126-word-ladder-ii
127-word-ladder		127-word-ladder
128-longest-consecutive-sequence		128-longest-consecutive-sequence
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
1295-find-numbers-with-even-number-of-digits		1295-find-numbers-with-even-number-of-digits
1299-replace-elements-with-greatest-element-on-right-side		1299-replace-elements-with-greatest-element-on-right-side
130-surrounded-regions		130-surrounded-regions
1305-all-elements-in-two-binary-search-trees		1305-all-elements-in-two-binary-search-trees
131-palindrome-partitioning		131-palindrome-partitioning
1312-minimum-insertion-steps-to-make-a-string-palindrome		1312-minimum-insertion-steps-to-make-a-string-palindrome
1313-decompress-run-length-encoded-list		1313-decompress-run-length-encoded-list
1329-sort-the-matrix-diagonally		1329-sort-the-matrix-diagonally
133-clone-graph		133-clone-graph
1332-remove-palindromic-subsequences		1332-remove-palindromic-subsequences
1337-the-k-weakest-rows-in-a-matrix		1337-the-k-weakest-rows-in-a-matrix
1338-reduce-array-size-to-the-half		1338-reduce-array-size-to-the-half
134-gas-station		134-gas-station
1342-number-of-steps-to-reduce-a-number-to-zero		1342-number-of-steps-to-reduce-a-number-to-zero
1351-count-negative-numbers-in-a-sorted-matrix		1351-count-negative-numbers-in-a-sorted-matrix
1354-construct-target-array-with-multiple-sums		1354-construct-target-array-with-multiple-sums
136-single-number		136-single-number
137-single-number-ii		137-single-number-ii
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
1383-maximum-performance-of-a-team		1383-maximum-performance-of-a-team
139-word-break		139-word-break
1395-count-number-of-teams		1395-count-number-of-teams
14-longest-common-prefix		14-longest-common-prefix
140-word-break-ii		140-word-break-ii
1405-longest-happy-string		1405-longest-happy-string
141-linked-list-cycle		141-linked-list-cycle
142-linked-list-cycle-ii		142-linked-list-cycle-ii
1423-maximum-points-you-can-obtain-from-cards		1423-maximum-points-you-can-obtain-from-cards
1424-diagonal-traverse-ii		1424-diagonal-traverse-ii
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
1448-count-good-nodes-in-binary-tree		1448-count-good-nodes-in-binary-tree
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
1457-pseudo-palindromic-paths-in-a-binary-tree		1457-pseudo-palindromic-paths-in-a-binary-tree
1461-check-if-a-string-contains-all-binary-codes-of-size-k		1461-check-if-a-string-contains-all-binary-codes-of-size-k
1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts		1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts
147-insertion-sort-list		147-insertion-sort-list
1473-paint-house-iii		1473-paint-house-iii
148-sort-list		148-sort-list
1480-running-sum-of-1d-array		1480-running-sum-of-1d-array
1482-minimum-number-of-days-to-make-m-bouquets		1482-minimum-number-of-days-to-make-m-bouquets
149-max-points-on-a-line		149-max-points-on-a-line
1497-check-if-array-pairs-are-divisible-by-k		1497-check-if-array-pairs-are-divisible-by-k
15-3sum		15-3sum
150-evaluate-reverse-polish-notation		150-evaluate-reverse-polish-notation
151-reverse-words-in-a-string		151-reverse-words-in-a-string
1512-number-of-good-pairs		1512-number-of-good-pairs
152-maximum-product-subarray		152-maximum-product-subarray
1547-minimum-cost-to-cut-a-stick		1547-minimum-cost-to-cut-a-stick
155-min-stack		155-min-stack
160-intersection-of-two-linked-lists		160-intersection-of-two-linked-lists
1614-maximum-nesting-depth-of-the-parentheses		1614-maximum-nesting-depth-of-the-parentheses
162-find-peak-element		162-find-peak-element
1636-sort-array-by-increasing-frequency		1636-sort-array-by-increasing-frequency
1642-furthest-building-you-can-reach		1642-furthest-building-you-can-reach
1649-create-sorted-array-through-instructions		1649-create-sorted-array-through-instructions
1658-minimum-operations-to-reduce-x-to-zero		1658-minimum-operations-to-reduce-x-to-zero
167-two-sum-ii-input-array-is-sorted		167-two-sum-ii-input-array-is-sorted
1679-max-number-of-k-sum-pairs		1679-max-number-of-k-sum-pairs
168-excel-sheet-column-title		168-excel-sheet-column-title
1680-concatenation-of-consecutive-binary-numbers		1680-concatenation-of-consecutive-binary-numbers

Name		Name	Last commit message	Last commit date
0 - 1 Knapsack Problem - GFG		0 - 1 Knapsack Problem - GFG
1-two-sum		1-two-sum
10-regular-expression-matching		10-regular-expression-matching
100-same-tree		100-same-tree
101-symmetric-tree		101-symmetric-tree
1011-capacity-to-ship-packages-within-d-days		1011-capacity-to-ship-packages-within-d-days
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1021-remove-outermost-parentheses		1021-remove-outermost-parentheses
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1047-remove-all-adjacent-duplicates-in-string		1047-remove-all-adjacent-duplicates-in-string
1048-longest-string-chain		1048-longest-string-chain
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
1074-number-of-submatrices-that-sum-to-target		1074-number-of-submatrices-that-sum-to-target
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
109-convert-sorted-list-to-binary-search-tree		109-convert-sorted-list-to-binary-search-tree
1094-car-pooling		1094-car-pooling
11-container-with-most-water		11-container-with-most-water
112-path-sum		112-path-sum
1122-relative-sort-array		1122-relative-sort-array
113-path-sum-ii		113-path-sum-ii
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
115-distinct-subsequences		115-distinct-subsequences
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
1177-can-make-palindrome-from-substring		1177-can-make-palindrome-from-substring
118-pascals-triangle		118-pascals-triangle
119-pascals-triangle-ii		119-pascals-triangle-ii
1192-critical-connections-in-a-network		1192-critical-connections-in-a-network
12-integer-to-roman		12-integer-to-roman
120-triangle		120-triangle
1209-remove-all-adjacent-duplicates-in-string-ii		1209-remove-all-adjacent-duplicates-in-string-ii
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
1220-count-vowels-permutation		1220-count-vowels-permutation
123-best-time-to-buy-and-sell-stock-iii		123-best-time-to-buy-and-sell-stock-iii
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
126-word-ladder-ii		126-word-ladder-ii
127-word-ladder		127-word-ladder
128-longest-consecutive-sequence		128-longest-consecutive-sequence
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
1295-find-numbers-with-even-number-of-digits		1295-find-numbers-with-even-number-of-digits
1299-replace-elements-with-greatest-element-on-right-side		1299-replace-elements-with-greatest-element-on-right-side
130-surrounded-regions		130-surrounded-regions
1305-all-elements-in-two-binary-search-trees		1305-all-elements-in-two-binary-search-trees
131-palindrome-partitioning		131-palindrome-partitioning
1312-minimum-insertion-steps-to-make-a-string-palindrome		1312-minimum-insertion-steps-to-make-a-string-palindrome
1313-decompress-run-length-encoded-list		1313-decompress-run-length-encoded-list
1329-sort-the-matrix-diagonally		1329-sort-the-matrix-diagonally
133-clone-graph		133-clone-graph
1332-remove-palindromic-subsequences		1332-remove-palindromic-subsequences
1337-the-k-weakest-rows-in-a-matrix		1337-the-k-weakest-rows-in-a-matrix
1338-reduce-array-size-to-the-half		1338-reduce-array-size-to-the-half
134-gas-station		134-gas-station
1342-number-of-steps-to-reduce-a-number-to-zero		1342-number-of-steps-to-reduce-a-number-to-zero
1351-count-negative-numbers-in-a-sorted-matrix		1351-count-negative-numbers-in-a-sorted-matrix
1354-construct-target-array-with-multiple-sums		1354-construct-target-array-with-multiple-sums
136-single-number		136-single-number
137-single-number-ii		137-single-number-ii
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
1383-maximum-performance-of-a-team		1383-maximum-performance-of-a-team
139-word-break		139-word-break
1395-count-number-of-teams		1395-count-number-of-teams
14-longest-common-prefix		14-longest-common-prefix
140-word-break-ii		140-word-break-ii
1405-longest-happy-string		1405-longest-happy-string
141-linked-list-cycle		141-linked-list-cycle
142-linked-list-cycle-ii		142-linked-list-cycle-ii
1423-maximum-points-you-can-obtain-from-cards		1423-maximum-points-you-can-obtain-from-cards
1424-diagonal-traverse-ii		1424-diagonal-traverse-ii
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
1448-count-good-nodes-in-binary-tree		1448-count-good-nodes-in-binary-tree
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
1457-pseudo-palindromic-paths-in-a-binary-tree		1457-pseudo-palindromic-paths-in-a-binary-tree
1461-check-if-a-string-contains-all-binary-codes-of-size-k		1461-check-if-a-string-contains-all-binary-codes-of-size-k
1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts		1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts
147-insertion-sort-list		147-insertion-sort-list
1473-paint-house-iii		1473-paint-house-iii
148-sort-list		148-sort-list
1480-running-sum-of-1d-array		1480-running-sum-of-1d-array
1482-minimum-number-of-days-to-make-m-bouquets		1482-minimum-number-of-days-to-make-m-bouquets
149-max-points-on-a-line		149-max-points-on-a-line
1497-check-if-array-pairs-are-divisible-by-k		1497-check-if-array-pairs-are-divisible-by-k
15-3sum		15-3sum
150-evaluate-reverse-polish-notation		150-evaluate-reverse-polish-notation
151-reverse-words-in-a-string		151-reverse-words-in-a-string
1512-number-of-good-pairs		1512-number-of-good-pairs
152-maximum-product-subarray		152-maximum-product-subarray
1547-minimum-cost-to-cut-a-stick		1547-minimum-cost-to-cut-a-stick
155-min-stack		155-min-stack
160-intersection-of-two-linked-lists		160-intersection-of-two-linked-lists
1614-maximum-nesting-depth-of-the-parentheses		1614-maximum-nesting-depth-of-the-parentheses
162-find-peak-element		162-find-peak-element
1636-sort-array-by-increasing-frequency		1636-sort-array-by-increasing-frequency
1642-furthest-building-you-can-reach		1642-furthest-building-you-can-reach
1649-create-sorted-array-through-instructions		1649-create-sorted-array-through-instructions
1658-minimum-operations-to-reduce-x-to-zero		1658-minimum-operations-to-reduce-x-to-zero
167-two-sum-ii-input-array-is-sorted		167-two-sum-ii-input-array-is-sorted
1679-max-number-of-k-sum-pairs		1679-max-number-of-k-sum-pairs
168-excel-sheet-column-title		168-excel-sheet-column-title
1680-concatenation-of-consecutive-binary-numbers		1680-concatenation-of-consecutive-binary-numbers

Name		Name	Last commit message	Last commit date
0 - 1 Knapsack Problem - GFG		0 - 1 Knapsack Problem - GFG
1-two-sum		1-two-sum
10-regular-expression-matching		10-regular-expression-matching
100-same-tree		100-same-tree
101-symmetric-tree		101-symmetric-tree
1011-capacity-to-ship-packages-within-d-days		1011-capacity-to-ship-packages-within-d-days
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1021-remove-outermost-parentheses		1021-remove-outermost-parentheses
103-binary-tree-zigzag-level-order-traversal		103-binary-tree-zigzag-level-order-traversal
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1047-remove-all-adjacent-duplicates-in-string		1047-remove-all-adjacent-duplicates-in-string
1048-longest-string-chain		1048-longest-string-chain
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
1074-number-of-submatrices-that-sum-to-target		1074-number-of-submatrices-that-sum-to-target
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
109-convert-sorted-list-to-binary-search-tree		109-convert-sorted-list-to-binary-search-tree
1094-car-pooling		1094-car-pooling
11-container-with-most-water		11-container-with-most-water
112-path-sum		112-path-sum
1122-relative-sort-array		1122-relative-sort-array
113-path-sum-ii		113-path-sum-ii
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
115-distinct-subsequences		115-distinct-subsequences
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
1177-can-make-palindrome-from-substring		1177-can-make-palindrome-from-substring
118-pascals-triangle		118-pascals-triangle
119-pascals-triangle-ii		119-pascals-triangle-ii
1192-critical-connections-in-a-network		1192-critical-connections-in-a-network
12-integer-to-roman		12-integer-to-roman
120-triangle		120-triangle
1209-remove-all-adjacent-duplicates-in-string-ii		1209-remove-all-adjacent-duplicates-in-string-ii
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
1220-count-vowels-permutation		1220-count-vowels-permutation
123-best-time-to-buy-and-sell-stock-iii		123-best-time-to-buy-and-sell-stock-iii
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
126-word-ladder-ii		126-word-ladder-ii
127-word-ladder		127-word-ladder
128-longest-consecutive-sequence		128-longest-consecutive-sequence
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
1295-find-numbers-with-even-number-of-digits		1295-find-numbers-with-even-number-of-digits
1299-replace-elements-with-greatest-element-on-right-side		1299-replace-elements-with-greatest-element-on-right-side
130-surrounded-regions		130-surrounded-regions
1305-all-elements-in-two-binary-search-trees		1305-all-elements-in-two-binary-search-trees
131-palindrome-partitioning		131-palindrome-partitioning
1312-minimum-insertion-steps-to-make-a-string-palindrome		1312-minimum-insertion-steps-to-make-a-string-palindrome
1313-decompress-run-length-encoded-list		1313-decompress-run-length-encoded-list
1329-sort-the-matrix-diagonally		1329-sort-the-matrix-diagonally
133-clone-graph		133-clone-graph
1332-remove-palindromic-subsequences		1332-remove-palindromic-subsequences
1337-the-k-weakest-rows-in-a-matrix		1337-the-k-weakest-rows-in-a-matrix
1338-reduce-array-size-to-the-half		1338-reduce-array-size-to-the-half
134-gas-station		134-gas-station
1342-number-of-steps-to-reduce-a-number-to-zero		1342-number-of-steps-to-reduce-a-number-to-zero
1351-count-negative-numbers-in-a-sorted-matrix		1351-count-negative-numbers-in-a-sorted-matrix
1354-construct-target-array-with-multiple-sums		1354-construct-target-array-with-multiple-sums
136-single-number		136-single-number
137-single-number-ii		137-single-number-ii
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
1383-maximum-performance-of-a-team		1383-maximum-performance-of-a-team
139-word-break		139-word-break
1395-count-number-of-teams		1395-count-number-of-teams
14-longest-common-prefix		14-longest-common-prefix
140-word-break-ii		140-word-break-ii
1405-longest-happy-string		1405-longest-happy-string
141-linked-list-cycle		141-linked-list-cycle
142-linked-list-cycle-ii		142-linked-list-cycle-ii
1423-maximum-points-you-can-obtain-from-cards		1423-maximum-points-you-can-obtain-from-cards
1424-diagonal-traverse-ii		1424-diagonal-traverse-ii
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
1448-count-good-nodes-in-binary-tree		1448-count-good-nodes-in-binary-tree
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
1457-pseudo-palindromic-paths-in-a-binary-tree		1457-pseudo-palindromic-paths-in-a-binary-tree
1461-check-if-a-string-contains-all-binary-codes-of-size-k		1461-check-if-a-string-contains-all-binary-codes-of-size-k
1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts		1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts
147-insertion-sort-list		147-insertion-sort-list
1473-paint-house-iii		1473-paint-house-iii
148-sort-list		148-sort-list
1480-running-sum-of-1d-array		1480-running-sum-of-1d-array
1482-minimum-number-of-days-to-make-m-bouquets		1482-minimum-number-of-days-to-make-m-bouquets
149-max-points-on-a-line		149-max-points-on-a-line
1497-check-if-array-pairs-are-divisible-by-k		1497-check-if-array-pairs-are-divisible-by-k
15-3sum		15-3sum
150-evaluate-reverse-polish-notation		150-evaluate-reverse-polish-notation
151-reverse-words-in-a-string		151-reverse-words-in-a-string
1512-number-of-good-pairs		1512-number-of-good-pairs
152-maximum-product-subarray		152-maximum-product-subarray
1547-minimum-cost-to-cut-a-stick		1547-minimum-cost-to-cut-a-stick
155-min-stack		155-min-stack
160-intersection-of-two-linked-lists		160-intersection-of-two-linked-lists
1614-maximum-nesting-depth-of-the-parentheses		1614-maximum-nesting-depth-of-the-parentheses
162-find-peak-element		162-find-peak-element
1636-sort-array-by-increasing-frequency		1636-sort-array-by-increasing-frequency
1642-furthest-building-you-can-reach		1642-furthest-building-you-can-reach
1649-create-sorted-array-through-instructions		1649-create-sorted-array-through-instructions
1658-minimum-operations-to-reduce-x-to-zero		1658-minimum-operations-to-reduce-x-to-zero
167-two-sum-ii-input-array-is-sorted		167-two-sum-ii-input-array-is-sorted
1679-max-number-of-k-sum-pairs		1679-max-number-of-k-sum-pairs
168-excel-sheet-column-title		168-excel-sheet-column-title
1680-concatenation-of-consecutive-binary-numbers		1680-concatenation-of-consecutive-binary-numbers

Latest commit

History

Folders and files

Repository files navigation

LeetCode_Problem

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

LeetCode_Problem

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

LeetCode_Problem

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

LeetCode_Problem

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

LeetCode_Problem

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

LeetCode_Problem

About

Resources

Stars

Watchers

Forks