This repository contains my solutions to various LeetCode problems implemented in Rust. It serves as both a learning journey and a showcase of my problem-solving skills.
Each solution is organized in its own branch following the naming convention:
solution/[problem-number]-[brief-problem-title]
For example:
solution/1-two-sum
solution/53-maximum-subarray
solution/121-best-time-to-buy-and-sell-stock
I chose Rust for solving LeetCode problems because:
- It combines high-level ergonomics with low-level control
- Strong type system and memory safety guarantees
- Excellent performance characteristics
- Growing popularity in systems programming and modern development
To run any solution, make sure you have Rust installed and then:
cargo run
- Rust 2024 Edition
- Cargo (Rust's package manager)
While this is a personal learning repository, I welcome discussions about the solutions. Feel free to open an issue if you'd like to discuss any particular solution or suggest improvements.
This repository represents my journey in:
- Mastering data structures and algorithms
- Learning Rust programming language
- Preparing for technical interviews
- Problem-solving skills development
Feel free to explore the solutions and follow my learning journey! Each solution includes detailed comments explaining the approach and time/space complexity analysis.
This project is open source and available under the MIT License.