https://github.com/milosz275/leetcode

Repository for my solutions to Leetcode problems.
https://github.com/milosz275/leetcode

c cpp doxygen leetcode leetcode-solutions python sphinx

Last synced: about 2 months ago
JSON representation

Repository for my solutions to Leetcode problems.

• Host: GitHub
• URL: https://github.com/milosz275/leetcode
• Owner: milosz275
• License: mit
• Created: 2024-06-21T09:07:08.000Z (6 months ago)
• Default Branch: main
• Last Pushed: 2024-09-21T14:16:01.000Z (3 months ago)
• Last Synced: 2024-10-12T19:02:42.219Z (3 months ago)
• Topics: c, cpp, doxygen, leetcode, leetcode-solutions, python, sphinx
• Language: C
• Homepage: https://milosz275.github.io/leetcode
• Size: 171 KB
• Stars: 3
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Funding: .github/FUNDING.yml
  • License: LICENSE

Awesome Lists containing this project

README

        
# Leetcode

[![CodeQL](https://github.com/mldxo/leetcode/actions/workflows/codeql.yml/badge.svg)](https://github.com/mldxo/leetcode/actions/workflows/codeql.yml)

[![Docs](https://github.com/mldxo/leetcode/actions/workflows/docs.yml/badge.svg)](https://github.com/mldxo/leetcode/actions/workflows/docs.yml)

This is a repository for my solutions to Leetcode problems. I will be solving problems in C, C++ and Python. There will be at least one problem solved every day. Explanations solutions will be provided with documentation generated in Doxygen and Sphinx. CamelCase is used for Leetcode functions and snake_case is the rest of the code.

## 75

| # | Title | Difficulty | Langs | Docs | Passed |

|---| ----- | ---------- | ----- | ---- | ------ |

| 1 | [Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/) | Easy | [C](merge-strings-alternately/main.c) | [Doxygen](https://mldxo.github.io/leetcode/merge-strings-alternately/) | ✔️ |

| 2 | [Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/) | Easy | [C](greatest-common-divisor-of-strings/main.c) | [Doxygen](https://mldxo.github.io/leetcode/greatest-common-divisor-of-strings/) | ✔️ |

| 3 | [Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/) | Easy | [C](kids-with-the-greatest-number-of-candies/main.c) | [Doxygen](https://mldxo.github.io/leetcode/kids-with-the-greatest-number-of-candies/) | ✔️ |

| 4 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/) | Medium | [C](reverse-words-in-a-string/main.c) | [Doxygen](https://mldxo.github.io/leetcode/reverse-words-in-a-string/) | ✔️ |

## All Problems

| # | Title | Difficulty | Langs | Docs | Passed |

|---| ----- | ---------- | ----- | ---- | ------ |

| 1 | [Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/) | Hard | [C](count-of-range-sum/main.c) | [Doxygen](https://mldxo.github.io/leetcode/count-of-range-sum/) | ❌ |

| 2 | [Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k/) | Medium | [C](subarray-product-less-than-k/main.c) | [Doxygen](https://mldxo.github.io/leetcode/subarray-product-less-than-k/) | ✔️ |

| 3 | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | Medium | [C](reverse-integer/main.c) | [Doxygen](https://mldxo.github.io/leetcode/reverse-integer/) | ✔️ |

| 4 | [Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/) | Easy | [C](merge-strings-alternately/main.c) | [Doxygen](https://mldxo.github.io/leetcode/merge-strings-alternately/) | ✔️ |

| 5 | [Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/) | Easy | [C](greatest-common-divisor-of-strings/main.c) | [Doxygen](https://mldxo.github.io/leetcode/greatest-common-divisor-of-strings/) | ✔️ |

| 6 | [All Ancestors of a Node in a Directed Acyclic Graph](https://leetcode.com/problems/all-ancestors-of-a-node-in-a-directed-acyclic-graph/) | Medium | [C++](all-ancestors-of-a-node-in-a-dag/main.cpp) | [Doxygen](https://mldxo.github.io/leetcode/all-ancestors-of-a-node-in-a-dag/) | ✔️ |

| 7 | [Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/) | Easy | [C](kids-with-the-greatest-number-of-candies/main.c) | [Doxygen](https://mldxo.github.io/leetcode/kids-with-the-greatest-number-of-candies/) | ✔️ |

| 8 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/) | Medium | [C](reverse-words-in-a-string/main.c) | [Doxygen](https://mldxo.github.io/leetcode/reverse-words-in-a-string/) | ✔️ |

| 9 | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | Easy | [C](intersection-of-two-arrays-ii/main.c) | [Doxygen](https://mldxo.github.io/leetcode/intersection-of-two-arrays-ii/) | ✔️ |

| 10 | [Water Bottles](https://leetcode.com/problems/water-bottles/) | Easy | [C](water-bottles/main.c) | [Doxygen](https://mldxo.github.io/leetcode/water-bottles/) | ✔️ |

| 11 | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching/) | Hard | [C](wildcard-matching/main.c) | [Doxygen](https://mldxo.github.io/leetcode/wildcard-matching/) | ✔️ |

| 12 | [Maximum Level Sum of a Binary Tree](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/) | Medium | [Python](maximum-level-sum-of-a-binary-tree/main.py) | [Sphinx](https://mldxo.github.io/leetcode/maximum-level-sum-of-a-binary-tree/) | ➖ |

## License

This project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.