Skip to content

sarvex/rust-leetcode

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
.github
.github
 
 
.sonarlint
.sonarlint
 
 
.trunk
.trunk
 
 
.vscode
.vscode
 
 
.cursorrules
.cursorrules
 
 
.gitignore
.gitignore
 
 
.windsurfrules
.windsurfrules
 
 
0001.Two Sum.rs
0001.Two Sum.rs
 
 
0002.Add Two Numbers.rs
0002.Add Two Numbers.rs
 
 
0003.Longest Substring Without Repeating Characters.rs
0003.Longest Substring Without Repeating Characters.rs
 
 
0004.Median of Two Sorted Arrays.rs
0004.Median of Two Sorted Arrays.rs
 
 
0005.Longest Palindromic Substring.rs
0005.Longest Palindromic Substring.rs
 
 
0006.Zigzag Conversion.rs
0006.Zigzag Conversion.rs
 
 
0007.Reverse Integer.rs
0007.Reverse Integer.rs
 
 
0009.Palindrome Number.rs
0009.Palindrome Number.rs
 
 
0010.Regular Expression Matching.rs
0010.Regular Expression Matching.rs
 
 
0011.Container With Most Water.rs
0011.Container With Most Water.rs
 
 
0012.Integer to Roman.rs
0012.Integer to Roman.rs
 
 
0013.Roman to Integer.rs
0013.Roman to Integer.rs
 
 
0014.Longest Common Prefix.rs
0014.Longest Common Prefix.rs
 
 
0015.3Sum.rs
0015.3Sum.rs
 
 
0017.Letter Combinations of a Phone Number.rs
0017.Letter Combinations of a Phone Number.rs
 
 
0019.Remove Nth Node From End of List.rs
0019.Remove Nth Node From End of List.rs
 
 
0020.Valid Parentheses.rs
0020.Valid Parentheses.rs
 
 
0021.Merge Two Sorted Lists.rs
0021.Merge Two Sorted Lists.rs
 
 
0022.Generate Parentheses.rs
0022.Generate Parentheses.rs
 
 
0023.Merge k Sorted Lists.rs
0023.Merge k Sorted Lists.rs
 
 
0024.Swap Nodes in Pairs.rs
0024.Swap Nodes in Pairs.rs
 
 
0025.Reverse Nodes in k-Group.rs
0025.Reverse Nodes in k-Group.rs
 
 
0026.Remove Duplicates from Sorted Array.rs
0026.Remove Duplicates from Sorted Array.rs
 
 
0027.Remove Element.rs
0027.Remove Element.rs
 
 
0028.Find the Index of the First Occurrence in a String.rs
0028.Find the Index of the First Occurrence in a String.rs
 
 
0032.Longest Valid Parentheses.rs
0032.Longest Valid Parentheses.rs
 
 
0033.Search in Rotated Sorted Array.rs
0033.Search in Rotated Sorted Array.rs
 
 
0034.Find First and Last Position of Element in Sorted Array.rs
0034.Find First and Last Position of Element in Sorted Array.rs
 
 
0035.Search Insert Position.rs
0035.Search Insert Position.rs
 
 
0038.Count and Say.rs
0038.Count and Say.rs
 
 
0039.Combination Sum.rs
0039.Combination Sum.rs
 
 
0040.Combination Sum II.rs
0040.Combination Sum II.rs
 
 
0041.First Missing Positive.rs
0041.First Missing Positive.rs
 
 
0042.Trapping Rain Water.rs
0042.Trapping Rain Water.rs
 
 
0043.Multiply Strings.rs
0043.Multiply Strings.rs
 
 
0045.Jump Game II.rs
0045.Jump Game II.rs
 
 
0046.Permutations.rs
0046.Permutations.rs
 
 
0047.Permutations II.rs
0047.Permutations II.rs
 
 
0048.Rotate Image.rs
0048.Rotate Image.rs
 
 
0049.Group Anagrams.rs
0049.Group Anagrams.rs
 
 
0050.Pow(x, n).rs
0050.Pow(x, n).rs
 
 
0053.Maximum Subarray.rs
0053.Maximum Subarray.rs
 
 
0054.Spiral Matrix.rs
0054.Spiral Matrix.rs
 
 
0055.Jump Game.rs
0055.Jump Game.rs
 
 
0056.Merge Intervals.rs
0056.Merge Intervals.rs
 
 
0057.Insert Interval.rs
0057.Insert Interval.rs
 
 
0058.Length of Last Word.rs
0058.Length of Last Word.rs
 
 
0059.Spiral Matrix II.rs
0059.Spiral Matrix II.rs
 
 
0060.Permutation Sequence.rs
0060.Permutation Sequence.rs
 
 
0061.Rotate List.rs
0061.Rotate List.rs
 
 
0062.Unique Paths.rs
0062.Unique Paths.rs
 
 
0063.Unique Paths II.rs
0063.Unique Paths II.rs
 
 
0064.Minimum Path Sum.rs
0064.Minimum Path Sum.rs
 
 
0065.Valid Number.rs
0065.Valid Number.rs
 
 
0066.Plus One.rs
0066.Plus One.rs
 
 
0067.Add Binary.rs
0067.Add Binary.rs
 
 
0069.Sqrt(x).rs
0069.Sqrt(x).rs
 
 
0070.Climbing Stairs.rs
0070.Climbing Stairs.rs
 
 
0071.Simplify Path.rs
0071.Simplify Path.rs
 
 
0073.Set Matrix Zeroes.rs
0073.Set Matrix Zeroes.rs
 
 
0074.Search a 2D Matrix.rs
0074.Search a 2D Matrix.rs
 
 
0075.Sort Colors.rs
0075.Sort Colors.rs
 
 
0076.Minimum Window Substring.rs
0076.Minimum Window Substring.rs
 
 
0077.Combinations.rs
0077.Combinations.rs
 
 
0078.Subsets.rs
0078.Subsets.rs
 
 
0079.Word Search.rs
0079.Word Search.rs
 
 
0080.Remove Duplicates from Sorted Array II.rs
0080.Remove Duplicates from Sorted Array II.rs
 
 
0081.Search in Rotated Sorted Array II.rs
0081.Search in Rotated Sorted Array II.rs
 
 
0082.Remove Duplicates from Sorted List II.rs
0082.Remove Duplicates from Sorted List II.rs
 
 
0083.Remove Duplicates from Sorted List.rs
0083.Remove Duplicates from Sorted List.rs
 
 
0084.Largest Rectangle in Histogram.rs
0084.Largest Rectangle in Histogram.rs
 
 
0085.Maximal Rectangle.rs
0085.Maximal Rectangle.rs
 
 
0086.Partition List.rs
0086.Partition List.rs
 
 
0088.Merge Sorted Array.rs
0088.Merge Sorted Array.rs
 
 
0090.Subsets II.rs
0090.Subsets II.rs
 
 
0092.Reverse Linked List II.rs
0092.Reverse Linked List II.rs
 
 
0094.Binary Tree Inorder Traversal.rs
0094.Binary Tree Inorder Traversal.rs
 
 
0095.Unique Binary Search Trees II.rs
0095.Unique Binary Search Trees II.rs
 
 
0096.Unique Binary Search Trees.rs
0096.Unique Binary Search Trees.rs
 
 
0097.Interleaving String.rs
0097.Interleaving String.rs
 
 
0098.Validate Binary Search Tree.rs
0098.Validate Binary Search Tree.rs
 
 
0100.Same Tree.rs
0100.Same Tree.rs
 
 
0101.Symmetric Tree.rs
0101.Symmetric Tree.rs
 
 
0102.Binary Tree Level Order Traversal.rs
0102.Binary Tree Level Order Traversal.rs
 
 
0103.Binary Tree Zigzag Level Order Traversal.rs
0103.Binary Tree Zigzag Level Order Traversal.rs
 
 
0104.Maximum Depth of Binary Tree.rs
0104.Maximum Depth of Binary Tree.rs
 
 
0105.Construct Binary Tree from Preorder and Inorder Traversal.rs
0105.Construct Binary Tree from Preorder and Inorder Traversal.rs
 
 
0106.Construct Binary Tree from Inorder and Postorder Traversal.rs
0106.Construct Binary Tree from Inorder and Postorder Traversal.rs
 
 
0107.Binary Tree Level Order Traversal II.rs
0107.Binary Tree Level Order Traversal II.rs
 
 
0108.Convert Sorted Array to Binary Search Tree.rs
0108.Convert Sorted Array to Binary Search Tree.rs
 
 
0109.Convert Sorted List to Binary Search Tree.rs
0109.Convert Sorted List to Binary Search Tree.rs
 
 
0110.Balanced Binary Tree.rs
0110.Balanced Binary Tree.rs
 
 
0111.Minimum Depth of Binary Tree.rs
0111.Minimum Depth of Binary Tree.rs
 
 

Repository files navigation

Rust LeetCode Solutions

A comprehensive collection of LeetCode problem solutions implemented in Rust.

Overview

This repository contains Rust solutions for over 500 LeetCode problems. Each solution is implemented with a focus on:

  • Clean, idiomatic Rust code
  • Detailed documentation and comments
  • Optimal time and space complexity
  • Test cases where applicable

Repository Structure

Solutions are organized by problem number and title:

  • 0001.Two Sum.rs
  • 0002.Add Two Numbers.rs
  • etc.

Each file contains:

  • The solution implementation
  • Documentation comments explaining the approach
  • Time and space complexity analysis (in most solutions)
  • Test cases for validation

Usage

These solutions can be used as:

  • Reference for learning Rust programming patterns
  • Study material for algorithm and data structure concepts
  • Preparation for coding interviews
  • Examples of idiomatic Rust code

Getting Started

To run any solution locally:

  1. Make sure you have Rust installed (https://www.rust-lang.org/tools/install)
  2. Create a new Rust project: cargo new leetcode_solution
  3. Replace the content of src/main.rs with the solution code
  4. Add any necessary dependencies to Cargo.toml
  5. Run with cargo run

Contributing

Contributions are welcome! If you'd like to add a new solution or improve an existing one:

  1. Fork the repository
  2. Create your feature branch
  3. Commit your changes
  4. Push to the branch
  5. Open a Pull Request

License

This project is licensed under the MIT License - see the LICENSE file for details.

Acknowledgments

  • Thanks to LeetCode for providing the problems
  • The Rust community for creating such an amazing language

About

No description, website, or topics provided.

Resources

Readme

License

MIT license

Code of conduct

Code of conduct

Security policy

Security policy
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages