{"id":13701947,"url":"https://github.com/tangweikun/leetcode","last_synced_at":"2025-05-05T04:30:40.637Z","repository":{"id":41390295,"uuid":"100388815","full_name":"tangweikun/leetcode","owner":"tangweikun","description":":zap: Leetcode Solutions","archived":false,"fork":false,"pushed_at":"2021-07-30T10:07:42.000Z","size":1951,"stargazers_count":118,"open_issues_count":0,"forks_count":12,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-11-13T09:40:19.717Z","etag":null,"topics":["interview","javascript","kata","leetcode","leetcode-javascript","leetcode-practice","leetcode-questions","leetcode-solutions"],"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/tangweikun.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE","code_of_conduct":"CODE_OF_CONDUCT.md","threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2017-08-15T15:00:44.000Z","updated_at":"2024-10-07T17:49:30.000Z","dependencies_parsed_at":"2022-09-03T17:40:54.050Z","dependency_job_id":null,"html_url":"https://github.com/tangweikun/leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tangweikun%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tangweikun%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tangweikun%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tangweikun%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tangweikun","download_url":"https://codeload.github.com/tangweikun/leetcode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252439365,"owners_count":21747993,"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":["interview","javascript","kata","leetcode","leetcode-javascript","leetcode-practice","leetcode-questions","leetcode-solutions"],"created_at":"2024-08-02T21:00:28.104Z","updated_at":"2025-05-05T04:30:38.422Z","avatar_url":"https://github.com/tangweikun.png","language":"JavaScript","readme":"\u003ch1 align=\"center\"\u003e\n 🔥 Leetcode 🔥\n\u003c/h1\u003e\n\n[![Travis Build](https://api.travis-ci.org/tangweikun/leetcode.svg?branch=master)](https://travis-ci.org/tangweikun/leetcode)\n[![Maintainability](https://api.codeclimate.com/v1/badges/94a223574a24b7225f16/maintainability)](https://codeclimate.com/github/tangweikun/leetcode)\n[![TestCoverage](https://api.codeclimate.com/v1/badges/94a223574a24b7225f16/test_coverage)](https://codeclimate.com/github/tangweikun/leetcode)\n[![Insight.io](https://img.shields.io/badge/insight.io-Ready-brightgreen.svg)](https://insight.io/github.com/tangweikun/leetcode/tree/master/?source=0)\n[![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg?style=flat-square)](http://makeapullrequest.com)\n[![code style: prettier](https://img.shields.io/badge/code_style-prettier-ff69b4.svg?style=flat-square)](https://github.com/prettier/prettier)\n\n\u003e Practice make Perfect\n\n- 🎉 Unit test with jest\n- ✨ Simple code\n- 🎨 Readable code\n\n![Logo](/logo.png)\n\n### Getting Start\n\n```javascript\ngit clone https://github.com/tangweikun/leetcode.git\ncd leetcode\nnpm install\nnpm run test // also you can run `npm run watch`\n```\n\n### Recommend\n\n- [🎉 CodeWars Solution](https://github.com/tangweikun/codewars)\n- [✨ Javascript Design Pattern](https://github.com/tangweikun/javascript-design-pattern)\n- [🎨 Lodash With ES6](https://github.com/tangweikun/lodash-es6)\n\n### Contents\n\n| # | Title | README | Difficulty | LeetCode | TAGS |\n| :-: | :-----------------------------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------------------------: | :--------: | :--------------------------------------------------------------------------------------------: | :----------------: |\n| 1 | [compare-version-numbers](src/compare-version-numbers/index.ts) | [:green_book:](src/compare-version-numbers/README.md) | Easy | [LeetCode](https://leetcode.com/problems/compare-version-numbers) | String |\n| 2 | [set-matrix-zeroes](src/set-matrix-zeroes:/index.ts) | [:green_book:](src/set-matrix-zeroes:/README.md) | Easy | [LeetCode](https://leetcode.com/problems/set-matrix-zeroes) | Array |\n| 3 | [triangle](src/triangle/index.ts) | [:green_book:](src/triangle/README.md) | Medium | [LeetCode](https://leetcode.com/problems/triangle) | DP |\n| 4 | [length-of-last-word](src/length-of-last-word/index.ts) | [:green_book:](src/length-of-last-word/README.md) | Easy | [LeetCode](https://leetcode.com/problems/length-of-last-word) | String |\n| 5 | [baseball-game](src/baseball-game/index.ts) | [:green_book:](src/baseball-game/README.md) | Easy | [LeetCode](https://leetcode.com/problems/baseball-game) | Stack |\n| 6 | [132-pattern](src/132-pattern/index.ts) | [:green_book:](src/132-pattern/README.md) | Medium | [LeetCode](https://leetcode.com/problems/132-pattern) | Stack |\n| 7 | [LongestCommonPrefix](src/longest-common-prefix/index.ts) | [:green_book:](src/longest-common-prefix/README.md) | Easy | [LeetCode](https://leetcode.com/problems/longest-common-prefix) | String |\n| 8 | [longest-substring-without-repeating-characters](src/longest-substring-without-repeating-characters/index.ts) | [:green_book:](src/longest-substring-without-repeating-characters/README.md) | Easy | [LeetCode](https://leetcode.com/articles/longest-substring-without-repeating-characters) | String |\n| 9 | [global-and-local-inversions](src/global-and-local-inversions/index.ts) | [:green_book:](src/global-and-local-inversions/README.md) | Medium | [LeetCode](https://leetcode.com/problems/min-stack) | Array |\n| 10 | [min-stack](src/min-stack/index.ts) | [:green_book:](src/min-stack/README.md) | Medium | [LeetCode](https://leetcode.com/problems/min-stack) | Stack |\n| 11 | [rotate-image](src/rotate-image/index.ts) | [:green_book:](src/rotate-image/README.md) | Medium | [LeetCode](https://leetcode.com/problems/min-stack) | Array |\n| 12 | [task-scheduler](src/task-scheduler/index.ts) | [:green_book:](src/task-scheduler/README.md) | Medium | [LeetCode](https://leetcode.com/problems/task-scheduler) | Array |\n| 13 | [search-insert-position](src/search-insert-position/index.ts) | [:green_book:](src/search-insert-position/README.md) | Easy | [LeetCode](https://leetcode.com/problems/search-insert-position) | BinarySearch |\n| 14 | [judge-route-circle](src/judge-route-circle/index.ts) | [:green_book:](src/judge-route-circle/README.md) | Easy | [LeetCode](https://leetcode.com/problems/judge-route-circle) | String |\n| 15 | [advantage-shuffle](src/advantage-shuffle/index.ts) | [:green_book:](src/advantage-shuffle/README.md) | Medium | [LeetCode](https://leetcode.com/problems/advantage-shuffle) | Array |\n| 16 | [number-of-matching-subsequences](src/number-of-matching-subsequences/index.ts) | [:green_book:](src/number-of-matching-subsequences/README.md) | Medium | [LeetCode](https://leetcode.com/problems/number-of-matching-subsequences) | Array |\n| 17 | [valid-parentheses](src/valid-parentheses/index.ts) | [:green_book:](src/valid-parentheses/README.md) | Easy | [LeetCode](https://leetcode.com/problems/valid-parentheses) | String |\n| 18 | [power-of-two](src/power-of-two/index.ts) | [:green_book:](src/power-of-two/README.md) | Easy | [LeetCode](https://leetcode.com/problems/power-of-two) | Math |\n| 19 | [number-of-1-bits](src/number-of-1-bits/index.ts) | [:green_book:](src/number-of-1-bits/README.md) | Easy | [LeetCode](https://leetcode.com/problems/number-of-1-bits) | Bit |\n| 20 | [my-calendar-ii](src/my-calendar-ii/index.ts) | [:green_book:](src/my-calendar-ii/README.md) | Easy | [LeetCode](https://leetcode.com/problems/my-calendar-ii) | Array |\n| 21 | [subdomain-visit-count](src/subdomain-visit-count/index.ts) | [:green_book:](src/subdomain-visit-count/README.md) | Easy | [LeetCode](https://leetcode.com/problems/subdomain-visit-count) | HashTable |\n| 22 | [top-k-frequent-elements](src/top-k-frequent-elements/index.ts) | [:green_book:](src/top-k-frequent-elements/README.md) | Medium | [LeetCode](https://leetcode.com/problems/top-k-frequent-elements) | HashTable |\n| 23 | [climbing-stairs](src/climbing-stairs/index.ts) | [:green_book:](src/climbing-stairs/README.md) | Easy | [LeetCode](https://leetcode.com/problems/climbing-stairs) | DP |\n| 24 | [remove-element](src/remove-element/index.ts) | [:green_book:](src/remove-element/README.md) | Easy | [LeetCode](https://leetcode.com/problems/remove-element) | Array |\n| 25 | [implement-strstr](src/implement-strstr/index.ts) | [:green_book:](src/implement-strstr/README.md) | Easy | [LeetCode](https://leetcode.com/problems/implement-strstr) | String |\n| 26 | [largest-number-at-least-twice-of-others](src/largest-number-at-least-twice-of-others/index.ts) | [:green_book:](src/largest-number-at-least-twice-of-others/README.md) | Easy | [LeetCode](https://leetcode.com/problems/largest-number-at-least-twice-of-others) | Array |\n| 27 | [powx-n](src/powx-n/index.ts) | [:green_book:](src/powx-n/README.md) | Easy | [LeetCode](https://leetcode.com/problems/powx-n) | Math |\n| 28 | [replace-words](src/replace-words/index.ts) | [:green_book:](src/replace-words/README.md) | Medium | [LeetCode](https://leetcode.com/problems/replace-words) | HashTable |\n| 29 | [remove-duplicates-from-sorted-array](src/remove-duplicates-from-sorted-array/index.ts) | [:green_book:](src/remove-duplicates-from-sorted-array/README.md) | Easy | [LeetCode](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | Two Pointer |\n| 30 | [roman-to-integer](src/roman-to-integer/index.ts) | [:green_book:](src/roman-to-integer/README.md) | Easy | [LeetCode](https://leetcode.com/problems/roman-to-integer) | Math |\n| 31 | [maximum-subarray](src/maximum-subarray/index.ts) | [:green_book:](src/maximum-subarray/README.md) | Easy | [LeetCode](https://leetcode.com/problems/maximum-subarray) | Array |\n| 32 | [plus-one](src/plus-one/index.ts) | [:green_book:](src/plus-one/README.md) | Easy | [LeetCode](https://leetcode.com/problems/plus-one) | Math |\n| 33 | [add-binary](src/add-binary/index.ts) | [:green_book:](src/add-binary/README.md) | Easy | [LeetCode](https://leetcode.com/problems/add-binary) | Math |\n| 34 | [sqrtx](src/sqrtx/index.ts) | [:green_book:](src/sqrtx/README.md) | Easy | [LeetCode](https://leetcode.com/problems/sqrtx) | Math |\n| 35 | [merge-sorted-array](src/merge-sorted-array/index.ts) | [:green_book:](src/merge-sorted-array/README.md) | Easy | [LeetCode](https://leetcode.com/problems/merge-sorted-array) | Array |\n| 36 | [count-and-say](src/count-and-say/index.ts) | [:green_book:](src/count-and-say/README.md) | Easy | [LeetCode](https://leetcode.com/problems/count-and-say) | String |\n| 37 | [best-time-to-buy-and-sell-stock](src/best-time-to-buy-and-sell-stock/index.ts) | [:green_book:](src/best-time-to-buy-and-sell-stock/README.md) | Easy | [LeetCode](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | Array |\n| 38 | [best-time-to-buy-and-sell-stock-ii](src/best-time-to-buy-and-sell-stock-ii/index.ts) | [:green_book:](src/best-time-to-buy-and-sell-stock-ii/README.md) | Easy | [LeetCode](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | Array |\n| 39 | [valid-palindrome](src/valid-palindrome/index.ts) | [:green_book:](src/valid-palindrome/README.md) | Easy | [LeetCode](https://leetcode.com/problems/valid-palindrome) | TwoPointers |\n| 40 | [single-number](src/single-number/index.ts) | [:green_book:](src/single-number/README.md) | Easy | [LeetCode](https://leetcode.com/problems/single-number) | Bit |\n| 41 | [two-sum-ii-input-array-is-sorted](src/two-sum-ii-input-array-is-sorted/index.ts) | [:green_book:](src/two-sum-ii-input-array-is-sorted/README.md) | Easy | [LeetCode](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | Array |\n| 42 | [rotate-array](src/rotate-array/index.ts) | [:green_book:](src/rotate-array/README.md) | Easy | [LeetCode](https://leetcode.com/problems/rotate-array) | Array |\n| 43 | [reverse-bits](src/reverse-bits/index.ts) | [:green_book:](src/reverse-bits/README.md) | Easy | [LeetCode](https://leetcode.com/problems/reverse-bits) | Bit |\n| 44 | [asteroid-collision](src/asteroid-collision/index.ts) | [:green_book:](src/asteroid-collision/README.md) | Medium | [LeetCode](https://leetcode.com/problems/asteroid-collision) | Stack |\n| 45 | [top-k-frequent-words](src/top-k-frequent-words/index.ts) | [:green_book:](src/top-k-frequent-words/README.md) | Medium | [LeetCode](https://leetcode.com/problems/top-k-frequent-words) | HashTable |\n| 46 | [contiguous-array](src/contiguous-array/index.ts) | [:green_book:](src/contiguous-array/README.md) | Medium | [LeetCode](https://leetcode.com/problems/contiguous-array) | HashTable |\n| 47 | [group-anagrams](src/group-anagrams/index.ts) | [:green_book:](src/group-anagrams/README.md) | Easy | [LeetCode](https://leetcode.com/problems/group-anagrams) | HashTable |\n| 48 | [happy-number](src/happy-number/index.ts) | [:green_book:](src/happy-number/README.md) | Easy | [LeetCode](https://leetcode.com/problems/happy-number) | Math |\n| 49 | [fizz-buzz](src/fizz-buzz/index.ts) | [:green_book:](src/fizz-buzz/README.md) | Easy | [LeetCode](https://leetcode.com/problems/fizz-buzz) | Math |\n| 50 | [hamming-distance](src/hamming-distance/index.ts) | [:green_book:](src/hamming-distance/README.md) | Easy | [LeetCode](https://leetcode.com/problems/hamming-distance) | Bit |\n| 51 | [intersection-of-two-arrays](src/intersection-of-two-arrays/index.ts) | [:green_book:](src/intersection-of-two-arrays/README.md) | Easy | [LeetCode](https://leetcode.com/problems/intersection-of-two-arrays) | TowPointers |\n| 52 | [intersection-of-two-arrays-ii](src/intersection-of-two-arrays-ii/index.ts) | [:green_book:](src/intersection-of-two-arrays-ii/README.md) | Easy | [LeetCode](https://leetcode.com/problems/intersection-of-two-arrays-ii) | TwoPointers |\n| 53 | [island-perimeter](src/island-perimeter/index.ts) | [:green_book:](src/island-perimeter/README.md) | Easy | [LeetCode](https://leetcode.com/problems/island-perimeter) | HashTable |\n| 54 | [keyboard-row](src/keyboard-row/index.ts) | [:green_book:](src/keyboard-row/README.md) | Easy | [LeetCode](https://leetcode.com/problems/keyboard-row) | HashTable |\n| 55 | [longest-palindrome](src/longest-palindrome/index.ts) | [:green_book:](src/longest-palindrome/README.md) | Easy | [LeetCode](https://leetcode.com/problems/longest-palindrome) | HashTable |\n| 56 | [longest-continuous-increasing-subsequence](src/longest-continuous-increasing-subsequence/index.ts) | [:green_book:](src/longest-continuous-increasing-subsequence/README.md) | Easy | [LeetCode](https://leetcode.com/problems/longest-continuous-increasing-subsequence) | Array |\n| 57 | [longest-harmonious-subsequence](src/longest-harmonious-subsequence/index.ts) | [:green_book:](src/longest-harmonious-subsequence/README.md) | Easy | [LeetCode](https://leetcode.com/problems/longest-harmonious-subsequence) | HashTable |\n| 58 | [first-unique-character-in-a-string](src/first-unique-character-in-a-string/index.ts) | [:green_book:](src/first-unique-character-in-a-string/README.md) | Easy | [LeetCode](https://leetcode.com/problems/first-unique-character-in-a-string) | String |\n| 59 | [find-the-difference](src/find-the-difference/index.ts) | [:green_book:](src/find-the-difference/README.md) | Easy | [LeetCode](https://leetcode.com/problems/find-the-difference) | HashTable |\n| 60 | [add-digits](src/add-digits/index.ts) | [:green_book:](src/add-digits/README.md) | Easy | [LeetCode](https://leetcode.com/problems/add-digits) | Math |\n| 61 | [add-strings](src/add-strings/index.ts) | [:green_book:](src/add-strings/README.md) | Easy | [LeetCode](https://leetcode.com/problems/add-strings) | Math |\n| 62 | [array-partition-i](src/array-partition-i/index.ts) | [:green_book:](src/array-partition-i/README.md) | Easy | [LeetCode](https://leetcode.com/problems/array-partition-i) | Array |\n| 63 | [arranging-coins](src/arranging-coins/index.ts) | [:green_book:](src/arranging-coins/README.md) | Easy | [LeetCode](https://leetcode.com/problems/arranging-coins) | Math |\n| 64 | [contains-duplicate](src/contains-duplicate/index.ts) | [:green_book:](src/contains-duplicate/README.md) | Easy | [LeetCode](https://leetcode.com/problems/contains-duplicate) | Array |\n| 65 | [contains-duplicate-ii](src/contains-duplicate-ii/index.ts) | [:green_book:](src/contains-duplicate-ii/README.md) | Easy | [LeetCode](https://leetcode.com/problems/contains-duplicate-ii) | Array |\n| 66 | [count-binary-substrings](src/count-binary-substrings/index.ts) | [:green_book:](src/count-binary-substrings/README.md) | Easy | [LeetCode](https://leetcode.com/problems/count-binary-substrings) | String |\n| 67 | [detect-capital](src/detect-capital/index.ts) | [:green_book:](src/detect-capital/README.md) | Easy | [LeetCode](https://leetcode.com/problems/detect-capital) | String |\n| 68 | [distribute-candies](src/distribute-candies/index.ts) | [:green_book:](src/distribute-candies/README.md) | Easy | [LeetCode](https://leetcode.com/problems/distribute-candies) | HashTable |\n| 69 | [count-primes](src/count-primes/index.ts) | [:green_book:](src/count-primes/README.md) | Easy | [LeetCode](https://leetcode.com/problems/count-primes) | Math |\n| 70 | [base-7](src/base-7/index.ts) | [:green_book:](src/base-7/README.md) | Easy | [LeetCode](https://leetcode.com/problems/base-7) |\n| 71 | [power-of-three](src/power-of-three/index.ts) | [:green_book:](src/power-of-three/README.md) | Easy | [LeetCode](https://leetcode.com/problems/power-of-three) | Math |\n| 72 | [power-of-four](src/power-of-four/index.ts) | [:green_book:](src/power-of-four/README.md) | Easy | [LeetCode](https://leetcode.com/problems/power-of-four) | math |\n| 73 | [number-of-segments-in-a-string](src/number-of-segments-in-a-string/index.ts) | [:green_book:](src/number-of-segments-in-a-string/README.md) | Easy | [LeetCode](https://leetcode.com/problems/number-of-segments-in-a-string) | String |\n| 74 | [reverse-string](src/reverse-string/index.ts) | [:green_book:](src/reverse-string/README.md) | Easy | [LeetCode](https://leetcode.com/problems/reverse-string) | String |\n| 75 | [reverse-string-ii](src/reverse-string-ii/index.ts) | [:green_book:](src/reverse-string-ii/README.md) | Easy | [LeetCode](https://leetcode.com/problems/reverse-string-ii) | String |\n| 76 | [reverse-words-in-a-string-iii](src/reverse-words-in-a-string-iii/index.ts) | [:green_book:](src/reverse-words-in-a-string-iii/README.md) | Easy | [LeetCode](https://leetcode.com/problems/reverse-words-in-a-string-iii) | String |\n| 77 | [reverse-vowels-of-a-string](src/reverse-vowels-of-a-string/index.ts) | [:green_book:](src/reverse-vowels-of-a-string/README.md) | Easy | [LeetCode](https://leetcode.com/problems/reverse-vowels-of-a-string) | String |\n| 78 | [ugly-number](src/ugly-number/index.ts) | [:green_book:](src/ugly-number/README.md) | Easy | [LeetCode](https://leetcode.com/problems/ugly-number) | Math |\n| 79 | [valid-anagram](src/valid-anagram/index.ts) | [:green_book:](src/valid-anagram/README.md) | Easy | [LeetCode](https://leetcode.com/problems/valid-anagram) | HashTable |\n| 80 | [valid-palindrome-ii](src/valid-palindrome-ii/index.ts) | [:green_book:](src/valid-palindrome-ii/README.md) | Easy | [LeetCode](https://leetcode.com/problems/valid-palindrome-ii) | String |\n| 81 | [word-pattern](src/word-pattern/index.ts) | [:green_book:](src/word-pattern/README.md) | Easy | [LeetCode](https://leetcode.com/problems/word-pattern) | HashTable |\n| 82 | [binary-number-with-alternating-bits](src/binary-number-with-alternating-bits/index.ts) | [:green_book:](src/binary-number-with-alternating-bits/README.md) | Easy | [LeetCode](https://leetcode.com/problems/binary-number-with-alternating-bits) | Bit |\n| 83 | [find-all-anagrams-in-a-string](src/find-all-anagrams-in-a-string/index.ts) | [:green_book:](src/find-all-anagrams-in-a-string/README.md) | Easy | [LeetCode](https://leetcode.com/problems/find-all-anagrams-in-a-string) | HashTable |\n| 84 | [factorial-trailing-zeroes](src/factorial-trailing-zeroes/index.ts) | [:green_book:](src/factorial-trailing-zeroes/README.md) | Easy | [LeetCode](https://leetcode.com/problems/factorial-trailing-zeroes) | Math |\n| 85 | [find-smallest-letter-greater-than-target](src/find-smallest-letter-greater-than-target/index.ts) | [:green_book:](src/find-smallest-letter-greater-than-target/README.md) | Easy | [LeetCode](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | BinarySearch |\n| 86 | [find-pivot-index](src/find-pivot-index/index.ts) | [:green_book:](src/find-pivot-index/README.md) | Easy | [LeetCode](https://leetcode.com/problems/find-pivot-index) | Array |\n| 87 | [license-key-formatting](src/license-key-formatting/index.ts) | [:green_book:](src/license-key-formatting/README.md) | Easy | [LeetCode](https://leetcode.com/problems/license-key-formatting) |\n| 88 | [longest-uncommon-subsequence-i](src/longest-uncommon-subsequence-i/index.ts) | [:green_book:](src/longest-uncommon-subsequence-i/README.md) | Easy | [LeetCode](https://leetcode.com/problems/longest-uncommon-subsequence-i) | String |\n| 89 | [majority-element](src/majority-element/index.ts) | [:green_book:](src/majority-element/README.md) | Easy | [LeetCode](https://leetcode.com/problems/majority-element) | Array |\n| 90 | [perfect-number](src/perfect-number/index.ts) | [:green_book:](src/perfect-number/README.md) | Easy | [LeetCode](https://leetcode.com/problems/perfect-number) | Math |\n| 91 | [prime-number-of-set-bits-in-binary-representation](src/prime-number-of-set-bits-in-binary-representation/index.ts) | [:green_book:](src/prime-number-of-set-bits-in-binary-representation/README.md) | Easy | [LeetCode](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation) | Bit |\n| 92 | [number-complement](src/number-complement/index.ts) | [:green_book:](src/number-complement/README.md) | Easy | [LeetCode](https://leetcode.com/problems/number-complement) | Bit |\n| 93 | [move-zeroes](src/move-zeroes/index.ts) | [:green_book:](src/move-zeroes/README.md) | Easy | [LeetCode](https://leetcode.com/problems/move-zeroes) | Array |\n| 94 | [relative-ranks](src/relative-ranks/index.ts) | [:green_book:](src/relative-ranks/README.md) | Easy | [LeetCode](https://leetcode.com/problems/relative-ranks) |\n| 95 | [valid-perfect-square](src/valid-perfect-square/index.ts) | [:green_book:](src/valid-perfect-square/README.md) | Easy | [LeetCode](https://leetcode.com/problems/valid-perfect-square) | Math |\n| 96 | [string-compression](src/string-compression/index.ts) | [:green_book:](src/string-compression/README.md) | Easy | [LeetCode](https://leetcode.com/problems/string-compression) | String |\n| 97 | [student-attendance-record-i](src/student-attendance-record-i/index.ts) | [:green_book:](src/student-attendance-record-i/README.md) | Easy | [LeetCode](https://leetcode.com/problems/student-attendance-record-i) | String |\n| 98 | [max-consecutive-ones](src/max-consecutive-ones/index.ts) | [:green_book:](src/max-consecutive-ones/README.md) | Easy | [LeetCode](https://leetcode.com/problems/max-consecutive-ones) | Array |\n| 99 | [maximum-average-subarray-i](src/maximum-average-subarray-i/index.ts) | [:green_book:](src/maximum-average-subarray-i/README.md) | Easy | [LeetCode](https://leetcode.com/problems/maximum-average-subarray-i) | Array |\n| 100 | [minimum-index-sum-of-two-lists](src/minimum-index-sum-of-two-lists/index.ts) | [:green_book:](src/minimum-index-sum-of-two-lists/README.md) | Easy | [LeetCode](https://leetcode.com/problems/minimum-index-sum-of-two-lists) |\n| 101 | [sum-of-square-numbers](src/sum-of-square-numbers/index.ts) | [:green_book:](src/sum-of-square-numbers/README.md) | Easy | [LeetCode](https://leetcode.com/problems/sum-of-square-numbers) | Math |\n| 102 | [set-mismatch](src/set-mismatch/index.ts) | [:green_book:](src/set-mismatch/README.md) | Easy | [LeetCode](https://leetcode.com/problems/set-mismatch) | Math |\n| 103 | [find-the-duplicate-number](src/find-the-duplicate-number/index.ts) | [:green_book:](src/find-the-duplicate-number/README.md) | Medium | [LeetCode](https://leetcode.com/problems/find-the-duplicate-number) | Math |\n| 104 | [self-dividing-numbers](src/self-dividing-numbers/index.ts) | [:green_book:](src/self-dividing-numbers/README.md) | Easy | [LeetCode](https://leetcode.com/problems/self-dividing-numbers) | Math |\n| 105 | [missing-number](src/missing-number/index.ts) | [:green_book:](src/missing-number/README.md) | Easy | [LeetCode](https://leetcode.com/problems/missing-number) | Math |\n| 106 | [maximum-product-of-three-numbers](src/maximum-product-of-three-numbers/index.ts) | [:green_book:](src/maximum-product-of-three-numbers/README.md) | Easy | [LeetCode](https://leetcode.com/problems/maximum-product-of-three-numbers) | Math |\n| 107 | [complex-number-multiplication](src/complex-number-multiplication/index.ts) | [:green_book:](src/complex-number-multiplication/README.md) | Medium | [LeetCode](https://leetcode.com/problems/complex-number-multiplication) | Math |\n| 108 | [ugly-number-ii](src/ugly-number-ii/index.ts) | [:green_book:](src/ugly-number-ii/README.md) | Medium | [LeetCode](https://leetcode.com/problems/maximum-product-of-three-numbers) | Math, DP |\n| 109 | [valid-square](src/valid-square/index.ts) | [:green_book:](src/valid-square/README.md) | Medium | [LeetCode](https://leetcode.com/problems/valid-square) | Math |\n| 110 | [1-bit-and-2-bit-characters](src/1-bit-and-2-bit-characters/index.ts) | [:green_book:](src/1-bit-and-2-bit-characters/README.md) | Easy | [LeetCode](https://leetcode.com/problems/1-bit-and-2-bit-characters) | Array |\n| 111 | [can-place-flowers](src/can-place-flowers/index.ts) | [:green_book:](src/can-place-flowers/README.md) | Easy | [LeetCode](https://leetcode.com/problems/can-place-flowers) | Array |\n| 112 | [find-all-numbers-disappeared-in-an-array](src/find-all-numbers-disappeared-in-an-array/index.ts) | [:green_book:](src/find-all-numbers-disappeared-in-an-array/README.md) | Easy | [LeetCode](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array) | Array |\n| 113 | [container-with-most-water](src/container-with-most-water/index.ts) | [:green_book:](src/container-with-most-water/README.md) | Medium | [LeetCode](https://leetcode.com/problems/container-with-most-water) | Array |\n| 114 | [degree-of-an-array](src/degree-of-an-array/index.ts) | [:green_book:](src/degree-of-an-array/README.md) | Easy | [LeetCode](https://leetcode.com/problems/degree-of-an-array) | Array |\n| 115 | [find-all-duplicates-in-an-array](src/find-all-duplicates-in-an-array/index.ts) | [:green_book:](src/find-all-duplicates-in-an-array/README.md) | Easy | [LeetCode](https://leetcode.com/problems/find-all-duplicates-in-an-array) | Array |\n| 116 | [find-minimum-in-rotated-sorted-array](src/find-minimum-in-rotated-sorted-array/index.ts) | [:green_book:](src/find-minimum-in-rotated-sorted-array/README.md) | Easy | [LeetCode](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | Array |\n| 117 | [find-minimum-in-rotated-sorted-array-ii](src/find-minimum-in-rotated-sorted-array-ii/index.ts) | [:green_book:](src/find-minimum-in-rotated-sorted-array-ii/README.md) | Easy | [LeetCode](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii) | Array |\n| 118 | [find-peak-element](src/find-peak-element/index.ts) | [:green_book:](src/find-peak-element/README.md) | Medium | [LeetCode](https://leetcode.com/problems/find-peak-element) | Array |\n| 119 | [jump-game](src/jump-game/index.ts) | [:green_book:](src/jump-game/README.md) | Medium | [LeetCode](https://leetcode.com/problems/jump-game) | DP |\n| 120 | [jump-game-ii](src/jump-game-ii/index.ts) | [:green_book:](src/jump-game-ii/README.md) | Hard | [LeetCode](https://leetcode.com/problems/jump-game-ii) | DP |\n| 121 | [max-chunks-to-make-sorted](src/max-chunks-to-make-sorted/index.ts) | [:green_book:](src/max-chunks-to-make-sorted/README.md) | Medium | [LeetCode](https://leetcode.com/problems/max-chunks-to-make-sorted) | Array |\n| 122 | [maximum-swap](src/maximum-swap/index.ts) | [:green_book:](src/maximum-swap/README.md) | Medium | [LeetCode](https://leetcode.com/problems/maximum-swap) | Array |\n| 123 | [min-cost-climbing-stairs](src/min-cost-climbing-stairs/index.ts) | [:green_book:](src/min-cost-climbing-stairs/README.md) | Medium | [LeetCode](https://leetcode.com/problems/min-cost-climbing-stairs) | DP |\n| 124 | [minimum-size-subarray-sum](src/minimum-size-subarray-sum/index.ts) | [:green_book:](src/minimum-size-subarray-sum/README.md) | Medium | [LeetCode](https://leetcode.com/problems/minimum-size-subarray-sum) | Array |\n| 125 | [remove-duplicates-from-sorted-array-ii](src/remove-duplicates-from-sorted-array-ii/index.ts) | [:green_book:](src/remove-duplicates-from-sorted-array-ii/README.md) | Medium | [LeetCode](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii) | Array |\n| 126 | [search-for-a-range](src/search-for-a-range/index.ts) | [:green_book:](src/search-for-a-range/README.md) | Medium | [LeetCode](https://leetcode.com/problems/search-for-a-range) | Array |\n| 127 | [subarray-product-less-than-k](src/subarray-product-less-than-k/index.ts) | [:green_book:](src/subarray-product-less-than-k/README.md) | Medium | [LeetCode](https://leetcode.com/problems/subarray-product-less-than-k) | Array |\n| 128 | [daily-temperatures](src/daily-temperatures/index.ts) | [:green_book:](src/daily-temperatures/README.md) | Medium | [LeetCode](https://leetcode.com/problems/daily-temperatures) | Stack |\n| 129 | [sum-of-two-integers](src/sum-of-two-integers/index.ts) | [:green_book:](src/sum-of-two-integers/README.md) | Easy | [LeetCode](https://leetcode.com/problems/sum-of-two-integers) | Bit |\n| 130 | [jewels-and-stones](src/jewels-and-stones/index.ts) | [:green_book:](src/jewels-and-stones/README.md) | Easy | [LeetCode](https://leetcode.com/problems/jewels-and-stones) | HashTable |\n| 131 | [number-of-boomerangs](src/number-of-boomerangs/index.ts) | [:green_book:](src/number-of-boomerangs/README.md) | Easy | [LeetCode](https://leetcode.com/problems/number-of-boomerangs) | HashTable |\n| 132 | [isomorphic-strings](src/isomorphic-strings/index.ts) | [:green_book:](src/isomorphic-strings/README.md) | Easy | [LeetCode](https://leetcode.com/problems/isomorphic-strings) | HashTable |\n| 133 | [counting-bits](src/counting-bits/index.ts) | [:green_book:](src/counting-bits/README.md) | Easy | [LeetCode](https://leetcode.com/problems/counting-bits) | Bit |\n| 134 | [valid-triangle-number](src/valid-triangle-number/index.ts) | [:green_book:](src/valid-triangle-number/README.md) | Medium | [LeetCode](https://leetcode.com/problems/valid-triangle-number) | Array |\n| 135 | [repeated-substring-pattern](src/repeated-substring-pattern/index.ts) | [:green_book:](src/repeated-substring-pattern/README.md) | Easy | [LeetCode](https://leetcode.com/problems/repeated-substring-pattern) | String |\n| 136 | [maximum-depth-of-binary-tree](src/_trees/maximum-depth-of-binary-tree/index.ts) | [:green_book:](src/_trees/maximum-depth-of-binary-tree/README.md) | Easy | [LeetCode](https://leetcode.com/problems/maximum-depth-of-binary-tree) | BinaryTree |\n| 137 | [merge-two-binary-trees](src/_trees/merge-two-binary-trees/index.ts) | [:green_book:](src/_trees/merge-two-binary-trees/README.md) | Easy | [LeetCode](https://leetcode.com/problems/merge-two-binary-_trees) | BinaryTree |\n| 138 | [average-of-levels-in-binary-tree](src/_trees/average-of-levels-in-binary-tree/index.ts) | [:green_book:](src/_trees/average-of-levels-in-binary-tree/README.md) | Easy | [LeetCode](https://leetcode.com/problems/average-of-levels-in-binary-tree) | BinaryTree |\n| 139 | [find-duplicate-subtrees](src/_trees/find-duplicate-subtrees/index.ts) | [:green_book:](src/_trees/find-duplicate-subtrees/README.md) | Medium | [LeetCode](https://leetcode.com/problems/find-duplicate-subtrees) | BinaryTree |\n| 140 | [minimum-window-substring](src/minimum-window-substring/index.ts) | [:green_book:](src/minimum-window-substring/README.md) | Hard | [LeetCode](https://leetcode.com/problems/minimum-window-substring) | String |\n| 141 | [invert-binary-tree](src/_trees/invert-binary-tree/index.ts) | [:green_book:](src/_trees/invert-binary-tree/README.md) | Easy | [LeetCode](https://leetcode.com/problems/invert-binary-tree) | BinaryTree |\n| 142 | [two-sum-iv-input-is-a-bst](src/_trees/two-sum-iv-input-is-a-bst/index.ts) | [:green_book:](src/_trees/two-sum-iv-input-is-a-bst/README.md) | Easy | [LeetCode](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) | BinaryTree |\n| 143 | [same-tree](src/_trees/same-tree/index.ts) | [:green_book:](src/_trees/same-tree/README.md) | Easy | [LeetCode](https://leetcode.com/problems/same-tree) | BinaryTree |\n| 144 | [sum-of-left-leaves](src/_trees/sum-of-left-leaves/index.ts) | [:green_book:](src/_trees/sum-of-left-leaves/README.md) | Easy | [LeetCode](https://leetcode.com/problems/sum-of-left-leaves) | BinaryTree |\n| 145 | [trim-a-binary-search-tree](src/_trees/trim-a-binary-search-tree/index.ts) | [:green_book:](src/_trees/trim-a-binary-search-tree/README.md) | Easy | [LeetCode](https://leetcode.com/problems/trim-a-binary-search-tree) | BinaryTree |\n| 146 | [toeplitz-matrix](src/toeplitz-matrix/index.ts) | [:green_book:](src/toeplitz-matrix/README.md) | Easy | [LeetCode](https://leetcode.com/problems/toeplitz-matrix) | Array |\n| 147 | [reshape-the-matrix](src/reshape-the-matrix/index.ts) | [:green_book:](src/reshape-the-matrix/README.md) | Easy | [LeetCode](https://leetcode.com/problems/reshape-the-matrix) | Array |\n| 148 | [next-greater-element-i](src/next-greater-element-i/index.ts) | [:green_book:](src/next-greater-element-i/README.md) | Easy | [LeetCode](https://leetcode.com/problems/next-greater-element-i) | Array |\n| 149 | [nim-game](src/nim-game/index.ts) | [:green_book:](src/nim-game/README.md) | Easy | [LeetCode](https://leetcode.com/problems/nim-game) | BrainTeaser |\n| 150 | [rotated-digits](src/rotated-digits/index.ts) | [:green_book:](src/rotated-digits/README.md) | Easy | [LeetCode](https://leetcode.com/problems/rotated-digits) | String |\n| 151 | [excel-sheet-column-number](src/excel-sheet-column-number/index.ts) | [:green_book:](src/excel-sheet-column-number/README.md) | Easy | [LeetCode](https://leetcode.com/problems/excel-sheet-column-number) | Math |\n| 152 | [ransom-note](src/ransom-note/index.ts) | [:green_book:](src/ransom-note/README.md) | Easy | [LeetCode](https://leetcode.com/problems/ransom-note) | String |\n| 153 | [k-diff-pairs-in-an-array](src/k-diff-pairs-in-an-array/index.ts) | [:green_book:](src/k-diff-pairs-in-an-array/README.md) | Easy | [LeetCode](https://leetcode.com/problems/k-diff-pairs-in-an-array) | Array |\n| 154 | [third-maximum-number](src/third-maximum-number/index.ts) | [:green_book:](src/third-maximum-number/README.md) | Easy | [LeetCode](https://leetcode.com/problems/third-maximum-number) | Array |\n| 155 | [single-element-in-a-sorted-array](src/single-element-in-a-sorted-array/index.ts) | [:green_book:](src/single-element-in-a-sorted-array/README.md) | Medium | [LeetCode](https://leetcode.com/problems/single-element-in-a-sorted-array) | Array |\n| 156 | [single-number-iii](src/single-number-iii/index.ts) | [:green_book:](src/single-number-iii/README.md) | Medium | [LeetCode](https://leetcode.com/problems/single-number-iii) | Array |\n| 157 | [arithmetic-slices](src/arithmetic-slices/index.ts) | [:green_book:](src/arithmetic-slices/README.md) | Medium | [LeetCode](https://leetcode.com/problems/arithmetic-slices) | Math,DP |\n| 158 | [palindromic-substrings](src/palindromic-substrings/index.ts) | [:green_book:](src/palindromic-substrings/README.md) | Medium | [LeetCode](https://leetcode.com/problems/palindromic-substrings) | String,DP |\n| 159 | [maximum-xor-of-two-numbers-in-an-array](src/maximum-xor-of-two-numbers-in-an-array/index.ts) | [:green_book:](src/maximum-xor-of-two-numbers-in-an-array/README.md) | Medium | [LeetCode](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array) | Bit |\n| 160 | [sort-characters-by-frequency](src/sort-characters-by-frequency/index.ts) | [:green_book:](src/sort-characters-by-frequency/README.md) | Medium | [LeetCode](https://leetcode.com/problems/sort-characters-by-frequency) | HashTable |\n| 161 | [rotate-string](src/rotate-string/index.ts) | [:green_book:](src/rotate-string/README.md) | Medium | [LeetCode](https://leetcode.com/problems/rotate-string) | String |\n| 162 | [product-of-array-except-self](src/product-of-array-except-self/index.ts) | [:green_book:](src/product-of-array-except-self/README.md) | Medium | [LeetCode](https://leetcode.com/problems/product-of-array-except-self) | Array |\n| 163 | [teemo-attacking](src/teemo-attacking/index.ts) | [:green_book:](src/teemo-attacking/README.md) | Medium | [LeetCode](https://leetcode.com/problems/teemo-attacking) | Array |\n| 164 | [queue-reconstruction-by-height](src/queue-reconstruction-by-height/index.ts) | [:green_book:](src/queue-reconstruction-by-height/README.md) | Medium | [LeetCode](https://leetcode.com/problems/queue-reconstruction-by-height) | Greedy |\n| 165 | [4sum-ii](src/4sum-ii/index.ts) | [:green_book:](src/4sum-ii/README.md) | Medium | [LeetCode](https://leetcode.com/problems/4sum-ii) | HashTable |\n| 166 | [01-matrix](src/01-matrix/index.ts) | [:green_book:](src/01-matrix/README.md) | Medium | [LeetCode](https://leetcode.com/problems/01-matrix) | HashTable |\n| 167 | [3sum](src/3sum/index.ts) | [:green_book:](src/3sum/README.md) | Medium | [LeetCode](https://leetcode.com/problems/3sum) | TwoPointers |\n| 168 | [3sum-closest](src/3sum-closest/index.ts) | [:green_book:](src/3sum-closest/README.md) | Medium | [LeetCode](https://leetcode.com/problems/3sum-closest) | TwoPointers |\n| 169 | [4Sum](src/4Sum/index.ts) | [:green_book:](src/4Sum/README.md) | Medium | [LeetCode](https://leetcode.com/problems/4sum) | TwoPointers |\n| 170 | [add-two-numbers](src/add-two-numbers/index.ts) | [:green_book:](src/add-two-numbers/README.md) | Medium | [LeetCode](https://leetcode.com/problems/add-two-numbers) | LinkedList |\n| 171 | [add-two-numbers-ii](src/add-two-numbers-ii/index.ts) | [:green_book:](src/add-two-numbers-ii/README.md) | Medium | [LeetCode](https://leetcode.com/problems/add-two-numbers-ii) | LinkedList |\n| 172 | [add-and-search-word-data-structure-design](src/add-and-search-word-data-structure-design/index.ts) | [:green_book:](src/add-and-search-word-data-structure-design/README.md) | Medium | [LeetCode](https://leetcode.com/problems/add-and-search-word-data-structure-design) | LinkedList |\n| 173 | [additive-number](src/additive-number/index.ts) | [:green_book:](src/additive-number/README.md) | Medium | [LeetCode](https://leetcode.com/problems/additive-number) | String |\n| 174 | [assign-cookies](src/assign-cookies/index.ts) | [:green_book:](src/assign-cookies/README.md) | Easy | [LeetCode](https://leetcode.com/problems/assign-cookies) | Greedy |\n| 175 | [basic-calculator](src/basic-calculator/index.ts) | [:green_book:](src/basic-calculator/README.md) | Medium | [LeetCode](https://leetcode.com/problems/basic-calculator) | Stack |\n| 176 | [basic-calculator-ii](src/basic-calculator-ii/index.ts) | [:green_book:](src/basic-calculator-ii/README.md) | Medium | [LeetCode](https://leetcode.com/problems/basic-calculator-ii) | Stack |\n| 177 | [target-sum](src/target-sum/index.ts) | [:green_book:](src/target-sum/README.md) | Medium | [LeetCode](https://leetcode.com/problems/target-sum) | DP |\n| 178 | [implement-queue-using-stacks](src/implement-queue-using-stacks/index.ts) | [:green_book:](src/implement-queue-using-stacks/README.md) | Easy | [LeetCode](https://leetcode.com/problems/implement-queue-using-stacks) | Stack |\n| 179 | [implement-stack-using-queues](src/implement-stack-using-queues/index.ts) | [:green_book:](src/implement-stack-using-queues/README.md) | Easy | [LeetCode](https://leetcode.com/problems/implement-stack-using-queues) | Stack |\n| 180 | [next-greater-element-ii](src/next-greater-element-ii/index.ts) | [:green_book:](src/next-greater-element-ii/README.md) | Medium | [LeetCode](https://leetcode.com/problems/next-greater-element-ii) | Stack |\n| 181 | [binary-tree-tilt](src/_trees/binary-tree-tilt/index.ts) | [:green_book:](src/_trees/binary-tree-tilt/README.md) | Easy | [LeetCode](https://leetcode.com/problems/binary-tree-tilt) | Tree |\n| 182 | [diameter-of-binary-tree](src/_trees/diameter-of-binary-tree/index.ts) | [:green_book:](src/_trees/diameter-of-binary-tree/README.md) | Easy | [LeetCode](https://leetcode.com/problems/diameter-of-binary-tree) | Tree |\n| 183 | [symmetric-tree](src/_trees/symmetric-tree/index.ts) | [:green_book:](src/_trees/symmetric-tree/README.md) | Easy | [LeetCode](https://leetcode.com/problems/symmetric-tree) | Tree |\n| 184 | [second-minimum-node-in-a-binary-tree](src/_trees/second-minimum-node-in-a-binary-tree/index.ts) | [:green_book:](src/_trees/second-minimum-node-in-a-binary-tree/README.md) | Easy | [LeetCode](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree) | Tree |\n| 185 | [subtree-of-another-tree](src/_trees/subtree-of-another-tree/index.ts) | [:green_book:](src/_trees/subtree-of-another-tree/README.md) | Easy | [LeetCode](https://leetcode.com/problems/subtree-of-another-tree) | Tree |\n| 186 | [binary-tree-paths](src/_trees/binary-tree-paths/index.ts) | [:green_book:](src/_trees/binary-tree-paths/README.md) | Easy | [LeetCode](https://leetcode.com/problems/binary-tree-paths) | DFS |\n| 187 | [path-sum](src/_trees/path-sum/index.ts) | [:green_book:](src/_trees/path-sum/README.md) | Easy | [LeetCode](https://leetcode.com/problems/path-sum) | DFS |\n| 188 | [minimum-depth-of-binary-tree](src/_trees/minimum-depth-of-binary-tree/index.ts) | [:green_book:](src/_trees/minimum-depth-of-binary-tree/README.md) | Easy | [LeetCode](https://leetcode.com/problems/minimum-depth-of-binary-tree) | DFS |\n| 189 | [find-bottom-left-tree-value](src/_trees/find-bottom-left-tree-value/index.ts) | [:green_book:](src/_trees/find-bottom-left-tree-value/README.md) | Medium | [LeetCode](https://leetcode.com/problems/find-bottom-left-tree-value) | DFS |\n| 190 | [decode-string](src/decode-string/index.ts) | [:green_book:](src/decode-string/README.md) | Medium | [LeetCode](https://leetcode.com/problems/decode-string) | DFS,Stack |\n| 191 | [find-largest-value-in-each-tree-row](src/_trees/find-largest-value-in-each-tree-row/index.ts) | [:green_book:](src/_trees/find-largest-value-in-each-tree-row/README.md) | Medium | [LeetCode](https://leetcode.com/problems/find-largest-value-in-each-tree-row) | DFS |\n| 192 | [max-area-of-island](src/max-area-of-island/index.ts) | [:green_book:](src/max-area-of-island/README.md) | Easy | [LeetCode](https://leetcode.com/problems/max-area-of-island) | DFS |\n| 193 | [flood-fill](src/flood-fill/index.ts) | [:green_book:](src/flood-fill/README.md) | Easy | [LeetCode](https://leetcode.com/problems/flood-fill) | DFS |\n| 194 | [balanced-binary-tree](src/_trees/balanced-binary-tree/index.ts) | [:green_book:](src/_trees/balanced-binary-tree/README.md) | Easy | [LeetCode](https://leetcode.com/problems/balanced-binary-tree) | DFS |\n| 195 | [friend-circles](src/friend-circles/index.ts) | [:green_book:](src/friend-circles/README.md) | Medium | [LeetCode](https://leetcode.com/problems/friend-circles) | DFS |\n| 196 | [house-robber-iii](src/_trees/house-robber-iii/index.ts) | [:green_book:](src/_trees/house-robber-iii/README.md) | Medium | [LeetCode](https://leetcode.com/problems/house-robber-iii) | DFS |\n| 197 | [increasing-subsequences](src/increasing-subsequences/index.ts) | [:green_book:](src/increasing-subsequences/README.md) | Medium | [LeetCode](https://leetcode.com/problems/increasing-subsequences) | DFS |\n| 198 | [sum-root-to-leaf-numbers](src/_trees/sum-root-to-leaf-numbers/index.ts) | [:green_book:](src/_trees/sum-root-to-leaf-numbers/README.md) | Medium | [LeetCode](https://leetcode.com/problems/sum-root-to-leaf-numbers) | DFS |\n| 199 | [number-of-islands](src/number-of-islands/index.ts) | [:green_book:](src/number-of-islands/README.md) | Medium | [LeetCode](https://leetcode.com/problems/number-of-islands) | DFS |\n| 200 | [path-sum-ii](src/_trees/path-sum-ii/index.ts) | [:green_book:](src/_trees/path-sum-ii/README.md) | Medium | [LeetCode](https://leetcode.com/problems/path-sum-ii) | DFS |\n| 201 | [matchsticks-to-square](src/matchsticks-to-square/index.ts) | [:green_book:](src/matchsticks-to-square/README.md) | Medium | [LeetCode](https://leetcode.com/problems/matchsticks-to-square) | DFS |\n| 202 | [two-sum](src/two-sum/index.ts) | [:green_book:](src/two-sum/README.md) | Easy | [LeetCode](https://leetcode.com/problems/two-sum) | Array |\n| 203 | [unique-morse-code-words](src/unique-morse-code-words/index.ts) | [:green_book:](src/unique-morse-code-words/README.md) | Easy | [LeetCode](https://leetcode.com/problems/unique-morse-code-words) | Hash |\n| 204 | [image-smoother](src/image-smoother/index.ts) | [:green_book:](src/image-smoother/README.md) | Easy | [LeetCode](https://leetcode.com/problems/image-smoother) | Array |\n| 205 | [pascals-triangle](src/pascals-triangle/index.ts) | [:green_book:](src/pascals-triangle/README.md) | Easy | [LeetCode](https://leetcode.com/problems/pascals-triangle) | Array |\n| 206 | [pascals-triangle-ii](src/pascals-triangle-ii/index.ts) | [:green_book:](src/pascals-triangle-ii/README.md) | Easy | [LeetCode](https://leetcode.com/problems/pascals-triangle-ii) | Array |\n| 207 | [shortest-unsorted-continuous-subarray](src/shortest-unsorted-continuous-subarray/index.ts) | [:green_book:](src/shortest-unsorted-continuous-subarray/README.md) | Easy | [LeetCode](https://leetcode.com/problems/shortest-unsorted-continuous-subarray) | Array |\n| 208 | [Non-decreasingArray](src/non-decreasingArray/index.ts) | [:green_book:](src/non-decreasingArray/README.md) | Easy | [LeetCode](https://leetcode.com/problems/non-decreasing-array) | Array |\n| 209 | [range-addition-ii](src/range-addition-ii/index.ts) | [:green_book:](src/range-addition-ii/README.md) | Easy | [LeetCode](https://leetcode.com/problems/range-addition-ii) | Math |\n| 210 | [repeated-string-match](src/repeated-string-match/index.ts) | [:green_book:](src/repeated-string-match/README.md) | Easy | [LeetCode](https://leetcode.com/problems/repeated-string-match) | Math |\n| 211 | [house-robber](src/house-robber/index.ts) | [:green_book:](src/house-robber/README.md) | Easy | [LeetCode](https://leetcode.com/problems/house-robber) | DP |\n| 212 | [minimum-ascii-delete-sum-for-two-strings](src/minimum-ascii-delete-sum-for-two-strings/index.ts) | [:green_book:](src/minimum-ascii-delete-sum-for-two-strings/README.md) | Medium | [LeetCode](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings) | DP |\n| 213 | [maximum-length-of-pair-chain](src/maximum-length-of-pair-chain/index.ts) | [:green_book:](src/maximum-length-of-pair-chain/README.md) | Medium | [LeetCode](https://leetcode.com/problems/maximum-length-of-pair-chain) | DP,Greedy |\n| 214 | [integer-break](src/integer-break/index.ts) | [:green_book:](src/integer-break/README.md) | Medium | [LeetCode](https://leetcode.com/problems/integer-break) | DP |\n| 215 | [count-numbers-with-unique-digits](src/count-numbers-with-unique-digits/index.ts) | [:green_book:](src/count-numbers-with-unique-digits/README.md) | Medium | [LeetCode](https://leetcode.com/problems/count-numbers-with-unique-digits) | DP |\n| 216 | [best-time-to-buy-and-sell-stock-with-transaction-fee](src/best-time-to-buy-and-sell-stock-with-transaction-fee/index.ts) | [:green_book:](src/best-time-to-buy-and-sell-stock-with-transaction-fee/README.md) | Medium | [LeetCode](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | DP,Greedy |\n| 217 | [shopping-offers](src/shopping-offers/index.ts) | [:green_book:](src/shopping-offers/README.md) | Medium | [LeetCode](https://leetcode.com/problems/shopping-offers) | DP,DFS |\n| 218 | [predict-the-winner](src/predict-the-winner/index.ts) | [:green_book:](src/predict-the-winner/README.md) | Medium | [LeetCode](https://leetcode.com/problems/predict-the-winner) | DP |\n| 219 | [2-keys-keyboard](src/2-keys-keyboard/index.ts) | [:green_book:](src/2-keys-keyboard/README.md) | Medium | [LeetCode](https://leetcode.com/problems/2-keys-keyboard) | DP |\n| 220 | [is-subsequence](src/is-subsequence/index.ts) | [:green_book:](src/is-subsequence/README.md) | Medium | [LeetCode](https://leetcode.com/problems/is-subsequence) | DP |\n| 221 | [delete-and-earn](src/delete-and-earn/index.ts) | [:green_book:](src/delete-and-earn/README.md) | Medium | [LeetCode](https://leetcode.com/problems/delete-and-earn) | DP |\n| 222 | [longest-palindromic-subsequence](src/longest-palindromic-subsequence/index.ts) | [:green_book:](src/longest-palindromic-subsequence/README.md) | Medium | [LeetCode](https://leetcode.com/problems/longest-palindromic-subsequence) | DP |\n| 223 | [combination-sum-iv](src/combination-sum-iv/index.ts) | [:green_book:](src/combination-sum-iv/README.md) | Medium | [LeetCode](https://leetcode.com/problems/combination-sum-iv) | DP |\n| 224 | [maximum-length-of-repeated-subarray](src/maximum-length-of-repeated-subarray/index.ts) | [:green_book:](src/maximum-length-of-repeated-subarray/README.md) | Medium | [LeetCode](https://leetcode.com/problems/maximum-length-of-repeated-subarray) | DP |\n| 225 | [minimum-path-sum](src/minimum-path-sum/index.ts) | [:green_book:](src/minimum-path-sum/README.md) | Medium | [LeetCode](https://leetcode.com/problems/minimum-path-sum) | DP |\n| 226 | [largest-sum-of-averages](src/largest-sum-of-averages/index.ts) | [:green_book:](src/largest-sum-of-averages/README.md) | Medium | [LeetCode](https://leetcode.com/problems/largest-sum-of-averages) | DP |\n| 227 | [longest-increasing-subsequence](src/longest-increasing-subsequence/index.ts) | [:green_book:](src/longest-increasing-subsequence/README.md) | Medium | [LeetCode](https://leetcode.com/problems/longest-increasing-subsequence) | DP |\n| 228 | [partition-equal-subset-sum](src/partition-equal-subset-sum/index.ts) | [:green_book:](src/partition-equal-subset-sum/README.md) | Medium | [LeetCode](https://leetcode.com/problems/partition-equal-subset-sum) | DP |\n| 229 | [flipping-an-image](src/flipping-an-image/index.ts) | [:green_book:](src/flipping-an-image/README.md) | Easy | [LeetCode](https://leetcode.com/problems/flipping-an-image) | Array |\n| 230 | [positions-of-large-groups](src/positions-of-large-groups/index.ts) | [:green_book:](src/positions-of-large-groups/README.md) | Easy | [LeetCode](https://leetcode.com/problems/positions-of-large-groups) | Array |\n| 231 | [magic-squares-in-grid](src/magic-squares-in-grid/index.ts) | [:green_book:](src/magic-squares-in-grid/README.md) | Easy | [LeetCode](https://leetcode.com/problems/magic-squares-in-grid) | Array |\n| 232 | [array-nesting](src/array-nesting/index.ts) | [:green_book:](src/array-nesting/README.md) | Medium | [LeetCode](https://leetcode.com/problems/array-nesting) | Array |\n| 233 | [combination-sum-iii](src/combination-sum-iii/index.ts) | [:green_book:](src/combination-sum-iii/README.md) | Medium | [LeetCode](https://leetcode.com/problems/combination-sum-iii) | Backtracking |\n| 234 | [subsets](src/subsets/index.ts) | [:green_book:](src/subsets/README.md) | Medium | [LeetCode](https://leetcode.com/problems/subsets) | Backtracking |\n| 235 | [my-calendar-i](src/my-calendar-i/index.ts) | [:green_book:](src/my-calendar-i/README.md) | Medium | [LeetCode](https://leetcode.com/problems/my-calendar-i) | Array |\n| 236 | [combination-sum](src/combination-sum/index.ts) | [:green_book:](src/combination-sum/README.md) | Medium | [LeetCode](https://leetcode.com/problems/combination-sum) | Backtracking |\n| 237 | [spiral-matrix-ii](src/spiral-matrix-ii/index.ts) | [:green_book:](src/spiral-matrix-ii/README.md) | Medium | [LeetCode](https://leetcode.com/problems/spiral-matrix-ii) | Backtracking |\n| 238 | [number-of-subarrays-with-bounded-maximum](src/number-of-subarrays-with-bounded-maximum/index.ts) | [:green_book:](src/number-of-subarrays-with-bounded-maximum/README.md) | Medium | [LeetCode](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum) | Array |\n| 239 | [subarray-sum-equals-k](src/subarray-sum-equals-k/index.ts) | [:green_book:](src/subarray-sum-equals-k/README.md) | Medium | [LeetCode](https://leetcode.com/problems/subarray-sum-equals-k) | HashTable |\n| 240 | [sort-colors](src/sort-colors/index.ts) | [:green_book:](src/sort-colors/README.md) | Medium | [LeetCode](https://leetcode.com/problems/sort-colors) | HashTable |\n| 241 | [subsets-ii](src/subsets-ii/index.ts) | [:green_book:](src/subsets-ii/README.md) | Medium | [LeetCode](https://leetcode.com/problems/subsets-ii) | Backtracking |\n| 242 | [summary-ranges](src/summary-ranges/index.ts) | [:green_book:](src/summary-ranges/README.md) | Medium | [LeetCode](https://leetcode.com/problems/summary-ranges) | Array |\n| 243 | [merge-intervals](src/merge-intervals/index.ts) | [:green_book:](src/merge-intervals/README.md) | Medium | [LeetCode](https://leetcode.com/problems/merge-intervals) | Array |\n| 244 | [minimum-moves-to-equal-array-elements](src/minimum-moves-to-equal-array-elements/index.ts) | [:green_book:](src/minimum-moves-to-equal-array-elements/README.md) | Easy | [LeetCode](https://leetcode.com/problems/minimum-moves-to-equal-array-elements) | Math |\n| 245 | [minimum-moves-to-equal-array-elements-ii](src/minimum-moves-to-equal-array-elements-ii/index.ts) | [:green_book:](src/minimum-moves-to-equal-array-elements-ii/README.md) | Easy | [LeetCode](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii) | Math |\n| 246 | [backspace-string-compare](src/backspace-string-compare/index.ts) | [:green_book:](src/backspace-string-compare/README.md) | Easy | [LeetCode](https://leetcode.com/problems/backspace-string-compare) | Stack |\n| 247 | [partition-labels](src/partition-labels/index.ts) | [:green_book:](src/partition-labels/README.md) | Medium | [LeetCode](https://leetcode.com/problems/partition-labels) | TwoPointers,Greedy |\n| 248 | [peak-index-in-a-mountain-array](src/peak-index-in-a-mountain-array/index.ts) | [:green_book:](src/peak-index-in-a-mountain-array/README.md) | Easy | [LeetCode](https://leetcode.com/problems/peak-index-in-a-mountain-array) | BinarySearch |\n| 249 | [goat-latin](src/goat-latin/index.ts) | [:green_book:](src/goat-latin/README.md) | Easy | [LeetCode](https://leetcode.com/problems/goat-latin) | String |\n| 250 | [custom-sort-string](src/custom-sort-string/index.ts) | [:green_book:](src/custom-sort-string/README.md) | Medium | [LeetCode](https://leetcode.com/problems/custom-sort-string) | String |\n| 251 | [nth-digit](src/nth-digit/index.ts) | [:green_book:](src/nth-digit/README.md) | Easy | [LeetCode](https://leetcode.com/problems/nth-digit) | Math |\n| 252 | [transpose-matrix](src/transpose-matrix/index.ts) | [:green_book:](src/transpose-matrix/README.md) | Easy | [LeetCode](https://leetcode.com/problems/transpose-matrix) | Array |\n| 253 | [maximize-distance-to-closest-person](src/maximize-distance-to-closest-person/index.ts) | [:green_book:](src/maximize-distance-to-closest-person/README.md) | Easy | [LeetCode](https://leetcode.com/problems/maximize-distance-to-closest-person) | Array |\n| 254 | [bulls-and-cows](src/bulls-and-cows/index.ts) | [:green_book:](src/bulls-and-cows/README.md) | Medium | [LeetCode](https://leetcode.com/problems/bulls-and-cows) | HashTable |\n| 255 | [construct-the-rectangle](src/construct-the-rectangle/index.ts) | [:green_book:](src/construct-the-rectangle/README.md) | Easy | [LeetCode](https://leetcode.com/problems/construct-the-rectangle) | Math |\n| 256 | [most-common-word](src/most-common-word/index.ts) | [:green_book:](src/most-common-word/README.md) | Easy | [LeetCode](https://leetcode.com/problems/most-common-word) | String |\n| 257 | [shortest-distance-to-a-character](src/shortest-distance-to-a-character/index.ts) | [:green_book:](src/shortest-distance-to-a-character/README.md) | Easy | [LeetCode](https://leetcode.com/problems/shortest-distance-to-a-character) | String |\n| 258 | [binary-gap](src/binary-gap/index.ts) | [:green_book:](src/binary-gap/README.md) | Easy | [LeetCode](https://leetcode.com/problems/binary-gap) | String |\n| 259 | [lemonade-change](src/lemonade-change/index.ts) | [:green_book:](src/lemonade-change/README.md) | Easy | [LeetCode](https://leetcode.com/problems/lemonade-change) | Greedy |\n| 260 | [excel-sheet-column-title](src/excel-sheet-column-title/index.ts) | [:green_book:](src/excel-sheet-column-title/README.md) | Easy | [LeetCode](https://leetcode.com/problems/excel-sheet-column-title) | Math |\n| 261 | [largest-triangle-area](src/largest-triangle-area/index.ts) | [:green_book:](src/largest-triangle-area/README.md) | Easy | [LeetCode](https://leetcode.com/problems/largest-triangle-area) | Math |\n| 262 | [reordered-power-of-2](src/reordered-power-of-2/index.ts) | [:green_book:](src/reordered-power-of-2/README.md) | Medium | [LeetCode](https://leetcode.com/problems/reordered-power-of-2) | Math |\n| 263 | [spiral-matrix](src/spiral-matrix/index.ts) | | Medium | [LeetCode](https://leetcode.com/problems/spiral-matrix) | Math |\n| 264 | [long-pressed-name](src/long-pressed-name/index.ts) | | Easy | [LeetCode](https://leetcode.com/problems/long-pressed-name) | String |\n| 265 | [uncommon-words-from-two-sentences](src/uncommon-words-from-two-sentences/index.js) | | Easy | [LeetCode](https://leetcode.com/problems/uncommon-words-from-two-sentences) | String |\n| 266 | [reverse-only-letters](src/reverse-only-letters/index.js) | | Easy | [LeetCode](https://leetcode.com/problems/reverse-only-letters) | String |\n| 267 | [powerful-integers](src/powerful-integers/index.js) | | Easy | [LeetCode](https://leetcode.com/problems/powerful-integers) | Math |\n| 268 | [minimum-add-to-make-parentheses-valid](src/minimum-add-to-make-parentheses-valid/index.js) | | Easy | [LeetCode](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid) | String |\n\n## Collaborators\n\n[\u003cimg src=\"https://github.com/tangweikun.png\" width=\"100px;\"/\u003e](https://github.com/tangweikun)\u003cbr/\u003e [\u003csub\u003eweikun tang\u003c/sub\u003e](https://github.com/tangweikun)\n","funding_links":[],"categories":["Javascript"],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftangweikun%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftangweikun%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftangweikun%2Fleetcode/lists"}