Welcome to the Daily_LeetCoding repository! This repository is dedicated to documenting my journey of solving LeetCode problems on a daily basis. By consistently tackling these coding challenges, I aim to improve my problem-solving skills, algorithmic thinking, and coding proficiency.
This repository contains solutions to various LeetCode problems categorized by their respective difficulty levels (Easy, Medium, Hard). Each problem solution is accompanied by a detailed explanation of the approach taken and the reasoning behind it. Additionally, you will find code implementations in popular programming languages such as Python, Java, and C++.
- Skill Enhancement: Regular practice of problem-solving enhances algorithmic thinking and coding skills.
- Learning Experience: Explaining solutions helps in better understanding of concepts and techniques.
- Consistency: Daily practice builds momentum and consistency, leading to better long-term results.
- Community Engagement: Sharing solutions and insights fosters collaboration and learning within the programming community.
To get started with Daily_Leetcoding, follow these steps:
- Clone the repository to your local machine:
git clone https://github.com/SaifRasool92/Daily-Leetcoding.git
This repository is authorized with LeetCode using LeetSync. LeetSync automatically synchronizes your LeetCode submissions with this repository, ensuring that your progress is accurately reflected here.
Contributions to Daily_Leetcoding are welcome! If you have a solution to a LeetCode problem that is not already included in this repository, or if you have suggestions for improving existing solutions, feel free to open a pull request. Please adhere to the following guidelines:
- Ensure that your code is well-documented and follows best practices.
- Provide a clear explanation of the solution approach.
- Use descriptive commit messages and follow the existing directory structure.
| 0920-uncommon-words-from-two-sentences |
| 1217-relative-sort-array |
| 1510-find-lucky-integer-in-an-array |
| 2532-remove-letter-to-equalize-frequency |
| 3914-check-if-any-element-has-prime-frequency |
| 0021-merge-two-sorted-lists |
| 0083-remove-duplicates-from-sorted-list |
| 0021-merge-two-sorted-lists |
| 1013-fibonacci-number |
| 3799-unique-3-digit-even-numbers |
| 0137-single-number-ii |
| 0861-flipping-an-image |
| 1610-xor-operation-in-an-array |
| 1839-decode-xored-array |
| 0026-remove-duplicates-from-sorted-array |
| 0557-reverse-words-in-a-string-iii |
| 0841-shortest-distance-to-a-character |
| 0861-flipping-an-image |
| 0861-flipping-an-image |
| 2737-row-with-maximum-ones |
| 0861-flipping-an-image |
| 1769-get-maximum-in-generated-array |
| 0219-contains-duplicate-ii |
| 0643-maximum-average-subarray-i |
| 2083-three-divisors |
| 2507-number-of-common-factors |
| 3799-unique-3-digit-even-numbers |
| 2083-three-divisors |
| 2507-number-of-common-factors |
| 3914-check-if-any-element-has-prime-frequency |
| 0525-contiguous-array |
| 0783-search-in-a-binary-search-tree |
| 0374-guess-number-higher-or-lower |
| 0783-search-in-a-binary-search-tree |
| 1730-special-array-with-x-elements-greater-than-or-equal-x |
| 0783-search-in-a-binary-search-tree |
| 0374-guess-number-higher-or-lower |
| 0207-course-schedule |
| 0207-course-schedule |
| 0207-course-schedule |
| 0207-course-schedule |
| 1858-latest-time-by-replacing-hidden-digits |
| 0121-best-time-to-buy-and-sell-stock |
| 1013-fibonacci-number |
| 1013-fibonacci-number |