{"id":51259905,"url":"https://github.com/luiscarlosjayk/rust-fun-practice","last_synced_at":"2026-06-29T11:30:27.300Z","repository":{"id":362136173,"uuid":"1255287962","full_name":"luiscarlosjayk/rust-fun-practice","owner":"luiscarlosjayk","description":"Practicing LeetCode-style DSA problems in Rust, organized by difficulty and topic. Each problem is its own crate with validating tests.","archived":false,"fork":false,"pushed_at":"2026-06-15T02:21:24.000Z","size":89,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2026-06-15T04:13:00.278Z","etag":null,"topics":["algorithms","coding-interview","data-structures","dsa","leetcode","neetcode","practice","rust"],"latest_commit_sha":null,"homepage":null,"language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/luiscarlosjayk.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE-APACHE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2026-05-31T16:38:07.000Z","updated_at":"2026-06-02T19:51:13.000Z","dependencies_parsed_at":null,"dependency_job_id":null,"html_url":"https://github.com/luiscarlosjayk/rust-fun-practice","commit_stats":null,"previous_names":["luiscarlosjayk/rust-fun-practice"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/luiscarlosjayk/rust-fun-practice","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luiscarlosjayk%2Frust-fun-practice","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luiscarlosjayk%2Frust-fun-practice/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luiscarlosjayk%2Frust-fun-practice/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luiscarlosjayk%2Frust-fun-practice/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/luiscarlosjayk","download_url":"https://codeload.github.com/luiscarlosjayk/rust-fun-practice/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/luiscarlosjayk%2Frust-fun-practice/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34925718,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-29T02:00:05.398Z","response_time":58,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","coding-interview","data-structures","dsa","leetcode","neetcode","practice","rust"],"created_at":"2026-06-29T11:30:26.541Z","updated_at":"2026-06-29T11:30:27.295Z","avatar_url":"https://github.com/luiscarlosjayk.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Rust Fun Practice\n\nPracticing LeetCode-style problems in Rust, level by level and topic by topic, to\nget fluent with std types (`Vec`, `HashMap`, `HashSet`, `String`/`\u0026str`,\niterators) and build toward Data Structures \u0026 Algorithms.\n\n## Layout\n\nEach problem is an independent crate under `\u003clevel\u003e/\u003ctopic\u003e/\u003cNNNN-slug\u003e/`:\n- `README.md` — the problem statement (see `TEMPLATE.md` for the format).\n- `src/lib.rs` — your solution. Starts as a `todo!()` stub; this is what you fill in.\n- `tests/tests.rs` — provided test cases that validate your solution.\n\n## Workflow\n\n1. Pick a problem and read its `README.md`.\n2. Implement the public function in `src/lib.rs`.\n3. Run the tests until green:\n\n```sh\ncargo test -p \u003cslug\u003e        # one problem, e.g. cargo test -p two-sum\ncargo test                  # every problem in the workspace\n```\n\nA fresh stub fails with a `not yet implemented` panic — that is expected until\nyou solve it.\n\n## Adding problems\n\n```sh\n./new-problem.sh \u003clevel\u003e \u003ctopic\u003e \u003cNNNN-slug\u003e \u003cfn_name\u003e\n# e.g. ./new-problem.sh easy arrays-hashing 0026-remove-duplicates remove_duplicates\n```\n\nThen fill in the generated `README.md`, `src/lib.rs`, and `tests/tests.rs`.\n\n## Attribution\n\nThese problems are practice exercises sourced from third parties; this repo holds\nonly my own Rust solutions and tests.\n\n- **Problem origin:** Each problem's `README.md` links to its canonical source\n  (the `LeetCode:` line). Problem titles and numbers follow [LeetCode](https://leetcode.com).\n- **Selection / ordering:** Topic grouping and the choice of which problems to\n  practice are inspired by the [NeetCode 150](https://neetcode.io/practice)\n  roadmap and [Hello Interview](https://www.hellointerview.com/learn/code).\n- **Wording:** Problem statements are **restated in my own words**; original\n  prompts, full test suites, and editorials remain the property of their\n  respective owners and are not reproduced here. Follow the linked source for the\n  official statement.\n- **Solutions and the test cases in this repo are my own work**, dual-licensed\n  under either [MIT](LICENSE-MIT) or [Apache-2.0](LICENSE-APACHE) at your option.\n\n## Progress\n\n### Easy\n\n| Topic | Problem | LC # | Status |\n|---|---|---|---|\n| arrays-hashing | Two Sum | 1 | ☐ |\n| arrays-hashing | Contains Duplicate | 217 | ☐ |\n| arrays-hashing | Valid Anagram | 242 | ☐ |\n| arrays-hashing | Remove Duplicates from Sorted Array | 26 | ☐ |\n| strings | Longest Common Prefix | 14 | ☐ |\n| strings | Reverse String | 344 | ☐ |\n| two-pointers | Valid Palindrome | 125 | ☐ |\n| stack | Valid Parentheses | 20 | ☐ |\n| binary-search | Binary Search | 704 | ☐ |\n| binary-search | Search Insert Position | 35 | ☐ |\n| sliding-window | Best Time to Buy and Sell Stock | 121 | ☐ |\n| linked-list | Reverse Linked List | 206 | ☐ |\n| linked-list | Merge Two Sorted Lists | 21 | ☐ |\n| trees | Invert Binary Tree | 226 | ☐ |\n| trees | Maximum Depth of Binary Tree | 104 | ☐ |\n| dynamic-programming | Climbing Stairs | 70 | ☐ |\n| math | Plus One | 66 | ☐ |\n\n### Medium\n\n| Topic | Problem | LC # | Status |\n|---|---|---|---|\n| arrays-hashing | Group Anagrams | 49 | ☐ |\n| arrays-hashing | Top K Frequent Elements | 347 | ☐ |\n| two-pointers | 3Sum | 15 | ☐ |\n| sliding-window | Longest Substring Without Repeating Characters | 3 | ☐ |\n| binary-search | Search in Rotated Sorted Array | 33 | ☐ |\n\n### Hard\n\n| Topic | Problem | LC # | Status |\n|---|---|---|---|\n| two-pointers | Trapping Rain Water | 42 | ☐ |\n| sliding-window | Minimum Window Substring | 76 | ☐ |\n| binary-search | Median of Two Sorted Arrays | 4 | ☐ |\n| linked-list | Merge k Sorted Lists | 23 | ☐ |\n| dynamic-programming | Edit Distance | 72 | ☐ |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fluiscarlosjayk%2Frust-fun-practice","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fluiscarlosjayk%2Frust-fun-practice","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fluiscarlosjayk%2Frust-fun-practice/lists"}