https://github.com/biomathcode/dsa-rust
https://github.com/biomathcode/dsa-rust
Last synced: 6 days ago
JSON representation
- Host: GitHub
- URL: https://github.com/biomathcode/dsa-rust
- Owner: biomathcode
- Created: 2023-12-02T10:16:47.000Z (over 1 year ago)
- Default Branch: master
- Last Pushed: 2024-02-26T10:34:27.000Z (over 1 year ago)
- Last Synced: 2025-06-22T19:07:31.038Z (6 days ago)
- Language: Rust
- Size: 56.6 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: readme.md
Awesome Lists containing this project
README
### Rust Problems Leetcode Solutions
Solutions are in `src/problems`;
```
cargo test
```
## LeetCode Problems:
- [array_strings_are_equal.rs](src/problems/array_strings_are_equal.rs)
- [can_place_flowers.rs](src/problems/can_place_flowers.rs)
- [climb_stairs.rs](src/problems/climb_stairs.rs)
- [fibonaci.rs](src/problems/fibonaci.rs)
- [find_difference.rs](src/problems/find_difference.rs)
- [find_pivot_index.rs](src/problems/find_pivot_index.rs)
- [greatest_common_divisor_of_strings.rs](src/problems/greatest_common_divisor_of_strings.rs)
- [group_anagrams.rs](src/problems/group_anagrams.rs)
- [highest_altitude.rs](src/problems/highest_altitude.rs)
- [increasing_triplet.rs](src/problems/increasing_triplet.rs)
- [kids_with_candies.rs](src/problems/kids_with_candies.rs)
- [largest_odd_number.rs](src/problems/largest_odd_number.rs)
- [largest_three_digit_same_number.rs](src/problems/largest_three_digit_same_number.rs)
- [length_of_last_word.rs](src/problems/length_of_last_word.rs)
- [longest_common_prefix.rs](src/problems/longest_common_prefix.rs)
- [longest_consecutive_sequence_128.rs](src/problems/longest_consecutive_sequence_128.rs)
- [max_area.rs](src/problems/max_area.rs)
- [max_profit.rs](src/problems/max_profit.rs)
- [merge_alternatively.rs](src/problems/merge_alternatively.rs)
- [min_stack.rs](src/problems/min_stack.rs)
- [mod.rs](src/problems/mod.rs)
- [move_zeroes.rs](src/problems/move_zeroes.rs)
- [product_of_array_except_self.rs](src/problems/product_of_array_except_self.rs)
- [queue_with_stack.rs](src/problems/queue_with_stack.rs)
- [roman_to_int.rs](src/problems/roman_to_int.rs)
- [rotate.rs](src/problems/rotate.rs)
- [single_number.rs](src/problems/single_number.rs)
- [sqrt.rs](src/problems/sqrt.rs)
- [string_compression.rs](src/problems/string_compression.rs)
- [sub_sequence.rs](src/problems/sub_sequence.rs)
- [total_money.rs](src/problems/total_money.rs)
- [trapping_rain_water.rs](src/problems/trapping_rain_water.rs)
- [two_sum.rs](src/problems/two_sum.rs)
- [two_sum_two.rs](src/problems/two_sum_two.rs)
- [unique_number_of_occurence.rs](src/problems/unique_number_of_occurence.rs)
- [valid_paranthesis.rs](src/problems/valid_paranthesis.rs)
- [valid_sudoku.rs](src/problems/valid_sudoku.rs)
### Notes
Competitive Programming patterns
// Checking for number of iterations of an element => Just use hashmap
// You should know iterators quite value
// Type conversions
// While solving problem create variables names related to problem itself.
// For Finding frequency use hashmap
// For Finding unique use hashset
// Learn Pattern - through loops ( while, for)
//
### Rust Books :
1. Rust Design patterns: [book](https://rust-unofficial.github.io/patterns/)
2. Pattern matching from the rust Book: [book](https://doc.rust-lang.org/book/ch18-01-all-the-places-for-patterns.html)
3. Pattern Syntax : [book](https://doc.rust-lang.org/book/ch18-03-pattern-syntax.html)