LeetCode-Sol

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

Name		Name	Last commit message	Last commit date
Latest commit History 851 Commits
0038-count-and-say		0038-count-and-say
0066-plus-one		0066-plus-one
0070-climbing-stairs		0070-climbing-stairs
0122-best-time-to-buy-and-sell-stock-ii		0122-best-time-to-buy-and-sell-stock-ii
0135-candy		0135-candy
0181-employees-earning-more-than-their-managers		0181-employees-earning-more-than-their-managers
0182-duplicate-emails		0182-duplicate-emails
0183-customers-who-never-order		0183-customers-who-never-order
0198-house-robber		0198-house-robber
0326-power-of-three		0326-power-of-three
0334-increasing-triplet-subsequence		0334-increasing-triplet-subsequence
0523-continuous-subarray-sum		0523-continuous-subarray-sum
0535-encode-and-decode-tinyurl		0535-encode-and-decode-tinyurl
0554-brick-wall		0554-brick-wall
0560-subarray-sum-equals-k		0560-subarray-sum-equals-k
0746-min-cost-climbing-stairs		0746-min-cost-climbing-stairs
0766-toeplitz-matrix		0766-toeplitz-matrix
1-two-sum		1-two-sum
100-same-tree		100-same-tree
1001-grid-illumination		1001-grid-illumination
1003-check-if-word-is-valid-after-substitutions		1003-check-if-word-is-valid-after-substitutions
1007-minimum-domino-rotations-for-equal-row		1007-minimum-domino-rotations-for-equal-row
1008-construct-binary-search-tree-from-preorder-traversal		1008-construct-binary-search-tree-from-preorder-traversal
101-symmetric-tree		101-symmetric-tree
1019-next-greater-node-in-linked-list		1019-next-greater-node-in-linked-list
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1026-maximum-difference-between-node-and-ancestor		1026-maximum-difference-between-node-and-ancestor
1028-recover-a-tree-from-preorder-traversal		1028-recover-a-tree-from-preorder-traversal
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
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
107-binary-tree-level-order-traversal-ii		107-binary-tree-level-order-traversal-ii
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
110-balanced-binary-tree		110-balanced-binary-tree
111-minimum-depth-of-binary-tree		111-minimum-depth-of-binary-tree
112-path-sum		112-path-sum
1123-lowest-common-ancestor-of-deepest-leaves		1123-lowest-common-ancestor-of-deepest-leaves
113-path-sum-ii		113-path-sum-ii
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
116-populating-next-right-pointers-in-each-node		116-populating-next-right-pointers-in-each-node
1162-as-far-from-land-as-possible		1162-as-far-from-land-as-possible
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
118-pascals-triangle		118-pascals-triangle
1200-minimum-absolute-difference		1200-minimum-absolute-difference
1207-unique-number-of-occurrences		1207-unique-number-of-occurrences
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
125-valid-palindrome		125-valid-palindrome
127-word-ladder		127-word-ladder
128-longest-consecutive-sequence		128-longest-consecutive-sequence
1299-replace-elements-with-greatest-element-on-right-side		1299-replace-elements-with-greatest-element-on-right-side
130-surrounded-regions		130-surrounded-regions
1302-deepest-leaves-sum		1302-deepest-leaves-sum
1305-all-elements-in-two-binary-search-trees		1305-all-elements-in-two-binary-search-trees
1315-sum-of-nodes-with-even-valued-grandparent		1315-sum-of-nodes-with-even-valued-grandparent
1328-break-a-palindrome		1328-break-a-palindrome
133-clone-graph		133-clone-graph
1339-maximum-product-of-splitted-binary-tree		1339-maximum-product-of-splitted-binary-tree
1346-check-if-n-and-its-double-exist		1346-check-if-n-and-its-double-exist
136-single-number		136-single-number
1367-linked-list-in-binary-tree		1367-linked-list-in-binary-tree
137-single-number-ii		137-single-number-ii
1373-maximum-sum-bst-in-binary-tree		1373-maximum-sum-bst-in-binary-tree
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree		1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
1381-design-a-stack-with-increment-operation		1381-design-a-stack-with-increment-operation
14-longest-common-prefix		14-longest-common-prefix
1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one		1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one
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
143-reorder-list		143-reorder-list
1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit		1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
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
147-insertion-sort-list		147-insertion-sort-list
149-max-points-on-a-line		149-max-points-on-a-line
150-evaluate-reverse-polish-notation		150-evaluate-reverse-polish-notation
1524-number-of-sub-arrays-with-odd-sum		1524-number-of-sub-arrays-with-odd-sum
155-min-stack		155-min-stack
1559-detect-cycles-in-2d-grid		1559-detect-cycles-in-2d-grid
1578-minimum-time-to-make-rope-colorful		1578-minimum-time-to-make-rope-colorful
16-3sum-closest		16-3sum-closest
1611-minimum-one-bit-operations-to-make-integers-zero		1611-minimum-one-bit-operations-to-make-integers-zero
1669-merge-in-between-linked-lists		1669-merge-in-between-linked-lists
173-binary-search-tree-iterator		173-binary-search-tree-iterator
175-combine-two-tables		175-combine-two-tables
1832-check-if-the-sentence-is-pangram		1832-check-if-the-sentence-is-pangram
1838-frequency-of-the-most-frequent-element		1838-frequency-of-the-most-frequent-element
187-repeated-dna-sequences		187-repeated-dna-sequences
1894-find-the-student-that-will-replace-the-chalk		1894-find-the-student-that-will-replace-the-chalk
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
191-number-of-1-bits		191-number-of-1-bits
1930-unique-length-3-palindromic-subsequences		1930-unique-length-3-palindromic-subsequences
1963-minimum-number-of-swaps-to-make-the-string-balanced		1963-minimum-number-of-swaps-to-make-the-string-balanced
1984-minimum-difference-between-highest-and-lowest-of-k-scores		1984-minimum-difference-between-highest-and-lowest-of-k-scores

Madhavsingla1/LeetCode-Sol

Folders and files

Latest commit

History