GitHub - anees4500/DSA-by-JAVA: Leetcode problem

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 208 Commits
1-two-sum		1-two-sum
1036-rotting-oranges		1036-rotting-oranges
1112-find-words-that-can-be-formed-by-characters		1112-find-words-that-can-be-formed-by-characters
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
1250-longest-common-subsequence		1250-longest-common-subsequence
13-roman-to-integer		13-roman-to-integer
1331-path-with-maximum-gold		1331-path-with-maximum-gold
1353-find-resultant-array-after-removing-anagrams		1353-find-resultant-array-after-removing-anagrams
152-maximum-product-subarray		152-maximum-product-subarray
16-3sum-closest		16-3sum-closest
1603-running-sum-of-1d-array		1603-running-sum-of-1d-array
1700-minimum-time-to-make-rope-colorful		1700-minimum-time-to-make-rope-colorful
1701-remove-max-number-of-edges-to-keep-graph-fully-traversable		1701-remove-max-number-of-edges-to-keep-graph-fully-traversable
174-dungeon-game		174-dungeon-game
179-largest-number		179-largest-number
18-4sum		18-4sum
1817-calculate-money-in-leetcode-bank		1817-calculate-money-in-leetcode-bank
200-number-of-islands		200-number-of-islands
207-course-schedule		207-course-schedule
2090-number-of-ways-to-arrive-at-destination		2090-number-of-ways-to-arrive-at-destination
2121-find-if-path-exists-in-graph		2121-find-if-path-exists-in-graph
2137-final-value-of-variable-after-performing-operations		2137-final-value-of-variable-after-performing-operations
2206-detonate-the-maximum-bombs		2206-detonate-the-maximum-bombs
2210-find-target-indices-after-sorting-array		2210-find-target-indices-after-sorting-array
2212-removing-minimum-and-maximum-from-array		2212-removing-minimum-and-maximum-from-array
2215-finding-3-digit-even-numbers		2215-finding-3-digit-even-numbers
2216-delete-the-middle-node-of-a-linked-list		2216-delete-the-middle-node-of-a-linked-list
2274-keep-multiplying-found-values-by-two		2274-keep-multiplying-found-values-by-two
2343-count-unguarded-cells-in-the-grid		2343-count-unguarded-cells-in-the-grid
2353-maximum-score-of-a-node-sequence		2353-maximum-score-of-a-node-sequence
237-delete-node-in-a-linked-list		237-delete-node-in-a-linked-list
241-different-ways-to-add-parentheses		241-different-ways-to-add-parentheses
2626-count-the-number-of-good-subarrays		2626-count-the-number-of-good-subarrays
2661-smallest-missing-non-negative-integer-after-operations		2661-smallest-missing-non-negative-integer-after-operations
283-move-zeroes		283-move-zeroes
290-word-pattern		290-word-pattern
300-longest-increasing-subsequence		300-longest-increasing-subsequence
322-coin-change		322-coin-change
338-counting-bits		338-counting-bits
3383-taking-maximum-energy-from-the-mystic-dungeon		3383-taking-maximum-energy-from-the-mystic-dungeon
3501-delete-nodes-from-linked-list-present-in-array		3501-delete-nodes-from-linked-list-present-in-array
3581-the-two-sneaky-numbers-of-digitville		3581-the-two-sneaky-numbers-of-digitville
3610-find-x-sum-of-all-k-long-subarrays-i		3610-find-x-sum-of-all-k-long-subarrays-i
3619-adjacent-increasing-subarrays-detection-ii		3619-adjacent-increasing-subarrays-detection-ii
3747-maximum-difference-between-adjacent-elements-in-a-circular-array		3747-maximum-difference-between-adjacent-elements-in-a-circular-array
3753-maximum-difference-between-even-and-odd-frequency-i		3753-maximum-difference-between-even-and-odd-frequency-i
3768-check-if-digits-are-equal-in-string-after-operations-i		3768-check-if-digits-are-equal-in-string-after-operations-i
383-ransom-note		383-ransom-note
389-find-the-difference		389-find-the-difference
404-sum-of-left-leaves		404-sum-of-left-leaves
4052-equal-score-substrings		4052-equal-score-substrings
4054-count-distinct-integers-after-removing-zeros		4054-count-distinct-integers-after-removing-zeros
4115-minimum-distance-between-three-equal-elements-i		4115-minimum-distance-between-three-equal-elements-i
416-partition-equal-subset-sum		416-partition-equal-subset-sum
438-find-all-anagrams-in-a-string		438-find-all-anagrams-in-a-string
443-string-compression		443-string-compression
448-find-all-numbers-disappeared-in-an-array		448-find-all-numbers-disappeared-in-an-array
455-assign-cookies		455-assign-cookies
49-group-anagrams		49-group-anagrams
51-n-queens		51-n-queens
518-coin-change-ii		518-coin-change-ii
539-minimum-time-difference		539-minimum-time-difference
541-reverse-string-ii		541-reverse-string-ii
547-number-of-provinces		547-number-of-provinces
551-student-attendance-record-i		551-student-attendance-record-i
557-reverse-words-in-a-string-iii		557-reverse-words-in-a-string-iii
561-array-partition		561-array-partition
567-permutation-in-string		567-permutation-in-string
583-delete-operation-for-two-strings		583-delete-operation-for-two-strings
605-can-place-flowers		605-can-place-flowers
637-average-of-levels-in-binary-tree		637-average-of-levels-in-binary-tree
64-minimum-path-sum		64-minimum-path-sum
657-robot-return-to-origin		657-robot-return-to-origin
66-plus-one		66-plus-one
674-longest-continuous-increasing-subsequence		674-longest-continuous-increasing-subsequence
7-reverse-integer		7-reverse-integer
712-minimum-ascii-delete-sum-for-two-strings		712-minimum-ascii-delete-sum-for-two-strings
72-edit-distance		72-edit-distance
724-find-pivot-index		724-find-pivot-index
75-sort-colors		75-sort-colors
803-cheapest-flights-within-k-stops		803-cheapest-flights-within-k-stops
813-all-paths-from-source-to-target		813-all-paths-from-source-to-target
838-design-linked-list		838-design-linked-list
896-smallest-subtree-with-all-the-deepest-nodes		896-smallest-subtree-with-all-the-deepest-nodes
930-all-possible-full-binary-trees		930-all-possible-full-binary-trees
941-sort-array-by-parity		941-sort-array-by-parity
98-validate-binary-search-tree		98-validate-binary-search-tree
99-recover-binary-search-tree		99-recover-binary-search-tree