GitHub - TalhaJubaerPrantor/LeetCode: Learning and solving DSA topics.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 106 Commits
0001-two-sum		0001-two-sum
0002-add-two-numbers		0002-add-two-numbers
0004-median-of-two-sorted-arrays		0004-median-of-two-sorted-arrays
0008-string-to-integer-atoi		0008-string-to-integer-atoi
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0025-reverse-nodes-in-k-group		0025-reverse-nodes-in-k-group
0029-divide-two-integers		0029-divide-two-integers
0042-trapping-rain-water		0042-trapping-rain-water
0050-powx-n		0050-powx-n
0061-rotate-list		0061-rotate-list
0074-search-a-2d-matrix		0074-search-a-2d-matrix
0078-subsets		0078-subsets
0084-largest-rectangle-in-histogram		0084-largest-rectangle-in-histogram
0136-single-number		0136-single-number
0138-copy-list-with-random-pointer		0138-copy-list-with-random-pointer
0141-linked-list-cycle		0141-linked-list-cycle
0142-linked-list-cycle-ii		0142-linked-list-cycle-ii
0148-sort-list		0148-sort-list
0151-reverse-words-in-a-string		0151-reverse-words-in-a-string
0155-min-stack		0155-min-stack
0204-count-primes		0204-count-primes
0205-isomorphic-strings		0205-isomorphic-strings
0206-reverse-linked-list		0206-reverse-linked-list
0231-power-of-two		0231-power-of-two
0232-implement-queue-using-stacks		0232-implement-queue-using-stacks
0237-delete-node-in-a-linked-list		0237-delete-node-in-a-linked-list
0240-search-a-2d-matrix-ii		0240-search-a-2d-matrix-ii
0242-valid-anagram		0242-valid-anagram
0328-odd-even-linked-list		0328-odd-even-linked-list
0402-remove-k-digits		0402-remove-k-digits
0410-split-array-largest-sum		0410-split-array-largest-sum
0451-sort-characters-by-frequency		0451-sort-characters-by-frequency
0496-next-greater-element-i		0496-next-greater-element-i
0503-next-greater-element-ii		0503-next-greater-element-ii
0735-asteroid-collision		0735-asteroid-collision
0796-rotate-string		0796-rotate-string
0876-middle-of-the-linked-list		0876-middle-of-the-linked-list
0907-sum-of-subarray-minimums		0907-sum-of-subarray-minimums
1011-capacity-to-ship-packages-within-d-days		1011-capacity-to-ship-packages-within-d-days
1021-remove-outermost-parentheses		1021-remove-outermost-parentheses
1283-find-the-smallest-divisor-given-a-threshold		1283-find-the-smallest-divisor-given-a-threshold
1482-minimum-number-of-days-to-make-m-bouquets		1482-minimum-number-of-days-to-make-m-bouquets
1539-kth-missing-positive-number		1539-kth-missing-positive-number
1614-maximum-nesting-depth-of-the-parentheses		1614-maximum-nesting-depth-of-the-parentheses
1901-find-a-peak-element-ii		1901-find-a-peak-element-ii
1903-largest-odd-number-in-string		1903-largest-odd-number-in-string
1922-count-good-numbers		1922-count-good-numbers
2095-delete-the-middle-node-of-a-linked-list		2095-delete-the-middle-node-of-a-linked-list
2104-sum-of-subarray-ranges		2104-sum-of-subarray-ranges
2220-minimum-bit-flips-to-convert-number		2220-minimum-bit-flips-to-convert-number
Infix to Postfix		Infix to Postfix