{"id":51063631,"url":"https://github.com/skharchikov/leetcode-rust","last_synced_at":"2026-06-23T04:30:47.182Z","repository":{"id":355945471,"uuid":"1191650184","full_name":"skharchikov/leetcode-rust","owner":"skharchikov","description":"LeetCode solutions in Rust","archived":false,"fork":false,"pushed_at":"2026-05-06T00:03:51.000Z","size":23,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2026-05-06T01:29:20.589Z","etag":null,"topics":["algorithms","blind75","data-structures","leetcode","rust"],"latest_commit_sha":null,"homepage":"","language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/skharchikov.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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-03-25T13:03:57.000Z","updated_at":"2026-05-06T00:03:54.000Z","dependencies_parsed_at":null,"dependency_job_id":null,"html_url":"https://github.com/skharchikov/leetcode-rust","commit_stats":null,"previous_names":["skharchikov/leetcode-rust"],"tags_count":null,"template":false,"template_full_name":null,"purl":"pkg:github/skharchikov/leetcode-rust","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/skharchikov%2Fleetcode-rust","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/skharchikov%2Fleetcode-rust/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/skharchikov%2Fleetcode-rust/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/skharchikov%2Fleetcode-rust/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/skharchikov","download_url":"https://codeload.github.com/skharchikov/leetcode-rust/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/skharchikov%2Fleetcode-rust/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34675970,"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-23T02:00:07.161Z","response_time":65,"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","blind75","data-structures","leetcode","rust"],"created_at":"2026-06-23T04:30:46.301Z","updated_at":"2026-06-23T04:30:47.173Z","avatar_url":"https://github.com/skharchikov.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode Solutions in Rust\n\nMy solutions to LeetCode problems, written in Rust.\n\n## Structure\n\nSolutions are organized by topic. Each topic is a module under `src/`, and each problem is a separate file within its topic.\n\n```\nsrc/\n├── lib.rs\n├── array/\n│   ├── mod.rs\n│   ├── two_sum.rs\n│   └── ...\n├── linked_list/\n│   ├── mod.rs\n│   └── add_two_numbers.rs\n├── string/\n├── tree/\n├── graph/\n├── dynamic_programming/\n├── binary/\n│   ├── mod.rs\n│   └── binary_search.rs\n└── ...\n```\n\n## Progress: Blind 75\n\n`▓░░░░░░░░░░░░░░░░░░░ 4/75 (5%)`\n\n### Array\n\n- [x] [Two Sum](https://leetcode.com/problems/two-sum)\n- [ ] Best Time to Buy and Sell Stock\n- [x] [Contains Duplicate](https://leetcode.com/problems/contains-duplicate)\n- [ ] Product of Array Except Self\n- [ ] Maximum Subarray\n- [ ] Maximum Product Subarray\n- [x] [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array)\n- [ ] Search in Rotated Sorted Array\n- [ ] 3Sum\n- [ ] Container With Most Water\n\n### Binary\n\n- [ ] Sum of Two Integers\n- [ ] Number of 1 Bits\n- [ ] Counting Bits\n- [ ] Missing Number\n- [ ] Reverse Bits\n\n### Dynamic Programming\n\n- [ ] Climbing Stairs\n- [ ] Coin Change\n- [ ] Longest Increasing Subsequence\n- [ ] Longest Common Subsequence\n- [ ] Word Break\n- [ ] Combination Sum IV\n- [ ] House Robber\n- [ ] House Robber II\n- [ ] Decode Ways\n- [ ] Unique Paths\n- [ ] Jump Game\n\n### Graph\n\n- [ ] Clone Graph\n- [ ] Course Schedule\n- [ ] Pacific Atlantic Water Flow\n- [ ] Number of Islands\n- [ ] Longest Consecutive Sequence\n- [ ] Alien Dictionary\n- [ ] Graph Valid Tree\n- [ ] Number of Connected Components in an Undirected Graph\n\n### Interval\n\n- [ ] Insert Interval\n- [ ] Merge Intervals\n- [ ] Non-overlapping Intervals\n- [ ] Meeting Rooms\n- [ ] Meeting Rooms II\n\n### Linked List\n\n- [ ] Reverse a Linked List\n- [ ] Detect Cycle in a Linked List\n- [ ] Merge Two Sorted Lists\n- [ ] Merge K Sorted Lists\n- [ ] Remove Nth Node From End of List\n- [ ] Reorder List\n\n### Matrix\n\n- [ ] Set Matrix Zeroes\n- [ ] Spiral Matrix\n- [ ] Rotate Image\n- [ ] Word Search\n\n### String\n\n- [ ] Longest Substring Without Repeating Characters\n- [ ] Longest Repeating Character Replacement\n- [ ] Minimum Window Substring\n- [x] [Valid Anagram](https://leetcode.com/problems/valid-anagram)\n- [ ] Group Anagrams\n- [ ] Valid Parentheses\n- [ ] Valid Palindrome\n- [ ] Longest Palindromic Substring\n- [ ] Palindromic Substrings\n- [ ] Encode and Decode Strings\n\n### Tree\n\n- [ ] Maximum Depth of Binary Tree\n- [ ] Same Tree\n- [ ] Invert Binary Tree\n- [ ] Binary Tree Maximum Path Sum\n- [ ] Binary Tree Level Order Traversal\n- [ ] Serialize and Deserialize Binary Tree\n- [ ] Subtree of Another Tree\n- [ ] Construct Binary Tree from Preorder and Inorder Traversal\n- [ ] Validate Binary Search Tree\n- [ ] Kth Smallest Element in a BST\n- [ ] Lowest Common Ancestor of a BST\n- [ ] Implement Trie (Prefix Tree)\n- [ ] Add and Search Word\n- [ ] Word Search II\n\n### Heap\n\n- [ ] Merge K Sorted Lists\n- [ ] Top K Frequent Elements\n- [ ] Find Median from Data Stream\n\n## Extras (not Blind 75)\n\nSolutions outside the Blind 75 list — classic algorithms, warm-ups, or topic detours.\n\n### Binary Search\n\n- [x] Binary Search (recursive) — `src/binary/binary_search.rs`\n- [x] Binary Search (iterative) — `src/binary/binary_search.rs`\n- [x] Find the First True in a Sorted Boolean Array — `src/binary/first_true_in_sorted_boolean_array.rs`\n- [x] First Element Not Smaller Than Target — `src/binary/first_element_not_smaller_than_target.rs`\n- [x] Find Element in Sorted Array with Duplicates — `src/binary/find_element_in_sorted_array_with_duplicates.rs`\n- [x] Square Root Estimation — `src/binary/square_root_estimation.rs`\n- [x] [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array) — `src/binary/peak_index_in_mountain_array.rs`\n\n## Usage\n\nRun all tests:\n\n```sh\ncargo test\n```\n\nRun tests for a specific topic:\n\n```sh\ncargo test array\n```\n\nRun tests for a specific problem:\n\n```sh\ncargo test two_sum\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fskharchikov%2Fleetcode-rust","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fskharchikov%2Fleetcode-rust","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fskharchikov%2Fleetcode-rust/lists"}