GitHub - vasav-prashar/DSA-Leetcode: Solving leetcode problems

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1,134 Commits
0079-word-search		0079-word-search
0416-partition-equal-subset-sum		0416-partition-equal-subset-sum
0494-target-sum		0494-target-sum
0518-coin-change-ii		0518-coin-change-ii
1-two-sum		1-two-sum
1. Preorder Traversal - GFG		1. Preorder Traversal - GFG
10. Maximum Width of Tree - GFG		10. Maximum Width of Tree - GFG
1009-complement-of-base-10-integer		1009-complement-of-base-10-integer
101-symmetric-tree		101-symmetric-tree
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1022-sum-of-root-to-leaf-binary-numbers		1022-sum-of-root-to-leaf-binary-numbers
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
1041-robot-bounded-in-circle		1041-robot-bounded-in-circle
1046-last-stone-weight		1046-last-stone-weight
1047-remove-all-adjacent-duplicates-in-string		1047-remove-all-adjacent-duplicates-in-string
1048-longest-string-chain		1048-longest-string-chain
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-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
1091-shortest-path-in-binary-matrix		1091-shortest-path-in-binary-matrix
1094-car-pooling		1094-car-pooling
11-container-with-most-water		11-container-with-most-water
112-path-sum		112-path-sum
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
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
118-pascals-triangle		118-pascals-triangle
1192-critical-connections-in-a-network		1192-critical-connections-in-a-network
12. Left View of Binary Tree - GFG		12. Left View of Binary Tree - GFG
120-triangle		120-triangle
1202-smallest-string-with-swaps		1202-smallest-string-with-swaps
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
1220-count-vowels-permutation		1220-count-vowels-permutation
126-word-ladder-ii		126-word-ladder-ii
1260-shift-2d-grid		1260-shift-2d-grid
1268-search-suggestions-system		1268-search-suggestions-system
127-word-ladder		127-word-ladder
128-longest-consecutive-sequence		128-longest-consecutive-sequence
1288-remove-covered-intervals		1288-remove-covered-intervals
1291-sequential-digits		1291-sequential-digits
13-roman-to-integer		13-roman-to-integer
13. Right View of Binary Tree - GFG		13. Right View of Binary Tree - GFG
1302-deepest-leaves-sum		1302-deepest-leaves-sum
1305-all-elements-in-two-binary-search-trees		1305-all-elements-in-two-binary-search-trees
131-palindrome-partitioning		131-palindrome-partitioning
1329-sort-the-matrix-diagonally		1329-sort-the-matrix-diagonally
133-clone-graph		133-clone-graph
1332-remove-palindromic-subsequences		1332-remove-palindromic-subsequences
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
1345-jump-game-iv		1345-jump-game-iv
135-candy		135-candy
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
1359-count-all-valid-pickup-and-delivery-options		1359-count-all-valid-pickup-and-delivery-options
136-single-number		136-single-number
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
1396-design-underground-system		1396-design-underground-system
14. Lowest Common Ancestor in a Binary Tree - GFG		14. Lowest Common Ancestor in a Binary Tree - GFG
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
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
1461-check-if-a-string-contains-all-binary-codes-of-size-k		1461-check-if-a-string-contains-all-binary-codes-of-size-k
1463-cherry-pickup-ii		1463-cherry-pickup-ii
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
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
151-reverse-words-in-a-string		151-reverse-words-in-a-string
1510-stone-game-iv		1510-stone-game-iv
16. Vertical Width of a Binary Tree - GFG		16. Vertical Width of a Binary Tree - GFG
160-intersection-of-two-linked-lists		160-intersection-of-two-linked-lists
1631-path-with-minimum-effort		1631-path-with-minimum-effort
1641-count-sorted-vowel-strings		1641-count-sorted-vowel-strings
1642-furthest-building-you-can-reach		1642-furthest-building-you-can-reach
1647-minimum-deletions-to-make-character-frequencies-unique		1647-minimum-deletions-to-make-character-frequencies-unique
165-compare-version-numbers		165-compare-version-numbers
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
1672-richest-customer-wealth		1672-richest-customer-wealth
1675-minimize-deviation-in-array		1675-minimize-deviation-in-array
1679-max-number-of-k-sum-pairs		1679-max-number-of-k-sum-pairs
1689-partitioning-into-minimum-number-of-deci-binary-numbers		1689-partitioning-into-minimum-number-of-deci-binary-numbers
169-majority-element		169-majority-element
1695-maximum-erasure-value		1695-maximum-erasure-value
1696-jump-game-vi		1696-jump-game-vi
17-letter-combinations-of-a-phone-number		17-letter-combinations-of-a-phone-number
17. Mirror Tree - GFG		17. Mirror Tree - GFG
171-excel-sheet-column-number		171-excel-sheet-column-number
1710-maximum-units-on-a-truck		1710-maximum-units-on-a-truck
1720-decode-xored-array		1720-decode-xored-array
1721-swapping-nodes-in-a-linked-list		1721-swapping-nodes-in-a-linked-list
173-binary-search-tree-iterator		173-binary-search-tree-iterator
183-customers-who-never-order		183-customers-who-never-order