Welcome to my LeetCode problem solutions repository! Here, you'll find comprehensive solutions to a wide range of LeetCode problems, all implemented in C++. Whether you're preparing for technical interviews or just looking to sharpen your algorithm skills, this repository is designed to help you understand and master common coding challenges.
C++ is a powerful and versatile programming language, particularly well-suited for competitive programming and algorithmic problem-solving. Its performance and efficiency make it a popular choice for coding interviews and contests like LeetCode. By providing solutions in C++, this repository aims to showcase effective problem-solving techniques and best practices in this language.
This repository is not just about providing answers to problems; it's also about learning and improvement. Each solution is crafted to be clear, concise, and well-structured, making it easier for you to understand and learn from. Additionally, the solutions are continuously updated and refined to incorporate feedback and improvements, ensuring that you have access to high-quality, up-to-date content.
To make the most of this repository, simply browse through the files to find the problem you're interested in. Each problem is contained with the C++ source code file (.cpp).
Contributions to this repository are welcome! If you have a new solution to a problem, an improvement to an existing solution, or a suggestion for how to make this repository better, feel free to submit a pull request. Your contributions help make this repository a valuable resource for the programming community.
0101-symmetric-tree |
0515-find-largest-value-in-each-tree-row |
0925-construct-binary-tree-from-preorder-and-postorder-traversal |
1387-find-elements-in-a-contaminated-binary-tree |
2059-unique-length-3-palindromic-subsequences |
2509-minimize-xor |
2533-bitwise-xor-of-all-pairings |
2792-neighboring-bitwise-xor |
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 |
0135-candy |
1502-construct-k-palindrome-strings |
1834-minimum-number-of-people-to-teach |
2221-check-if-a-parentheses-string-can-be-valid |
2456-construct-smallest-number-from-di-string |
2509-minimize-xor |
2021-remove-all-occurrences-of-a-substring |
2221-check-if-a-parentheses-string-can-be-valid |
2307-replace-non-coprime-numbers-in-array |
2456-construct-smallest-number-from-di-string |
3447-clear-digits |
2533-bitwise-xor-of-all-pairings |
3462-vowels-game-in-a-string |
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 |
2473-max-sum-of-a-pair-with-equal-sum-of-digits |
2887-sort-vowels-in-a-string |
3219-make-lexicographically-smallest-array-by-swapping-elements |
1387-find-elements-in-a-contaminated-binary-tree |
1477-product-of-the-last-k-numbers |
2429-design-a-food-rating-system |
2434-design-a-number-container-system |
2429-design-a-food-rating-system |
2434-design-a-number-container-system |
1477-product-of-the-last-k-numbers |
0925-construct-binary-tree-from-preorder-and-postorder-traversal |
2265-partition-array-according-to-given-pivot |
2551-apply-operations-to-an-array |
2707-merge-two-2d-arrays-by-summing-values |
3462-vowels-game-in-a-string |
2307-replace-non-coprime-numbers-in-array |