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. 🙌
| 0780-max-chunks-to-make-sorted |
| 1570-final-prices-with-a-special-discount-in-a-shop |
| 3181-find-building-where-alice-and-bob-can-meet |
| 3181-find-building-where-alice-and-bob-can-meet |
| 3181-find-building-where-alice-and-bob-can-meet |
| 0515-find-largest-value-in-each-tree-row |
| 0925-construct-binary-tree-from-preorder-and-postorder-traversal |
| 1093-recover-a-tree-from-preorder-traversal |
| 1387-find-elements-in-a-contaminated-binary-tree |
| 2059-unique-length-3-palindromic-subsequences |
| 2478-longest-nice-subarray |
| 2509-minimize-xor |
| 2533-bitwise-xor-of-all-pairings |
| 2766-find-the-prefix-common-array-of-two-arrays |
| 1524-string-matching-in-an-array |
| 2292-counting-words-with-a-given-prefix |
| 3309-count-prefix-and-suffix-pairs-i |
| 3309-count-prefix-and-suffix-pairs-i |
| 3309-count-prefix-and-suffix-pairs-i |
| 3309-count-prefix-and-suffix-pairs-i |
| 2533-bitwise-xor-of-all-pairings |
| 1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid |
| 0820-find-eventual-safe-states |
| 1558-course-schedule-iv |
| 2246-maximum-employees-to-be-invited-to-a-meeting |
| 1387-find-elements-in-a-contaminated-binary-tree |
| 2434-design-a-number-container-system |
| 2434-design-a-number-container-system |
| 0925-construct-binary-tree-from-preorder-and-postorder-traversal |
| 3623-count-number-of-trapezoids-i |