A community-driven collection of LeetCode solutions in Rust. Each problem includes a clean, idiomatic solution with inline tests and a beginner-friendly tutorial covering the approach, dry run, code walkthrough, and complexity analysis.
| # | Problem | Difficulty | Tutorial | Solution |
|---|---|---|---|---|
| 0001 | Two Sum | Easy | Tutorial | Rust |
| 0002 | Add Two Numbers | Medium | Tutorial | Rust |
| 0003 | Longest Substring Without Repeating Characters | Medium | Tutorial | Rust |
Want to add a solution or improve an existing one? Check out the Contributing Guide.