Claude with LeetCode

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 with the help of Claude. The site will be updated daily with new solutions under 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
• Roadmap
• Share with the Community
• Contributing
• Thanks to our Contributors
• License
• 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.

🤝 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 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.

📄 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	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	✔️	❌	✔️	❌
0035 - Search Insert Position	🟢 Easy	❌	❌	❌	❌	❌	❌	❌	✔️	❌	❌	❌
0219 - Contains Duplicate II	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0463 - Island Perimeter	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0724 - Find Pivot Index	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1732 - Find the Highest Altitude	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1967 - Number of Strings That Appear as Substrings in Word	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2144 - Minimum Cost of Buying Candies With Discount	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	✔️	❌	❌	❌
2248 - Intersection of Multiple Arrays	🟢 Easy	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
2574 - Left and Right Sum Differences	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3512 - Minimum Operations to Make Array Sum Divisible by K	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3633 - Earliest Finish Time for Land and Water Rides I	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3838 - Weighted Word Mapping	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3898 - Find the Degree of Each Vertex	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3925 - Concatenate Array With Reverse	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0011 - Container With Most Water	🟡 Medium	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0015 - 3Sum	🟡 Medium	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0039 - Combination Sum	🟡 Medium	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0040 - Combination Sum II	🟡 Medium	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0047 - Permutations II	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0128 - Longest Consecutive Sequence	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0287 - Find the Duplicate Number	🟡 Medium	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
0658 - Find K Closest Elements	🟡 Medium	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
1311 - Get Watched Videos by Your Friends	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1493 - Longest Subarray of 1's After Deleting One Element	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1567 - Maximum Length of Subarray With Positive Product	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1765 - Map of Highest Peak	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1833 - Maximum Ice Cream Bars	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1846 - Maximum Element After Decreasing and Rearranging	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2161 - Partition Array According to Given Pivot	🟡 Medium	❌	✔️	❌	❌	✔️	❌	❌	❌	❌	❌	❌
2196 - Create Binary Tree From Descriptions	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2352 - Equal Row and Column Pairs	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3020 - Find the Maximum Number of Elements in Subset	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3635 - Earliest Finish Time for Land and Water Rides II	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3689 - Maximum Total Subarray Value I	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3737 - Count Subarrays With Majority Element I	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0004 - Median of Two Sorted Arrays	🔴 Hard	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0332 - Reconstruct Itinerary	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0815 - Bus Routes	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0843 - Guess the Word	🔴 Hard	❌	✔️	✔️	✔️	❌	❌	✔️	❌	✔️	❌	❌
0952 - Largest Component Size by Common Factor	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1840 - Maximum Building Height	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2065 - Maximum Path Quality of a Graph	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3559 - Number of Ways to Assign Edge Weights II	🔴 Hard	❌	❌	❌	❌	❌	❌	❌	✔️	❌	❌	❌
3691 - Maximum Total Subarray Value II	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3739 - Count Subarrays With Majority Element II	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Backtracking

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0022 - Generate Parentheses	🟡 Medium	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0039 - Combination Sum	🟡 Medium	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0040 - Combination Sum II	🟡 Medium	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0077 - Combinations	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0797 - All Paths From Source to Target	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2065 - Maximum Path Quality of a Graph	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Binary Search

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0035 - Search Insert Position	🟢 Easy	❌	❌	❌	❌	❌	❌	❌	✔️	❌	❌	❌
0287 - Find the Duplicate Number	🟡 Medium	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
0658 - Find K Closest Elements	🟡 Medium	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
0004 - Median of Two Sorted Arrays	🔴 Hard	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌

Binary Tree

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0094 - Binary Tree Inorder Traversal	🟢 Easy	❌	❌	❌	❌	❌	❌	❌	❌	❌	✔️	❌

Bit Manipulation

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0287 - Find the Duplicate Number	🟡 Medium	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌

Breadth-First Search

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0463 - Island Perimeter	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1971 - Find if Path Exists in Graph	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0743 - Network Delay Time	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0797 - All Paths From Source to Target	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1129 - Shortest Path with Alternating Colors	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1311 - Get Watched Videos by Your Friends	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1765 - Map of Highest Peak	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2492 - Minimum Score of a Path Between Two Cities	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2685 - Count the Number of Complete Components	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0815 - Bus Routes	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Contest

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
2723 - Add Two Promises	🟢 Easy	❌	❌	❌	❌	❌	✔️	❌	❌	❌	❌	✔️
3940 - Limit Occurrences in Sorted Array	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3950 - Exactly One Consecutive Set Bits Pair	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3954 - Sum of Compatible Numbers in Range I	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3959 - Check Good Integer	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2627 - Debounce	🟡 Medium	❌	❌	❌	❌	❌	✔️	❌	❌	❌	❌	✔️
3951 - Minimum Energy to Maintain Brightness	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3952 - Maximum Total Value of Covered Indices	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3955 - Valid Binary Strings With Cost Limit	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3960 - Frequency Balance Subarray	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3961 - Maximize Sum of Device Ratings	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3953 - Maximum Score with Co-Prime Element	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3956 - Maximum Sum of M Non-Overlapping Subarrays I	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3957 - Maximum Sum of M Non-Overlapping Subarrays II	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Counting

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
1189 - Maximum Number of Balloons	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3737 - Count Subarrays With Majority Element I	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Counting Sort

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
1833 - Maximum Ice Cream Bars	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Depth-First Search

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0094 - Binary Tree Inorder Traversal	🟢 Easy	❌	❌	❌	❌	❌	❌	❌	❌	❌	✔️	❌
0463 - Island Perimeter	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1971 - Find if Path Exists in Graph	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0743 - Network Delay Time	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0797 - All Paths From Source to Target	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2492 - Minimum Score of a Path Between Two Cities	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2685 - Count the Number of Complete Components	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0332 - Reconstruct Itinerary	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Divide and Conquer

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
3737 - Count Subarrays With Majority Element I	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0004 - Median of Two Sorted Arrays	🔴 Hard	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0023 - Merge k Sorted Lists	🔴 Hard	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
3739 - Count Subarrays With Majority Element II	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Dynamic Programming

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0022 - Generate Parentheses	🟡 Medium	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
3699 - Number of ZigZag Arrays I	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3700 - Number of ZigZag Arrays II	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Enumeration

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
3020 - Find the Maximum Number of Elements in Subset	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Eulerian Circuit

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0332 - Reconstruct Itinerary	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Game Theory

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0843 - Guess the Word	🔴 Hard	❌	✔️	✔️	✔️	❌	❌	✔️	❌	✔️	❌	❌

Graph Theory

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
1971 - Find if Path Exists in Graph	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0743 - Network Delay Time	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0797 - All Paths From Source to Target	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1129 - Shortest Path with Alternating Colors	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1311 - Get Watched Videos by Your Friends	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1557 - Minimum Number of Vertices to Reach All Nodes	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2492 - Minimum Score of a Path Between Two Cities	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2685 - Count the Number of Complete Components	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0332 - Reconstruct Itinerary	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2065 - Maximum Path Quality of a Graph	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2076 - Process Restricted Friend Requests	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2508 - Add Edges to Make Degrees of All Nodes Even	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Greedy

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
2144 - Minimum Cost of Buying Candies With Discount	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	✔️	❌	❌	❌
0011 - Container With Most Water	🟡 Medium	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
1833 - Maximum Ice Cream Bars	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1846 - Maximum Element After Decreasing and Rearranging	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Hash Table

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0001 - Two Sum	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	✔️	❌	✔️	❌
0141 - Linked List Cycle	🟢 Easy	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
1189 - Maximum Number of Balloons	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0003 - Longest Substring Without Repeating Characters	🟡 Medium	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0012 - Integer to Roman	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0128 - Longest Consecutive Sequence	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0138 - Copy List with Random Pointer	🟡 Medium	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
0424 - Longest Repeating Character Replacement	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1311 - Get Watched Videos by Your Friends	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1358 - Number of Substrings Containing All Three Characters	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1657 - Determine if Two Strings Are Close	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	✔️	❌	✔️	❌
3020 - Find the Maximum Number of Elements in Subset	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3737 - Count Subarrays With Majority Element I	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0815 - Bus Routes	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0952 - Largest Component Size by Common Factor	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2508 - Add Edges to Make Degrees of All Nodes Even	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3739 - Count Subarrays With Majority Element II	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Heap (Priority Queue)

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0658 - Find K Closest Elements	🟡 Medium	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
0743 - Network Delay Time	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0023 - Merge k Sorted Lists	🔴 Hard	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0332 - Reconstruct Itinerary	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Interactive

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0843 - Guess the Word	🔴 Hard	❌	✔️	✔️	✔️	❌	❌	✔️	❌	✔️	❌	❌

Linked List

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0021 - Merge Two Sorted Lists	🟢 Easy	✔️	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0141 - Linked List Cycle	🟢 Easy	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
0206 - Reverse Linked List	🟢 Easy	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
0002 - Add Two Numbers	🟡 Medium	✔️	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
0019 - Remove Nth Node From End of List	🟡 Medium	✔️	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
0138 - Copy List with Random Pointer	🟡 Medium	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
0143 - Reorder List	🟡 Medium	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
2095 - Delete the Middle Node of a Linked List	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2130 - Maximum Twin Sum of a Linked List	🟡 Medium	❌	✔️	❌	❌	✔️	❌	❌	❌	❌	❌	❌
0023 - Merge k Sorted Lists	🔴 Hard	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0025 - Reverse Nodes in k-Group	🔴 Hard	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌

Math

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0007 - Reverse Integer	🟡 Medium	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0012 - Integer to Roman	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1344 - Angle Between Hands of a Clock	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3558 - Number of Ways to Assign Edge Weights I	🟡 Medium	❌	❌	❌	❌	❌	❌	❌	✔️	❌	❌	❌
3751 - Total Waviness of Numbers in Range I	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0843 - Guess the Word	🔴 Hard	❌	✔️	✔️	✔️	❌	❌	✔️	❌	✔️	❌	❌
0952 - Largest Component Size by Common Factor	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1840 - Maximum Building Height	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3700 - Number of ZigZag Arrays II	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3753 - Total Waviness of Numbers in Range II	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Matrix

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0463 - Island Perimeter	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1765 - Map of Highest Peak	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Merge Sort

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
3737 - Count Subarrays With Majority Element I	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0023 - Merge k Sorted Lists	🔴 Hard	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
3739 - Count Subarrays With Majority Element II	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Number Theory

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0952 - Largest Component Size by Common Factor	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Prefix Sum

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
1732 - Find the Highest Altitude	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3737 - Count Subarrays With Majority Element I	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3699 - Number of ZigZag Arrays I	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3739 - Count Subarrays With Majority Element II	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Recursion

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0206 - Reverse Linked List	🟢 Easy	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
0143 - Reorder List	🟡 Medium	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
0025 - Reverse Nodes in k-Group	🔴 Hard	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌

Segment Tree

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
3737 - Count Subarrays With Majority Element I	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3739 - Count Subarrays With Majority Element II	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Shortest Path

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0743 - Network Delay Time	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Simulation

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
3612 - Process String with Special Operations I	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3614 - Process String with Special Operations II	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Sliding Window

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0003 - Longest Substring Without Repeating Characters	🟡 Medium	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0658 - Find K Closest Elements	🟡 Medium	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌

Sorting

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
2144 - Minimum Cost of Buying Candies With Discount	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	✔️	❌	❌	❌
0015 - 3Sum	🟡 Medium	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0658 - Find K Closest Elements	🟡 Medium	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
1311 - Get Watched Videos by Your Friends	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1833 - Maximum Ice Cream Bars	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1846 - Maximum Element After Decreasing and Rearranging	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0332 - Reconstruct Itinerary	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1840 - Maximum Building Height	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Stack

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0020 - Valid Parentheses	🟢 Easy	✔️	❌	❌	❌	❌	❌	❌	✔️	❌	❌	❌
0094 - Binary Tree Inorder Traversal	🟢 Easy	❌	❌	❌	❌	❌	❌	❌	❌	❌	✔️	❌
0143 - Reorder List	🟡 Medium	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
2130 - Maximum Twin Sum of a Linked List	🟡 Medium	❌	✔️	❌	❌	✔️	❌	❌	❌	❌	❌	❌

String

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0020 - Valid Parentheses	🟢 Easy	✔️	❌	❌	❌	❌	❌	❌	✔️	❌	❌	❌
1189 - Maximum Number of Balloons	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1967 - Number of Strings That Appear as Substrings in Word	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0003 - Longest Substring Without Repeating Characters	🟡 Medium	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0006 - Zigzag Conversion	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	✔️	❌
0012 - Integer to Roman	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0022 - Generate Parentheses	🟡 Medium	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0093 - Restore IP Addresses	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0394 - Decode String	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1415 - The k-th Lexicographical String of All Happy Strings of Length n	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1456 - Maximum Number of Vowels in a Substring of Given Length	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
1545 - Find Kth Bit in Nth Binary String	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2390 - Removing Stars From a String	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3612 - Process String with Special Operations I	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0214 - Shortest Palindrome	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0332 - Reconstruct Itinerary	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0843 - Guess the Word	🔴 Hard	❌	✔️	✔️	✔️	❌	❌	✔️	❌	✔️	❌	❌
1392 - Longest Happy Prefix	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2223 - Sum of Scores of Built Strings	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
3614 - Process String with Special Operations II	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌

Tree

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0094 - Binary Tree Inorder Traversal	🟢 Easy	❌	❌	❌	❌	❌	❌	❌	❌	❌	✔️	❌

Two Pointers

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
0141 - Linked List Cycle	🟢 Easy	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
0011 - Container With Most Water	🟡 Medium	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0015 - 3Sum	🟡 Medium	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌	❌
0019 - Remove Nth Node From End of List	🟡 Medium	✔️	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
0143 - Reorder List	🟡 Medium	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
0287 - Find the Duplicate Number	🟡 Medium	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
0658 - Find K Closest Elements	🟡 Medium	❌	❌	❌	❌	✔️	❌	❌	❌	❌	❌	❌
2095 - Delete the Middle Node of a Linked List	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2130 - Maximum Twin Sum of a Linked List	🟡 Medium	❌	✔️	❌	❌	✔️	❌	❌	❌	❌	❌	❌

Union-Find

Problem	Difficulty	C	C++	C#	GO	Java	JS	Kotlin	Python	Ruby	Rust	TS
1971 - Find if Path Exists in Graph	🟢 Easy	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0128 - Longest Consecutive Sequence	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2492 - Minimum Score of a Path Between Two Cities	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2685 - Count the Number of Complete Components	🟡 Medium	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
0952 - Largest Component Size by Common Factor	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌
2076 - Process Restricted Friend Requests	🔴 Hard	❌	✔️	❌	❌	❌	❌	❌	❌	❌	❌	❌