{"id":34238815,"url":"https://github.com/saltchang/leetcode","last_synced_at":"2026-05-04T17:32:03.966Z","repository":{"id":43822278,"uuid":"431611872","full_name":"saltchang/leetcode","owner":"saltchang","description":"Just LeetCode.","archived":false,"fork":false,"pushed_at":"2022-07-26T13:13:23.000Z","size":1801,"stargazers_count":2,"open_issues_count":1,"forks_count":1,"subscribers_count":2,"default_branch":"main","last_synced_at":"2024-06-21T18:47:58.620Z","etag":null,"topics":["algorithm","cpp","go","leetcode","leetcode-solutions","typescript"],"latest_commit_sha":null,"homepage":"","language":"TypeScript","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/saltchang.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}},"created_at":"2021-11-24T19:56:01.000Z","updated_at":"2023-03-07T15:14:36.000Z","dependencies_parsed_at":"2022-07-20T19:19:09.472Z","dependency_job_id":null,"html_url":"https://github.com/saltchang/leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/saltchang/leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/saltchang%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/saltchang%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/saltchang%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/saltchang%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/saltchang","download_url":"https://codeload.github.com/saltchang/leetcode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/saltchang%2Fleetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32617680,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-04T10:08:07.713Z","status":"ssl_error","status_checked_at":"2026-05-04T10:08:02.005Z","response_time":58,"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":["algorithm","cpp","go","leetcode","leetcode-solutions","typescript"],"created_at":"2025-12-16T03:12:55.999Z","updated_at":"2026-05-04T17:32:03.959Z","avatar_url":"https://github.com/saltchang.png","language":"TypeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# [LeetCode](https://leetcode.com/problemset/all)\n\n![TypeScript](https://img.shields.io/badge/language-TypeScript-3178c6)\u0026nbsp;\n![Go](https://img.shields.io/badge/language-Go-007d9c)\u0026nbsp;\n![C++](https://img.shields.io/badge/language-C++-004283)\u0026nbsp;\n![Progress](https://img.shields.io/badge/progess-16%20%2F%202082-sucess)\u0026nbsp;\n[![License](https://img.shields.io/badge/license-MIT-a31f34)](./LICENSE)\n\n## Problems\n\n**[:star: Starred Problems](https://leetcode.com/list/xoqag3yj) are highly recommended.**\n\n|   #    | Title                                                     | Solutions                      | Difficulty |        Note         | Starred |\n|:------:|-----------------------------------------------------------|--------------------------------|:----------:|:-------------------:|:-------:|\n| [0001] | Two Sum                                                   | [TS][0001_ts], [Go][0001_go]   |   [Easy]   | [:memo:][0001_note] | :star:  |\n| [0003] | Longest Substring Without Repeating Characters            | [TS][0003_ts]                  |  [Medium]  | [:memo:][0003_note] | :star:  |\n| [0014] | Longest Common Prefix                                     | [C++][0014_cpp]                |   [Easy]   | [:memo:][0014_note] |         |\n| [0019] | Remove Nth Node From End of List                          | [C++][0019_cpp]                |  [Medium]  | [:memo:][0019_note] | :star:  |\n| [0038] | Count and Say                                             | [C++][0038_cpp]                |  [Medium]  | [:memo:][0038_note] |         |\n| [0041] | First Missing Positive                                    | [TS][0041_ts]                  |   [Hard]   | [:memo:][0041_note] |         |\n| [0070] | Climbing Stairs                                           | [Go][0070_go]                  |   [Easy]   | [:memo:][0070_note] | :star:  |\n| [0098] | Validate Binary Search Tree                               | [TS][0098_ts], [C++][0098_cpp] |  [Medium]  | [:memo:][0098_note] | :star:  |\n| [0102] | Binary Tree Level Order Traversal                         | [C++][0102_cpp]                |  [Medium]  | [:memo:][0102_note] | :star:  |\n| [0104] | Maximum Depth of Binary Tree                              | [TS][0104_ts], [C++][0104_cpp] |   [Easy]   | [:memo:][0104_note] | :star:  |\n| [0105] | Construct Binary Tree from Preorder and Inorder Traversal | [TS][0105_ts]                  |  [Medium]  | [:memo:][0105_note] | :star:  |\n| [0118] | Pascal's Triangle                                         | [C++][0118_cpp]                |   [Easy]   | [:memo:][0118_note] |         |\n| [0125] | Valid Palindrome                                          | [C++][0125_cpp]                |   [Easy]   | [:memo:][0125_note] | :star:  |\n| [0147] | Insertion Sort List                                       | [C++][0147_cpp]                |  [Medium]  | [:memo:][0147_note] |         |\n| [0206] | Reverse Linked List                                       | [Go][0206_go]                  |   [Easy]   | [:memo:][0206_note] | :star:  |\n| [0387] | First Unique Character in a String                        | [C++][0387_cpp]                |   [Easy]   | [:memo:][0387_note] |         |\n\n[**:point_up: Back to Problems**](#problems)\n\n## Run Test\n\n### TypeScript\n\nFirst, install the packages:\n\n```bash\nyarn\n```\n\nTest all problems:\n\n```bash\nyarn test --verbose false\n```\n\nTest a single problem:\n\n```bash\nyarn test --verbose false problems/0001\n```\n\nSee [Jest CLI Options](https://jestjs.io/docs/cli#--verbose) for more information.\n\n### Go\n\nTest all problems:\n\n```bash\ngo test ./problems/**/go -v\n```\n\nTest a single problem:\n\n```bash\ngo test ./problems/0001/go -v\n```\n\n## Contributors\n\n\u003ca href=\"https://github.com/ccHSU13\"\u003e\n    \u003cimg\n      src=\"https://avatars.githubusercontent.com/u/86006022\"\n      alt=\"ccHSU13\"\n      width=\"75px\"\n      style=\"border-radius:50%;\"\n    \u003e\n\u003c/a\u003e\n\u003ca href=\"https://github.com/saltchang\"\u003e\n    \u003cimg\n      src=\"https://avatars.githubusercontent.com/u/44324205\"\n      alt=\"saltchang\"\n      width=\"75px\"\n      style=\"border-radius:50%;\"\n    \u003e\n\u003c/a\u003e\n\n\u003c!-- Cheat Sheet --\u003e\n\n[github emoji cheat sheet]: https://github.com/ikatyang/emoji-cheat-sheet/blob/master/README.md\n\n\u003c!-- 0001 --\u003e\n\n[0001]: https://leetcode.com/problems/two-sum\n[0001_note]: ./problems/0001/README.md#:memo:-note\n[0001_ts]: ./problems/0001/ts/two_sum.ts\n[0001_go]: ./problems/0001/go/two_sum.go\n\n\u003c!-- 0003 --\u003e\n\n[0003]: https://leetcode.com/problems/longest-substring-without-repeating-characters\n[0003_note]: ./problems/0003/README.md#:memo:-note\n[0003_ts]: ./problems/0003/ts/longest_substring_without_repeating_characters.ts\n\n\u003c!-- 0014 --\u003e\n\n[0014]: https://leetcode.com/problems/longest-common-prefix\n[0014_note]: ./problems/0014/README.md#:memo:-note\n[0014_cpp]: ./problems/0014/cpp/longest_common_prefix.cpp\n\n\u003c!-- 0019 --\u003e\n\n[0019]: https://leetcode.com/problems/remove-nth-node-from-end-of-list\n[0019_note]: ./problems/0019/README.md#:memo:-note\n[0019_cpp]: ./problems/0019/cpp/remove_nth_node_from_end_of_list.cpp\n\n\u003c!-- 0038 --\u003e\n\n[0038]: https://leetcode.com/problems/count-and-say\n[0038_note]: ./problems/0038/README.md#:memo:-note\n[0038_cpp]: ./problems/0038/cpp/count_and_say.cpp\n\n\u003c!-- 0041 --\u003e\n\n[0041]: https://leetcode.com/problems/first-missing-positive\n[0041_note]: ./problems/0041/README.md#:memo:-note\n[0041_ts]: ./problems/0041/ts/first_missing_positive.ts\n\n\u003c!-- 0070 --\u003e\n\n[0070]: https://leetcode.com/problems/climbing-stairs\n[0070_note]: ./problems/0070/README.md#:memo:-note\n[0070_go]: ./problems/0070/go/climbing_stairs.go\n\n\u003c!-- 0098 --\u003e\n\n[0098]: https://leetcode.com/problems/validate-binary-search-tree\n[0098_note]: ./problems/0098/README.md#:memo:-note\n[0098_ts]: ./problems/0098/ts/validate_binary_search_tree.ts\n[0098_cpp]: ./problems/0098/cpp/validate_binary_search_tree.cpp\n\n\u003c!-- 0102 --\u003e\n\n[0102]: https://leetcode.com/problems/binary-tree-level-order-traversal\n[0102_note]: ./problems/0102/README.md#:memo:-note\n[0102_cpp]: ./problems/0102/cpp/binary_tree_level_order_traversal.cpp\n\n\u003c!-- 0104 --\u003e\n\n[0104]: https://leetcode.com/problems/maximum-depth-of-binary-tree\n[0104_note]: ./problems/0104/README.md#:memo:-note\n[0104_ts]: ./problems/0104/ts/maximum_depth_of_binary_tree.ts\n[0104_cpp]: ./problems/0104/cpp/maximum_depth_of_binary_tree.cpp\n\n\u003c!-- 0105 --\u003e\n\n[0105]: https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal\n[0105_note]: ./problems/0105/README.md#:memo:-note\n[0105_ts]: ./problems/0105/ts/construct_binary_tree_from_preorder_and_inorder_traversal.ts\n\n\u003c!-- 0118 --\u003e\n[0118]: https://leetcode.com/problems/pascals-triangle\n[0118_Note]: ./problems/0118/README.md#:memo:-note\n[0118_cpp]: ./problems/0118/cpp/pascals_triangle.cpp\n\n\u003c!-- 0125 --\u003e\n\n[0125]: https://leetcode.com/problems/valid-palindrome\n[0125_note]: ./problems/0125/README.md#:memo:-note\n[0125_cpp]: ./problems/0125/cpp/valid_palindrome.cpp\n\n\u003c!-- 0147 --\u003e\n[0147]: https://leetcode.com/problems/insertion-sort-list\n[0147_Note]: ./problems/0147/README.md#:memo:-note\n[0147_cpp]: ./problems/0147/cpp/insertion_sort_list.cpp\n\n\u003c!-- 0206 --\u003e\n\n[0206]: https://leetcode.com/problems/reverse-linked-list\n[0206_note]: ./problems/0206/README.md#:memo:-note\n[0206_go]: ./problems/0206/go/reverse_linked_list.go\n\n\u003c!-- 0387 --\u003e\n\n[0387]: https://leetcode.com/problems/first-unique-character-in-a-string\n[0387_note]: ./problems/0387/README.md#:memo:-note\n[0387_cpp]: ./problems/0387/cpp/first_unique_character_in_a_string.cpp\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsaltchang%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsaltchang%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsaltchang%2Fleetcode/lists"}