Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.
Awesome Lists | Featured Topics | Projects
https://github.com/sky172839465/leetcode-in-js

LeetCode solution in JavaScript. ✍️
https://github.com/sky172839465/leetcode-in-js
code-generator leetcode leetcode-javascript unit-testing
Last synced: 28 days ago
JSON representation
LeetCode solution in JavaScript. ✍️
Host: GitHub
URL: https://github.com/sky172839465/leetcode-in-js
Owner: sky172839465
License: mit
Created: 2019-05-05T05:33:44.000Z (over 5 years ago)
Default Branch: master
Last Pushed: 2023-01-03T21:47:21.000Z (almost 2 years ago)
Last Synced: 2023-03-03T03:52:18.750Z (almost 2 years ago)
Topics: code-generator, leetcode, leetcode-javascript, unit-testing
Language: JavaScript
Homepage:
Size: 1.24 MB
Stars: 4
Watchers: 1
Forks: 0
Open Issues: 12
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project

README

        # LeetCode  [![Written by javaScript][javascript-image]][javascript-url] [![LeetCode coverage][leetcode-image]][leetcode-url]

[javascript-image]: https://img.shields.io/badge/Language-JavaScript-yellow.svg

[javascript-url]: https://zh.wikipedia.org/wiki/JavaScript

[leetcode-image]: https://leetcode-badge.chyroc.cn/?name=sky172839465&leetcode_badge_style=Solved/Total-{{.solved_question}}/{{.all_question}}-green.svg

[leetcode-url]: https://leetcode.com/sky172839465

[![Build Status][travis-image]][travis-url]

[![Coverage Status][codecov-image]][codecov-url]

[![Tested With Jest][jest-image]][jest-url]

[![JavaScript Style Guide][standard-image]][standard-url]

[![Conventional Commits][conventional-commits-image]][conventional-commits-url]

[travis-image]: https://img.shields.io/travis/sky172839465/leetcode-in-js.svg?branch=master

[travis-url]: https://travis-ci.com/sky172839465/leetcode-in-js

[codecov-image]: https://img.shields.io/codecov/c/github/sky172839465/leetcode-in-js.svg

[codecov-url]: https://codecov.io/gh/sky172839465/leetcode-in-js

[jest-image]: https://img.shields.io/badge/tested_with-jest-99424f.svg

[jest-url]: https://github.com/facebook/jest

[standard-image]: https://img.shields.io/badge/code_style-standard-brightgreen.svg

[standard-url]: https://standardjs.com

[conventional-commits-image]: https://img.shields.io/badge/Conventional%20Commits-1.0.0-yellow.svg

[conventional-commits-url]: https://conventionalcommits.org

LeetCode solution in JavaScript. ✍️

## 🚀**Quick Start**

1. **Clone project**

    ```sh

    $ git clone https://github.com/sky172839465/leetcode-in-js.git

    ```

2. **Install dependency**

    ```sh

    $ npm install

    ```

3. **Run single solution**

    ```sh

    $ npm run test __tests__/easy/0001-two-sum.test.js

    ```

    **Run all solutions**

    ```sh

    $ npm run test

    ```

4.  **Create / Remove solution**

    ```sh

    $ npm run solution

    ```

    

      Demo create new solution

      ![create-solution](https://user-images.githubusercontent.com/9082423/58757240-7391a400-853b-11e9-9716-f2d13b286fbf.gif)

    

    

    Demo remove exist solution

      ![remove-solution](https://user-images.githubusercontent.com/9082423/58757241-742a3a80-853b-11e9-873e-e1bc0feb6a8c.gif)

    

## 📚**Contents**

| # | Problem | Difficulty | Solution | Readme | Test Case |

| :---: | :--- | :---: | :---: | :---: | :---: |

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|

|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)|