DSA Practice

[ Solutions to Data Structures and Algorithms problems from LeetCode and other platforms, organized by topic ]

This repository contains solutions to Data Structures and Algorithms problems solved on platforms like LeetCode,GFG.

Purpose:

Track my progress and improve problem-solving skills

Happy Coding:)

Name		Name	Last commit message	Last commit date
Latest commit History 403 Commits
100-same-tree		100-same-tree
101-symmetric-tree		101-symmetric-tree
1013-fibonacci-number		1013-fibonacci-number
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
1034-subarrays-with-k-different-integers		1034-subarrays-with-k-different-integers
1036-rotting-oranges		1036-rotting-oranges
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1046-max-consecutive-ones-iii		1046-max-consecutive-ones-iii
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
1050-construct-binary-search-tree-from-preorder-traversal		1050-construct-binary-search-tree-from-preorder-traversal
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
11-container-with-most-water		11-container-with-most-water
110-balanced-binary-tree		110-balanced-binary-tree
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
12-integer-to-roman		12-integer-to-roman
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
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
134-gas-station		134-gas-station
135-candy		135-candy
136-single-number		136-single-number
1370-count-number-of-nice-subarrays		1370-count-number-of-nice-subarrays
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
1408-find-the-smallest-divisor-given-a-threshold		1408-find-the-smallest-divisor-given-a-threshold
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
1445-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold		1445-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
1460-number-of-substrings-containing-all-three-characters		1460-number-of-substrings-containing-all-three-characters
148-sort-list		148-sort-list
151-reverse-words-in-a-string		151-reverse-words-in-a-string
1538-maximum-points-you-can-obtain-from-cards		1538-maximum-points-you-can-obtain-from-cards
154-find-minimum-in-rotated-sorted-array-ii		154-find-minimum-in-rotated-sorted-array-ii
160-intersection-of-two-linked-lists		160-intersection-of-two-linked-lists
162-find-peak-element		162-find-peak-element
1656-count-good-triplets		1656-count-good-triplets
167-two-sum-ii-input-array-is-sorted		167-two-sum-ii-input-array-is-sorted
169-majority-element		169-majority-element
173-binary-search-tree-iterator		173-binary-search-tree-iterator
1878-check-if-array-is-sorted-and-rotated		1878-check-if-array-is-sorted-and-rotated
189-rotate-array		189-rotate-array
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
1987-substrings-of-size-three-with-distinct-characters		1987-substrings-of-size-three-with-distinct-characters
2-add-two-numbers		2-add-two-numbers
20-valid-parentheses		20-valid-parentheses
203-remove-linked-list-elements		203-remove-linked-list-elements
2047-find-a-peak-element-ii		2047-find-a-peak-element-ii
206-reverse-linked-list		206-reverse-linked-list
209-minimum-size-subarray-sum		209-minimum-size-subarray-sum
21-merge-two-sorted-lists		21-merge-two-sorted-lists
2112-minimum-difference-between-highest-and-lowest-of-k-scores		2112-minimum-difference-between-highest-and-lowest-of-k-scores
219-contains-duplicate-ii		219-contains-duplicate-ii
2216-delete-the-middle-node-of-a-linked-list		2216-delete-the-middle-node-of-a-linked-list
225-implement-stack-using-queues		225-implement-stack-using-queues
2271-rearrange-array-elements-by-sign		2271-rearrange-array-elements-by-sign
229-majority-element-ii		229-majority-element-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
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
25-reverse-nodes-in-k-group		25-reverse-nodes-in-k-group
2573-remove-nodes-from-linked-list		2573-remove-nodes-from-linked-list
268-missing-number		268-missing-number
2737-row-with-maximum-ones		2737-row-with-maximum-ones
275-h-index-ii		275-h-index-ii
278-first-bad-version		278-first-bad-version
28-find-the-index-of-the-first-occurrence-in-a-string		28-find-the-index-of-the-first-occurrence-in-a-string
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
328-odd-even-linked-list		328-odd-even-linked-list
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
3501-delete-nodes-from-linked-list-present-in-array		3501-delete-nodes-from-linked-list-present-in-array
3788-maximum-unique-subarray-sum-after-deletion		3788-maximum-unique-subarray-sum-after-deletion
4-median-of-two-sorted-arrays		4-median-of-two-sorted-arrays
424-longest-repeating-character-replacement		424-longest-repeating-character-replacement
450-delete-node-in-a-bst		450-delete-node-in-a-bst
455-assign-cookies		455-assign-cookies
503-next-greater-element-ii		503-next-greater-element-ii
54-spiral-matrix		54-spiral-matrix
543-diameter-of-binary-tree		543-diameter-of-binary-tree
547-number-of-provinces		547-number-of-provinces
55-jump-game		55-jump-game
560-subarray-sum-equals-k		560-subarray-sum-equals-k
561-array-partition		561-array-partition
575-distribute-candies		575-distribute-candies
58-length-of-last-word		58-length-of-last-word
61-rotate-list		61-rotate-list
653-two-sum-iv-input-is-a-bst		653-two-sum-iv-input-is-a-bst
658-find-k-closest-elements		658-find-k-closest-elements
662-maximum-width-of-binary-tree		662-maximum-width-of-binary-tree
70-climbing-stairs		70-climbing-stairs
724-find-pivot-index		724-find-pivot-index

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

DSA Practice

Purpose:

About

Uh oh!

Releases

Packages

Uh oh!

Contributors

Uh oh!

Languages

Folders and files

Latest commit

History

Repository files navigation

DSA Practice

Purpose:

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages