GitHub - devanshiprasad/Problem-Solving-Java: Solutions to all the problems that I have attempted on Leetcode and GFG.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 185 Commits
1207-delete-nodes-and-return-forest		1207-delete-nodes-and-return-forest
121-best-time-to-buy-and-sell-stock		121-best-time-to-buy-and-sell-stock
122-best-time-to-buy-and-sell-stock-ii		122-best-time-to-buy-and-sell-stock-ii
1298-reverse-substrings-between-each-pair-of-parentheses		1298-reverse-substrings-between-each-pair-of-parentheses
141-linked-list-cycle		141-linked-list-cycle
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
148-sort-list		148-sort-list
1496-lucky-numbers-in-a-matrix		1496-lucky-numbers-in-a-matrix
1511-count-number-of-teams		1511-count-number-of-teams
1556-make-two-arrays-equal-by-reversing-subarrays		1556-make-two-arrays-equal-by-reversing-subarrays
1570-final-prices-with-a-special-discount-in-a-shop		1570-final-prices-with-a-special-discount-in-a-shop
160-intersection-of-two-linked-lists		160-intersection-of-two-linked-lists
169-majority-element		169-majority-element
1711-find-valid-matrix-given-row-and-column-sums		1711-find-valid-matrix-given-row-and-column-sums
1720-crawler-log-folder		1720-crawler-log-folder
1741-sort-array-by-increasing-frequency		1741-sort-array-by-increasing-frequency
1756-minimum-deletions-to-make-string-balanced		1756-minimum-deletions-to-make-string-balanced
1818-maximum-score-from-removing-substrings		1818-maximum-score-from-removing-substrings
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
1951-find-the-winner-of-the-circular-game		1951-find-the-winner-of-the-circular-game
2-add-two-numbers		2-add-two-numbers
202-happy-number		202-happy-number
206-reverse-linked-list		206-reverse-linked-list
217-contains-duplicate		217-contains-duplicate
2171-second-minimum-time-to-reach-destination		2171-second-minimum-time-to-reach-destination
2216-delete-the-middle-node-of-a-linked-list		2216-delete-the-middle-node-of-a-linked-list
2217-step-by-step-directions-from-a-binary-tree-node-to-another		2217-step-by-step-directions-from-a-binary-tree-node-to-another
2255-minimum-swaps-to-group-all-1s-together-ii		2255-minimum-swaps-to-group-all-1s-together-ii
2306-create-binary-tree-from-descriptions		2306-create-binary-tree-from-descriptions
231-power-of-two		231-power-of-two
237-delete-node-in-a-linked-list		237-delete-node-in-a-linked-list
2472-build-a-matrix-with-conditions		2472-build-a-matrix-with-conditions
2502-sort-the-people		2502-sort-the-people
2536-determine-if-two-events-have-conflict		2536-determine-if-two-events-have-conflict
2727-number-of-senior-citizens		2727-number-of-senior-citizens
273-integer-to-english-words		273-integer-to-english-words
3-longest-substring-without-repeating-characters		3-longest-substring-without-repeating-characters
3235-minimum-cost-to-convert-string-i		3235-minimum-cost-to-convert-string-i
34-find-first-and-last-position-of-element-in-sorted-array		34-find-first-and-last-position-of-element-in-sorted-array
35-search-insert-position		35-search-insert-position
455-assign-cookies		455-assign-cookies
503-next-greater-element-ii		503-next-greater-element-ii
55-jump-game		55-jump-game
66-plus-one		66-plus-one
792-binary-search		792-binary-search
948-sort-an-array		948-sort-an-array
Difficulty: Basic		Difficulty: Basic
Difficulty: Easy		Difficulty: Easy
Difficulty: Hard/Edit Distance		Difficulty: Hard/Edit Distance
Difficulty: Medium		Difficulty: Medium