DSA-Problem-Solutions

Collection of solutions to LeetCode and GeeksForGeeks problems - Created using LeetHub

Name		Name	Last commit message	Last commit date
Latest commit History 697 Commits
0 - 1 Knapsack Problem - GFG		0 - 1 Knapsack Problem - GFG
1-two-sum		1-two-sum
100-same-tree		100-same-tree
1000-minimum-cost-to-merge-stones		1000-minimum-cost-to-merge-stones
1008-construct-binary-search-tree-from-preorder-traversal		1008-construct-binary-search-tree-from-preorder-traversal
101-symmetric-tree		101-symmetric-tree
1014-best-sightseeing-pair		1014-best-sightseeing-pair
102-binary-tree-level-order-traversal		102-binary-tree-level-order-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
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
110-balanced-binary-tree		110-balanced-binary-tree
111-minimum-depth-of-binary-tree		111-minimum-depth-of-binary-tree
113-path-sum-ii		113-path-sum-ii
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
1143-longest-common-subsequence		1143-longest-common-subsequence
116-populating-next-right-pointers-in-each-node		116-populating-next-right-pointers-in-each-node
118-pascals-triangle		118-pascals-triangle
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
128-longest-consecutive-sequence		128-longest-consecutive-sequence
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
13-roman-to-integer		13-roman-to-integer
131-palindrome-partitioning		131-palindrome-partitioning
133-clone-graph		133-clone-graph
1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance		1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1373-maximum-sum-bst-in-binary-tree		1373-maximum-sum-bst-in-binary-tree
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
1383-maximum-performance-of-a-team		1383-maximum-performance-of-a-team
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
144-binary-tree-preorder-traversal		144-binary-tree-preorder-traversal
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
146-lru-cache		146-lru-cache
151-reverse-words-in-a-string		151-reverse-words-in-a-string
152-maximum-product-subarray		152-maximum-product-subarray
1520-maximum-number-of-non-overlapping-substrings		1520-maximum-number-of-non-overlapping-substrings
1547-minimum-cost-to-cut-a-stick		1547-minimum-cost-to-cut-a-stick
155-min-stack		155-min-stack
1567-maximum-length-of-subarray-with-positive-product		1567-maximum-length-of-subarray-with-positive-product
160-intersection-of-two-linked-lists		160-intersection-of-two-linked-lists
1631-path-with-minimum-effort		1631-path-with-minimum-effort
165-compare-version-numbers		165-compare-version-numbers
1679-max-number-of-k-sum-pairs		1679-max-number-of-k-sum-pairs
169-majority-element		169-majority-element
1707-maximum-xor-with-an-element-from-array		1707-maximum-xor-with-an-element-from-array
173-binary-search-tree-iterator		173-binary-search-tree-iterator
1786-number-of-restricted-paths-from-first-to-last-node		1786-number-of-restricted-paths-from-first-to-last-node
188-best-time-to-buy-and-sell-stock-iv		188-best-time-to-buy-and-sell-stock-iv
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
1905-count-sub-islands		1905-count-sub-islands
1976-number-of-ways-to-arrive-at-destination		1976-number-of-ways-to-arrive-at-destination
2-add-two-numbers		2-add-two-numbers
20-valid-parentheses		20-valid-parentheses
200-number-of-islands		200-number-of-islands
202-happy-number		202-happy-number
206-reverse-linked-list		206-reverse-linked-list
207-course-schedule		207-course-schedule
208-implement-trie-prefix-tree		208-implement-trie-prefix-tree
21-merge-two-sorted-lists		21-merge-two-sorted-lists
215-kth-largest-element-in-an-array		215-kth-largest-element-in-an-array
218-the-skyline-problem		218-the-skyline-problem
223-rectangle-area		223-rectangle-area
225-implement-stack-using-queues		225-implement-stack-using-queues
229-majority-element-ii		229-majority-element-ii
230-kth-smallest-element-in-a-bst		230-kth-smallest-element-in-a-bst
232-implement-queue-using-stacks		232-implement-queue-using-stacks
234-palindrome-linked-list		234-palindrome-linked-list
235-lowest-common-ancestor-of-a-binary-search-tree		235-lowest-common-ancestor-of-a-binary-search-tree
236-lowest-common-ancestor-of-a-binary-tree		236-lowest-common-ancestor-of-a-binary-tree
237-delete-node-in-a-linked-list		237-delete-node-in-a-linked-list
239-sliding-window-maximum		239-sliding-window-maximum
24-swap-nodes-in-pairs		24-swap-nodes-in-pairs
240-search-a-2d-matrix-ii		240-search-a-2d-matrix-ii
25-reverse-nodes-in-k-group		25-reverse-nodes-in-k-group
26-remove-duplicates-from-sorted-array		26-remove-duplicates-from-sorted-array
27-remove-element		27-remove-element
28-implement-strstr		28-implement-strstr
287-find-the-duplicate-number		287-find-the-duplicate-number
295-find-median-from-data-stream		295-find-median-from-data-stream
297-serialize-and-deserialize-binary-tree		297-serialize-and-deserialize-binary-tree
3-longest-substring-without-repeating-characters		3-longest-substring-without-repeating-characters
300-longest-increasing-subsequence		300-longest-increasing-subsequence
304-range-sum-query-2d-immutable		304-range-sum-query-2d-immutable
309-best-time-to-buy-and-sell-stock-with-cooldown		309-best-time-to-buy-and-sell-stock-with-cooldown
31-next-permutation		31-next-permutation
310-minimum-height-trees		310-minimum-height-trees
312-burst-balloons		312-burst-balloons
322-coin-change		322-coin-change
33-search-in-rotated-sorted-array		33-search-in-rotated-sorted-array
338-counting-bits		338-counting-bits
347-top-k-frequent-elements		347-top-k-frequent-elements
37-sudoku-solver		37-sudoku-solver
38-count-and-say		38-count-and-say

marmik2001/DSA-Problem-Solutions

Folders and files

Latest commit

History