Welcome to my LeetCode solutions repository! 🚀
This repository is automatically updated with my solved LeetCode problems, organized in the following structure:
- (problem_number, problem_name).cpp: Contains my solution to the problem with comments on time and space complexity.
- README.md: Includes the full problem statement from LeetCode.
- notes.md: An empty file for future notes or additional thoughts (created automatically).
This repository is maintained using LeetHub, a simple Chrome extension that automates the process of pushing solved LeetCode problems to GitHub. It automatically creates the files mentioned above and comments my code with time and space complexity.
A big shoutout to the developer of LeetHub for building such an awesome tool! It makes tracking and sharing my progress seamless. 🙌
0005-longest-palindromic-substring |
0015-3sum |
0031-next-permutation |
0075-sort-colors |
2414-move-pieces-to-obtain-a-string |
3018-make-string-a-subsequence-using-cyclic-increments |
0005-longest-palindromic-substring |
2164-two-best-non-overlapping-events |
2300-construct-string-with-repeat-limit |
2640-maximum-number-of-integers-to-choose-from-a-range-i |
3427-special-array-ii |
2891-maximum-beauty-of-an-array-after-applying-operation |
3267-find-longest-special-substring-that-occurs-thrice-i |
2300-construct-string-with-repeat-limit |
3267-find-longest-special-substring-that-occurs-thrice-i |
2692-take-gifts-from-the-richest-pile |
2695-find-score-of-an-array-after-marking-all-elements |
3555-final-array-state-after-k-multiplication-operations-i |
3555-final-array-state-after-k-multiplication-operations-i |
1570-final-prices-with-a-special-discount-in-a-shop |
1570-final-prices-with-a-special-discount-in-a-shop |