A collection of solutions to LeetCode problems, categorized by difficulty and topic.
This repository contains solutions to various LeetCode problems. Each solution includes the problem statement, the approach used to solve the problem, and the implementation in different programming languages.
Navigate to the directory of the problem you want to view and open the corresponding solution file.
Example:
cd Easy/problem1
cat solution.py
Contributions are welcome! If you have a solution to a LeetCode problem that is not already in this repository, feel free to add it.
- Fork the repository.
- Create a new branch (git checkout -b new-solution).
- Add your solution in the appropriate directory.
- Commit your changes (git commit -m 'Add new solution').
- Push to the branch (git push origin new-solution).
- Open a pull request.
- Please ensure your code follows the style and structure of the existing solutions.
This project is licensed under the MIT License - see the LICENSE.md file for details.
If you have any questions or suggestions, feel free to contact me:
Email: [email protected]
GitHub: AdrishikharChowdhury
0017-letter-combinations-of-a-phone-number |
0037-sudoku-solver |
0216-combination-sum-iii |
0494-target-sum |
0075-sort-colors |
0088-merge-sorted-array |
2392-successful-pairs-of-spells-and-potions |
2473-max-sum-of-a-pair-with-equal-sum-of-digits |
3748-sort-matrix-by-diagonals |
1524-string-matching-in-an-array |
2292-counting-words-with-a-given-prefix |
3309-count-prefix-and-suffix-pairs-i |
0515-find-largest-value-in-each-tree-row |
3439-find-minimum-diameter-after-merging-two-trees |
0515-find-largest-value-in-each-tree-row |
3309-count-prefix-and-suffix-pairs-i |
3309-count-prefix-and-suffix-pairs-i |
3309-count-prefix-and-suffix-pairs-i |
0007-reverse-integer |
0009-palindrome-number |
0050-powx-n |
0062-unique-paths |
0204-count-primes |
1236-n-th-tribonacci-number |
1500-count-largest-group |
2448-count-number-of-bad-pairs |
1236-n-th-tribonacci-number |
0062-unique-paths |
0011-container-with-most-water |
0714-best-time-to-buy-and-sell-stock-with-transaction-fee |
1502-construct-k-palindrome-strings |
2221-check-if-a-parentheses-string-can-be-valid |
2509-minimize-xor |
0050-powx-n |
2021-remove-all-occurrences-of-a-substring |
2221-check-if-a-parentheses-string-can-be-valid |
2533-bitwise-xor-of-all-pairings |
0407-trapping-rain-water-ii |
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid |
2434-design-a-number-container-system |
2473-max-sum-of-a-pair-with-equal-sum-of-digits |
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid |
0684-redundant-connection |
0854-making-a-large-island |
1396-count-servers-that-communicate |
2583-divide-nodes-into-the-maximum-number-of-groups |
2764-maximum-number-of-fish-in-a-grid |
0820-find-eventual-safe-states |
2246-maximum-employees-to-be-invited-to-a-meeting |
2021-remove-all-occurrences-of-a-substring |
3434-find-the-number-of-distinct-colors-among-the-balls |
0567-permutation-in-string |
2394-count-subarrays-with-score-less-than-k |
2434-design-a-number-container-system |
2434-design-a-number-container-system |
0204-count-primes |
0204-count-primes |