https://github.com/stewie-pixel/claude-with-leetcode
Daily Leetcode masterclass with Claude code DSA mentor
https://github.com/stewie-pixel/claude-with-leetcode
ai-agents algorithms claude-code claude-skill claude-skills coding-interviews data-structures dsa leetcode
Last synced: 10 days ago
JSON representation
Daily Leetcode masterclass with Claude code DSA mentor
- Host: GitHub
- URL: https://github.com/stewie-pixel/claude-with-leetcode
- Owner: Stewie-pixel
- License: mit
- Created: 2025-08-25T09:29:16.000Z (11 months ago)
- Default Branch: main
- Last Pushed: 2026-07-02T00:25:21.000Z (13 days ago)
- Last Synced: 2026-07-02T02:26:01.458Z (13 days ago)
- Topics: ai-agents, algorithms, claude-code, claude-skill, claude-skills, coding-interviews, data-structures, dsa, leetcode
- Language: C++
- Homepage:
- Size: 3.21 MB
- Stars: 44
- Watchers: 1
- Forks: 13
- Open Issues: 125
-
Metadata Files:
- Readme: README.md
- Changelog: CHANGELOG.md
- Contributing: CONTRIBUTING.md
- License: LICENSE
- Code of conduct: CODE_OF_CONDUCT.md
- Codeowners: .github/CODEOWNERS
- Security: SECURITY.md
Awesome Lists containing this project
README
# Claude with LeetCode
[](https://leetcode.com/u/hanchivi39/)
[](https://github.com/Stewie-pixel/claude-with-leetcode/actions/workflows/build-readme.yml)
[](https://github.com/Stewie-pixel/claude-with-leetcode)
[](https://github.com/Stewie-pixel/claude-with-leetcode)
[](https://github.com/Stewie-pixel/claude-with-leetcode/releases)
[](https://opensource.org/licenses/MIT)
[](https://github.com/sponsors/Stewie-pixel)
A little assistant from Claude to help you learn daily LeetCode problems organised by DSA topic and difficulty.
> This repo hosts solutions to all problems found on [Leetcode](https://leetcode.com/problemset/) with the help of Claude. The site will be updated daily with new solutions under [problem list](https://github.com/Stewie-pixel/claude-with-leetcode#-problem-list)!
Currently support these languages:
> Python, Java, JavaScript, C++, Go, C#, TypeScript, Rust, Kotlin, Ruby, C
Solutions are also welcome for any other _supported_ language on leetcode.com!
## 🎬 Demo
## 📊 GitHub Stats
## 💻 Table of Contents
- [Features](#-features)
- [Roadmap](#-roadmap)
- [Share with the Community](#-share-with-the-community)
- [Contributing](#-contributing)
- [Thanks to our Contributors](#-thanks-to-our-contributors)
- [License](#-license)
- [Problem List](#problem-list)
## 🚀 Features
### 🌐 Universal LeetCode Catalog Support
This repository organizes and compiles daily solutions for the entire universe of LeetCode questions, spanning everything from foundational array tasks to the most advanced dynamic programming problems found in weekly contests
### 🤖 Intelligent AI Mentorship
Get granular, structural breakdown hints and optimal code logic recommendations from Claude without spoiling the core algorithmic logic upfront.
### 🔄 Multi-Language Synchronization
Automatically track and synchronize your multi-language solutions across comprehensive tech stacks including C++, Java, Python, Rust, and JavaScript.
### 📂 Automated Categorization
Zero manual cataloging required. The system automatically parses multi-topic tags and maps individual problems out into relevant, consolidated DSA pattern matrices.
## 🗺️ Roadmap
### 🔄 Continuous Solution Stream
- Maintain daily LeetCode coding challenge updates across C++, Java, Python, Rust, and JavaScript
- Comprehensive tracking and solution mapping for all Weekly and Biweekly programming contests
- Expand alternative optimal pattern variations for advanced dynamic programming structures
### 🛠️ Developer Tooling & Integration
- Mirabile CLI GitHub workflow integration to seamlessly guide developers through issue creation
- Standardized Pull Request onboarding automation to assist external contributors during code submission
- Implement automated execution verification hooks to validate runtime complexity statistics
## 📢 Share with the Community
If this project is helping you crush your technical interviews, share it with your network and help others level up their algorithmic skills.
[](https://x.com)
[](https://reddit.com)
[](https://linkedin.com)
[](https://dev.to)
[](https://facebook.com)
[](https://instagram.com)
## 🤝 Contributing
Contributions are what make the open-source community such an amazing place to learn, inspire, and create. Any contributions you make are greatly appreciated. Please fork the repository, make your feature modifications on a standalone branch, and open a clean Pull Request against the main branch.
See our [Contributing Guide](./CONTRIBUTING.md) for development setup, coding
standards, and how to submit pull requests.
## 💖 Thanks to our Contributors
A massive thank you to everyone helping maintain, optimize, and expand this data structure and algorithm sandbox.
[](https://github.com/Stewie-pixel/claude-with-leetcode/graphs/contributors)
## 📄 License
Distributed under the MIT License. See `LICENSE` for more information.
## ⚡ Problem List
### Array
Problem | Difficulty | C | C++ | C# | GO | Java | JS | Kotlin | Python | Ruby | Rust | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[0001 - Two Sum](https://leetcode.com/problems/two-sum) | 🟢 Easy | ❌ | [✔️](cpp%2F1-two-sum%2FREADME.md) | ❌ | ❌ | ❌ | ❌ | ❌ | [✔️](python%2F1-two-sum%2FREADME.md) | ❌ | [✔️](rust%2F1-two-sum%2FREADME.md) | ❌
[0035 - Search Insert Position](https://leetcode.com/problems/search-insert-position) | 🟢 Easy | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | [✔️](python%2F35-search-insert-position%2FANALYSIS.md) | ❌ | ❌ | ❌
[0219 - Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii) | 🟢 Easy | ❌ | [✔️](cpp%2F219-contains-duplicate-ii%2FREADME.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0463 - Island Perimeter](https://leetcode.com/problems/island-perimeter) | 🟢 Easy | ❌ | [✔️](cpp%2F463-island-perimeter%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0724 - Find Pivot Index](https://leetcode.com/problems/find-pivot-index) | 🟢 Easy | ❌ | [✔️](cpp%2F724-find-pivot-index%2FREADME.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1732 - Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude) | 🟢 Easy | ❌ | [✔️](cpp%2F1732-find-the-highest-altitude%2FREADME.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1967 - Number of Strings That Appear as Substrings in Word](https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word) | 🟢 Easy | ❌ | [✔️](cpp%2F1967-number-of-strings-that-appear-as-substrings-in-word%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2144 - Minimum Cost of Buying Candies With Discount](https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount) | 🟢 Easy | ❌ | [✔️](cpp%2F2144-minimum-cost-of-buying-candies-with-discount%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | [✔️](dcc%2Fpython%2F2144-minimum-cost-of-buying-candies-with-discount%2FREADME.md) | ❌ | ❌ | ❌
[2248 - Intersection of Multiple Arrays](https://leetcode.com/problems/intersection-of-multiple-arrays) | 🟢 Easy | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2574 - Left and Right Sum Differences](https://leetcode.com/problems/left-and-right-sum-differences) | 🟢 Easy | ❌ | [✔️](cpp%2F2574-left-and-right-sum-differences%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3512 - Minimum Operations to Make Array Sum Divisible by K](https://leetcode.com/problems/minimum-operations-to-make-array-sum-divisible-by-k) | 🟢 Easy | ❌ | [✔️](cpp%2F3512-minimum-operations-to-make-array-sum-divisible-by-k%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3633 - Earliest Finish Time for Land and Water Rides I](https://leetcode.com/problems/earliest-finish-time-for-land-and-water-rides-i) | 🟢 Easy | ❌ | [✔️](cpp%2F3633-earliest-finish-time-for-land-and-water-rides-i%2FREADME.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3838 - Weighted Word Mapping](https://leetcode.com/problems/weighted-word-mapping) | 🟢 Easy | ❌ | [✔️](cpp%2F3838-weighted-word-mapping%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3898 - Find the Degree of Each Vertex](https://leetcode.com/problems/find-the-degree-of-each-vertex) | 🟢 Easy | ❌ | [✔️](cpp%2F3898-find-the-degree-of-each-vertex%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3925 - Concatenate Array With Reverse](https://leetcode.com/problems/concatenate-array-with-reverse) | 🟢 Easy | ❌ | [✔️](cpp%2F3925-concatenate-array-with-reverse%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0011 - Container With Most Water](https://leetcode.com/problems/container-with-most-water) | 🟡 Medium | [✔️](c%2F11-container-with-most-water%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0015 - 3Sum](https://leetcode.com/problems/3sum) | 🟡 Medium | [✔️](c%2F15-3sum%2F3sum.c) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0039 - Combination Sum](https://leetcode.com/problems/combination-sum) | 🟡 Medium | [✔️](c%2F39-combination-sum%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0040 - Combination Sum II](https://leetcode.com/problems/combination-sum-ii) | 🟡 Medium | [✔️](c%2F40-combination-sum-ii%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0047 - Permutations II](https://leetcode.com/problems/permutations-ii) | 🟡 Medium | ❌ | [✔️](cpp%2F47-permutations-ii%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0128 - Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | 🟡 Medium | ❌ | [✔️](cpp%2F128-longest-consecutive-sequence%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0287 - Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | 🟡 Medium | ❌ | ❌ | ❌ | ❌ | [✔️](java%2F287-find-the-duplicate-number%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0658 - Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | 🟡 Medium | ❌ | ❌ | ❌ | ❌ | [✔️](java%2F658-find-k-closest-elements%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1311 - Get Watched Videos by Your Friends](https://leetcode.com/problems/get-watched-videos-by-your-friends) | 🟡 Medium | ❌ | [✔️](cpp%2F1311-get-watched-videos-by-your-friends%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1493 - Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element) | 🟡 Medium | ❌ | [✔️](cpp%2F1493-longest-subarray-of-1s-after-deleting-one-element%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1567 - Maximum Length of Subarray With Positive Product](https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product) | 🟡 Medium | ❌ | [✔️](cpp%2F1567-maximum-length-of-subarray-with-positive-product%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1765 - Map of Highest Peak](https://leetcode.com/problems/map-of-highest-peak) | 🟡 Medium | ❌ | [✔️](cpp%2F1765-map-of-highest-peak%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1833 - Maximum Ice Cream Bars](https://leetcode.com/problems/maximum-ice-cream-bars) | 🟡 Medium | ❌ | [✔️](cpp%2F1833-maximum-ice-cream-bars%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1846 - Maximum Element After Decreasing and Rearranging](https://leetcode.com/problems/maximum-element-after-decreasing-and-rearranging) | 🟡 Medium | ❌ | [✔️](cpp%2F1846-maximum-element-after-decreasing-and-rearranging%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2161 - Partition Array According to Given Pivot](https://leetcode.com/problems/partition-array-according-to-given-pivot) | 🟡 Medium | ❌ | [✔️](cpp%2F2161-partition-array-according-to-given-pivot%2FANALYSIS.md) | ❌ | ❌ | [✔️](java%2F2161-partition-array-according-to-given-pivot%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2196 - Create Binary Tree From Descriptions](https://leetcode.com/problems/create-binary-tree-from-descriptions) | 🟡 Medium | ❌ | [✔️](cpp%2F2196-create-binary-tree-from-descriptions%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2352 - Equal Row and Column Pairs](https://leetcode.com/problems/equal-row-and-column-pairs) | 🟡 Medium | ❌ | [✔️](cpp%2F2352-equal-row-and-column-pairs%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2812 - Find the Safest Path in a Grid](https://leetcode.com/problems/find-the-safest-path-in-a-grid) | 🟡 Medium | ❌ | [✔️](cpp%2F2812-find-the-safest-path-in-a-grid%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3020 - Find the Maximum Number of Elements in Subset](https://leetcode.com/problems/find-the-maximum-number-of-elements-in-subset) | 🟡 Medium | ❌ | [✔️](cpp%2F3020-find-the-maximum-number-of-elements-in-subset%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3635 - Earliest Finish Time for Land and Water Rides II](https://leetcode.com/problems/earliest-finish-time-for-land-and-water-rides-ii) | 🟡 Medium | ❌ | [✔️](cpp%2F3635-earliest-finish-time-for-land-and-water-rides-ii%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3689 - Maximum Total Subarray Value I](https://leetcode.com/problems/maximum-total-subarray-value-i) | 🟡 Medium | ❌ | [✔️](cpp%2F3689-maximum-total-subarray-value-i%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3737 - Count Subarrays With Majority Element I](https://leetcode.com/problems/count-subarrays-with-majority-element-i) | 🟡 Medium | ❌ | [✔️](cpp%2F3737-count-subarrays-with-majority-element-i%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0004 - Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | 🔴 Hard | [✔️](c%2F4-median-of-two-sorted-arrays%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0332 - Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | 🔴 Hard | ❌ | [✔️](cpp%2F332-reconstruct-itinerary%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0815 - Bus Routes](https://leetcode.com/problems/bus-routes) | 🔴 Hard | ❌ | [✔️](cpp%2F815-bus-routes%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0843 - Guess the Word](https://leetcode.com/problems/guess-the-word) | 🔴 Hard | ❌ | [✔️](cpp%2F843-guess-the-word%2FANALYSIS.md) | [✔️](csharp%2F843-guess-the-word%2FANALYSIS.md) | [✔️](go%2F843-guess-the-word%2FANALYSIS.md) | ❌ | ❌ | [✔️](kotlin%2F843-guess-the-word%2FANALYSIS.md) | ❌ | [✔️](ruby%2F843-guess-the-word%2FANALYSIS.md) | ❌ | ❌
[0952 - Largest Component Size by Common Factor](https://leetcode.com/problems/largest-component-size-by-common-factor) | 🔴 Hard | ❌ | [✔️](cpp%2F952-largest-component-size-by-common-factor%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1840 - Maximum Building Height](https://leetcode.com/problems/maximum-building-height) | 🔴 Hard | ❌ | [✔️](cpp%2F1840-maximum-building-height%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2065 - Maximum Path Quality of a Graph](https://leetcode.com/problems/maximum-path-quality-of-a-graph) | 🔴 Hard | ❌ | [✔️](cpp%2F2065-maximum-path-quality-of-a-graph%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3559 - Number of Ways to Assign Edge Weights II](https://leetcode.com/problems/number-of-ways-to-assign-edge-weights-ii) | 🔴 Hard | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | [✔️](python%2F3559-number-of-ways-to-assign-edge-weights-ii%2FANALYSIS.md) | ❌ | ❌ | ❌
[3691 - Maximum Total Subarray Value II](https://leetcode.com/problems/maximum-total-subarray-value-ii) | 🔴 Hard | ❌ | [✔️](cpp%2F3691-maximum-total-subarray-value-ii%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3739 - Count Subarrays With Majority Element II](https://leetcode.com/problems/count-subarrays-with-majority-element-ii) | 🔴 Hard | ❌ | [✔️](cpp%2F3739-count-subarrays-with-majority-element-ii%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
### Backtracking
Problem | Difficulty | C | C++ | C# | GO | Java | JS | Kotlin | Python | Ruby | Rust | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[0022 - Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | 🟡 Medium | [✔️](c%2F22-generate-parentheses%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0039 - Combination Sum](https://leetcode.com/problems/combination-sum) | 🟡 Medium | [✔️](c%2F39-combination-sum%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0040 - Combination Sum II](https://leetcode.com/problems/combination-sum-ii) | 🟡 Medium | [✔️](c%2F40-combination-sum-ii%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0077 - Combinations](https://leetcode.com/problems/combinations) | 🟡 Medium | ❌ | [✔️](cpp%2F77-combinations%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0797 - All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | 🟡 Medium | ❌ | [✔️](cpp%2F797-all-paths-from-source-to-target%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2065 - Maximum Path Quality of a Graph](https://leetcode.com/problems/maximum-path-quality-of-a-graph) | 🔴 Hard | ❌ | [✔️](cpp%2F2065-maximum-path-quality-of-a-graph%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
### Binary Search
Problem | Difficulty | C | C++ | C# | GO | Java | JS | Kotlin | Python | Ruby | Rust | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[0035 - Search Insert Position](https://leetcode.com/problems/search-insert-position) | 🟢 Easy | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | [✔️](python%2F35-search-insert-position%2FANALYSIS.md) | ❌ | ❌ | ❌
[0287 - Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | 🟡 Medium | ❌ | ❌ | ❌ | ❌ | [✔️](java%2F287-find-the-duplicate-number%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0658 - Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements) | 🟡 Medium | ❌ | ❌ | ❌ | ❌ | [✔️](java%2F658-find-k-closest-elements%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2812 - Find the Safest Path in a Grid](https://leetcode.com/problems/find-the-safest-path-in-a-grid) | 🟡 Medium | ❌ | [✔️](cpp%2F2812-find-the-safest-path-in-a-grid%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0004 - Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | 🔴 Hard | [✔️](c%2F4-median-of-two-sorted-arrays%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
### Binary Tree
Problem | Difficulty | C | C++ | C# | GO | Java | JS | Kotlin | Python | Ruby | Rust | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[0094 - Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | 🟢 Easy | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | [✔️](rust%2F94-binary-tree-inorder-traversal%2FANALYSIS.md) | ❌
### Bit Manipulation
Problem | Difficulty | C | C++ | C# | GO | Java | JS | Kotlin | Python | Ruby | Rust | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[0287 - Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number) | 🟡 Medium | ❌ | ❌ | ❌ | ❌ | [✔️](java%2F287-find-the-duplicate-number%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
### Breadth-First Search
Problem | Difficulty | C | C++ | C# | GO | Java | JS | Kotlin | Python | Ruby | Rust | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[0463 - Island Perimeter](https://leetcode.com/problems/island-perimeter) | 🟢 Easy | ❌ | [✔️](cpp%2F463-island-perimeter%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1971 - Find if Path Exists in Graph](https://leetcode.com/problems/find-if-path-exists-in-graph) | 🟢 Easy | ❌ | [✔️](cpp%2F1971-find-if-path-exists-in-graph%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0743 - Network Delay Time](https://leetcode.com/problems/network-delay-time) | 🟡 Medium | ❌ | [✔️](cpp%2F743-network-delay-time%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0797 - All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | 🟡 Medium | ❌ | [✔️](cpp%2F797-all-paths-from-source-to-target%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1129 - Shortest Path with Alternating Colors](https://leetcode.com/problems/shortest-path-with-alternating-colors) | 🟡 Medium | ❌ | [✔️](cpp%2F1129-shortest-path-with-alternating-colors%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1311 - Get Watched Videos by Your Friends](https://leetcode.com/problems/get-watched-videos-by-your-friends) | 🟡 Medium | ❌ | [✔️](cpp%2F1311-get-watched-videos-by-your-friends%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1765 - Map of Highest Peak](https://leetcode.com/problems/map-of-highest-peak) | 🟡 Medium | ❌ | [✔️](cpp%2F1765-map-of-highest-peak%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2492 - Minimum Score of a Path Between Two Cities](https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities) | 🟡 Medium | ❌ | [✔️](cpp%2F2492-minimum-score-of-a-path-between-two-cities%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2685 - Count the Number of Complete Components](https://leetcode.com/problems/count-the-number-of-complete-components) | 🟡 Medium | ❌ | [✔️](cpp%2F2685-count-the-number-of-complete-components%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2812 - Find the Safest Path in a Grid](https://leetcode.com/problems/find-the-safest-path-in-a-grid) | 🟡 Medium | ❌ | [✔️](cpp%2F2812-find-the-safest-path-in-a-grid%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0815 - Bus Routes](https://leetcode.com/problems/bus-routes) | 🔴 Hard | ❌ | [✔️](cpp%2F815-bus-routes%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
### Contest
Problem | Difficulty | C | C++ | C# | GO | Java | JS | Kotlin | Python | Ruby | Rust | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[2723 - Add Two Promises](https://leetcode.com/problems/add-two-promises) | 🟢 Easy | ❌ | ❌ | ❌ | ❌ | ❌ | [✔️](javascript%2F2723-add-two-promises%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | [✔️](typescript%2F2723-add-two-promises%2FANALYSIS.md)
[3940 - Limit Occurrences in Sorted Array](https://leetcode.com/problems/limit-occurrences-in-sorted-array) | 🟢 Easy | ❌ | [✔️](cpp%2F3940-limit-occurrences-in-sorted-array%2FREADME.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3950 - Exactly One Consecutive Set Bits Pair](https://leetcode.com/problems/exactly-one-consecutive-set-bits-pair) | 🟢 Easy | ❌ | [✔️](cpp%2F3950-exactly-one-consecutive-set-bits-pair%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3954 - Sum of Compatible Numbers in Range I](https://leetcode.com/problems/sum-of-compatible-numbers-in-range-i) | 🟢 Easy | ❌ | [✔️](cpp%2F3954-sum-of-compatible-numbers-in-range-i%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3959 - Check Good Integer](https://leetcode.com/problems/check-good-integer) | 🟢 Easy | ❌ | [✔️](cpp%2F3959-check-good-integer%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2627 - Debounce](https://leetcode.com/problems/debounce) | 🟡 Medium | ❌ | ❌ | ❌ | ❌ | ❌ | [✔️](javascript%2F2627-debounce%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | [✔️](typescript%2F2627-debounce%2FANALYSIS.md)
[3951 - Minimum Energy to Maintain Brightness](https://leetcode.com/problems/minimum-energy-to-maintain-brightness) | 🟡 Medium | ❌ | [✔️](cpp%2F3951-minimum-energy-to-maintain-brightness%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3952 - Maximum Total Value of Covered Indices](https://leetcode.com/problems/maximum-total-value-of-covered-indices) | 🟡 Medium | ❌ | [✔️](cpp%2F3952-maximum-total-value-of-covered-indices%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3955 - Valid Binary Strings With Cost Limit](https://leetcode.com/problems/valid-binary-strings-with-cost-limit) | 🟡 Medium | ❌ | [✔️](cpp%2F3955-valid-binary-strings-with-cost-limit%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3960 - Frequency Balance Subarray](https://leetcode.com/problems/frequency-balance-subarray) | 🟡 Medium | ❌ | [✔️](cpp%2F3960-frequency-balance-subarray%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3961 - Maximize Sum of Device Ratings](https://leetcode.com/problems/maximize-sum-of-device-ratings) | 🟡 Medium | ❌ | [✔️](cpp%2F3961-maximize-sum-of-device-ratings%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3953 - Maximum Score with Co-Prime Element](https://leetcode.com/problems/maximum-score-with-co-prime-element) | 🔴 Hard | ❌ | [✔️](cpp%2F3953-maximum-score-with-co-prime-element%2FREADME.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3956 - Maximum Sum of M Non-Overlapping Subarrays I](https://leetcode.com/problems/maximum-sum-of-m-non-overlapping-subarrays-i) | 🔴 Hard | ❌ | [✔️](cpp%2F3956-maximum-sum-of-m-non-overlapping-subarrays-i%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3957 - Maximum Sum of M Non-Overlapping Subarrays II](https://leetcode.com/problems/maximum-sum-of-m-non-overlapping-subarrays-ii) | 🔴 Hard | ❌ | [✔️](cpp%2F3957-maximum-sum-of-m-non-overlapping-subarrays-ii%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
### Counting
Problem | Difficulty | C | C++ | C# | GO | Java | JS | Kotlin | Python | Ruby | Rust | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[1189 - Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons) | 🟢 Easy | ❌ | [✔️](cpp%2F1189-maximum-number-of-balloons%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3737 - Count Subarrays With Majority Element I](https://leetcode.com/problems/count-subarrays-with-majority-element-i) | 🟡 Medium | ❌ | [✔️](cpp%2F3737-count-subarrays-with-majority-element-i%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
### Counting Sort
Problem | Difficulty | C | C++ | C# | GO | Java | JS | Kotlin | Python | Ruby | Rust | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[1833 - Maximum Ice Cream Bars](https://leetcode.com/problems/maximum-ice-cream-bars) | 🟡 Medium | ❌ | [✔️](cpp%2F1833-maximum-ice-cream-bars%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
### Depth-First Search
Problem | Difficulty | C | C++ | C# | GO | Java | JS | Kotlin | Python | Ruby | Rust | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[0094 - Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | 🟢 Easy | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | [✔️](rust%2F94-binary-tree-inorder-traversal%2FANALYSIS.md) | ❌
[0463 - Island Perimeter](https://leetcode.com/problems/island-perimeter) | 🟢 Easy | ❌ | [✔️](cpp%2F463-island-perimeter%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1971 - Find if Path Exists in Graph](https://leetcode.com/problems/find-if-path-exists-in-graph) | 🟢 Easy | ❌ | [✔️](cpp%2F1971-find-if-path-exists-in-graph%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0743 - Network Delay Time](https://leetcode.com/problems/network-delay-time) | 🟡 Medium | ❌ | [✔️](cpp%2F743-network-delay-time%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0797 - All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | 🟡 Medium | ❌ | [✔️](cpp%2F797-all-paths-from-source-to-target%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2492 - Minimum Score of a Path Between Two Cities](https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities) | 🟡 Medium | ❌ | [✔️](cpp%2F2492-minimum-score-of-a-path-between-two-cities%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2685 - Count the Number of Complete Components](https://leetcode.com/problems/count-the-number-of-complete-components) | 🟡 Medium | ❌ | [✔️](cpp%2F2685-count-the-number-of-complete-components%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0332 - Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | 🔴 Hard | ❌ | [✔️](cpp%2F332-reconstruct-itinerary%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
### Divide and Conquer
Problem | Difficulty | C | C++ | C# | GO | Java | JS | Kotlin | Python | Ruby | Rust | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[3737 - Count Subarrays With Majority Element I](https://leetcode.com/problems/count-subarrays-with-majority-element-i) | 🟡 Medium | ❌ | [✔️](cpp%2F3737-count-subarrays-with-majority-element-i%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0004 - Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | 🔴 Hard | [✔️](c%2F4-median-of-two-sorted-arrays%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0023 - Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | 🔴 Hard | [✔️](c%2F23-merge-k-sorted-lists%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3739 - Count Subarrays With Majority Element II](https://leetcode.com/problems/count-subarrays-with-majority-element-ii) | 🔴 Hard | ❌ | [✔️](cpp%2F3739-count-subarrays-with-majority-element-ii%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
### Dynamic Programming
Problem | Difficulty | C | C++ | C# | GO | Java | JS | Kotlin | Python | Ruby | Rust | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[0022 - Generate Parentheses](https://leetcode.com/problems/generate-parentheses) | 🟡 Medium | [✔️](c%2F22-generate-parentheses%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3699 - Number of ZigZag Arrays I](https://leetcode.com/problems/number-of-zigzag-arrays-i) | 🔴 Hard | ❌ | [✔️](cpp%2F3699-number-of-zigzag-arrays-i%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[3700 - Number of ZigZag Arrays II](https://leetcode.com/problems/number-of-zigzag-arrays-ii) | 🔴 Hard | ❌ | [✔️](cpp%2F3700-number-of-zigzag-arrays-ii%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
### Enumeration
Problem | Difficulty | C | C++ | C# | GO | Java | JS | Kotlin | Python | Ruby | Rust | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[3020 - Find the Maximum Number of Elements in Subset](https://leetcode.com/problems/find-the-maximum-number-of-elements-in-subset) | 🟡 Medium | ❌ | [✔️](cpp%2F3020-find-the-maximum-number-of-elements-in-subset%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
### Eulerian Circuit
Problem | Difficulty | C | C++ | C# | GO | Java | JS | Kotlin | Python | Ruby | Rust | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[0332 - Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | 🔴 Hard | ❌ | [✔️](cpp%2F332-reconstruct-itinerary%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
### Game Theory
Problem | Difficulty | C | C++ | C# | GO | Java | JS | Kotlin | Python | Ruby | Rust | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[0843 - Guess the Word](https://leetcode.com/problems/guess-the-word) | 🔴 Hard | ❌ | [✔️](cpp%2F843-guess-the-word%2FANALYSIS.md) | [✔️](csharp%2F843-guess-the-word%2FANALYSIS.md) | [✔️](go%2F843-guess-the-word%2FANALYSIS.md) | ❌ | ❌ | [✔️](kotlin%2F843-guess-the-word%2FANALYSIS.md) | ❌ | [✔️](ruby%2F843-guess-the-word%2FANALYSIS.md) | ❌ | ❌
### Graph Theory
Problem | Difficulty | C | C++ | C# | GO | Java | JS | Kotlin | Python | Ruby | Rust | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[1971 - Find if Path Exists in Graph](https://leetcode.com/problems/find-if-path-exists-in-graph) | 🟢 Easy | ❌ | [✔️](cpp%2F1971-find-if-path-exists-in-graph%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0743 - Network Delay Time](https://leetcode.com/problems/network-delay-time) | 🟡 Medium | ❌ | [✔️](cpp%2F743-network-delay-time%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0797 - All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target) | 🟡 Medium | ❌ | [✔️](cpp%2F797-all-paths-from-source-to-target%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1129 - Shortest Path with Alternating Colors](https://leetcode.com/problems/shortest-path-with-alternating-colors) | 🟡 Medium | ❌ | [✔️](cpp%2F1129-shortest-path-with-alternating-colors%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1311 - Get Watched Videos by Your Friends](https://leetcode.com/problems/get-watched-videos-by-your-friends) | 🟡 Medium | ❌ | [✔️](cpp%2F1311-get-watched-videos-by-your-friends%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1557 - Minimum Number of Vertices to Reach All Nodes](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes) | 🟡 Medium | ❌ | [✔️](cpp%2F1557-minimum-number-of-vertices-to-reach-all-nodes%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2492 - Minimum Score of a Path Between Two Cities](https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities) | 🟡 Medium | ❌ | [✔️](cpp%2F2492-minimum-score-of-a-path-between-two-cities%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2685 - Count the Number of Complete Components](https://leetcode.com/problems/count-the-number-of-complete-components) | 🟡 Medium | ❌ | [✔️](cpp%2F2685-count-the-number-of-complete-components%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0332 - Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary) | 🔴 Hard | ❌ | [✔️](cpp%2F332-reconstruct-itinerary%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2065 - Maximum Path Quality of a Graph](https://leetcode.com/problems/maximum-path-quality-of-a-graph) | 🔴 Hard | ❌ | [✔️](cpp%2F2065-maximum-path-quality-of-a-graph%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2076 - Process Restricted Friend Requests](https://leetcode.com/problems/process-restricted-friend-requests) | 🔴 Hard | ❌ | [✔️](cpp%2F2076-process-restricted-friend-requests%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[2508 - Add Edges to Make Degrees of All Nodes Even](https://leetcode.com/problems/add-edges-to-make-degrees-of-all-nodes-even) | 🔴 Hard | ❌ | [✔️](cpp%2F2508-add-edges-to-make-degrees-of-all-nodes-even%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
### Greedy
Problem | Difficulty | C | C++ | C# | GO | Java | JS | Kotlin | Python | Ruby | Rust | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[2144 - Minimum Cost of Buying Candies With Discount](https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount) | 🟢 Easy | ❌ | [✔️](cpp%2F2144-minimum-cost-of-buying-candies-with-discount%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | [✔️](dcc%2Fpython%2F2144-minimum-cost-of-buying-candies-with-discount%2FREADME.md) | ❌ | ❌ | ❌
[0011 - Container With Most Water](https://leetcode.com/problems/container-with-most-water) | 🟡 Medium | [✔️](c%2F11-container-with-most-water%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1833 - Maximum Ice Cream Bars](https://leetcode.com/problems/maximum-ice-cream-bars) | 🟡 Medium | ❌ | [✔️](cpp%2F1833-maximum-ice-cream-bars%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1846 - Maximum Element After Decreasing and Rearranging](https://leetcode.com/problems/maximum-element-after-decreasing-and-rearranging) | 🟡 Medium | ❌ | [✔️](cpp%2F1846-maximum-element-after-decreasing-and-rearranging%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
### Hash Table
Problem | Difficulty | C | C++ | C# | GO | Java | JS | Kotlin | Python | Ruby | Rust | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[0001 - Two Sum](https://leetcode.com/problems/two-sum) | 🟢 Easy | ❌ | [✔️](cpp%2F1-two-sum%2FREADME.md) | ❌ | ❌ | ❌ | ❌ | ❌ | [✔️](python%2F1-two-sum%2FREADME.md) | ❌ | [✔️](rust%2F1-two-sum%2FREADME.md) | ❌
[0141 - Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | 🟢 Easy | ❌ | ❌ | ❌ | ❌ | [✔️](java%2F141-linked-list-cycle%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[1189 - Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons) | 🟢 Easy | ❌ | [✔️](cpp%2F1189-maximum-number-of-balloons%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0003 - Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | 🟡 Medium | [✔️](c%2F3-longest-substring-without-repeating-characters%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0012 - Integer to Roman](https://leetcode.com/problems/integer-to-roman) | 🟡 Medium | ❌ | [✔️](cpp%2F12-integer-to-roman%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0128 - Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence) | 🟡 Medium | ❌ | [✔️](cpp%2F128-longest-consecutive-sequence%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0138 - Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer) | 🟡 Medium | ❌ | ❌ | ❌ | ❌ | [✔️](java%2F138-copy-list-with-random-pointer%2FANALYSIS.md) | ❌ | ❌ | ❌ | ❌ | ❌ | ❌
[0424 - Longest Repeat