https://github.com/milosz275/leetcode
Repository for my solutions to Leetcode problems. Each task is documented and docs are automatically deployed.
https://github.com/milosz275/leetcode
c cpp doxygen leetcode leetcode-solutions python sphinx
Last synced: 5 months ago
JSON representation
Repository for my solutions to Leetcode problems. Each task is documented and docs are automatically deployed.
- Host: GitHub
- URL: https://github.com/milosz275/leetcode
- Owner: milosz275
- License: mit
- Created: 2024-06-21T09:07:08.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2025-03-15T10:04:01.000Z (about 1 year ago)
- Last Synced: 2025-04-06T02:15:33.431Z (12 months ago)
- Topics: c, cpp, doxygen, leetcode, leetcode-solutions, python, sphinx
- Language: C++
- Homepage: https://milosz275.github.io/leetcode
- Size: 1.26 MB
- 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
[](https://github.com/milosz275/leetcode/actions/workflows/codeql.yml)
[](https://github.com/milosz275/leetcode/actions/workflows/docs.yml)
This is a repository for my solutions to Leetcode problems written in C, C++, Python and SQL. Leetcode profile: [mlsh](https://leetcode.com/u/mlsh/)
## 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://milosz275.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://milosz275.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://milosz275.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://milosz275.github.io/leetcode/reverse-words-in-a-string/) | ✔️ |
| 5 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | Easy | [C++](move-zeroes/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/move-zeroes/) | ✔️ |
| 6 | [Is Subsequence](https://leetcode.com/problems/is-subsequence/) | Medium | [C](is-subsequence/main.c) | [Doxygen](https://milosz275.github.io/leetcode/is-subsequence/) | ✔️ |
| 7 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | Medium | [C](container-with-most-water/main.c) | [Doxygen](https://milosz275.github.io/leetcode/container-with-most-water/) | ✔️ |
| 8 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index/) | Easy | [C++](find-pivot-index/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/find-pivot-index/) | ✔️ |
| 9 | [Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/) | Easy | [C++](unique-number-of-occurrences/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/unique-number-of-occurrences/) | ✔️ |
|10 | [Removing Stars From a String](https://leetcode.com/problems/removing-stars-from-a-string/) | Easy | [C++](removing-stars-from-a-string/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/removing-stars-from-a-string/) | ✔️ |
|11 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [C++](decode-string/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/decode-string/) | ✔️ |
|12 | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/) | Easy | [C++](number-of-recent-calls/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/number-of-recent-calls/) | ✔️ |
|13 | [Delete the Middle Node of a Linked List](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/) | Medium | [C++](delete-the-middle-node-of-a-linked-list/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/delete-the-middle-node-of-a-linked-list/) | ✔️ |
|14 | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/) | Medium | [C++](odd-even-linked-list/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/odd-even-linked-list/) | ✔️ |
|15 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | Easy | [C++](reverse-linked-list/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/reverse-linked-list/) | ✔️ |
|16 | [Maximum Level Sum of a Binary Tree](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/) | Medium | [C++](maximum-level-sum-of-a-binary-tree/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/maximum-level-sum-of-a-binary-tree/) | ✔️ |
|17 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | Medium | [C++](kth-largest-element-in-an-array/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/kth-largest-element-in-an-array/) | ✔️ |
|18 | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/) | Easy | [C++](guess-number-higher-or-lower/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/guess-number-higher-or-lower/) | ✔️ |
|19 | [N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/) | Easy | [C++](n-th-tribonacci-number/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/n-th-tribonacci-number/) | ✔️ |
|20 | [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | Medium | [C++](longest-common-subsequence/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/longest-common-subsequence/) | ✔️ |
|21 | [Counting Bits](https://leetcode.com/problems/counting-bits/) | Easy | [C++](counting-bits/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/counting-bits/) | ✔️ |
|22 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures/) | Medium | [C++](daily-temperatures/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/daily-temperatures/) | ✔️ |
## SQL 50
| # | Title | Difficulty | Langs | Docs | Passed |
|----| ----- | ---------- | ----- | ---- | ------ |
| 1 | [Recyclable and Low Fat Products](https://leetcode.com/problems/recyclable-and-low-fat-products/) | Easy | [SQL](recyclable-and-low-fat-products/main.cpp) | ➖ | ✔️ |
| 2 | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee/) | Easy | [SQL](find-customer-referee/main.cpp) | ➖ | ✔️ |
## 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.cpp) | [Doxygen](https://milosz275.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://milosz275.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://milosz275.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://milosz275.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://milosz275.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://milosz275.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://milosz275.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://milosz275.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://milosz275.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://milosz275.github.io/leetcode/water-bottles/) | ✔️ |
| 11 | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching/) | Hard | [C](wildcard-matching/main.c) | [Doxygen](https://milosz275.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 | [C++](maximum-level-sum-of-a-binary-tree/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/maximum-level-sum-of-a-binary-tree/) | ✔️ |
| 13 | [Maximum Number of Integers to Choose From a Range I](https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-i/) | Medium | [C++](maximum-number-of-integers-to-choose-from-a-range-i/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/maximum-number-of-integers-to-choose-from-a-range-i/) | ✔️ |
| 14 | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) | Medium | [C++](remove-duplicates-from-sorted-array-ii/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/remove-duplicates-from-sorted-array-ii/) | ✔️ |
| 15 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman/) | Medium | [C++](integer-to-roman/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/integer-to-roman/) | ✔️ |
| 16 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | Easy | [C++](valid-palindrome/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/valid-palindrome/) | ✔️ |
| 17 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | Easy | [C++](reverse-linked-list/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/reverse-linked-list/) | ✔️ |
| 18 | [Basic Calculator](https://leetcode.com/problems/basic-calculator/) | Hard | [C++](basic-calculator/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/basic-calculator/) | ✔️ |
| 19 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | Easy | [C++](valid-anagram/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/valid-anagram/) | ✔️ |
| 20 | [Sort List](https://leetcode.com/problems/sort-list/) | Medium | [C++](sort-list/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/sort-list/) | ✔️ |
| 21 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | Easy | [C++](palindrome-linked-list/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/palindrome-linked-list/) | ✔️ |
| 22 | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/) | Medium | [C++](linked-list-random-node/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/linked-list-random-node/) | ✔️ |
| 23 | [H-Index](https://leetcode.com/problems/h-index/) | Medium | [C++](h-index/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/h-index/) | ✔️ |
| 24 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | Medium | [C++](container-with-most-water/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/container-with-most-water/) | ✔️ |
| 25 | [Two Sum](https://leetcode.com/problems/two-sum/) | Medium | [C++](two-sum/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/two-sum/) | ✔️ |
| 26 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [C++](3sum/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/3sum/) | ✔️ |
| 27 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [C++](best-time-to-buy-and-sell-stock/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/best-time-to-buy-and-sell-stock/) | ✔️ |
| 28 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/) | Easy | [C++](binary-tree-preorder-traversal/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/binary-tree-preorder-traversal/) | ✔️ |
| 29 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | Easy | [C++](climbing-stairs/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/climbing-stairs/) | ✔️ |
| 30 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | Medium | [C++](binary-tree-level-order-traversal/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/binary-tree-level-order-traversal/) | ✔️ |
| 31 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | Easy | [C++](binary-tree-inorder-traversal/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/binary-tree-inorder-traversal/) | ✔️ |
| 32 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) | Easy | [C++](binary-tree-postorder-traversal/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/binary-tree-postorder-traversal/) | ✔️ |
| 33 | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/) | Medium | [C++](binary-search-tree-iterator/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/binary-search-tree-iterator/) | ✔️ |
| 34 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | Medium | [C++](validate-binary-search-tree/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/validate-binary-search-tree/) | ✔️ |
| 35 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [C++](trapping-rain-water/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/trapping-rain-water/) | ✔️ |
| 36 | [Word Break](https://leetcode.com/problems/word-break/) | Medium | [C++](word-break/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/word-break/) | ✔️ |
| 37 | [Sum of Digits of String After Convert](https://leetcode.com/problems/sum-of-digits-of-string-after-convert/) | Easy | [C++](sum-of-digits-of-string-after-convert/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/sum-of-digits-of-string-after-convert/) | ✔️ |
| 38 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | Medium | [C++](best-time-to-buy-and-sell-stock-ii/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/best-time-to-buy-and-sell-stock-ii/) | ✔️ |
| 39 | [Design HashMap](https://leetcode.com/problems/design-hashmap/) | Easy | [C++](design-hashmap/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/design-hashmap/) | ✔️ |
| 40 | [Add Sum of Digits in Base K](https://leetcode.com/problems/sum-of-digits-in-base-k/) | Easy | [C++](sum-of-digits-in-base-k/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/sum-of-digits-in-base-k/) | ✔️ |
| 41 | [Add digits](https://leetcode.com/problems/add-digits/) | Easy | [C++](add-digits/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/add-digits/) | ✔️ |
| 42 | [Continuous Subarrays](https://leetcode.com/problems/continuous-subarrays/) | Medium | [C++](continuous-subarrays/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/continuous-subarrays/) | ✔️ |
| 43 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | Hard | [C++](find-median-from-data-stream/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/find-median-from-data-stream/) | ✔️ |
| 44 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/) | Medium | [C++](minimum-size-subarray-sum/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/minimum-size-subarray-sum/) | ✔️ |
| 45 | [Rotate Image](https://leetcode.com/problems/rotate-image/) | Medium | [C++](rotate-image/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/rotate-image/) | ✔️ |
| 46 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | Medium | [C++](spiral-matrix/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/spiral-matrix/) | ✔️ |
| 47 | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/) | Medium | [C++](spiral-matrix-ii/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/spiral-matrix-ii/) | ✔️ |
| 48 | [Counting Words With a Given Prefix](https://leetcode.com/problems/counting-words-with-a-given-prefix/) | Easy | [C++](counting-words-with-a-given-prefix/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/counting-words-with-a-given-prefix/) | ✔️ |
| 49 | [Circular Array Loop](https://leetcode.com/problems/circular-array-loop/) | Medium | [C++](circular-array-loop/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/circular-array-loop/) | ✔️ |
| 50 | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/) | Easy | [C++](number-of-recent-calls/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/number-of-recent-calls/) | ✔️ |
| 51 | [Clone Graph](https://leetcode.com/problems/clone-graph/) | Medium | [C++](clone-graph/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/clone-graph/) | ✔️ |
| 52 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [C++](decode-string/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/decode-string/) | ✔️ |
| 53 | [Counting Bits](https://leetcode.com/problems/counting-bits/) | Easy | [C++](counting-bits/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/counting-bits/) | ✔️ |
| 54 | [Course Schedule](https://leetcode.com/problems/course-schedule/) | Medium | [C++](course-schedule/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/course-schedule/) | ✔️ |
| 55 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures/) | Medium | [C++](daily-temperatures/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/daily-temperatures/) | ✔️ |
| 56 | [First Letter to Appear Twice](https://leetcode.com/problems/first-letter-to-appear-twice/) | Easy | [C++](first-letter-to-appear-twice/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/first-letter-to-appear-twice/) | ✔️ |
| 57 | [Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/) | Easy | [C++](guess-number-higher-or-lower/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/guess-number-higher-or-lower/) | ✔️ |
| 58 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | Easy | [C++](linked-list-cycle/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/linked-list-cycle/) | ✔️ |
| 59 | [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | Medium | [C++](longest-common-subsequence/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/longest-common-subsequence/) | ✔️ |
| 60 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | Easy | [C++](merge-two-sorted-lists/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/merge-two-sorted-lists/) | ✔️ |
| 61 | [N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/) | Easy | [C++](n-th-tribonacci-number/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/n-th-tribonacci-number/) | ✔️ |
| 62 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [C++](search-in-rotated-sorted-array/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/search-in-rotated-sorted-array/) | ✔️ |
| 63 | [Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/) | Easy | [C++](unique-number-of-occurrences/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/unique-number-of-occurrences/) | ✔️ |
| 64 | [Word Subsets](https://leetcode.com/problems/word-subsets/) | Medium | [C++](word-subsets/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/word-subsets/) | ✔️ |
| 65 | [Find the Prefix Common Array of Two Arrays](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/) | Medium | [C++](find-the-prefix-common-array-of-two-arrays/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/find-the-prefix-common-array-of-two-arrays/) | ✔️ |
| 66 | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/) | Medium | [C++](odd-even-linked-list/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/odd-even-linked-list/) | ✔️ |
| 67 | [Delete the Middle Node of a Linked List](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/) | Medium | [C++](delete-the-middle-node-of-a-linked-list/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/delete-the-middle-node-of-a-linked-list/) | ✔️ |
| 68 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [C++](merge-k-sorted-lists/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/merge-k-sorted-lists/) | ✔️ |
| 69 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [C++](group-anagrams/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/group-anagrams/) | ✔️ |
| 70 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | Medium | [C++](kth-largest-element-in-an-array/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/kth-largest-element-in-an-array/) | ✔️ |
| 71 | [Minimize XOR](https://leetcode.com/problems/minimize-xor/) | Medium | [C++](minimize-xor/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/minimize-xor/) | ✔️ |
| 72 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [C++](valid-parentheses/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/valid-parentheses/) | ✔️ |
| 73 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | Medium | [C++](remove-nth-node-from-end-of-list/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/remove-nth-node-from-end-of-list/) | ✔️ |
| 74 | [Simplified Fractions](https://leetcode.com/problems/simplified-fractions/) | Medium | [C++](simplified-fractions/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/simplified-fractions/) | ✔️ |
| 75 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | Medium | [C++](top-k-frequent-elements/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/top-k-frequent-elements/) | ✔️ |
| 76 | [Minimum Cost to Make at Least One Valid Path in a Grid](https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/) | Hard | [C++](minimum-cost-to-make-at-least-one-valid-path-in-a-grid/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/) | ✔️ |
| 77 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | Easy | [C++](invert-binary-tree/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/invert-binary-tree/) | ✔️ |
| 78 | [Encode and Decode String](https://leetcode.com/problems/encode-and-decode-string/) | Medium | [C++](encode-and-decode-string/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/encode-and-decode-string/) | ✔️ |
| 79 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | Easy | [C++](contains-duplicate/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/contains-duplicate/) | ✔️ |
| 80 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | Medium | [C++](find-minimum-in-rotated-sorted-array/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/find-minimum-in-rotated-sorted-array/) | ✔️ |
| 81 | [First Completely Painted Row or Column](https://leetcode.com/problems/first-completely-painted-row-or-column/) | Medium | [C++](first-completely-painted-row-or-column/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/first-completely-painted-row-or-column/) | ✔️ |
| 82 | [Grid Game](https://leetcode.com/problems/grid-game/) | Medium | [C++](grid-game/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/grid-game/) | ✔️ |
| 83 | [Map of Highest Peak](https://leetcode.com/problems/map-of-highest-peak/) | Medium | [C++](map-of-highest-peak/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/map-of-highest-peak/) | ✔️ |
| 84 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | Easy | [C++](move-zeroes/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/move-zeroes/) | ✔️ |
| 85 | [Count Servers that Communicate](https://leetcode.com/problems/count-servers-that-communicate/) | Medium | [C++](count-servers-that-communicate/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/count-servers-that-communicate/) | ✔️ |
| 86 | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states/) | Medium | [C++](find-eventual-safe-states/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/find-eventual-safe-states/) | ✔️ |
| 87 | [Make Lexicographically Smallest Array by Swapping Elements](https://leetcode.com/problems/make-lexicographically-smallest-array-by-swapping-elements/) | Medium | [C++](make-lexicographically-smallest-array-by-swapping-elements/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/make-lexicographically-smallest-array-by-swapping-elements/) | ✔️ |
| 88 | [Course Schedule IV](https://leetcode.com/problems/course-schedule-iv/) | Medium | [C++](course-schedule-iv/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/course-schedule-iv/) | ✔️ |
| 89 | [Binary Search](https://leetcode.com/problems/binary-search/) | Easy | [C++](binary-search/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/binary-search/) | ✔️ |
| 90 | [Maximum Count of Positive Integer and Negative Integer](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer/) | Easy | [C++](maximum-count-of-positive-integer-and-negative-integer/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/maximum-count-of-positive-integer-and-negative-integer/) | ✔️ |
| 91 | [Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/) | Easy | [C++](maximum-ascending-subarray-sum/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/maximum-ascending-subarray-sum/) | ✔️ |
| 92 | [Removing Stars From a String](https://leetcode.com/problems/removing-stars-from-a-string/) | Easy | [C++](removing-stars-from-a-string/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/removing-stars-from-a-string/) | ✔️ |
| 93 | [Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/) | Easy | [C++](check-if-one-string-swap-can-make-strings-equal/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/check-if-one-string-swap-can-make-strings-equal/) | ✔️ |
| 94 | [Tuple with Same Product](https://leetcode.com/problems/tuple-with-same-product/) | Medium | [C++](tuple-with-same-product/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/tuple-with-same-product/) | ✔️ |
| 95 | [Find the Number of Distinct Colors Among the Balls](https://leetcode.com/problems/find-the-number-of-distinct-colors-among-the-balls/) | Medium | [C++](find-the-number-of-distinct-colors-among-the-balls/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/find-the-number-of-distinct-colors-among-the-balls/) | ✔️ |
| 96 | [Design a Number Container System](https://leetcode.com/problems/design-a-number-container-system/) | Medium | [C++](design-a-number-container-system/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/design-a-number-container-system/) | ✔️ |
| 97 | [Is Subsequence](https://leetcode.com/problems/is-subsequence/) | Medium | [C](is-subsequence/main.c) | [Doxygen](https://milosz275.github.io/leetcode/is-subsequence/) | ✔️ |
| 98 | [Reorder List](https://leetcode.com/problems/reorder-list/) | Medium | [C++](reorder-list/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/reorder-list/) | ✔️ |
| 99 | [The k-th Lexicographical String of All Happy Strings of Length n](https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/) | Medium | [C++](the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/) | ✔️ |
| 100| [Nearest Exit from Entrance in Maze](https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/) | Medium | [C++](nearest-exit-from-entrance-in-maze/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/nearest-exit-from-entrance-in-maze/) | ✔️ |
| 101| [Find Unique Binary String](https://leetcode.com/problems/find-unique-binary-string/) | Medium | [C++](find-unique-binary-string/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/find-unique-binary-string/) | ✔️ |
| 102| [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | Easy | [C++](maximum-depth-of-binary-tree/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/maximum-depth-of-binary-tree/) | ✔️ |
| 103| [Find Elements in a Contaminated Binary Tree](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/) | Medium | [C++](find-elements-in-a-contaminated-binary-tree/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/find-elements-in-a-contaminated-binary-tree/) | ✔️ |
| 104| [Same Tree](https://leetcode.com/problems/same-tree/) | Easy | [C++](same-tree/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/same-tree/) | ✔️ |
| 105| [Recover a Tree From Preorder Traversal](https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/) | Hard | [C++](recover-a-tree-from-preorder-traversal/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/recover-a-tree-from-preorder-traversal/) | ✔️ |
| 106| [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Medium | [C++](maximum-subarray/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/maximum-subarray/) | ✔️ |
| 107| [Maximum Absolute Sum of Any Subarray](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/) | Medium | [C++](maximum-absolute-sum-of-any-subarray/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/maximum-absolute-sum-of-any-subarray/) | ✔️ |
| 108| [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/) | Medium | [C++](graph-valid-tree/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/graph-valid-tree/) | ✔️ |
| 109| [Merge Two 2D Arrays by Summing Values](https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values/) | Easy | [C++](merge-two-2d-arrays-by-summing-values/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/merge-two-2d-arrays-by-summing-values/) | ✔️ |
| 110| [Min Stack](https://leetcode.com/problems/min-stack/) | Medium | [C++](min-stack/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/min-stack/) | ✔️ |
| 111| [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | Medium | [C++](lowest-common-ancestor-of-a-binary-search-tree/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/lowest-common-ancestor-of-a-binary-search-tree/) | ✔️ |
| 112| [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/) | Medium | [C++](implement-trie-prefix-tree/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/implement-trie-prefix-tree/) | ✔️ |
| 113| [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | Hard | [C++](reverse-nodes-in-k-group/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/reverse-nodes-in-k-group/) | ✔️ |
| 114| [Partition Array According to Given Pivot](https://leetcode.com/problems/partition-array-according-to-given-pivot/) | Medium | [C++](partition-array-according-to-given-pivot/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/partition-array-according-to-given-pivot/) | ✔️ |
| 115| [Check if Number is a Sum of Powers of Three](https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/) | Medium | [C++](check-if-number-is-a-sum-of-powers-of-three/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/check-if-number-is-a-sum-of-powers-of-three/) | ✔️ |
| 116| [Count Total Number of Colored Cells](https://leetcode.com/problems/count-total-number-of-colored-cells/) | Medium | [C++](count-total-number-of-colored-cells/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/count-total-number-of-colored-cells/) | ✔️ |
| 117| [Find Missing and Repeated Values](https://leetcode.com/problems/find-missing-and-repeated-values/) | Easy | [C++](find-missing-and-repeated-values/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/find-missing-and-repeated-values/) | ✔️ |
| 118| [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/) | Medium | [C](search-a-2d-matrix/main.c) | [Doxygen](https://milosz275.github.io/leetcode/search-a-2d-matrix/) | ✔️ |
| 119| [Lowest Common Ancestor of Deepest Leaves](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves/) | Medium | [C++](lowest-common-ancestor-of-deepest-leaves/main.cpp) | [Doxygen](https://milosz275.github.io/leetcode/lowest-common-ancestor-of-deepest-leaves/) | ✔️ |
| 120| [Type of Triangle](https://leetcode.com/problems/type-of-triangle/) | Easy | [Python](type-of-triangle/main.py) | [MkDocs](https://milosz275.github.io/leetcode/type-of-triangle/) | ✔️ |
| 121| [Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/) | Easy | [Python](find-the-index-of-the-first-occurrence-in-a-string/main.py) | [MkDocs](https://milosz275.github.io/leetcode/find-the-index-of-the-first-occurrence-in-a-string/) | ✔️ |
## License
This project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.