GitHub - Dipendra-Raghav/Leetcode

1 Branch 0 Tags

Name		Name	Last commit message	Last commit date
Latest commit Dipendra-Raghav Time: 0 ms (100.00%), Space: 41.8 MB (75.56%) - LeetHub May 10, 2024 9f37389 · May 10, 2024 History 761 Commits
0005-longest-palindromic-substring		0005-longest-palindromic-substring
0006-zigzag-conversion		0006-zigzag-conversion
0013-roman-to-integer		0013-roman-to-integer
0014-longest-common-prefix		0014-longest-common-prefix
0017-letter-combinations-of-a-phone-number		0017-letter-combinations-of-a-phone-number
0019-remove-nth-node-from-end-of-list		0019-remove-nth-node-from-end-of-list
0020-valid-parentheses		0020-valid-parentheses
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0033-search-in-rotated-sorted-array		0033-search-in-rotated-sorted-array
0037-sudoku-solver		0037-sudoku-solver
0039-combination-sum		0039-combination-sum
0042-trapping-rain-water		0042-trapping-rain-water
0045-jump-game-ii		0045-jump-game-ii
0046-permutations		0046-permutations
0050-powx-n		0050-powx-n
0051-n-queens		0051-n-queens
0053-maximum-subarray		0053-maximum-subarray
0055-jump-game		0055-jump-game
0056-merge-intervals		0056-merge-intervals
0059-spiral-matrix-ii		0059-spiral-matrix-ii
0067-add-binary		0067-add-binary
0070-climbing-stairs		0070-climbing-stairs
0071-simplify-path		0071-simplify-path
0072-edit-distance		0072-edit-distance
0073-set-matrix-zeroes		0073-set-matrix-zeroes
0075-sort-colors		0075-sort-colors
0087-scramble-string		0087-scramble-string
0090-subsets-ii		0090-subsets-ii
0093-restore-ip-addresses		0093-restore-ip-addresses
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
0100-same-tree		0100-same-tree
0103-binary-tree-zigzag-level-order-traversal		0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree		0104-maximum-depth-of-binary-tree
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0124-binary-tree-maximum-path-sum		0124-binary-tree-maximum-path-sum
0128-longest-consecutive-sequence		0128-longest-consecutive-sequence
0129-sum-root-to-leaf-numbers		0129-sum-root-to-leaf-numbers
0131-palindrome-partitioning		0131-palindrome-partitioning
0133-clone-graph		0133-clone-graph
0134-gas-station		0134-gas-station
0139-word-break		0139-word-break
0141-linked-list-cycle		0141-linked-list-cycle
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0149-max-points-on-a-line		0149-max-points-on-a-line
0150-evaluate-reverse-polish-notation		0150-evaluate-reverse-polish-notation
0151-reverse-words-in-a-string		0151-reverse-words-in-a-string
0152-maximum-product-subarray		0152-maximum-product-subarray
0198-house-robber		0198-house-robber
0200-number-of-islands		0200-number-of-islands
0206-reverse-linked-list		0206-reverse-linked-list
0207-course-schedule		0207-course-schedule
0208-implement-trie-prefix-tree		0208-implement-trie-prefix-tree
0210-course-schedule-ii		0210-course-schedule-ii
0211-design-add-and-search-words-data-structure		0211-design-add-and-search-words-data-structure
0224-basic-calculator		0224-basic-calculator
0226-invert-binary-tree		0226-invert-binary-tree
0228-summary-ranges		0228-summary-ranges
0232-implement-queue-using-stacks		0232-implement-queue-using-stacks
0236-lowest-common-ancestor-of-a-binary-tree		0236-lowest-common-ancestor-of-a-binary-tree
0279-perfect-squares		0279-perfect-squares
0290-word-pattern		0290-word-pattern
0300-longest-increasing-subsequence		0300-longest-increasing-subsequence
0309-best-time-to-buy-and-sell-stock-with-cooldown		0309-best-time-to-buy-and-sell-stock-with-cooldown
0319-bulb-switcher		0319-bulb-switcher
0322-coin-change		0322-coin-change
0328-odd-even-linked-list		0328-odd-even-linked-list
0347-top-k-frequent-elements		0347-top-k-frequent-elements
0352-data-stream-as-disjoint-intervals		0352-data-stream-as-disjoint-intervals
0380-insert-delete-getrandom-o1		0380-insert-delete-getrandom-o1
0382-linked-list-random-node		0382-linked-list-random-node
0394-decode-string		0394-decode-string
0409-longest-palindrome		0409-longest-palindrome
0410-split-array-largest-sum		0410-split-array-largest-sum
0415-add-strings		0415-add-strings
0427-construct-quad-tree		0427-construct-quad-tree
0435-non-overlapping-intervals		0435-non-overlapping-intervals
0438-find-all-anagrams-in-a-string		0438-find-all-anagrams-in-a-string
0443-string-compression		0443-string-compression
0446-arithmetic-slices-ii-subsequence		0446-arithmetic-slices-ii-subsequence
0447-number-of-boomerangs		0447-number-of-boomerangs
0452-minimum-number-of-arrows-to-burst-balloons		0452-minimum-number-of-arrows-to-burst-balloons
0455-assign-cookies		0455-assign-cookies
0472-concatenated-words		0472-concatenated-words
0491-non-decreasing-subsequences		0491-non-decreasing-subsequences
0502-ipo		0502-ipo
0520-detect-capital		0520-detect-capital
0530-minimum-absolute-difference-in-bst		0530-minimum-absolute-difference-in-bst
0540-single-element-in-a-sorted-array		0540-single-element-in-a-sorted-array
0543-diameter-of-binary-tree		0543-diameter-of-binary-tree
0547-number-of-provinces		0547-number-of-provinces
0556-next-greater-element-iii		0556-next-greater-element-iii
0567-permutation-in-string		0567-permutation-in-string
0572-subtree-of-another-tree		0572-subtree-of-another-tree
0576-out-of-boundary-paths		0576-out-of-boundary-paths
0605-can-place-flowers		0605-can-place-flowers
0606-construct-string-from-binary-tree		0606-construct-string-from-binary-tree
0629-k-inverse-pairs-array		0629-k-inverse-pairs-array
0645-set-mismatch		0645-set-mismatch
0647-palindromic-substrings		0647-palindromic-substrings
0649-dota2-senate		0649-dota2-senate
0652-find-duplicate-subtrees		0652-find-duplicate-subtrees
0654-maximum-binary-tree		0654-maximum-binary-tree
0662-maximum-width-of-binary-tree		0662-maximum-width-of-binary-tree
0686-repeated-string-match		0686-repeated-string-match
0701-insert-into-a-binary-search-tree		0701-insert-into-a-binary-search-tree
0703-kth-largest-element-in-a-stream		0703-kth-largest-element-in-a-stream
0704-binary-search		0704-binary-search
0706-design-hashmap		0706-design-hashmap
0739-daily-temperatures		0739-daily-temperatures
0746-min-cost-climbing-stairs		0746-min-cost-climbing-stairs
0787-cheapest-flights-within-k-stops		0787-cheapest-flights-within-k-stops
0797-all-paths-from-source-to-target		0797-all-paths-from-source-to-target
0802-find-eventual-safe-states		0802-find-eventual-safe-states
0834-sum-of-distances-in-tree		0834-sum-of-distances-in-tree
0839-similar-string-groups		0839-similar-string-groups
0841-keys-and-rooms		0841-keys-and-rooms
0867-transpose-matrix		0867-transpose-matrix
0872-leaf-similar-trees		0872-leaf-similar-trees
0875-koko-eating-bananas		0875-koko-eating-bananas
0876-middle-of-the-linked-list		0876-middle-of-the-linked-list
0879-profitable-schemes		0879-profitable-schemes
0886-possible-bipartition		0886-possible-bipartition
0907-sum-of-subarray-minimums		0907-sum-of-subarray-minimums
0909-snakes-and-ladders		0909-snakes-and-ladders
0918-maximum-sum-circular-subarray		0918-maximum-sum-circular-subarray
0926-flip-string-to-monotone-increasing		0926-flip-string-to-monotone-increasing
0934-shortest-bridge		0934-shortest-bridge
0935-knight-dialer		0935-knight-dialer
0938-range-sum-of-bst		0938-range-sum-of-bst
0944-delete-columns-to-make-sorted		0944-delete-columns-to-make-sorted
0953-verifying-an-alien-dictionary		0953-verifying-an-alien-dictionary
0974-subarray-sums-divisible-by-k		0974-subarray-sums-divisible-by-k
0980-unique-paths-iii		0980-unique-paths-iii
0983-minimum-cost-for-tickets		0983-minimum-cost-for-tickets
0988-smallest-string-starting-from-leaf		0988-smallest-string-starting-from-leaf
0989-add-to-array-form-of-integer		0989-add-to-array-form-of-integer
0997-find-the-town-judge		0997-find-the-town-judge
1011-capacity-to-ship-packages-within-d-days		1011-capacity-to-ship-packages-within-d-days
1019-next-greater-node-in-linked-list		1019-next-greater-node-in-linked-list
1026-maximum-difference-between-node-and-ancestor		1026-maximum-difference-between-node-and-ancestor
1035-uncrossed-lines		1035-uncrossed-lines
1046-last-stone-weight		1046-last-stone-weight
1061-lexicographically-smallest-equivalent-string		1061-lexicographically-smallest-equivalent-string
1071-greatest-common-divisor-of-strings		1071-greatest-common-divisor-of-strings
1091-shortest-path-in-binary-matrix		1091-shortest-path-in-binary-matrix
1095-find-in-mountain-array		1095-find-in-mountain-array
1143-longest-common-subsequence		1143-longest-common-subsequence
1160-find-words-that-can-be-formed-by-characters		1160-find-words-that-can-be-formed-by-characters
1161-maximum-level-sum-of-a-binary-tree		1161-maximum-level-sum-of-a-binary-tree
1187-make-array-strictly-increasing		1187-make-array-strictly-increasing
1207-unique-number-of-occurrences		1207-unique-number-of-occurrences
1232-check-if-it-is-a-straight-line		1232-check-if-it-is-a-straight-line
1235-maximum-profit-in-job-scheduling		1235-maximum-profit-in-job-scheduling
1239-maximum-length-of-a-concatenated-string-with-unique-characters		1239-maximum-length-of-a-concatenated-string-with-unique-characters
1254-number-of-closed-islands		1254-number-of-closed-islands
1318-minimum-flips-to-make-a-or-b-equal-to-c		1318-minimum-flips-to-make-a-or-b-equal-to-c
1319-number-of-operations-to-make-network-connected		1319-number-of-operations-to-make-network-connected
1339-maximum-product-of-splitted-binary-tree		1339-maximum-product-of-splitted-binary-tree
1345-jump-game-iv		1345-jump-game-iv
1347-minimum-number-of-steps-to-make-two-strings-anagram		1347-minimum-number-of-steps-to-make-two-strings-anagram
1351-count-negative-numbers-in-a-sorted-matrix		1351-count-negative-numbers-in-a-sorted-matrix
1353-maximum-number-of-events-that-can-be-attended		1353-maximum-number-of-events-that-can-be-attended
1372-longest-zigzag-path-in-a-binary-tree		1372-longest-zigzag-path-in-a-binary-tree
1376-time-needed-to-inform-all-employees		1376-time-needed-to-inform-all-employees
1396-design-underground-system		1396-design-underground-system
1402-reducing-dishes		1402-reducing-dishes
1406-stone-game-iii		1406-stone-game-iii
1416-restore-the-array		1416-restore-the-array
1431-kids-with-the-greatest-number-of-candies		1431-kids-with-the-greatest-number-of-candies
1443-minimum-time-to-collect-all-apples-in-a-tree		1443-minimum-time-to-collect-all-apples-in-a-tree
1444-number-of-ways-of-cutting-a-pizza		1444-number-of-ways-of-cutting-a-pizza
1456-maximum-number-of-vowels-in-a-substring-of-given-length		1456-maximum-number-of-vowels-in-a-substring-of-given-length
1457-pseudo-palindromic-paths-in-a-binary-tree		1457-pseudo-palindromic-paths-in-a-binary-tree
1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero		1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero
1470-shuffle-the-array		1470-shuffle-the-array
1491-average-salary-excluding-the-minimum-and-maximum-salary		1491-average-salary-excluding-the-minimum-and-maximum-salary
1498-number-of-subsequences-that-satisfy-the-given-sum-condition		1498-number-of-subsequences-that-satisfy-the-given-sum-condition
1502-can-make-arithmetic-progression-from-sequence		1502-can-make-arithmetic-progression-from-sequence
1523-count-odd-numbers-in-an-interval-range		1523-count-odd-numbers-in-an-interval-range
1535-find-the-winner-of-an-array-game		1535-find-the-winner-of-an-array-game
1539-kth-missing-positive-number		1539-kth-missing-positive-number
1546-maximum-number-of-non-overlapping-subarrays-with-sum-equals-target		1546-maximum-number-of-non-overlapping-subarrays-with-sum-equals-target
1547-minimum-cost-to-cut-a-stick		1547-minimum-cost-to-cut-a-stick
1552-magnetic-force-between-two-balls		1552-magnetic-force-between-two-balls
1557-minimum-number-of-vertices-to-reach-all-nodes		1557-minimum-number-of-vertices-to-reach-all-nodes
1567-maximum-length-of-subarray-with-positive-product		1567-maximum-length-of-subarray-with-positive-product
1569-number-of-ways-to-reorder-array-to-get-same-bst		1569-number-of-ways-to-reorder-array-to-get-same-bst
1572-matrix-diagonal-sum		1572-matrix-diagonal-sum
1579-remove-max-number-of-edges-to-keep-graph-fully-traversable		1579-remove-max-number-of-edges-to-keep-graph-fully-traversable
1603-design-parking-system		1603-design-parking-system
1626-best-team-with-no-conflicts		1626-best-team-with-no-conflicts
1630-arithmetic-subarrays		1630-arithmetic-subarrays
1639-number-of-ways-to-form-a-target-string-given-a-dictionary		1639-number-of-ways-to-form-a-target-string-given-a-dictionary
1657-determine-if-two-strings-are-close		1657-determine-if-two-strings-are-close
1712-ways-to-split-array-into-three-subarrays		1712-ways-to-split-array-into-three-subarrays
1721-swapping-nodes-in-a-linked-list		1721-swapping-nodes-in-a-linked-list
1727-largest-submatrix-with-rearrangements		1727-largest-submatrix-with-rearrangements
1751-maximum-number-of-events-that-can-be-attended-ii		1751-maximum-number-of-events-that-can-be-attended-ii
1768-merge-strings-alternately		1768-merge-strings-alternately
1799-maximize-score-after-n-operations		1799-maximize-score-after-n-operations
1822-sign-of-the-product-of-an-array		1822-sign-of-the-product-of-an-array
1833-maximum-ice-cream-bars		1833-maximum-ice-cream-bars
1838-frequency-of-the-most-frequent-element		1838-frequency-of-the-most-frequent-element
1857-largest-color-value-in-a-directed-graph		1857-largest-color-value-in-a-directed-graph
1877-minimize-maximum-pair-sum-in-array		1877-minimize-maximum-pair-sum-in-array
1921-eliminate-maximum-number-of-monsters		1921-eliminate-maximum-number-of-monsters
1926-nearest-exit-from-entrance-in-maze		1926-nearest-exit-from-entrance-in-maze
1962-remove-stones-to-minimize-the-total		1962-remove-stones-to-minimize-the-total
1964-find-the-longest-valid-obstacle-course-at-each-position		1964-find-the-longest-valid-obstacle-course-at-each-position
1971-find-if-path-exists-in-graph		1971-find-if-path-exists-in-graph
2008-maximum-earnings-from-taxi		2008-maximum-earnings-from-taxi
2054-two-best-non-overlapping-events		2054-two-best-non-overlapping-events
2092-find-all-people-with-secret		2092-find-all-people-with-secret
2101-detonate-the-maximum-bombs		2101-detonate-the-maximum-bombs
2125-number-of-laser-beams-in-a-bank		2125-number-of-laser-beams-in-a-bank
2130-maximum-twin-sum-of-a-linked-list		2130-maximum-twin-sum-of-a-linked-list
2140-solving-questions-with-brainpower		2140-solving-questions-with-brainpower
2150-find-all-lonely-numbers-in-the-array		2150-find-all-lonely-numbers-in-the-array
2187-minimum-time-to-complete-trips		2187-minimum-time-to-complete-trips
2216-minimum-deletions-to-make-array-beautiful		2216-minimum-deletions-to-make-array-beautiful
2225-find-players-with-zero-or-one-losses		2225-find-players-with-zero-or-one-losses
2244-minimum-rounds-to-complete-all-tasks		2244-minimum-rounds-to-complete-all-tasks
2246-longest-path-with-different-adjacent-characters		2246-longest-path-with-different-adjacent-characters
2256-minimum-average-difference		2256-minimum-average-difference
2270-number-of-ways-to-split-array		2270-number-of-ways-to-split-array
2279-maximum-bags-with-full-capacity-of-rocks		2279-maximum-bags-with-full-capacity-of-rocks
2336-smallest-number-in-infinite-set		2336-smallest-number-in-infinite-set
2352-equal-row-and-column-pairs		2352-equal-row-and-column-pairs
2359-find-closest-node-to-given-two-nodes		2359-find-closest-node-to-given-two-nodes
2389-longest-subsequence-with-limited-sum		2389-longest-subsequence-with-limited-sum
2390-removing-stars-from-a-string		2390-removing-stars-from-a-string
2405-optimal-partition-of-string		2405-optimal-partition-of-string
2444-count-subarrays-with-fixed-bounds		2444-count-subarrays-with-fixed-bounds
2466-count-ways-to-build-good-strings		2466-count-ways-to-build-good-strings
2477-minimum-fuel-cost-to-report-to-the-capital		2477-minimum-fuel-cost-to-report-to-the-capital
2610-convert-an-array-into-a-2d-array-with-conditions		2610-convert-an-array-into-a-2d-array-with-conditions
2620-counter		2620-counter
2665-counter-ii		2665-counter-ii
2849-determine-if-a-cell-is-reachable-at-a-given-time		2849-determine-if-a-cell-is-reachable-at-a-given-time
2895-minimum-processing-time		2895-minimum-processing-time
2919-minimum-increment-operations-to-make-array-beautiful		2919-minimum-increment-operations-to-make-array-beautiful
K-th element of two Arrays - GFG		K-th element of two Arrays - GFG
Subset Sums - GFG		Subset Sums - GFG
Topological sort - GFG		Topological sort - GFG
Readme		Readme