GitHub - jagadeeshm007/leetcode: This repository serves as a collection of my solutions to various LeetCode Data Structures and Algorithms (DSA) problems using c++.

This repository serves as a collection of my solutions to various LeetCode Data Structures and Algorithms (DSA) problems.

Name		Name	Last commit message	Last commit date
Latest commit History 693 Commits
1-two-sum		1-two-sum
101-symmetric-tree		101-symmetric-tree
1039-find-the-town-judge		1039-find-the-town-judge
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1044-find-common-characters		1044-find-common-characters
1046-max-consecutive-ones-iii		1046-max-consecutive-ones-iii
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
1092-maximum-difference-between-node-and-ancestor		1092-maximum-difference-between-node-and-ancestor
112-path-sum		112-path-sum
1121-partition-array-for-maximum-sum		1121-partition-array-for-maximum-sum
1138-grumpy-bookstore-owner		1138-grumpy-bookstore-owner
1145-number-of-submatrices-that-sum-to-target		1145-number-of-submatrices-that-sum-to-target
115-distinct-subsequences		115-distinct-subsequences
12-integer-to-roman		12-integer-to-roman
120-triangle		120-triangle
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
1212-sequential-digits		1212-sequential-digits
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
125-valid-palindrome		125-valid-palindrome
1250-longest-common-subsequence		1250-longest-common-subsequence
1267-remove-zero-sum-consecutive-nodes-from-linked-list		1267-remove-zero-sum-consecutive-nodes-from-linked-list
13-roman-to-integer		13-roman-to-integer
130-surrounded-regions		130-surrounded-regions
1319-unique-number-of-occurrences		1319-unique-number-of-occurrences
134-gas-station		134-gas-station
135-candy		135-candy
1352-maximum-profit-in-job-scheduling		1352-maximum-profit-in-job-scheduling
1354-find-players-with-zero-or-one-losses		1354-find-players-with-zero-or-one-losses
136-single-number		136-single-number
1360-maximum-length-of-a-concatenated-string-with-unique-characters		1360-maximum-length-of-a-concatenated-string-with-unique-characters
137-single-number-ii		137-single-number-ii
1371-minimum-remove-to-make-valid-parentheses		1371-minimum-remove-to-make-valid-parentheses
139-word-break		139-word-break
14-longest-common-prefix		14-longest-common-prefix
1422-divide-array-in-sets-of-k-consecutive-numbers		1422-divide-array-in-sets-of-k-consecutive-numbers
1428-jump-game-iii		1428-jump-game-iii
1463-the-k-weakest-rows-in-a-matrix		1463-the-k-weakest-rows-in-a-matrix
1469-minimum-number-of-steps-to-make-two-strings-anagram		1469-minimum-number-of-steps-to-make-two-strings-anagram
1476-count-negative-numbers-in-a-sorted-matrix		1476-count-negative-numbers-in-a-sorted-matrix
15-3sum		15-3sum
150-evaluate-reverse-polish-notation		150-evaluate-reverse-polish-notation
151-reverse-words-in-a-string		151-reverse-words-in-a-string
153-find-minimum-in-rotated-sorted-array		153-find-minimum-in-rotated-sorted-array
1559-cherry-pickup-ii		1559-cherry-pickup-ii
1568-pseudo-palindromic-paths-in-a-binary-tree		1568-pseudo-palindromic-paths-in-a-binary-tree
1572-subrectangle-queries		1572-subrectangle-queries
16-3sum-closest		16-3sum-closest
1605-minimum-number-of-days-to-make-m-bouquets		1605-minimum-number-of-days-to-make-m-bouquets
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves		1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
162-find-peak-element		162-find-peak-element
1666-make-the-string-great		1666-make-the-string-great
169-majority-element		169-majority-element
17-letter-combinations-of-a-phone-number		17-letter-combinations-of-a-phone-number
1737-maximum-nesting-depth-of-the-parentheses		1737-maximum-nesting-depth-of-the-parentheses
1777-determine-if-two-strings-are-close		1777-determine-if-two-strings-are-close
1802-number-of-students-unable-to-eat-lunch		1802-number-of-students-unable-to-eat-lunch
1807-partitioning-into-minimum-number-of-deci-binary-numbers		1807-partitioning-into-minimum-number-of-deci-binary-numbers
1823-determine-if-string-halves-are-alike		1823-determine-if-string-halves-are-alike
1850-minimum-length-of-string-after-deleting-similar-ends		1850-minimum-length-of-string-after-deleting-similar-ends
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
190-reverse-bits		190-reverse-bits
191-number-of-1-bits		191-number-of-1-bits
1916-find-center-of-star-graph		1916-find-center-of-star-graph
198-house-robber		198-house-robber
2-add-two-numbers		2-add-two-numbers
20-valid-parentheses		20-valid-parentheses
200-number-of-islands		200-number-of-islands
2001-jump-game-vii		2001-jump-game-vii
201-bitwise-and-of-numbers-range		201-bitwise-and-of-numbers-range
205-isomorphic-strings		205-isomorphic-strings
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
2118-maximum-earnings-from-taxi		2118-maximum-earnings-from-taxi
2121-find-if-path-exists-in-graph		2121-find-if-path-exists-in-graph
2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points		2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points
2195-time-needed-to-buy-tickets		2195-time-needed-to-buy-tickets
2210-find-target-indices-after-sorting-array		2210-find-target-indices-after-sorting-array
2213-find-all-people-with-secret		2213-find-all-people-with-secret
222-count-complete-tree-nodes		222-count-complete-tree-nodes
2231-find-first-palindromic-string-in-the-array		2231-find-first-palindromic-string-in-the-array
226-invert-binary-tree		226-invert-binary-tree
2271-rearrange-array-elements-by-sign		2271-rearrange-array-elements-by-sign
228-summary-ranges		228-summary-ranges
229-majority-element-ii		229-majority-element-ii
2299-merge-nodes-in-between-zeros		2299-merge-nodes-in-between-zeros
231-power-of-two		231-power-of-two
232-implement-queue-using-stacks		232-implement-queue-using-stacks
2461-amount-of-time-for-binary-tree-to-be-infected		2461-amount-of-time-for-binary-tree-to-be-infected
2479-meeting-rooms-iii		2479-meeting-rooms-iii
2481-strictly-palindromic-number		2481-strictly-palindromic-number
2519-find-the-original-array-of-prefix-xor		2519-find-the-original-array-of-prefix-xor
2572-append-characters-to-string-to-make-subsequence		2572-append-characters-to-string-to-make-subsequence
258-add-digits		258-add-digits
26-remove-duplicates-from-sorted-array		26-remove-duplicates-from-sorted-array
263-ugly-number		263-ugly-number

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

About

Uh oh!

Releases

Packages

Uh oh!

Contributors

Uh oh!

Languages

Folders and files

Latest commit

History

Repository files navigation

About

Topics

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages