LeetCode Solutions in Rust

A library crate containing Rust solutions to LeetCode problems, organized by difficulty level. This repository serves as a reference implementation of various algorithms and data structures.

Structure

src/
├── easy/
│   ├── two_sum.rs         # Problem 1: Two Sum
│   ├── palindrome_number.rs
│   └── ...
├── medium/
│   ├── add_two_numbers.rs # Problem 2: Add Two Numbers
│   ├── longest_substring.rs
│   └── ...
└── hard/
    ├── median_arrays.rs   # Problem 4: Median of Two Sorted Arrays
    └── ...

Usage

This is not a runnable crate but rather a collection of solution implementations.

Problem Index

Easy

• 1. Two Sum
• 9. Palindrome number
• 13. Roman to integer
• 14. Longest common prefix

Medium

• 2. Add Two Numbers
• 3. Longest Substring Without Repeating Characters
• 5. Longest Palindromic Substring
• 6. Zigzag Conversion
• 7. Reverse integer
• 8. String to integer (ATOI)
• 11. Container with the most water
• 12. Integer to roman
• 15. 3Sum
• 16. 3Sum Closest
• 17. Phone Number Letters

Hard

• 4. Median of Two Sorted Arrays
• 10. Regular expression matching

Contribution

Contributions welcome! Please:

1. Follow existing code style
2. Include problem description in doc comment
3. Add test cases
4. Organize by difficulty level