https://github.com/aliezzahn/rust-substring-finder
This Rust project provides an optimized implementation of the "Find Substring" problem using a **sliding window approach with HashMaps**.
https://github.com/aliezzahn/rust-substring-finder
Last synced: 3 months ago
JSON representation
This Rust project provides an optimized implementation of the "Find Substring" problem using a **sliding window approach with HashMaps**.
- Host: GitHub
- URL: https://github.com/aliezzahn/rust-substring-finder
- Owner: aliezzahn
- License: mit
- Created: 2025-02-24T13:03:19.000Z (3 months ago)
- Default Branch: main
- Last Pushed: 2025-02-24T13:08:04.000Z (3 months ago)
- Last Synced: 2025-02-24T14:24:31.102Z (3 months ago)
- Language: Rust
- Size: 3.91 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Rust Substring Finder
## Overview
This Rust project provides an optimized implementation of the "Find Substring" problem using a **sliding window approach with HashMaps**.
## Features
- 🚀 **Optimized**: Fast execution using efficient memory management.
- ✅ **Unit Tests**: Includes multiple test cases.
- 📜 **Well-documented**: Code is easy to read and understand.
## Usage
```rust
use substring_finder::Solution;
let s = "barfoothefoobarman".to_string();
let words = vec!["foo".to_string(), "bar".to_string()];
let result = Solution::find_substring(s, words);
assert_eq!(result, vec![0, 9]);
```
## Running Tests
```sh
cargo test
```
## Installation
Clone the repository and run:
```sh
cargo build
```
## License
MIT