Leetcode-Solutions

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

Name		Name	Last commit message	Last commit date
Latest commit History 878 Commits
0 - 1 Knapsack Problem - GFG		0 - 1 Knapsack Problem - GFG
01. Recursion & Backtracking		01. Recursion & Backtracking
02. Binary Search		02. Binary Search
03. Sorting		03. Sorting
04. Two Pointer		04. Two Pointer
05. Tries		05. Tries
06. Linked List		06. Linked List
1-two-sum		1-two-sum
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
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
1035-uncrossed-lines		1035-uncrossed-lines
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
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
1092-shortest-common-supersequence		1092-shortest-common-supersequence
11-container-with-most-water		11-container-with-most-water
110-balanced-binary-tree		110-balanced-binary-tree
111-minimum-depth-of-binary-tree		111-minimum-depth-of-binary-tree
1114-print-in-order		1114-print-in-order
1115-print-foobar-alternately		1115-print-foobar-alternately
1116-print-zero-even-odd		1116-print-zero-even-odd
1117-building-h2o		1117-building-h2o
112-path-sum		112-path-sum
113-path-sum-ii		113-path-sum-ii
1143-longest-common-subsequence		1143-longest-common-subsequence
115-distinct-subsequences		115-distinct-subsequences
116-populating-next-right-pointers-in-each-node		116-populating-next-right-pointers-in-each-node
1161-maximum-level-sum-of-a-binary-tree		1161-maximum-level-sum-of-a-binary-tree
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
118-pascals-triangle		118-pascals-triangle
119-pascals-triangle-ii		119-pascals-triangle-ii
1190-reverse-substrings-between-each-pair-of-parentheses		1190-reverse-substrings-between-each-pair-of-parentheses
1191-k-concatenation-maximum-sum		1191-k-concatenation-maximum-sum
1192-critical-connections-in-a-network		1192-critical-connections-in-a-network
120-triangle		120-triangle
1202-smallest-string-with-swaps		1202-smallest-string-with-swaps
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
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
1240-tiling-a-rectangle-with-the-fewest-squares		1240-tiling-a-rectangle-with-the-fewest-squares
1249-minimum-remove-to-make-valid-parentheses		1249-minimum-remove-to-make-valid-parentheses
1255-maximum-score-words-formed-by-letters		1255-maximum-score-words-formed-by-letters
1268-search-suggestions-system		1268-search-suggestions-system
127-word-ladder		127-word-ladder
128-longest-consecutive-sequence		128-longest-consecutive-sequence
131-palindrome-partitioning		131-palindrome-partitioning
1312-minimum-insertion-steps-to-make-a-string-palindrome		1312-minimum-insertion-steps-to-make-a-string-palindrome
1319-number-of-operations-to-make-network-connected		1319-number-of-operations-to-make-network-connected
132-palindrome-partitioning-ii		132-palindrome-partitioning-ii
1339-maximum-product-of-splitted-binary-tree		1339-maximum-product-of-splitted-binary-tree
1367-linked-list-in-binary-tree		1367-linked-list-in-binary-tree
1372-longest-zigzag-path-in-a-binary-tree		1372-longest-zigzag-path-in-a-binary-tree
1376-time-needed-to-inform-all-employees		1376-time-needed-to-inform-all-employees
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
139-word-break		139-word-break
1390-four-divisors		1390-four-divisors
140-word-break-ii		140-word-break-ii
141-linked-list-cycle		141-linked-list-cycle
142-linked-list-cycle-ii		142-linked-list-cycle-ii
143-reorder-list		143-reorder-list
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
1447-simplified-fractions		1447-simplified-fractions
1463-cherry-pickup-ii		1463-cherry-pickup-ii
148-sort-list		148-sort-list
1492-the-kth-factor-of-n		1492-the-kth-factor-of-n
151-reverse-words-in-a-string		151-reverse-words-in-a-string
1514-path-with-maximum-probability		1514-path-with-maximum-probability
152-maximum-product-subarray		152-maximum-product-subarray
153-find-minimum-in-rotated-sorted-array		153-find-minimum-in-rotated-sorted-array
1541-minimum-insertions-to-balance-a-parentheses-string		1541-minimum-insertions-to-balance-a-parentheses-string
1547-minimum-cost-to-cut-a-stick		1547-minimum-cost-to-cut-a-stick
155-min-stack		155-min-stack
1552-magnetic-force-between-two-balls		1552-magnetic-force-between-two-balls
1584-min-cost-to-connect-all-points		1584-min-cost-to-connect-all-points
160-intersection-of-two-linked-lists		160-intersection-of-two-linked-lists
1627-graph-connectivity-with-threshold		1627-graph-connectivity-with-threshold
1631-path-with-minimum-effort		1631-path-with-minimum-effort
1636-sort-array-by-increasing-frequency		1636-sort-array-by-increasing-frequency
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
1670-design-front-middle-back-queue		1670-design-front-middle-back-queue
1671-minimum-number-of-removals-to-make-mountain-array		1671-minimum-number-of-removals-to-make-mountain-array
1679-max-number-of-k-sum-pairs		1679-max-number-of-k-sum-pairs
169-majority-element		169-majority-element
1697-checking-existence-of-edge-length-limited-paths		1697-checking-existence-of-edge-length-limited-paths
174-dungeon-game		174-dungeon-game
1803-count-pairs-with-xor-in-a-range		1803-count-pairs-with-xor-in-a-range
1832-check-if-the-sentence-is-pangram		1832-check-if-the-sentence-is-pangram
188-best-time-to-buy-and-sell-stock-iv		188-best-time-to-buy-and-sell-stock-iv
1884-egg-drop-with-2-eggs-and-n-floors		1884-egg-drop-with-2-eggs-and-n-floors
189-rotate-array		189-rotate-array
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
1971-find-if-path-exists-in-graph		1971-find-if-path-exists-in-graph

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Leetcode-Solutions

About

Releases

Packages

Languages

whyshashi/Leetcode-Solutions

Folders and files

Latest commit

History

Repository files navigation

Leetcode-Solutions

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages