Leetcode-Solutions

This repo contains all of the problems that I have solved on leetcode.

Navigation Menu

Repository files navigation

Leetcode-Solutions

About

Releases

Packages

Contributors

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 281 Commits
1-two-sum		1-two-sum
1054-complement-of-base-10-integer		1054-complement-of-base-10-integer
1079-sum-of-root-to-leaf-binary-numbers		1079-sum-of-root-to-leaf-binary-numbers
110-balanced-binary-tree		110-balanced-binary-tree
1212-sequential-digits		1212-sequential-digits
1222-remove-covered-intervals		1222-remove-covered-intervals
1234-number-of-paths-with-max-score		1234-number-of-paths-with-max-score
1240-stone-game-ii		1240-stone-game-ii
1256-rank-transform-of-an-array		1256-rank-transform-of-an-array
1297-maximum-number-of-balloons		1297-maximum-number-of-balloons
1386-shift-2d-grid		1386-shift-2d-grid
1428-jump-game-iii		1428-jump-game-iii
1443-minimum-distance-to-type-a-word-using-two-fingers		1443-minimum-distance-to-type-a-word-using-two-fingers
1446-angle-between-hands-of-a-clock		1446-angle-between-hands-of-a-clock
1447-jump-game-iv		1447-jump-game-iv
1458-sort-integers-by-the-number-of-1-bits		1458-sort-integers-by-the-number-of-1-bits
1466-jump-game-v		1466-jump-game-v
1507-check-if-there-is-a-valid-path-in-a-grid		1507-check-if-there-is-a-valid-path-in-a-grid
1520-number-of-steps-to-reduce-a-number-in-binary-representation-to-one		1520-number-of-steps-to-reduce-a-number-in-binary-representation-to-one
1522-stone-game-iii		1522-stone-game-iii
1557-check-if-a-string-contains-all-binary-codes-of-size-k		1557-check-if-a-string-contains-all-binary-codes-of-size-k
1658-minimum-swaps-to-arrange-a-binary-grid		1658-minimum-swaps-to-arrange-a-binary-grid
1663-detect-cycles-in-2d-grid		1663-detect-cycles-in-2d-grid
1704-special-positions-in-a-binary-matrix		1704-special-positions-in-a-binary-matrix
1716-maximum-non-negative-product-in-a-matrix		1716-maximum-non-negative-product-in-a-matrix
1728-fancy-sequence		1728-fancy-sequence
1756-minimum-deletions-to-make-string-balanced		1756-minimum-deletions-to-make-string-balanced
1800-concatenation-of-consecutive-binary-numbers		1800-concatenation-of-consecutive-binary-numbers
1807-partitioning-into-minimum-number-of-deci-binary-numbers		1807-partitioning-into-minimum-number-of-deci-binary-numbers
1833-find-the-highest-altitude		1833-find-the-highest-altitude
1840-minimize-hamming-distance-after-swap-operations		1840-minimize-hamming-distance-after-swap-operations
1878-check-if-array-is-sorted-and-rotated		1878-check-if-array-is-sorted-and-rotated
1884-minimum-changes-to-make-alternating-binary-string		1884-minimum-changes-to-make-alternating-binary-string
1956-maximum-element-after-decreasing-and-rearranging		1956-maximum-element-after-decreasing-and-rearranging
1961-maximum-ice-cream-bars		1961-maximum-ice-cream-bars
1968-maximum-building-height		1968-maximum-building-height
1975-minimum-distance-to-the-target-element		1975-minimum-distance-to-the-target-element
1984-maximum-distance-between-a-pair-of-values		1984-maximum-distance-between-a-pair-of-values
1990-get-biggest-three-rhombus-sums-in-a-grid		1990-get-biggest-three-rhombus-sums-in-a-grid
2001-jump-game-vii		2001-jump-game-vii
2015-determine-whether-matrix-can-be-obtained-by-rotation		2015-determine-whether-matrix-can-be-obtained-by-rotation
2017-minimum-number-of-flips-to-make-the-binary-string-alternating		2017-minimum-number-of-flips-to-make-the-binary-string-alternating
2106-find-greatest-common-divisor-of-array		2106-find-greatest-common-divisor-of-array
2107-find-unique-binary-string		2107-find-unique-binary-string
2160-minimum-operations-to-make-a-uni-value-grid		2160-minimum-operations-to-make-a-uni-value-grid
2178-walking-robot-simulation-ii		2178-walking-robot-simulation-ii
2197-decode-the-slanted-ciphertext		2197-decode-the-slanted-ciphertext
2199-two-furthest-houses-with-different-colors		2199-two-furthest-houses-with-different-colors
2216-delete-the-middle-node-of-a-linked-list		2216-delete-the-middle-node-of-a-linked-list
2236-maximum-twin-sum-of-a-linked-list		2236-maximum-twin-sum-of-a-linked-list
2245-destroying-asteroids		2245-destroying-asteroids
2306-create-binary-tree-from-descriptions		2306-create-binary-tree-from-descriptions
2550-words-within-two-edits-of-dictionary		2550-words-within-two-edits-of-dictionary
2582-minimum-score-of-a-path-between-two-cities		2582-minimum-score-of-a-path-between-two-cities
2598-shortest-distance-to-target-string-in-a-circular-array		2598-shortest-distance-to-target-string-in-a-circular-array
2721-sum-of-distances		2721-sum-of-distances
2846-robot-collisions		2846-robot-collisions
2914-find-the-safest-path-in-a-grid		2914-find-the-safest-path-in-a-grid
2978-check-if-strings-can-be-made-equal-with-operations-ii		2978-check-if-strings-can-be-made-equal-with-operations-ii
2999-check-if-strings-can-be-made-equal-with-operations-i		2999-check-if-strings-can-be-made-equal-with-operations-i
3031-construct-product-matrix		3031-construct-product-matrix
3235-minimum-cost-to-convert-string-i		3235-minimum-cost-to-convert-string-i
3238-minimum-cost-to-convert-string-ii		3238-minimum-cost-to-convert-string-ii
3260-divide-an-array-into-subarrays-with-minimum-cost-ii		3260-divide-an-array-into-subarrays-with-minimum-cost-ii
3263-divide-an-array-into-subarrays-with-minimum-cost-i		3263-divide-an-array-into-subarrays-with-minimum-cost-i
3275-minimum-number-of-pushes-to-type-word-i		3275-minimum-number-of-pushes-to-type-word-i
3276-minimum-number-of-pushes-to-type-word-ii		3276-minimum-number-of-pushes-to-type-word-ii
3299-find-the-maximum-number-of-elements-in-subset		3299-find-the-maximum-number-of-elements-in-subset
3329-find-the-length-of-the-longest-common-prefix		3329-find-the-length-of-the-longest-common-prefix
3338-count-submatrices-with-top-left-element-and-sum-less-than-k		3338-count-submatrices-with-top-left-element-and-sum-less-than-k
3376-longest-common-suffix-queries		3376-longest-common-suffix-queries
3405-count-the-number-of-special-characters-ii		3405-count-the-number-of-special-characters-ii
3406-find-all-possible-stable-binary-arrays-i		3406-find-all-possible-stable-binary-arrays-i
3407-find-all-possible-stable-binary-arrays-ii		3407-find-all-possible-stable-binary-arrays-ii
3470-maximum-score-from-grid-operations		3470-maximum-score-from-grid-operations
3492-count-submatrices-with-equal-frequency-of-x-and-y		3492-count-submatrices-with-equal-frequency-of-x-and-y
3496-minimum-number-of-seconds-to-make-mountain-height-zero		3496-minimum-number-of-seconds-to-make-mountain-height-zero
3558-find-a-safe-walk-through-a-grid		3558-find-a-safe-walk-through-a-grid
3561-remove-methods-from-project		3561-remove-methods-from-project
3583-sorted-gcd-pair-queries		3583-sorted-gcd-pair-queries
3584-find-the-lexicographically-smallest-valid-sequence		3584-find-the-lexicographically-smallest-valid-sequence
3606-minimum-element-after-replacement-with-digit-sum		3606-minimum-element-after-replacement-with-digit-sum
3608-find-the-number-of-subsequences-with-equal-gcd		3608-find-the-number-of-subsequences-with-equal-gcd
3626-smallest-divisible-digit-product-i		3626-smallest-divisible-digit-product-i
3635-smallest-divisible-digit-product-ii		3635-smallest-divisible-digit-product-ii
3651-transformed-array		3651-transformed-array
3677-maximum-amount-of-money-robot-can-earn		3677-maximum-amount-of-money-robot-can-earn
3750-closest-equal-element-queries		3750-closest-equal-element-queries
3770-lexicographically-smallest-generated-string		3770-lexicographically-smallest-generated-string
3781-maximize-the-distance-between-points-on-a-square		3781-maximize-the-distance-between-points-on-a-square
3804-maximize-active-section-with-trade-ii		3804-maximize-active-section-with-trade-ii
3805-maximize-active-section-with-trade-i		3805-maximize-active-section-with-trade-i
3812-smallest-palindromic-rearrangement-i		3812-smallest-palindromic-rearrangement-i
3813-smallest-palindromic-rearrangement-ii		3813-smallest-palindromic-rearrangement-ii
3820-number-of-unique-xor-triplets-ii		3820-number-of-unique-xor-triplets-ii
3824-number-of-unique-xor-triplets-i		3824-number-of-unique-xor-triplets-i
3838-path-existence-queries-in-a-graph-i		3838-path-existence-queries-in-a-graph-i
3842-number-of-ways-to-assign-edge-weights-ii		3842-number-of-ways-to-assign-edge-weights-ii
3844-number-of-ways-to-assign-edge-weights-i		3844-number-of-ways-to-assign-edge-weights-i
3849-equal-sum-grid-partition-i		3849-equal-sum-grid-partition-i

Folders and files

Latest commit

History

Repository files navigation

Leetcode-Solutions

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages