LeetCode Solutions

Welcome to the "LeetCode Solutions" repository! This repository serves as a comprehensive collection of solutions to various algorithmic and coding problems from LeetCode, a popular platform for practising coding skills and preparing for technical interviews. Whether you're a beginner looking to improve your problem-solving abilities or an experienced coder aiming to refine your skills, this repository offers a valuable resource to enhance your understanding of algorithms and data structures.

Name		Name	Last commit message	Last commit date
Latest commit History 954 Commits
1-bit-and-2-bit-characters.java		1-bit-and-2-bit-characters.java
2-keys-keyboard.py		2-keys-keyboard.py
24-game.java		24-game.java
24-game.py		24-game.py
Addtwonumbers.py		Addtwonumbers.py
Calculate Delayed Arrival Time.py		Calculate Delayed Arrival Time.py
Count Elements With Maximum Frequency.py		Count Elements With Maximum Frequency.py
FirstandLastposition.py		FirstandLastposition.py
Maximal Rectangle.py		Maximal Rectangle.py
Middle of the Linkedlist.py		Middle of the Linkedlist.py
Minimum Common Value.py		Minimum Common Value.py
Palindrome Number.py		Palindrome Number.py
README.md		README.md
Reverse Integer.py		Reverse Integer.py
Rotate Array.py		Rotate Array.py
Search Insert Position.py		Search Insert Position.py
Squares of a Sorted Array.py		Squares of a Sorted Array.py
Two Sum.py		Two Sum.py
Valid Parentheses.py		Valid Parentheses.py
add-binary.java		add-binary.java
add-digits.py		add-digits.py
add-one-row-to-tree.py		add-one-row-to-tree.py
add-two-numbers.py		add-two-numbers.py
adding-spaces-to-a-string.py		adding-spaces-to-a-string.py
adjacent-increasing-subarrays-detection-i.java		adjacent-increasing-subarrays-detection-i.java
adjacent-increasing-subarrays-detection-ii.java		adjacent-increasing-subarrays-detection-ii.java
alice-and-bob-playing-flower-game.java		alice-and-bob-playing-flower-game.java
all-ancestors-of-a-node-in-a-directed-acyclic-graph.py		all-ancestors-of-a-node-in-a-directed-acyclic-graph.py
all-oone-data-structure.py		all-oone-data-structure.py
alternating-groups-ii.py		alternating-groups-ii.py
angle-between-hands-of-a-clock.py		angle-between-hands-of-a-clock.py
append-characters-to-string-to-make-subsequence.py		append-characters-to-string-to-make-subsequence.py
apple-redistribution-into-boxes.java		apple-redistribution-into-boxes.java
apply-operations-to-an-array.py		apply-operations-to-an-array.py
apply-operations-to-maximize-score.java		apply-operations-to-maximize-score.java
average-waiting-time.py		average-waiting-time.py
avoid-flood-in-the-city.java		avoid-flood-in-the-city.java
avoid-flood-in-the-city.py		avoid-flood-in-the-city.py
balance-a-binary-search-tree.java		balance-a-binary-search-tree.java
balance-a-binary-search-tree.py		balance-a-binary-search-tree.py
balanced-binary-tree.java		balanced-binary-tree.java
best-sightseeing-pair.py		best-sightseeing-pair.py
best-time-to-buy-and-sell-stock-using-strategy.java		best-time-to-buy-and-sell-stock-using-strategy.java
best-time-to-buy-and-sell-stock-v.java		best-time-to-buy-and-sell-stock-v.java
best-time-to-buy-and-sell-stock.py		best-time-to-buy-and-sell-stock.py
binary-gap.py		binary-gap.py
binary-number-with-alternating-bits.java		binary-number-with-alternating-bits.java
binary-prefix-divisible-by-5.java		binary-prefix-divisible-by-5.java
binary-search-tree-to-greater-sum-tree.py		binary-search-tree-to-greater-sum-tree.py
binary-subarrays-with-sum.py		binary-subarrays-with-sum.py
binary-tree-inorder-traversal.py		binary-tree-inorder-traversal.py
binary-tree-postorder-traversal.py		binary-tree-postorder-traversal.py
binary-tree-preorder-traversal.py		binary-tree-preorder-traversal.py
binary-watch.java		binary-watch.java
bitwise-ors-of-subarrays.java		bitwise-ors-of-subarrays.java
bitwise-xor-of-all-pairings.py		bitwise-xor-of-all-pairings.py
block-placement-queries.py		block-placement-queries.py
boats-to-save-people.py		boats-to-save-people.py
build-a-matrix-with-conditions.py		build-a-matrix-with-conditions.py
build-array-from-permutation.java		build-array-from-permutation.java
calculate-money-in-leetcode-bank.java		calculate-money-in-leetcode-bank.java
candy.java		candy.java
champagne-tower.java		champagne-tower.java
check-if-a-parentheses-string-can-be-valid.py		check-if-a-parentheses-string-can-be-valid.py
check-if-a-string-contains-all-binary-codes-of-size-k.py		check-if-a-string-contains-all-binary-codes-of-size-k.py
check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence.py		check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence.py
check-if-all-1s-are-at-least-length-k-places-away.java		check-if-all-1s-are-at-least-length-k-places-away.java
check-if-array-is-good.py		check-if-array-is-good.py
check-if-array-is-sorted-and-rotated.java		check-if-array-is-sorted-and-rotated.java
check-if-array-is-sorted-and-rotated.py		check-if-array-is-sorted-and-rotated.py
check-if-array-pairs-are-divisible-by-k.py		check-if-array-pairs-are-divisible-by-k.py
check-if-binary-string-has-at-most-one-segment-of-ones.py		check-if-binary-string-has-at-most-one-segment-of-ones.py
check-if-digits-are-equal-in-string-after-operations-i.java		check-if-digits-are-equal-in-string-after-operations-i.java
check-if-grid-can-be-cut-into-sections.java		check-if-grid-can-be-cut-into-sections.java
check-if-n-and-its-double-exist.py		check-if-n-and-its-double-exist.py
check-if-number-is-a-sum-of-powers-of-three.py		check-if-number-is-a-sum-of-powers-of-three.py
check-if-one-string-swap-can-make-strings-equal.py		check-if-one-string-swap-can-make-strings-equal.py
check-if-strings-can-be-made-equal-with-operations-i.py		check-if-strings-can-be-made-equal-with-operations-i.py
check-if-strings-can-be-made-equal-with-operations-ii.py		check-if-strings-can-be-made-equal-with-operations-ii.py
check-if-there-is-a-valid-path-in-a-grid.py		check-if-there-is-a-valid-path-in-a-grid.py
check-if-word-is-valid-after-substitutions.py		check-if-word-is-valid-after-substitutions.py
circular-sentence.py		circular-sentence.py
clear-digits.java		clear-digits.java
closest-equal-element-queries.py		closest-equal-element-queries.py
closest-prime-numbers-in-range.py		closest-prime-numbers-in-range.py
combination-sum-ii.py		combination-sum-ii.py
compare-strings-by-frequency-of-the-smallest-character.py		compare-strings-by-frequency-of-the-smallest-character.py
compare-version-numbers.java		compare-version-numbers.java
compare-version-numbers.py		compare-version-numbers.py
complement-of-base-10-integer.py		complement-of-base-10-integer.py
concatenate-non-zero-digits-and-multiply-by-sum-i.py		concatenate-non-zero-digits-and-multiply-by-sum-i.py
concatenate-non-zero-digits-and-multiply-by-sum-ii.py		concatenate-non-zero-digits-and-multiply-by-sum-ii.py
concatenation-of-consecutive-binary-numbers.py		concatenation-of-consecutive-binary-numbers.py
construct-binary-tree-from-preorder-and-postorder-traversal.py		construct-binary-tree-from-preorder-and-postorder-traversal.py
construct-k-palindrome-strings.py		construct-k-palindrome-strings.py
construct-product-matrix.py		construct-product-matrix.py
construct-smallest-number-from-di-string.py		construct-smallest-number-from-di-string.py
construct-string-with-repeat-limit.py		construct-string-with-repeat-limit.py
construct-the-lexicographically-largest-valid-sequence.py		construct-the-lexicographically-largest-valid-sequence.py
construct-the-minimum-bitwise-array-i.java		construct-the-minimum-bitwise-array-i.java

Navigation Menu

Repository files navigation

LeetCode Solutions

About

Releases

Packages

Contributors

Languages

Folders and files

Latest commit

History

Repository files navigation

LeetCode Solutions

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages