This repository contains my solutions to various LeetCode problems, primarily implemented in TypeScript and Rust. The legacy Go solutions are kept for historical reference but are no longer actively maintained.

MD Version: CN | EN

leetcode-ws/
├── golang/     # Legacy solutions implemented in Go (deprecated; kept for historical reference)
├── rust/       # Solutions implemented in Rust
├── typescript/ # Solutions implemented in TypeScript
└── weekly/     # Weekly contest or series-based problem solutions

• Primary Languages: TypeScript, Rust
• Deprecated: Go (kept for reference only, not actively updated)

Each solution file is named using the following format: [problem-number].[problem-name].[language-extension]

For example:

• 88.merge-sorted-array.go
• 3405.count-the-number-of-arrays-with-k-matching-adjacent-elements.ts
• 2110.number-of-smooth-descent-periods-of-a-stock.rs

This is a personal learning repository for tracking my LeetCode problem-solving journey. However, if you find any issues or have suggestions for improvements, feel free to open an issue or submit a pull request.

This project is open source and available under the MIT License.