GitHub - tanish-jain-225/DSA: A curated collection of my Data Structures and Algorithms practice problems. This repository reflects my commitment to improving problem-solving skills and preparing for coding interviews and competitive programming.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 374 Commits
1-two-sum		1-two-sum
100-same-tree		100-same-tree
1013-fibonacci-number		1013-fibonacci-number
1016-subarray-sums-divisible-by-k		1016-subarray-sums-divisible-by-k
1019-squares-of-a-sorted-array		1019-squares-of-a-sorted-array
1028-interval-list-intersections		1028-interval-list-intersections
1036-rotting-oranges		1036-rotting-oranges
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
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
11-container-with-most-water		11-container-with-most-water
1128-remove-all-adjacent-duplicates-in-string		1128-remove-all-adjacent-duplicates-in-string
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
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
125-valid-palindrome		125-valid-palindrome
1288-maximum-subarray-sum-with-one-deletion		1288-maximum-subarray-sum-with-one-deletion
1297-maximum-number-of-balloons		1297-maximum-number-of-balloons
1300-critical-connections-in-a-network		1300-critical-connections-in-a-network
131-palindrome-partitioning		131-palindrome-partitioning
1320-remove-all-adjacent-duplicates-in-string-ii		1320-remove-all-adjacent-duplicates-in-string-ii
134-gas-station		134-gas-station
136-single-number		136-single-number
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
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
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
146-lru-cache		146-lru-cache
15-3sum		15-3sum
151-reverse-words-in-a-string		151-reverse-words-in-a-string
152-maximum-product-subarray		152-maximum-product-subarray
153-find-minimum-in-rotated-sorted-array		153-find-minimum-in-rotated-sorted-array
155-min-stack		155-min-stack
16-3sum-closest		16-3sum-closest
167-two-sum-ii-input-array-is-sorted		167-two-sum-ii-input-array-is-sorted
169-majority-element		169-majority-element
1706-min-cost-to-connect-all-points		1706-min-cost-to-connect-all-points
173-binary-search-tree-iterator		173-binary-search-tree-iterator
18-4sum		18-4sum
20-valid-parentheses		20-valid-parentheses
200-number-of-islands		200-number-of-islands
202-happy-number		202-happy-number
2021-remove-all-occurrences-of-a-substring		2021-remove-all-occurrences-of-a-substring
204-count-primes		204-count-primes
206-reverse-linked-list		206-reverse-linked-list
207-course-schedule		207-course-schedule
209-minimum-size-subarray-sum		209-minimum-size-subarray-sum
21-merge-two-sorted-lists		21-merge-two-sorted-lists
210-course-schedule-ii		210-course-schedule-ii
225-implement-stack-using-queues		225-implement-stack-using-queues
230-kth-smallest-element-in-a-bst		230-kth-smallest-element-in-a-bst
232-implement-queue-using-stacks		232-implement-queue-using-stacks
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
238-product-of-array-except-self		238-product-of-array-except-self
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
257-binary-tree-paths		257-binary-tree-paths
26-remove-duplicates-from-sorted-array		26-remove-duplicates-from-sorted-array
2662-check-knight-tour-configuration		2662-check-knight-tour-configuration
287-find-the-duplicate-number		287-find-the-duplicate-number
3-longest-substring-without-repeating-characters		3-longest-substring-without-repeating-characters
31-next-permutation		31-next-permutation
3227-find-missing-and-repeated-values		3227-find-missing-and-repeated-values
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
37-sudoku-solver		37-sudoku-solver
378-kth-smallest-element-in-a-sorted-matrix		378-kth-smallest-element-in-a-sorted-matrix
383-ransom-note		383-ransom-note
387-first-unique-character-in-a-string		387-first-unique-character-in-a-string
39-combination-sum		39-combination-sum
409-longest-palindrome		409-longest-palindrome
42-trapping-rain-water		42-trapping-rain-water
424-longest-repeating-character-replacement		424-longest-repeating-character-replacement
443-string-compression		443-string-compression
46-permutations		46-permutations
496-next-greater-element-i		496-next-greater-element-i
50-powx-n		50-powx-n
503-next-greater-element-ii		503-next-greater-element-ii
51-n-queens		51-n-queens
525-contiguous-array		525-contiguous-array
53-maximum-subarray		53-maximum-subarray
54-spiral-matrix		54-spiral-matrix
540-single-element-in-a-sorted-array		540-single-element-in-a-sorted-array
543-diameter-of-binary-tree		543-diameter-of-binary-tree
547-number-of-provinces		547-number-of-provinces
56-merge-intervals		56-merge-intervals
560-subarray-sum-equals-k		560-subarray-sum-equals-k
567-permutation-in-string		567-permutation-in-string
57-insert-interval		57-insert-interval
572-subtree-of-another-tree		572-subtree-of-another-tree
61-rotate-list		61-rotate-list
662-maximum-width-of-binary-tree		662-maximum-width-of-binary-tree
668-kth-smallest-number-in-multiplication-table		668-kth-smallest-number-in-multiplication-table

About

A curated collection of my Data Structures and Algorithms practice problems. This repository reflects my commitment to improving problem-solving skills and preparing for coding interviews and competitive programming.

Activity

0 stars

1 watching

0 forks

Report repository

Navigation Menu

About

Releases

Packages

Contributors

Languages

Folders and files

Latest commit

History

About

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages