Welcome to the LeetCode Practice Repository! This repository is dedicated to practicing and mastering a wide range of LeetCode problems, spanning various topics and difficulty levels. Whether you're preparing for coding interviews or aiming to sharpen your algorithmic skills, you'll find valuable resources here.
- 🔍 Diverse Problem Set: A growing collection of problems categorized by topics such as Arrays, Strings, Trees, Graphs, and more.
- 🧠 Practice Challenges: Practical coding challenges designed to enhance problem-solving skills and prepare for technical interviews.
- 📈 Solutions & Explanations: Implementations of problems with detailed explanations, including time and space complexity analyses.
- 💬 Ongoing Development: The repository is continuously updated with new problems, techniques, and solutions.
Here's what’s currently available in the repository:
- 0264-ugly-number-ii: Solutions to problems involving ugly numbers, using mathematical approaches.
- 0273-integer-to-english-words: Converts integers to their English word representation.
- 0381-insert-delete-getrandom-o1-duplicates-allowed: Implementations for data structure with insertion, deletion, and random access.
- 0458-poor-pigs: A mathematical approach to solving the problem of determining the minimum number of pigs needed.
- 0479-largest-palindrome-product: Solutions to find the largest palindrome product of two numbers.
- 0650-2-keys-keyboard: Problems and solutions related to keyboard simulation.
- 0870-magic-squares-in-grid: Magic squares problems and their solutions.
- 0264-ugly-number-ii: Dynamic programming approach for generating ugly numbers.
- 0354-russian-doll-envelopes: Finding the maximum number of envelopes you can put inside one another.
- 0403-frog-jump: Dynamic programming solutions for the frog jump problem.
- 0410-split-array-largest-sum: Split an array into parts with the largest sum minimized.
- 0446-arithmetic-slices-ii-subsequence: Counting arithmetic slices in subsequences.
- 0466-count-the-repetitions: Counting the number of repetitions of a string in a repeated string.
- 0650-2-keys-keyboard: Dynamic programming approach to keyboard simulation.
- 2067-maximum-number-of-points-with-cost: Finding the maximum number of points with given cost constraints.
- 0789-kth-largest-element-in-a-stream: Solution for finding the k-th largest element in a stream.
- 1313-count-ways-to-build-rooms-in-an-ant-colony: Tree-based solutions for room-building problems in an ant colony.
- 0332-reconstruct-itinerary: Reconstructing an itinerary from a list of tickets.
- 1313-count-ways-to-build-rooms-in-an-ant-colony: Graph-based solutions for room-building problems.
- 1313-count-ways-to-build-rooms-in-an-ant-colony: Applying topological sort to room-building scenarios.
- 0458-poor-pigs: Combinatorial methods for solving the problem of determining the minimum number of pigs needed.
- 1313-count-ways-to-build-rooms-in-an-ant-colony: Combinatorial solutions for room-building problems.
- 🌟 Comprehensive Coverage: We plan to cover more LeetCode problems across a wider range of topics and difficulty levels.
- 🔄 Continuous Updates: Regular updates will be made to include new problems, solutions, and improvements.
- 🔧 Community Contributions: We welcome contributions from the community to enhance the repository further.
| 0145-binary-tree-postorder-traversal |
| 0776-n-ary-tree-postorder-traversal |
| 0789-kth-largest-element-in-a-stream |
| 1313-count-ways-to-build-rooms-in-an-ant-colony |
| 0332-reconstruct-itinerary |
| 0984-most-stones-removed-with-same-row-or-column |
| 1313-count-ways-to-build-rooms-in-an-ant-colony |
| 1325-path-with-maximum-probability |
| 2803-modify-graph-edge-weights |
| 1313-count-ways-to-build-rooms-in-an-ant-colony |
| 0458-poor-pigs |
| 1313-count-ways-to-build-rooms-in-an-ant-colony |
| 0273-integer-to-english-words |
| 0332-reconstruct-itinerary |
| 0335-self-crossing |
| 0587-erect-the-fence |
| 0336-palindrome-pairs |
| 0440-k-th-smallest-in-lexicographical-order |
| 0363-max-sum-of-rectangle-no-larger-than-k |
| 0493-reverse-pairs |
| 0407-trapping-rain-water-ii |
| 0488-zuma-game |
| 0999-regions-cut-by-slashes |
| 1691-minimum-number-of-days-to-disconnect-island |
| 2035-count-sub-islands |
| 0984-most-stones-removed-with-same-row-or-column |
| 0999-regions-cut-by-slashes |
| 2035-count-sub-islands |
| 0381-insert-delete-getrandom-o1-duplicates-allowed |
| 0432-all-oone-data-structure |
| 0789-kth-largest-element-in-a-stream |
| 1497-design-a-stack-with-increment-operation |
| 0381-insert-delete-getrandom-o1-duplicates-allowed |
| 0391-perfect-rectangle |
| 1691-minimum-number-of-days-to-disconnect-island |
| 0789-kth-largest-element-in-a-stream |
| 0145-binary-tree-postorder-traversal |
| 0789-kth-largest-element-in-a-stream |
| 0789-kth-largest-element-in-a-stream |
| 0432-all-oone-data-structure |
| 2411-spiral-matrix-iv |
| 2903-insert-greatest-common-divisors-in-linked-list |
| 0432-all-oone-data-structure |
| 0040-combination-sum-ii |
| 0005-longest-palindromic-substring |
| 0719-find-k-th-smallest-pair-distance |
| 2581-divide-players-into-teams-of-equal-skill |
| 0479-largest-palindrome-product |
| 0003-longest-substring-without-repeating-characters |
| 0480-sliding-window-median |
| 0632-smallest-range-covering-elements-from-k-lists |
| 1240-stone-game-ii |
| 0476-number-complement |
| 1473-find-the-longest-substring-containing-vowels-in-even-counts |
| 0145-binary-tree-postorder-traversal |
| 0488-zuma-game |
| 0591-tag-validator |
| 0776-n-ary-tree-postorder-traversal |
| 1497-design-a-stack-with-increment-operation |
| 0488-zuma-game |
| 0546-remove-boxes |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 1325-path-with-maximum-probability |
| 2803-modify-graph-edge-weights |
| 0601-human-traffic-of-stadium |
| 2903-insert-greatest-common-divisors-in-linked-list |
| 0920-uncommon-words-from-two-sentences |
| 1620-check-if-array-pairs-are-divisible-by-k |
| 0214-shortest-palindrome |
| 0214-shortest-palindrome |
| 0214-shortest-palindrome |
We love contributions! Help us make this even better by contributing to the project. Your input is highly valued. 🤗
-
Fork the Project
-
Create your Feature Branch
(git checkout -b feature/AmazingFeature)
- Commit your Changes
(git commit -m 'Add some AmazingFeature')
- Push to the Branch
(git push origin feature/AmazingFeature)
- Open a Pull Request
- Navigate to the "Pull Requests" tab in the repository.
- Click "New Pull Request".
- Select your feature branch and compare it with the main branch.
- Add a descriptive title and comments about your changes.
- Click "Create Pull Request".
- @AshimaSingh0610 - Creator & Maintainer