{"id":41641513,"url":"https://github.com/whisperpine/leetcode-rs","last_synced_at":"2026-01-24T15:11:04.104Z","repository":{"id":313069821,"uuid":"1048279590","full_name":"whisperpine/leetcode-rs","owner":"whisperpine","description":"LeetCode problem solutions in Rust.","archived":false,"fork":false,"pushed_at":"2025-12-27T22:52:59.000Z","size":82,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-12-30T00:49:26.075Z","etag":null,"topics":["algorithms","data-structures","dsa","leetcode","neetcode","rust"],"latest_commit_sha":null,"homepage":"","language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/whisperpine.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2025-09-01T07:50:39.000Z","updated_at":"2025-12-27T22:53:02.000Z","dependencies_parsed_at":"2025-09-03T19:36:46.232Z","dependency_job_id":"6d0ee0c6-ee60-4d20-be35-043075ce74b0","html_url":"https://github.com/whisperpine/leetcode-rs","commit_stats":null,"previous_names":["whisperpine/leetcode-rs"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/whisperpine/leetcode-rs","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/whisperpine%2Fleetcode-rs","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/whisperpine%2Fleetcode-rs/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/whisperpine%2Fleetcode-rs/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/whisperpine%2Fleetcode-rs/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/whisperpine","download_url":"https://codeload.github.com/whisperpine/leetcode-rs/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/whisperpine%2Fleetcode-rs/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28730315,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-24T10:24:43.181Z","status":"ssl_error","status_checked_at":"2026-01-24T10:24:36.112Z","response_time":89,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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","data-structures","dsa","leetcode","neetcode","rust"],"created_at":"2026-01-24T15:11:03.501Z","updated_at":"2026-01-24T15:11:04.097Z","avatar_url":"https://github.com/whisperpine.png","language":"Rust","readme":"\u003c!-- markdownlint-disable MD033 --\u003e\n# LeetCode Rust\n\nAn ongoing list of LeetCode problem solutions in Rust.\n\n## NeetCode Roadmap\n\nRefer to [NeetCode Roadmap](https://neetcode.io/roadmap).\n\n\u003cdetails\u003e\u003csummary\u003eRoadmap Mermaid Flowchart\u003c/summary\u003e\n\n```mermaid\nflowchart LR\n  array_hash(\"Array \u0026 Hash\")\n  two_pointers(\"Two Pointers\")\n  stack(\"Stack\")\n  binary_search(\"Binary Search\")\n  sliding_window(\"Sliding Window\")\n  linked_list(\"Linked List\")\n  trees(\"Trees\")\n  tries(\"Tries\")\n  backtracking(\"Backtracking\")\n  %% heap(\"Heap\")\n  heap(\"Heap / Priority Queue\")\n  graphs(\"Graphs\")\n  %% dp(\"DP\")\n  dp(\"Dynamic Programming\")\n  bit(\"Bit Manipulation\")\n  math(\"Math \u0026 Geometry\")\n  intervals(\"Intervals\")\n  greedy(\"Greedy\")\n  advanced_graphs(\"Advanced Graphs\")\n\n  array_hash --\u003e two_pointers\n  array_hash --\u003e stack\n\n  two_pointers --\u003e binary_search\n  two_pointers --\u003e sliding_window\n  two_pointers --\u003e linked_list\n\n  binary_search --\u003e trees\n  linked_list --\u003e trees\n\n  trees --\u003e tries\n  trees --\u003e backtracking\n  trees --\u003e heap\n\n  backtracking --\u003e dp\n  backtracking --\u003e graphs\n\n  dp --\u003e bit\n  dp --\u003e math\n  graphs --\u003e math\n\n  graphs --\u003e advanced_graphs\n  heap --\u003e advanced_graphs\n  heap --\u003e intervals\n  heap --\u003e greedy\n```\n\n\u003c/details\u003e\n\n## Get Started\n\nSolutions for LeetCode problems are written in files under [./tests](./tests/)\nrespectively. This means that rust compiler can check errors and run test cases\nfor a specific LeetCode problem.\nBut for comprehensive tests, you should copy the code to LeetCode live editor\nand submit. See [LeetCode problem set](https://leetcode.com/problemset/).\n\nThere are several ways to run tests:\n\n```sh\n# Run an integration test with \"cargo test\".\ncargo test --test TEST -- --no-capture\n# Run an integration test with \"cargo nextest\".\ncargo nextest run --test TEST --no-capture\n# The same as \"cargo nextest\" above, but more handy (recommended).\njust tf TEST\n\n# For example, run tests in \"./tests/15_3sum.rs\".\njust tf 15_3sum\n```\n\nIt's recommended to install [just](https://github.com/casey/just)\nand [nextest](https://github.com/nextest-rs/nextest),\nso that you can use `just tf TEST` command to test.\n\n## Table of Problems\n\n### Array \u0026 Hash\n\n| Problem | Difficulty | Solution |\n| - | - | - |\n| 1. Two Sum | Easy | [1_two_sum.rs](./tests/1_two_sum.rs) |\n| 217. Contains Duplicate | Easy | [217_contains_duplicate.rs](./tests/217_contains_duplicate.rs) |\n| 242. Valid Anagram | Easy | [242_valid_anagram.rs](./tests/242_valid_anagram.rs) |\n| 49. Group Anagrams | Medium | [49_group_anagrams.rs](./tests/49_group_anagrams.rs) |\n| 347. Top K Frequent Elements | Medium | [347_top_k_frequent_elements.rs](./tests/347_top_k_frequent_elements.rs) |\n\n### Two Pointers\n\n| Problem | Difficulty | Solution |\n| - | - | - |\n| 125. Valid Palindrome | Easy | [125_valid_palindrome.rs](./tests/125_valid_palindrome.rs) |\n| 15. 3Sum | Medium | [15_3sum.rs](./tests/15_3sum.rs) |\n\n### Stack\n\n| Problem | Difficulty | Solution |\n| - | - | - |\n| 20. Valid Parentheses | Easy | [20_valid_parentheses.rs](./tests/20_valid_parentheses.rs) |\n\n### Binary Search\n\n| Problem | Difficulty | Solution |\n| - | - | - |\n| 704. Binary Search | Easy | [704_binary_search.rs](./tests/704_binary_search.rs) |\n| 74. Search a 2D Matrix | Medium | [74_search_a_2d_matrix.rs](./tests/74_search_a_2d_matrix.rs) |\n\n### Sliding Window\n\n| Problem | Difficulty | Solution |\n| - | - | - |\n| 121. Best Time to Buy and Sell Stock | Easy | [121_best_time_to_buy_and_sell_stock.rs](./tests/121_best_time_to_buy_and_sell_stock.rs) |\n| 3. Longest Substring Without Repeating Characters | Medium | [3_longest_substring_without_repeating_characters.rs](./tests/3_longest_substring_without_repeating_characters.rs) |\n\n### Linked List\n\n| Problem | Difficulty | Solution |\n| - | - | - |\n| 206. Reverse Linked List | Easy | [206_reverse_linked_list.rs](./tests/206_reverse_linked_list.rs) |\n| 21. Merge Two Sorted Lists | Easy | [21_merge_two_sorted_lists.rs](./tests/21_merge_two_sorted_lists.rs) |\n\n### Trees\n\n| Problem | Difficulty | Solution |\n| - | - | - |\n| 226. Invert Binary Tree | Easy | [226_invert_binary_tree.rs](./tests/226_invert_binary_tree.rs) |\n| 104. Maximum Depth of Binary Tree | Easy | [104_maximum_depth_of_binary_tree.rs](./tests/104_maximum_depth_of_binary_tree.rs) |\n| 102. Binary Tree Level Order Traversal | Medium | [102_binary_tree_level_order_traversal.rs](./tests/102_binary_tree_level_order_traversal.rs) |\n\n### Backtracking\n\n| Problem | Difficulty | Solution |\n| - | - | - |\n| 78. Subsets | Medium | [78_subsets.rs](./tests/78_subsets.rs) |\n| 39. Combination Sum | Medium | [39_combination_sum.rs](./tests/39_combination_sum.rs) |\n\n### Graphs\n\n| Problem | Difficulty | Solution |\n| - | - | - |\n| 200. Number of Islands | Medium | [200_number_of_islands.rs](./tests/200_number_of_islands.rs) |\n| 695. Max Area of Island | Medium | [695_max_area_of_island.rs](./tests/695_max_area_of_island.rs) |\n\n### Heap / Priority Queue\n\n| Problem | Difficulty | Solution |\n| - | - | - |\n| 703. Kth Largest Element in a Stream | Easy | [703_kth_largest_element_in_a_stream.rs](./tests/703_kth_largest_element_in_a_stream.rs) |\n| 1046. Last Stone Weight | Easy | [1046_last_stone_weight.rs](./tests/1046_last_stone_weight.rs) |\n\n### Intervals\n\n| Problem | Difficulty | Solution |\n| - | - | - |\n| 56. Merge Intervals | Medium | [56_merge_intervals.rs](./tests/56_merge_intervals.rs) |\n\n### Greedy\n\n| Problem | Difficulty | Solution |\n| - | - | - |\n| 55. Jump Game | Medium | [55_jump_game.rs](./tests/55_jump_game.rs) |\n| 45. Jump Game II | Medium | [45_jump_game_ii.rs](./tests/45_jump_game_ii.rs) |\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwhisperpine%2Fleetcode-rs","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwhisperpine%2Fleetcode-rs","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwhisperpine%2Fleetcode-rs/lists"}