Welcome to my coding practice repository! This repository contains my solutions to various coding challenges from LeetCode and GeeksforGeeks. I've organized the solutions by platform and topic, and each solution includes explanations to help you understand the approach.
Feel free to explore the solutions, provide feedback, and use the code for your own learning. If you find these solutions helpful, don't hesitate to give this repository a star ⭐️.
This repository is a collection of my solutions to coding challenges from LeetCode and GeeksforGeeks. Practicing coding problems helps improve problem-solving skills and algorithmic thinking, which are valuable for technical interviews and real-world programming challenges.
I've provided solutions in the following programming languages:
- Python
- Java
- C++
Feel free to choose the language you're most comfortable with.
The LeetCode folder contains solutions to LeetCode problems, organized by topic. Each solution includes the problem statement, code, and explanations if necessary.
The GeeksforGeeks folder contains solutions to GeeksforGeeks problems, categorized by their respective topics. Just like in the LeetCode section, each solution is accompanied by explanations.
- Browse the LeetCode and GeeksforGeeks folders to find problems categorized by topics.
- Each problem solution includes the problem statement, code, and explanations.
- You're welcome to use the code for your own learning or even as a reference for your own submissions.
- If you're new to coding challenges, start with easier problems and gradually move to more complex ones.
Contributions are appreciated! If you'd like to contribute your solutions or improvements, follow these steps:
- Fork this repository.
- Create a new branch:
git checkout -b new-feature - Add your solution in the appropriate folder.
- Include clear explanations in your code or in a separate README within the problem folder.
- Commit your changes:
git commit -m 'Add solution for Problem XYZ' - Push to the branch:
git push origin new-feature - Open a pull request, and I'll review it as soon as possible.
If you have any questions, suggestions, or just want to connect, you can reach me at [email protected].
Happy coding! 🚀
| 0238-product-of-array-except-self |
| 0410-split-array-largest-sum |
| 0560-subarray-sum-equals-k |
| 0966-binary-subarrays-with-sum |
| 1046-max-consecutive-ones-iii |
| 1370-count-number-of-nice-subarrays |
| 0073-set-matrix-zeroes |
| 0074-search-a-2d-matrix |
| 0542-01-matrix |
| 1036-rotting-oranges |
| 0136-single-number |
| 0268-missing-number |
| 0389-find-the-difference |
| 3428-find-the-xor-of-numbers-which-appear-twice |
| 0225-implement-stack-using-queues |
| 0232-implement-queue-using-stacks |
| 0387-first-unique-character-in-a-string |
| 0169-majority-element |
| 0229-majority-element-ii |
| 0383-ransom-note |
| 0387-first-unique-character-in-a-string |
| 0451-sort-characters-by-frequency |
| 3324-split-the-array |
| 0053-maximum-subarray |
| 0169-majority-element |
| 0215-kth-largest-element-in-an-array |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 0673-number-of-longest-increasing-subsequence |
| 0493-reverse-pairs |
| 0673-number-of-longest-increasing-subsequence |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 0128-longest-consecutive-sequence |
| 0547-number-of-provinces |
| 0547-number-of-provinces |
| 0014-longest-common-prefix |
| 0028-find-the-index-of-the-first-occurrence-in-a-string |
| 0812-rotate-string |
| 1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence |
| 0215-kth-largest-element-in-an-array |
| 0451-sort-characters-by-frequency |
| 2094-remove-stones-to-minimize-the-total |
| 0451-sort-characters-by-frequency |
| 0735-asteroid-collision |
| 2076-sum-of-digits-of-string-after-convert |
| 2232-adding-spaces-to-a-string |
| 2386-min-max-game |
| 0215-kth-largest-element-in-an-array |
| 0002-add-two-numbers |
| 0141-linked-list-cycle |
| 0206-reverse-linked-list |
| 0002-add-two-numbers |
| 0206-reverse-linked-list |
| 0070-climbing-stairs |
| 0155-min-stack |
| 0225-implement-stack-using-queues |
| 0232-implement-queue-using-stacks |
| 0042-trapping-rain-water |
| 0496-next-greater-element-i |
| 0503-next-greater-element-ii |
| 0943-sum-of-subarray-minimums |