{"id":21954695,"url":"https://github.com/sky172839465/leetcode-in-js","last_synced_at":"2026-02-28T11:32:00.713Z","repository":{"id":35547915,"uuid":"184983812","full_name":"sky172839465/leetcode-in-js","owner":"sky172839465","description":"LeetCode solution in JavaScript. ✍️","archived":false,"fork":false,"pushed_at":"2023-01-03T21:47:21.000Z","size":1300,"stargazers_count":4,"open_issues_count":12,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-23T12:49:47.598Z","etag":null,"topics":["code-generator","leetcode","leetcode-javascript","unit-testing"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","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/sky172839465.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":"2019-05-05T05:33:44.000Z","updated_at":"2020-12-27T02:23:43.000Z","dependencies_parsed_at":"2023-01-15T23:12:22.269Z","dependency_job_id":null,"html_url":"https://github.com/sky172839465/leetcode-in-js","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/sky172839465/leetcode-in-js","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sky172839465%2Fleetcode-in-js","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sky172839465%2Fleetcode-in-js/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sky172839465%2Fleetcode-in-js/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sky172839465%2Fleetcode-in-js/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sky172839465","download_url":"https://codeload.github.com/sky172839465/leetcode-in-js/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sky172839465%2Fleetcode-in-js/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29931660,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-28T09:58:13.507Z","status":"ssl_error","status_checked_at":"2026-02-28T09:57:57.047Z","response_time":90,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: 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":["code-generator","leetcode","leetcode-javascript","unit-testing"],"created_at":"2024-11-29T07:24:43.758Z","updated_at":"2026-02-28T11:32:00.348Z","avatar_url":"https://github.com/sky172839465.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode  [![Written by javaScript][javascript-image]][javascript-url] [![LeetCode coverage][leetcode-image]][leetcode-url]\n[javascript-image]: https://img.shields.io/badge/Language-JavaScript-yellow.svg\n[javascript-url]: https://zh.wikipedia.org/wiki/JavaScript\n[leetcode-image]: https://leetcode-badge.chyroc.cn/?name=sky172839465\u0026leetcode_badge_style=Solved/Total-{{.solved_question}}/{{.all_question}}-green.svg\n[leetcode-url]: https://leetcode.com/sky172839465\n\n[![Build Status][travis-image]][travis-url]\n[![Coverage Status][codecov-image]][codecov-url]\n[![Tested With Jest][jest-image]][jest-url]\n[![JavaScript Style Guide][standard-image]][standard-url]\n[![Conventional Commits][conventional-commits-image]][conventional-commits-url]\n\n[travis-image]: https://img.shields.io/travis/sky172839465/leetcode-in-js.svg?branch=master\n[travis-url]: https://travis-ci.com/sky172839465/leetcode-in-js\n[codecov-image]: https://img.shields.io/codecov/c/github/sky172839465/leetcode-in-js.svg\n[codecov-url]: https://codecov.io/gh/sky172839465/leetcode-in-js\n[jest-image]: https://img.shields.io/badge/tested_with-jest-99424f.svg\n[jest-url]: https://github.com/facebook/jest\n[standard-image]: https://img.shields.io/badge/code_style-standard-brightgreen.svg\n[standard-url]: https://standardjs.com\n[conventional-commits-image]: https://img.shields.io/badge/Conventional%20Commits-1.0.0-yellow.svg\n[conventional-commits-url]: https://conventionalcommits.org\nLeetCode solution in JavaScript. ✍️\n\n## 🚀**Quick Start**\n1. **Clone project**\n    ```sh\n    $ git clone https://github.com/sky172839465/leetcode-in-js.git\n    ```\n2. **Install dependency**\n    ```sh\n    $ npm install\n    ```\n3. **Run single solution**\n    ```sh\n    $ npm run test __tests__/easy/0001-two-sum.test.js\n    ```\n    **Run all solutions**\n    ```sh\n    $ npm run test\n    ```\n4.  **Create / Remove solution**\n    ```sh\n    $ npm run solution\n    ```\n    \u003cdetails\u003e\n      \u003csummary\u003eDemo create new solution\u003c/summary\u003e\n\n      ![create-solution](https://user-images.githubusercontent.com/9082423/58757240-7391a400-853b-11e9-9716-f2d13b286fbf.gif)\n    \u003c/details\u003e\n    \u003cdetails\u003e\n    \u003csummary\u003eDemo remove exist solution\u003c/summary\u003e\n\n      ![remove-solution](https://user-images.githubusercontent.com/9082423/58757241-742a3a80-853b-11e9-873e-e1bc0feb6a8c.gif)\n    \u003c/details\u003e\n\n## 📚**Contents**\n| # | Problem | Difficulty | Solution | Readme | Test Case |\n| :---: | :--- | :---: | :---: | :---: | :---: |\n|0001|[Two Sum](https://leetcode.com/problems/two-sum)|easy|[Solution](./src/easy/0001-two-sum/index.js)|[Readme](./src/easy/0001-two-sum/README.md)|[Test Case](./__tests__/easy/0001-two-sum.test.js)|\n|0007|[Reverse Integer](https://leetcode.com/problems/reverse-integer)|easy|[Solution](./src/easy/0007-reverse-integer/index.js)|[Readme](./src/easy/0007-reverse-integer/README.md)|[Test Case](./__tests__/easy/0007-reverse-integer.test.js)|\n|0009|[Palindrome Number](https://leetcode.com/problems/palindrome-number)|easy|[Solution](./src/easy/0009-palindrome-number/index.js)|[Readme](./src/easy/0009-palindrome-number/README.md)|[Test Case](./__tests__/easy/0009-palindrome-number.test.js)|\n|0013|[Roman to Integer](https://leetcode.com/problems/roman-to-integer)|easy|[Solution](./src/easy/0013-roman-to-integer/index.js)|[Readme](./src/easy/0013-roman-to-integer/README.md)|[Test Case](./__tests__/easy/0013-roman-to-integer.test.js)|\n|0014|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix)|easy|[Solution](./src/easy/0014-longest-common-prefix/index.js)|[Readme](./src/easy/0014-longest-common-prefix/README.md)|[Test Case](./__tests__/easy/0014-longest-common-prefix.test.js)|\n|0020|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses)|easy|[Solution](./src/easy/0020-valid-parentheses/index.js)|[Readme](./src/easy/0020-valid-parentheses/README.md)|[Test Case](./__tests__/easy/0020-valid-parentheses.test.js)|\n|0021|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists)|easy|[Solution](./src/easy/0021-merge-two-sorted-lists/index.js)|[Readme](./src/easy/0021-merge-two-sorted-lists/README.md)|[Test Case](./__tests__/easy/0021-merge-two-sorted-lists.test.js)|\n|0026|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array)|easy|[Solution](./src/easy/0026-remove-duplicates-from-sorted-array/index.js)|[Readme](./src/easy/0026-remove-duplicates-from-sorted-array/README.md)|[Test Case](./__tests__/easy/0026-remove-duplicates-from-sorted-array.test.js)|\n|0027|[Remove Element](https://leetcode.com/problems/remove-element)|easy|[Solution](./src/easy/0027-remove-element/index.js)|[Readme](./src/easy/0027-remove-element/README.md)|[Test Case](./__tests__/easy/0027-remove-element.test.js)|\n|0028|[Implement strStr()](https://leetcode.com/problems/implement-strstr)|easy|[Solution](./src/easy/0028-implement-strstr/index.js)|[Readme](./src/easy/0028-implement-strstr/README.md)|[Test Case](./__tests__/easy/0028-implement-strstr.test.js)|\n|0035|[Search Insert Position](https://leetcode.com/problems/search-insert-position)|easy|[Solution](./src/easy/0035-search-insert-position/index.js)|[Readme](./src/easy/0035-search-insert-position/README.md)|[Test Case](./__tests__/easy/0035-search-insert-position.test.js)|\n|0038|[Count and Say](https://leetcode.com/problems/count-and-say)|easy|[Solution](./src/easy/0038-count-and-say/index.js)|[Readme](./src/easy/0038-count-and-say/README.md)|[Test Case](./__tests__/easy/0038-count-and-say.test.js)|\n|0053|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray)|easy|[Solution](./src/easy/0053-maximum-subarray/index.js)|[Readme](./src/easy/0053-maximum-subarray/README.md)|[Test Case](./__tests__/easy/0053-maximum-subarray.test.js)|\n|0058|[Length of Last Word](https://leetcode.com/problems/length-of-last-word)|easy|[Solution](./src/easy/0058-length-of-last-word/index.js)|[Readme](./src/easy/0058-length-of-last-word/README.md)|[Test Case](./__tests__/easy/0058-length-of-last-word.test.js)|\n|0066|[Plus One](https://leetcode.com/problems/plus-one)|easy|[Solution](./src/easy/0066-plus-one/index.js)|[Readme](./src/easy/0066-plus-one/README.md)|[Test Case](./__tests__/easy/0066-plus-one.test.js)|\n|0067|[Add Binary](https://leetcode.com/problems/add-binary)|easy|[Solution](./src/easy/0067-add-binary/index.js)|[Readme](./src/easy/0067-add-binary/README.md)|[Test Case](./__tests__/easy/0067-add-binary.test.js)|\n|0069|[Sqrt(x)](https://leetcode.com/problems/sqrtx)|easy|[Solution](./src/easy/0069-sqrtx/index.js)|[Readme](./src/easy/0069-sqrtx/README.md)|[Test Case](./__tests__/easy/0069-sqrtx.test.js)|\n|0070|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs)|easy|[Solution](./src/easy/0070-climbing-stairs/index.js)|[Readme](./src/easy/0070-climbing-stairs/README.md)|[Test Case](./__tests__/easy/0070-climbing-stairs.test.js)|\n|0083|[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list)|easy|[Solution](./src/easy/0083-remove-duplicates-from-sorted-list/index.js)|[Readme](./src/easy/0083-remove-duplicates-from-sorted-list/README.md)|[Test Case](./__tests__/easy/0083-remove-duplicates-from-sorted-list.test.js)|\n|0088|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array)|easy|[Solution](./src/easy/0088-merge-sorted-array/index.js)|[Readme](./src/easy/0088-merge-sorted-array/README.md)|[Test Case](./__tests__/easy/0088-merge-sorted-array.test.js)|\n|0100|[Same Tree](https://leetcode.com/problems/same-tree)|easy|[Solution](./src/easy/0100-same-tree/index.js)|[Readme](./src/easy/0100-same-tree/README.md)|[Test Case](./__tests__/easy/0100-same-tree.test.js)|\n|0101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree)|easy|[Solution](./src/easy/0101-symmetric-tree/index.js)|[Readme](./src/easy/0101-symmetric-tree/README.md)|[Test Case](./__tests__/easy/0101-symmetric-tree.test.js)|\n|0104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)|easy|[Solution](./src/easy/0104-maximum-depth-of-binary-tree/index.js)|[Readme](./src/easy/0104-maximum-depth-of-binary-tree/README.md)|[Test Case](./__tests__/easy/0104-maximum-depth-of-binary-tree.test.js)|\n|0107|[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii)|easy|[Solution](./src/easy/0107-binary-tree-level-order-traversal-ii/index.js)|[Readme](./src/easy/0107-binary-tree-level-order-traversal-ii/README.md)|[Test Case](./__tests__/easy/0107-binary-tree-level-order-traversal-ii.test.js)|\n|0108|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree)|easy|[Solution](./src/easy/0108-convert-sorted-array-to-binary-search-tree/index.js)|[Readme](./src/easy/0108-convert-sorted-array-to-binary-search-tree/README.md)|[Test Case](./__tests__/easy/0108-convert-sorted-array-to-binary-search-tree.test.js)|\n|0111|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree)|easy|[Solution](./src/easy/0111-minimum-depth-of-binary-tree/index.js)|[Readme](./src/easy/0111-minimum-depth-of-binary-tree/README.md)|[Test Case](./__tests__/easy/0111-minimum-depth-of-binary-tree.test.js)|\n|0112|[Path Sum](https://leetcode.com/problems/path-sum)|easy|[Solution](./src/easy/0112-path-sum/index.js)|[Readme](./src/easy/0112-path-sum/README.md)|[Test Case](./__tests__/easy/0112-path-sum.test.js)|\n|0118|[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle)|easy|[Solution](./src/easy/0118-pascals-triangle/index.js)|[Readme](./src/easy/0118-pascals-triangle/README.md)|[Test Case](./__tests__/easy/0118-pascals-triangle.test.js)|\n|0119|[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii)|easy|[Solution](./src/easy/0119-pascals-triangle-ii/index.js)|[Readme](./src/easy/0119-pascals-triangle-ii/README.md)|[Test Case](./__tests__/easy/0119-pascals-triangle-ii.test.js)|\n|0121|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)|easy|[Solution](./src/easy/0121-best-time-to-buy-and-sell-stock/index.js)|[Readme](./src/easy/0121-best-time-to-buy-and-sell-stock/README.md)|[Test Case](./__tests__/easy/0121-best-time-to-buy-and-sell-stock.test.js)|\n|0122|[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii)|easy|[Solution](./src/easy/0122-best-time-to-buy-and-sell-stock-ii/index.js)|[Readme](./src/easy/0122-best-time-to-buy-and-sell-stock-ii/README.md)|[Test Case](./__tests__/easy/0122-best-time-to-buy-and-sell-stock-ii.test.js)|\n|0125|[Valid Palindrome](https://leetcode.com/problems/valid-palindrome)|easy|[Solution](./src/easy/0125-valid-palindrome/index.js)|[Readme](./src/easy/0125-valid-palindrome/README.md)|[Test Case](./__tests__/easy/0125-valid-palindrome.test.js)|\n|0136|[Single Number](https://leetcode.com/problems/single-number)|easy|[Solution](./src/easy/0136-single-number/index.js)|[Readme](./src/easy/0136-single-number/README.md)|[Test Case](./__tests__/easy/0136-single-number.test.js)|\n|0141|[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle)|easy|[Solution](./src/easy/0141-linked-list-cycle/index.js)|[Readme](./src/easy/0141-linked-list-cycle/README.md)|[Test Case](./__tests__/easy/0141-linked-list-cycle.test.js)|\n|0155|[Min Stack](https://leetcode.com/problems/min-stack)|easy|[Solution](./src/easy/0155-min-stack/index.js)|[Readme](./src/easy/0155-min-stack/README.md)|[Test Case](./__tests__/easy/0155-min-stack.test.js)|\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsky172839465%2Fleetcode-in-js","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsky172839465%2Fleetcode-in-js","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsky172839465%2Fleetcode-in-js/lists"}