{"id":15732425,"url":"https://github.com/tjx666/leetcode-javascript-2023","last_synced_at":"2025-03-31T03:41:52.103Z","repository":{"id":175499534,"uuid":"652569369","full_name":"tjx666/leetcode-javascript-2023","owner":"tjx666","description":"每逢面试必刷题","archived":false,"fork":false,"pushed_at":"2024-01-07T05:27:10.000Z","size":268,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-29T22:34:45.856Z","etag":null,"topics":["algorithm","font-end","interview","javascript","leetcode"],"latest_commit_sha":null,"homepage":"https://leetcode.cn/u/yutengjing/","language":"JavaScript","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/tjx666.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}},"created_at":"2023-06-12T10:42:34.000Z","updated_at":"2025-02-07T08:10:04.000Z","dependencies_parsed_at":null,"dependency_job_id":"a1a0aeb4-02d0-49b6-9420-8ce0e54aed81","html_url":"https://github.com/tjx666/leetcode-javascript-2023","commit_stats":null,"previous_names":["tjx666/leetcode-javascript-2023"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tjx666%2Fleetcode-javascript-2023","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tjx666%2Fleetcode-javascript-2023/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tjx666%2Fleetcode-javascript-2023/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tjx666%2Fleetcode-javascript-2023/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tjx666","download_url":"https://codeload.github.com/tjx666/leetcode-javascript-2023/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246413230,"owners_count":20773053,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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","font-end","interview","javascript","leetcode"],"created_at":"2024-10-04T00:20:18.395Z","updated_at":"2025-03-31T03:41:52.084Z","avatar_url":"https://github.com/tjx666.png","language":"JavaScript","readme":"# LeetCode JavaScript 2023\n\n\u003cdiv align=\"center\"\u003e\n\n[![test](https://github.com/tjx666/leetcode-javascript-2023/actions/workflows/test.yml/badge.svg)](https://github.com/tjx666/leetcode-javascript-2023/actions/workflows/test.yml) [![codecov](https://codecov.io/gh/tjx666/leetcode-javascript-2023/branch/main/graph/badge.svg?token=FQDHJODKYD)](https://codecov.io/gh/tjx666/leetcode-javascript-2023)\n\n\u003cimg src=\"https://img.shields.io/badge/progress-27/200-green\" /\u003e\n\u003cimg src=\"https://img.shields.io/badge/easy-23-green\" /\u003e\n\u003cimg src=\"https://img.shields.io/badge/medium-4-yellow\" /\u003e\n\n\u003c/div\u003e\n\n## 刷题顺序\n\n1. [0002. 两数相加](https://leetcode.cn/problems/add-two-numbers/)\n2. [0206. 反转链表](https://leetcode.cn/problems/reverse-linked-list/)\n3. [0445. 两数相加 II](https://leetcode.cn/problems/add-two-numbers-ii/)\n4. [0160. 相交链表](https://leetcode.cn/problems/intersection-of-two-linked-lists/)\n5. [0141. 环形链表](https://leetcode.cn/problems/linked-list-cycle/)\n6. [0142. 环形链表 II](https://leetcode.cn/problems/linked-list-cycle-ii/)\n7. [0021. 合并两个有序链表](https://leetcode.cn/problems/merge-two-sorted-lists/description/)\n8. [0203. 移除链表元素](https://leetcode.cn/problems/remove-linked-list-elements/)\n9. [0083. 删除排序链表中的重复元素](https://leetcode.cn/problems/remove-duplicates-from-sorted-list/description)\n10. [0876. 链表的中间结点](https://leetcode.cn/problems/middle-of-the-linked-list/description/)\n11. [0234. 回文链表](https://leetcode.cn/problems/palindrome-linked-list/)\n12. [1290. 二进制链表转整数](https://leetcode.cn/problems/convert-binary-number-in-a-linked-list-to-integer/description/)\n13. [0144. 二叉树的前序遍历](https://leetcode.cn/problems/binary-tree-preorder-traversal/)\n14. [0094. 二叉树的中序遍历](https://leetcode.cn/problems/binary-tree-inorder-traversal/description/)\n15. [0145. 二叉树的后序遍历](https://leetcode.cn/problems/binary-tree-postorder-traversal/description/)\n16. [0102. 二叉树的层序遍历](https://leetcode.cn/problems/binary-tree-level-order-traversal/description/)\n17. [0104. 二叉树的最大深度](https://leetcode.cn/problems/maximum-depth-of-binary-tree/description/)\n18. [0226. 翻转二叉树](https://leetcode.cn/problems/invert-binary-tree/description/)\n19. [0257. 二叉树的所有路径](https://leetcode.cn/problems/binary-tree-paths/description/)\n20. [0101. 对称二叉树](https://leetcode.cn/problems/symmetric-tree/)\n21. [0111. 二叉树的最小深度](https://leetcode.cn/problems/minimum-depth-of-binary-tree/)\n22. [0543. 二叉树的直径](https://leetcode.cn/problems/diameter-of-binary-tree/)\n23. [0100. 相同的树](https://leetcode.cn/problems/same-tree/)\n24. [0617. 合并二叉树](https://leetcode.cn/problems/merge-two-binary-trees/)\n25. [0236. 二叉树的最近公共祖先](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/description/)\n26. [14. 最长公共前缀](https://leetcode.cn/problems/longest-common-prefix/description/)\n27. [1556. 千位分隔数](https://leetcode.cn/problems/thousand-separator/description/)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftjx666%2Fleetcode-javascript-2023","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftjx666%2Fleetcode-javascript-2023","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftjx666%2Fleetcode-javascript-2023/lists"}