GitHub - Raj-m01/DSA-Challenge: List of DSA problems I solved during preparation

Raj-m01 / DSA-Challenge Public

Notifications You must be signed in to change notification settings
Fork 1
Star 0

List of DSA problems I solved during preparation

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 820 Commits
0054-spiral-matrix		0054-spiral-matrix
0092-reverse-linked-list-ii		0092-reverse-linked-list-ii
0113-path-sum-ii		0113-path-sum-ii
0131-palindrome-partitioning		0131-palindrome-partitioning
0177-nth-highest-salary		0177-nth-highest-salary
0182-duplicate-emails		0182-duplicate-emails
0234-palindrome-linked-list		0234-palindrome-linked-list
0445-add-two-numbers-ii		0445-add-two-numbers-ii
0547-number-of-provinces		0547-number-of-provinces
0692-top-k-frequent-words		0692-top-k-frequent-words
100-same-tree		100-same-tree
1008-construct-binary-search-tree-from-preorder-traversal		1008-construct-binary-search-tree-from-preorder-traversal
101-symmetric-tree		101-symmetric-tree
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
1095-find-in-mountain-array		1095-find-in-mountain-array
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
112-path-sum		112-path-sum
113-path-sum-ii		113-path-sum-ii
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
124-binary-tree-maximum-path-sum		124-binary-tree-maximum-path-sum
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
1448-count-good-nodes-in-binary-tree		1448-count-good-nodes-in-binary-tree
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
146-lru-cache		146-lru-cache
148-sort-list		148-sort-list
1482-minimum-number-of-days-to-make-m-bouquets		1482-minimum-number-of-days-to-make-m-bouquets
1512-number-of-good-pairs		1512-number-of-good-pairs
153-find-minimum-in-rotated-sorted-array		153-find-minimum-in-rotated-sorted-array
154-find-minimum-in-rotated-sorted-array-ii		154-find-minimum-in-rotated-sorted-array-ii
162-find-peak-element		162-find-peak-element
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
17-letter-combinations-of-a-phone-number		17-letter-combinations-of-a-phone-number
1721-swapping-nodes-in-a-linked-list		1721-swapping-nodes-in-a-linked-list
173-binary-search-tree-iterator		173-binary-search-tree-iterator
1752-check-if-array-is-sorted-and-rotated		1752-check-if-array-is-sorted-and-rotated
1832-check-if-the-sentence-is-pangram		1832-check-if-the-sentence-is-pangram
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
199-binary-tree-right-side-view		199-binary-tree-right-side-view
20-valid-parentheses		20-valid-parentheses
202-happy-number		202-happy-number
203-remove-linked-list-elements		203-remove-linked-list-elements
206-reverse-linked-list		206-reverse-linked-list
209-minimum-size-subarray-sum		209-minimum-size-subarray-sum
2095-delete-the-middle-node-of-a-linked-list		2095-delete-the-middle-node-of-a-linked-list
21-merge-two-sorted-lists		21-merge-two-sorted-lists
216-combination-sum-iii		216-combination-sum-iii
219-contains-duplicate-ii		219-contains-duplicate-ii
222-count-complete-tree-nodes		222-count-complete-tree-nodes
2220-minimum-bit-flips-to-convert-number		2220-minimum-bit-flips-to-convert-number
2221-find-triangular-sum-of-an-array		2221-find-triangular-sum-of-an-array
2236-root-equals-sum-of-children		2236-root-equals-sum-of-children
225-implement-stack-using-queues		225-implement-stack-using-queues
2270-number-of-ways-to-split-array		2270-number-of-ways-to-split-array
2299-strong-password-checker-ii		2299-strong-password-checker-ii
23-merge-k-sorted-lists		23-merge-k-sorted-lists
230-kth-smallest-element-in-a-bst		230-kth-smallest-element-in-a-bst
2300-successful-pairs-of-spells-and-potions		2300-successful-pairs-of-spells-and-potions
231-power-of-two		231-power-of-two
2336-smallest-number-in-infinite-set		2336-smallest-number-in-infinite-set
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
2358-maximum-number-of-groups-entering-a-competition		2358-maximum-number-of-groups-entering-a-competition
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
2398-maximum-number-of-robots-within-budget		2398-maximum-number-of-robots-within-budget
2399-check-distances-between-same-letters		2399-check-distances-between-same-letters
240-search-a-2d-matrix-ii		240-search-a-2d-matrix-ii
2414-length-of-the-longest-alphabetical-continuous-substring		2414-length-of-the-longest-alphabetical-continuous-substring
25-reverse-nodes-in-k-group		25-reverse-nodes-in-k-group
257-binary-tree-paths		257-binary-tree-paths
26-remove-duplicates-from-sorted-array		26-remove-duplicates-from-sorted-array
268-missing-number		268-missing-number
278-first-bad-version		278-first-bad-version
297-serialize-and-deserialize-binary-tree		297-serialize-and-deserialize-binary-tree
3-longest-substring-without-repeating-characters		3-longest-substring-without-repeating-characters
31-next-permutation		31-next-permutation
32-longest-valid-parentheses		32-longest-valid-parentheses
326-power-of-three		326-power-of-three
33-search-in-rotated-sorted-array		33-search-in-rotated-sorted-array
34-find-first-and-last-position-of-element-in-sorted-array		34-find-first-and-last-position-of-element-in-sorted-array
344-reverse-string		344-reverse-string
347-top-k-frequent-elements		347-top-k-frequent-elements
35-search-insert-position		35-search-insert-position
36-valid-sudoku		36-valid-sudoku
37-sudoku-solver		37-sudoku-solver
374-guess-number-higher-or-lower		374-guess-number-higher-or-lower
383-ransom-note		383-ransom-note
39-combination-sum		39-combination-sum
4-median-of-two-sorted-arrays		4-median-of-two-sorted-arrays

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

About

Uh oh!

Uh oh!

Languages

Raj-m01/DSA-Challenge

Folders and files

Latest commit

History

About

Topics

Uh oh!

Stars

Watchers

Forks

Uh oh!

Languages