{"id":16355085,"url":"https://github.com/revan-zhang/leetcode-javascript","last_synced_at":"2025-08-12T14:41:20.779Z","repository":{"id":39422532,"uuid":"74674996","full_name":"revan-zhang/leetcode-javascript","owner":"revan-zhang","description":":spider::spider: Leetcode Solutions written in javascript","archived":false,"fork":false,"pushed_at":"2017-10-04T03:27:15.000Z","size":586,"stargazers_count":134,"open_issues_count":2,"forks_count":30,"subscribers_count":5,"default_branch":"master","last_synced_at":"2025-06-22T15:54:12.743Z","etag":null,"topics":["javascript","leetcode","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":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/revan-zhang.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}},"created_at":"2016-11-24T13:18:54.000Z","updated_at":"2025-03-25T11:47:12.000Z","dependencies_parsed_at":"2022-09-20T03:10:07.402Z","dependency_job_id":null,"html_url":"https://github.com/revan-zhang/leetcode-javascript","commit_stats":null,"previous_names":["revan-zhang/leetcode-javascript","loatheb/leetcode-javascript"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/revan-zhang/leetcode-javascript","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/revan-zhang%2Fleetcode-javascript","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/revan-zhang%2Fleetcode-javascript/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/revan-zhang%2Fleetcode-javascript/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/revan-zhang%2Fleetcode-javascript/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/revan-zhang","download_url":"https://codeload.github.com/revan-zhang/leetcode-javascript/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/revan-zhang%2Fleetcode-javascript/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":270078382,"owners_count":24523372,"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","status":"online","status_checked_at":"2025-08-12T02:00:09.011Z","response_time":80,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["javascript","leetcode","leetcode-solutions"],"created_at":"2024-10-11T01:39:00.027Z","updated_at":"2025-08-12T14:41:20.705Z","avatar_url":"https://github.com/revan-zhang.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# :pencil2: Leetcode Solutions with javascript\nUpdate time:  2016-11-24 21:14:45\n\nAuto created by [leetcode_generate](https://github.com/bonfy/leetcode) [Usage](https://github.com/bonfy/leetcode/blob/master/README_leetcode_generate.md)\n\nI have solved **141   /   429** problems\nwhile there are **78** problems still locked.\n\nIf you have any question, please give me an [issue](https://github.com/zz-zhangzhao/leetcode-javascript/issues).\n\nIf you are loving solving problems in leetcode, please contact me to enjoy it together!\n\n(Notes: :lock: means you need to buy a book from Leetcode to unlock the problem)\n\n| # | Title | Source Code | Article | Difficulty |\n|:---:|:---:|:---:|:---:|:---:|\n|1|[two-sum](https://leetcode.com/problems/two-sum)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/001-two-sum/two-sum.js)|[:memo:](https://leetcode.com/articles/two-sum/)|Easy|\n|2|[add-two-numbers](https://leetcode.com/problems/add-two-numbers)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/002-add-two-numbers/add-two-numbers.js)|[:memo:](https://leetcode.com/articles/add-two-numbers/)|Medium|\n|3|[longest-substring-without-repeating-characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/003-longest-substring-without-repeating-characters/longest-substring-without-repeating-characters.js)|[:memo:](https://leetcode.com/articles/longest-substring-without-repeating-characters/)|Medium|\n|4|[median-of-two-sorted-arrays](https://leetcode.com/problems/median-of-two-sorted-arrays)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/004-median-of-two-sorted-arrays/median-of-two-sorted-arrays.js)||Hard|\n|5|[longest-palindromic-substring](https://leetcode.com/problems/longest-palindromic-substring)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/005-longest-palindromic-substring/longest-palindromic-substring.js)|[:memo:](https://leetcode.com/articles/longest-palindromic-substring/)|Medium|\n|6|[zigzag-conversion](https://leetcode.com/problems/zigzag-conversion)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/006-zigzag-conversion/zigzag-conversion.js)||Easy|\n|7|[reverse-integer](https://leetcode.com/problems/reverse-integer)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/007-reverse-integer/reverse-integer.js)||Easy|\n|8|[string-to-integer-atoi](https://leetcode.com/problems/string-to-integer-atoi)|||Easy|\n|9|[palindrome-number](https://leetcode.com/problems/palindrome-number)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/009-palindrome-number/palindrome-number.js)||Easy|\n|10|[regular-expression-matching](https://leetcode.com/problems/regular-expression-matching)|||Hard|\n|11|[container-with-most-water](https://leetcode.com/problems/container-with-most-water)||[:memo:](https://leetcode.com/articles/container-most-water/)|Medium|\n|12|[integer-to-roman](https://leetcode.com/problems/integer-to-roman)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/012-integer-to-roman/integer-to-roman.js)||Medium|\n|13|[roman-to-integer](https://leetcode.com/problems/roman-to-integer)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/013-roman-to-integer/roman-to-integer.js)||Easy|\n|14|[longest-common-prefix](https://leetcode.com/problems/longest-common-prefix)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/014-longest-common-prefix/longest-common-prefix.js)|[:memo:](https://leetcode.com/articles/longest-common-prefix/)|Easy|\n|15|[3sum](https://leetcode.com/problems/3sum)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/015-3sum/3sum.js)||Medium|\n|16|[3sum-closest](https://leetcode.com/problems/3sum-closest)|||Medium|\n|17|[letter-combinations-of-a-phone-number](https://leetcode.com/problems/letter-combinations-of-a-phone-number)|||Medium|\n|18|[4sum](https://leetcode.com/problems/4sum)|||Medium|\n|19|[remove-nth-node-from-end-of-list](https://leetcode.com/problems/remove-nth-node-from-end-of-list)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/019-remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list.js)|[:memo:](https://leetcode.com/articles/remove-nth-node-end-list/)|Easy|\n|20|[valid-parentheses](https://leetcode.com/problems/valid-parentheses)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/020-valid-parentheses/valid-parentheses.js)||Easy|\n|21|[merge-two-sorted-lists](https://leetcode.com/problems/merge-two-sorted-lists)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/021-merge-two-sorted-lists/merge-two-sorted-lists.js)||Easy|\n|22|[generate-parentheses](https://leetcode.com/problems/generate-parentheses)|||Medium|\n|23|[merge-k-sorted-lists](https://leetcode.com/problems/merge-k-sorted-lists)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/023-merge-k-sorted-lists/merge-k-sorted-lists.js)||Hard|\n|24|[swap-nodes-in-pairs](https://leetcode.com/problems/swap-nodes-in-pairs)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/024-swap-nodes-in-pairs/swap-nodes-in-pairs.js)||Easy|\n|25|[reverse-nodes-in-k-group](https://leetcode.com/problems/reverse-nodes-in-k-group)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/025-reverse-nodes-in-k-group/reverse-nodes-in-k-group.js)||Hard|\n|26|[remove-duplicates-from-sorted-array](https://leetcode.com/problems/remove-duplicates-from-sorted-array)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/026-remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array.js)|[:memo:](https://leetcode.com/articles/remove-duplicates-sorted-array/)|Easy|\n|27|[remove-element](https://leetcode.com/problems/remove-element)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/027-remove-element/remove-element.js)|[:memo:](https://leetcode.com/articles/remove-element/)|Easy|\n|28|[implement-strstr](https://leetcode.com/problems/implement-strstr)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/028-implement-strstr/implement-strstr.js)||Easy|\n|29|[divide-two-integers](https://leetcode.com/problems/divide-two-integers)|||Medium|\n|30|[substring-with-concatenation-of-all-words](https://leetcode.com/problems/substring-with-concatenation-of-all-words)|||Hard|\n|31|[next-permutation](https://leetcode.com/problems/next-permutation)||[:memo:](https://leetcode.com/articles/next-permutation/)|Medium|\n|32|[longest-valid-parentheses](https://leetcode.com/problems/longest-valid-parentheses)|||Hard|\n|33|[search-in-rotated-sorted-array](https://leetcode.com/problems/search-in-rotated-sorted-array)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/033-search-in-rotated-sorted-array/search-in-rotated-sorted-array.js)||Hard|\n|34|[search-for-a-range](https://leetcode.com/problems/search-for-a-range)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/034-search-for-a-range/search-for-a-range.js)||Medium|\n|35|[search-insert-position](https://leetcode.com/problems/search-insert-position)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/035-search-insert-position/search-insert-position.js)||Medium|\n|36|[valid-sudoku](https://leetcode.com/problems/valid-sudoku)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/036-valid-sudoku/valid-sudoku.js)||Easy|\n|37|[sudoku-solver](https://leetcode.com/problems/sudoku-solver)|||Hard|\n|38|[count-and-say](https://leetcode.com/problems/count-and-say)|||Easy|\n|39|[combination-sum](https://leetcode.com/problems/combination-sum)|||Medium|\n|40|[combination-sum-ii](https://leetcode.com/problems/combination-sum-ii)|||Medium|\n|41|[first-missing-positive](https://leetcode.com/problems/first-missing-positive)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/041-first-missing-positive/first-missing-positive.js)||Hard|\n|42|[trapping-rain-water](https://leetcode.com/problems/trapping-rain-water)|||Hard|\n|43|[multiply-strings](https://leetcode.com/problems/multiply-strings)|||Medium|\n|44|[wildcard-matching](https://leetcode.com/problems/wildcard-matching)|||Hard|\n|45|[jump-game-ii](https://leetcode.com/problems/jump-game-ii)|||Hard|\n|46|[permutations](https://leetcode.com/problems/permutations)|||Medium|\n|47|[permutations-ii](https://leetcode.com/problems/permutations-ii)|||Medium|\n|48|[rotate-image](https://leetcode.com/problems/rotate-image)|||Medium|\n|49|[anagrams](https://leetcode.com/problems/anagrams)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/049-anagrams/anagrams.js)||Medium|\n|50|[powx-n](https://leetcode.com/problems/powx-n)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/050-powx-n/powx-n.js)||Medium|\n|51|[n-queens](https://leetcode.com/problems/n-queens)|||Hard|\n|52|[n-queens-ii](https://leetcode.com/problems/n-queens-ii)|||Hard|\n|53|[maximum-subarray](https://leetcode.com/problems/maximum-subarray)|||Medium|\n|54|[spiral-matrix](https://leetcode.com/problems/spiral-matrix)|||Medium|\n|55|[jump-game](https://leetcode.com/problems/jump-game)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/055-jump-game/jump-game.js)|[:memo:](https://leetcode.com/articles/jump-game/)|Medium|\n|56|[merge-intervals](https://leetcode.com/problems/merge-intervals)|||Hard|\n|57|[insert-interval](https://leetcode.com/problems/insert-interval)|||Hard|\n|58|[length-of-last-word](https://leetcode.com/problems/length-of-last-word)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/058-length-of-last-word/length-of-last-word.js)||Easy|\n|59|[spiral-matrix-ii](https://leetcode.com/problems/spiral-matrix-ii)|||Medium|\n|60|[permutation-sequence](https://leetcode.com/problems/permutation-sequence)|||Medium|\n|61|[rotate-list](https://leetcode.com/problems/rotate-list)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/061-rotate-list/rotate-list.js)||Medium|\n|62|[unique-paths](https://leetcode.com/problems/unique-paths)|||Medium|\n|63|[unique-paths-ii](https://leetcode.com/problems/unique-paths-ii)|||Medium|\n|64|[minimum-path-sum](https://leetcode.com/problems/minimum-path-sum)|||Medium|\n|65|[valid-number](https://leetcode.com/problems/valid-number)|||Hard|\n|66|[plus-one](https://leetcode.com/problems/plus-one)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/066-plus-one/plus-one.js)||Easy|\n|67|[add-binary](https://leetcode.com/problems/add-binary)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/067-add-binary/add-binary.js)||Easy|\n|68|[text-justification](https://leetcode.com/problems/text-justification)|||Hard|\n|69|[sqrtx](https://leetcode.com/problems/sqrtx)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/069-sqrtx/sqrtx.js)||Medium|\n|70|[climbing-stairs](https://leetcode.com/problems/climbing-stairs)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/070-climbing-stairs/climbing-stairs.js)||Easy|\n|71|[simplify-path](https://leetcode.com/problems/simplify-path)|||Medium|\n|72|[edit-distance](https://leetcode.com/problems/edit-distance)|||Hard|\n|73|[set-matrix-zeroes](https://leetcode.com/problems/set-matrix-zeroes)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/073-set-matrix-zeroes/set-matrix-zeroes.js)||Medium|\n|74|[search-a-2d-matrix](https://leetcode.com/problems/search-a-2d-matrix)|||Medium|\n|75|[sort-colors](https://leetcode.com/problems/sort-colors)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/075-sort-colors/sort-colors.js)||Medium|\n|76|[minimum-window-substring](https://leetcode.com/problems/minimum-window-substring)|||Hard|\n|77|[combinations](https://leetcode.com/problems/combinations)|||Medium|\n|78|[subsets](https://leetcode.com/problems/subsets)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/078-subsets/subsets.js)||Medium|\n|79|[word-search](https://leetcode.com/problems/word-search)|||Medium|\n|80|[remove-duplicates-from-sorted-array-ii](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/080-remove-duplicates-from-sorted-array-ii/remove-duplicates-from-sorted-array-ii.js)||Medium|\n|81|[search-in-rotated-sorted-array-ii](https://leetcode.com/problems/search-in-rotated-sorted-array-ii)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/081-search-in-rotated-sorted-array-ii/search-in-rotated-sorted-array-ii.js)||Medium|\n|82|[remove-duplicates-from-sorted-list-ii](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/082-remove-duplicates-from-sorted-list-ii/remove-duplicates-from-sorted-list-ii.js)||Medium|\n|83|[remove-duplicates-from-sorted-list](https://leetcode.com/problems/remove-duplicates-from-sorted-list)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/083-remove-duplicates-from-sorted-list/remove-duplicates-from-sorted-list.js)|[:memo:](https://leetcode.com/articles/remove-duplicates-sorted-list/)|Easy|\n|84|[largest-rectangle-in-histogram](https://leetcode.com/problems/largest-rectangle-in-histogram)|||Hard|\n|85|[maximal-rectangle](https://leetcode.com/problems/maximal-rectangle)|||Hard|\n|86|[partition-list](https://leetcode.com/problems/partition-list)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/086-partition-list/partition-list.js)||Medium|\n|87|[scramble-string](https://leetcode.com/problems/scramble-string)|||Hard|\n|88|[merge-sorted-array](https://leetcode.com/problems/merge-sorted-array)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/088-merge-sorted-array/merge-sorted-array.js)||Easy|\n|89|[gray-code](https://leetcode.com/problems/gray-code)|||Medium|\n|90|[subsets-ii](https://leetcode.com/problems/subsets-ii)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/090-subsets-ii/subsets-ii.js)||Medium|\n|91|[decode-ways](https://leetcode.com/problems/decode-ways)|||Medium|\n|92|[reverse-linked-list-ii](https://leetcode.com/problems/reverse-linked-list-ii)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/092-reverse-linked-list-ii/reverse-linked-list-ii.js)||Medium|\n|93|[restore-ip-addresses](https://leetcode.com/problems/restore-ip-addresses)|||Medium|\n|94|[binary-tree-inorder-traversal](https://leetcode.com/problems/binary-tree-inorder-traversal)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/094-binary-tree-inorder-traversal/binary-tree-inorder-traversal.js)||Medium|\n|95|[unique-binary-search-trees-ii](https://leetcode.com/problems/unique-binary-search-trees-ii)|||Medium|\n|96|[unique-binary-search-trees](https://leetcode.com/problems/unique-binary-search-trees)|||Medium|\n|97|[interleaving-string](https://leetcode.com/problems/interleaving-string)|||Hard|\n|98|[validate-binary-search-tree](https://leetcode.com/problems/validate-binary-search-tree)|||Medium|\n|99|[recover-binary-search-tree](https://leetcode.com/problems/recover-binary-search-tree)|||Hard|\n|100|[same-tree](https://leetcode.com/problems/same-tree)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/100-same-tree/same-tree.js)||Easy|\n|101|[symmetric-tree](https://leetcode.com/problems/symmetric-tree)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/101-symmetric-tree/symmetric-tree.js)|[:memo:](https://leetcode.com/articles/symmetric-tree/)|Easy|\n|102|[binary-tree-level-order-traversal](https://leetcode.com/problems/binary-tree-level-order-traversal)|||Easy|\n|103|[binary-tree-zigzag-level-order-traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal)|||Medium|\n|104|[maximum-depth-of-binary-tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/104-maximum-depth-of-binary-tree/maximum-depth-of-binary-tree.js)||Easy|\n|105|[construct-binary-tree-from-preorder-and-inorder-traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal)|||Medium|\n|106|[construct-binary-tree-from-inorder-and-postorder-traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal)|||Medium|\n|107|[binary-tree-level-order-traversal-ii](https://leetcode.com/problems/binary-tree-level-order-traversal-ii)|||Easy|\n|108|[convert-sorted-array-to-binary-search-tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree)|||Medium|\n|109|[convert-sorted-list-to-binary-search-tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree)|||Medium|\n|110|[balanced-binary-tree](https://leetcode.com/problems/balanced-binary-tree)|||Easy|\n|111|[minimum-depth-of-binary-tree](https://leetcode.com/problems/minimum-depth-of-binary-tree)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/111-minimum-depth-of-binary-tree/minimum-depth-of-binary-tree.js)||Easy|\n|112|[path-sum](https://leetcode.com/problems/path-sum)|||Easy|\n|113|[path-sum-ii](https://leetcode.com/problems/path-sum-ii)|||Medium|\n|114|[flatten-binary-tree-to-linked-list](https://leetcode.com/problems/flatten-binary-tree-to-linked-list)|||Medium|\n|115|[distinct-subsequences](https://leetcode.com/problems/distinct-subsequences)|||Hard|\n|116|[populating-next-right-pointers-in-each-node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node)|||Medium|\n|117|[populating-next-right-pointers-in-each-node-ii](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii)|||Hard|\n|118|[pascals-triangle](https://leetcode.com/problems/pascals-triangle)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/118-pascals-triangle/pascals-triangle.js)||Easy|\n|119|[pascals-triangle-ii](https://leetcode.com/problems/pascals-triangle-ii)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/119-pascals-triangle-ii/pascals-triangle-ii.js)||Easy|\n|120|[triangle](https://leetcode.com/problems/triangle)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/120-triangle/triangle.js)||Medium|\n|121|[best-time-to-buy-and-sell-stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/121-best-time-to-buy-and-sell-stock/best-time-to-buy-and-sell-stock.js)|[:memo:](https://leetcode.com/articles/best-time-buy-and-sell-stock/)|Easy|\n|122|[best-time-to-buy-and-sell-stock-ii](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/122-best-time-to-buy-and-sell-stock-ii/best-time-to-buy-and-sell-stock-ii.js)|[:memo:](https://leetcode.com/articles/best-time-buy-and-sell-stock-ii/)|Medium|\n|123|[best-time-to-buy-and-sell-stock-iii](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii)|||Hard|\n|124|[binary-tree-maximum-path-sum](https://leetcode.com/problems/binary-tree-maximum-path-sum)|||Hard|\n|125|[valid-palindrome](https://leetcode.com/problems/valid-palindrome)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/125-valid-palindrome/valid-palindrome.js)||Easy|\n|126|[word-ladder-ii](https://leetcode.com/problems/word-ladder-ii)|||Hard|\n|127|[word-ladder](https://leetcode.com/problems/word-ladder)|||Medium|\n|128|[longest-consecutive-sequence](https://leetcode.com/problems/longest-consecutive-sequence)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/128-longest-consecutive-sequence/longest-consecutive-sequence.js)||Hard|\n|129|[sum-root-to-leaf-numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers)|||Medium|\n|130|[surrounded-regions](https://leetcode.com/problems/surrounded-regions)|||Medium|\n|131|[palindrome-partitioning](https://leetcode.com/problems/palindrome-partitioning)|||Medium|\n|132|[palindrome-partitioning-ii](https://leetcode.com/problems/palindrome-partitioning-ii)|||Hard|\n|133|[clone-graph](https://leetcode.com/problems/clone-graph)|||Medium|\n|134|[gas-station](https://leetcode.com/problems/gas-station)|||Medium|\n|135|[candy](https://leetcode.com/problems/candy)|||Hard|\n|136|[single-number](https://leetcode.com/problems/single-number)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/136-single-number/single-number.js)||Easy|\n|137|[single-number-ii](https://leetcode.com/problems/single-number-ii)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/137-single-number-ii/single-number-ii.js)||Medium|\n|138|[copy-list-with-random-pointer](https://leetcode.com/problems/copy-list-with-random-pointer)|||Hard|\n|139|[word-break](https://leetcode.com/problems/word-break)|||Medium|\n|140|[word-break-ii](https://leetcode.com/problems/word-break-ii)|||Hard|\n|141|[linked-list-cycle](https://leetcode.com/problems/linked-list-cycle)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/141-linked-list-cycle/linked-list-cycle.js)|[:memo:](https://leetcode.com/articles/linked-list-cycle/)|Easy|\n|142|[linked-list-cycle-ii](https://leetcode.com/problems/linked-list-cycle-ii)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/142-linked-list-cycle-ii/linked-list-cycle-ii.js)||Medium|\n|143|[reorder-list](https://leetcode.com/problems/reorder-list)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/143-reorder-list/reorder-list.js)||Medium|\n|144|[binary-tree-preorder-traversal](https://leetcode.com/problems/binary-tree-preorder-traversal)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/144-binary-tree-preorder-traversal/binary-tree-preorder-traversal.js)||Medium|\n|145|[binary-tree-postorder-traversal](https://leetcode.com/problems/binary-tree-postorder-traversal)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/145-binary-tree-postorder-traversal/binary-tree-postorder-traversal.js)||Hard|\n|146|[lru-cache](https://leetcode.com/problems/lru-cache)|||Hard|\n|147|[insertion-sort-list](https://leetcode.com/problems/insertion-sort-list)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/147-insertion-sort-list/insertion-sort-list.js)||Medium|\n|148|[sort-list](https://leetcode.com/problems/sort-list)|||Medium|\n|149|[max-points-on-a-line](https://leetcode.com/problems/max-points-on-a-line)|||Hard|\n|150|[evaluate-reverse-polish-notation](https://leetcode.com/problems/evaluate-reverse-polish-notation)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/150-evaluate-reverse-polish-notation/evaluate-reverse-polish-notation.js)||Medium|\n|151|[reverse-words-in-a-string](https://leetcode.com/problems/reverse-words-in-a-string)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/151-reverse-words-in-a-string/reverse-words-in-a-string.js)||Medium|\n|152|[maximum-product-subarray](https://leetcode.com/problems/maximum-product-subarray)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/152-maximum-product-subarray/maximum-product-subarray.js)||Medium|\n|153|[find-minimum-in-rotated-sorted-array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/153-find-minimum-in-rotated-sorted-array/find-minimum-in-rotated-sorted-array.js)||Medium|\n|154|[find-minimum-in-rotated-sorted-array-ii](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/154-find-minimum-in-rotated-sorted-array-ii/find-minimum-in-rotated-sorted-array-ii.js)||Hard|\n|155|[min-stack](https://leetcode.com/problems/min-stack)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/155-min-stack/min-stack.js)||Easy|\n|156|[binary-tree-upside-down](https://leetcode.com/problems/binary-tree-upside-down)|:lock:||Medium|\n|157|[read-n-characters-given-read4](https://leetcode.com/problems/read-n-characters-given-read4)|:lock:||Easy|\n|158|[read-n-characters-given-read4-ii-call-multiple-times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times)|:lock:||Hard|\n|159|[longest-substring-with-at-most-two-distinct-characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters)|:lock:||Hard|\n|160|[intersection-of-two-linked-lists](https://leetcode.com/problems/intersection-of-two-linked-lists)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/160-intersection-of-two-linked-lists/intersection-of-two-linked-lists.js)|[:memo:](https://leetcode.com/articles/intersection-two-linked-lists/)|Easy|\n|161|[one-edit-distance](https://leetcode.com/problems/one-edit-distance)|:lock:||Medium|\n|162|[find-peak-element](https://leetcode.com/problems/find-peak-element)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/162-find-peak-element/find-peak-element.js)||Medium|\n|163|[missing-ranges](https://leetcode.com/problems/missing-ranges)|:lock:||Medium|\n|164|[maximum-gap](https://leetcode.com/problems/maximum-gap)|||Hard|\n|165|[compare-version-numbers](https://leetcode.com/problems/compare-version-numbers)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/165-compare-version-numbers/compare-version-numbers.js)||Easy|\n|166|[fraction-to-recurring-decimal](https://leetcode.com/problems/fraction-to-recurring-decimal)||[:memo:](https://leetcode.com/articles/fraction-recurring-decimal/)|Medium|\n|167|[two-sum-ii-input-array-is-sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/167-two-sum-ii-input-array-is-sorted/two-sum-ii-input-array-is-sorted.js)|[:memo:](https://leetcode.com/articles/two-sum-ii-input-array-sorted/)|Medium|\n|168|[excel-sheet-column-title](https://leetcode.com/problems/excel-sheet-column-title)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/168-excel-sheet-column-title/excel-sheet-column-title.js)||Easy|\n|169|[majority-element](https://leetcode.com/problems/majority-element)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/169-majority-element/majority-element.js)||Easy|\n|170|[two-sum-iii-data-structure-design](https://leetcode.com/problems/two-sum-iii-data-structure-design)|:lock:||Easy|\n|171|[excel-sheet-column-number](https://leetcode.com/problems/excel-sheet-column-number)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/171-excel-sheet-column-number/excel-sheet-column-number.js)||Easy|\n|172|[factorial-trailing-zeroes](https://leetcode.com/problems/factorial-trailing-zeroes)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/172-factorial-trailing-zeroes/factorial-trailing-zeroes.js)||Easy|\n|173|[binary-search-tree-iterator](https://leetcode.com/problems/binary-search-tree-iterator)|||Medium|\n|174|[dungeon-game](https://leetcode.com/problems/dungeon-game)|||Hard|\n|179|[largest-number](https://leetcode.com/problems/largest-number)|||Medium|\n|186|[reverse-words-in-a-string-ii](https://leetcode.com/problems/reverse-words-in-a-string-ii)|:lock:||Medium|\n|187|[repeated-dna-sequences](https://leetcode.com/problems/repeated-dna-sequences)|||Medium|\n|188|[best-time-to-buy-and-sell-stock-iv](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv)|||Hard|\n|189|[rotate-array](https://leetcode.com/problems/rotate-array)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/189-rotate-array/rotate-array.js)|[:memo:](https://leetcode.com/articles/rotate-array/)|Easy|\n|190|[reverse-bits](https://leetcode.com/problems/reverse-bits)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/190-reverse-bits/reverse-bits.js)||Easy|\n|191|[number-of-1-bits](https://leetcode.com/problems/number-of-1-bits)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/191-number-of-1-bits/number-of-1-bits.js)|[:memo:](https://leetcode.com/articles/number-1-bits/)|Easy|\n|198|[house-robber](https://leetcode.com/problems/house-robber)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/198-house-robber/house-robber.js)|[:memo:](https://leetcode.com/articles/house-robber/)|Easy|\n|199|[binary-tree-right-side-view](https://leetcode.com/problems/binary-tree-right-side-view)|||Medium|\n|200|[number-of-islands](https://leetcode.com/problems/number-of-islands)|||Medium|\n|201|[bitwise-and-of-numbers-range](https://leetcode.com/problems/bitwise-and-of-numbers-range)|||Medium|\n|202|[happy-number](https://leetcode.com/problems/happy-number)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/202-happy-number/happy-number.js)||Easy|\n|203|[remove-linked-list-elements](https://leetcode.com/problems/remove-linked-list-elements)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/203-remove-linked-list-elements/remove-linked-list-elements.js)||Easy|\n|204|[count-primes](https://leetcode.com/problems/count-primes)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/204-count-primes/count-primes.js)||Easy|\n|205|[isomorphic-strings](https://leetcode.com/problems/isomorphic-strings)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/205-isomorphic-strings/isomorphic-strings.js)||Easy|\n|206|[reverse-linked-list](https://leetcode.com/problems/reverse-linked-list)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/206-reverse-linked-list/reverse-linked-list.js)|[:memo:](https://leetcode.com/articles/reverse-linked-list/)|Easy|\n|207|[course-schedule](https://leetcode.com/problems/course-schedule)|||Medium|\n|208|[implement-trie-prefix-tree](https://leetcode.com/problems/implement-trie-prefix-tree)||[:memo:](https://leetcode.com/articles/implement-trie-prefix-tree/)|Medium|\n|209|[minimum-size-subarray-sum](https://leetcode.com/problems/minimum-size-subarray-sum)|||Medium|\n|210|[course-schedule-ii](https://leetcode.com/problems/course-schedule-ii)|||Medium|\n|211|[add-and-search-word-data-structure-design](https://leetcode.com/problems/add-and-search-word-data-structure-design)|||Medium|\n|212|[word-search-ii](https://leetcode.com/problems/word-search-ii)|||Hard|\n|213|[house-robber-ii](https://leetcode.com/problems/house-robber-ii)|||Medium|\n|214|[shortest-palindrome](https://leetcode.com/problems/shortest-palindrome)|||Hard|\n|215|[kth-largest-element-in-an-array](https://leetcode.com/problems/kth-largest-element-in-an-array)|||Medium|\n|216|[combination-sum-iii](https://leetcode.com/problems/combination-sum-iii)|||Medium|\n|217|[contains-duplicate](https://leetcode.com/problems/contains-duplicate)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/217-contains-duplicate/contains-duplicate.js)|[:memo:](https://leetcode.com/articles/contains-duplicate/)|Easy|\n|218|[the-skyline-problem](https://leetcode.com/problems/the-skyline-problem)|||Hard|\n|219|[contains-duplicate-ii](https://leetcode.com/problems/contains-duplicate-ii)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/219-contains-duplicate-ii/contains-duplicate-ii.js)|[:memo:](https://leetcode.com/articles/contains-duplicate-ii/)|Easy|\n|220|[contains-duplicate-iii](https://leetcode.com/problems/contains-duplicate-iii)||[:memo:](https://leetcode.com/articles/contains-duplicate-iii/)|Medium|\n|221|[maximal-square](https://leetcode.com/problems/maximal-square)||[:memo:](https://leetcode.com/articles/maximal-square/)|Medium|\n|222|[count-complete-tree-nodes](https://leetcode.com/problems/count-complete-tree-nodes)|||Medium|\n|223|[rectangle-area](https://leetcode.com/problems/rectangle-area)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/223-rectangle-area/rectangle-area.js)||Easy|\n|224|[basic-calculator](https://leetcode.com/problems/basic-calculator)|||Hard|\n|225|[implement-stack-using-queues](https://leetcode.com/problems/implement-stack-using-queues)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/225-implement-stack-using-queues/implement-stack-using-queues.js)|[:memo:](https://leetcode.com/articles/implement-stack-using-queues/)|Easy|\n|226|[invert-binary-tree](https://leetcode.com/problems/invert-binary-tree)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/226-invert-binary-tree/invert-binary-tree.js)|[:memo:](https://leetcode.com/articles/invert-binary-tree/)|Easy|\n|227|[basic-calculator-ii](https://leetcode.com/problems/basic-calculator-ii)|||Medium|\n|228|[summary-ranges](https://leetcode.com/problems/summary-ranges)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/228-summary-ranges/summary-ranges.js)|[:memo:](https://leetcode.com/articles/summary-ranges/)|Medium|\n|229|[majority-element-ii](https://leetcode.com/problems/majority-element-ii)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/229-majority-element-ii/majority-element-ii.js)||Medium|\n|230|[kth-smallest-element-in-a-bst](https://leetcode.com/problems/kth-smallest-element-in-a-bst)|||Medium|\n|231|[power-of-two](https://leetcode.com/problems/power-of-two)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/231-power-of-two/power-of-two.js)||Easy|\n|232|[implement-queue-using-stacks](https://leetcode.com/problems/implement-queue-using-stacks)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/232-implement-queue-using-stacks/implement-queue-using-stacks.js)|[:memo:](https://leetcode.com/articles/implement-queue-using-stacks/)|Easy|\n|233|[number-of-digit-one](https://leetcode.com/problems/number-of-digit-one)|||Hard|\n|234|[palindrome-linked-list](https://leetcode.com/problems/palindrome-linked-list)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/234-palindrome-linked-list/palindrome-linked-list.js)||Easy|\n|235|[lowest-common-ancestor-of-a-binary-search-tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/235-lowest-common-ancestor-of-a-binary-search-tree/lowest-common-ancestor-of-a-binary-search-tree.js)||Easy|\n|236|[lowest-common-ancestor-of-a-binary-tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree)|||Medium|\n|237|[delete-node-in-a-linked-list](https://leetcode.com/problems/delete-node-in-a-linked-list)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/237-delete-node-in-a-linked-list/delete-node-in-a-linked-list.js)|[:memo:](https://leetcode.com/articles/delete-node-linked-list/)|Easy|\n|238|[product-of-array-except-self](https://leetcode.com/problems/product-of-array-except-self)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/238-product-of-array-except-self/product-of-array-except-self.js)||Medium|\n|239|[sliding-window-maximum](https://leetcode.com/problems/sliding-window-maximum)|||Hard|\n|240|[search-a-2d-matrix-ii](https://leetcode.com/problems/search-a-2d-matrix-ii)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/240-search-a-2d-matrix-ii/search-a-2d-matrix-ii.js)||Medium|\n|241|[different-ways-to-add-parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses)|||Medium|\n|242|[valid-anagram](https://leetcode.com/problems/valid-anagram)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/242-valid-anagram/valid-anagram.js)|[:memo:](https://leetcode.com/articles/valid-anagram/)|Easy|\n|243|[shortest-word-distance](https://leetcode.com/problems/shortest-word-distance)|:lock:|[:memo:](https://leetcode.com/articles/shortest-word-distance/)|Easy|\n|244|[shortest-word-distance-ii](https://leetcode.com/problems/shortest-word-distance-ii)|:lock:||Medium|\n|245|[shortest-word-distance-iii](https://leetcode.com/problems/shortest-word-distance-iii)|:lock:||Medium|\n|246|[strobogrammatic-number](https://leetcode.com/problems/strobogrammatic-number)|:lock:||Easy|\n|247|[strobogrammatic-number-ii](https://leetcode.com/problems/strobogrammatic-number-ii)|:lock:||Medium|\n|248|[strobogrammatic-number-iii](https://leetcode.com/problems/strobogrammatic-number-iii)|:lock:||Hard|\n|249|[group-shifted-strings](https://leetcode.com/problems/group-shifted-strings)|:lock:||Easy|\n|250|[count-univalue-subtrees](https://leetcode.com/problems/count-univalue-subtrees)|:lock:||Medium|\n|251|[flatten-2d-vector](https://leetcode.com/problems/flatten-2d-vector)|:lock:||Medium|\n|252|[meeting-rooms](https://leetcode.com/problems/meeting-rooms)|:lock:|[:memo:](https://leetcode.com/articles/meeting-rooms/)|Easy|\n|253|[meeting-rooms-ii](https://leetcode.com/problems/meeting-rooms-ii)|:lock:||Medium|\n|254|[factor-combinations](https://leetcode.com/problems/factor-combinations)|:lock:||Medium|\n|255|[verify-preorder-sequence-in-binary-search-tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree)|:lock:||Medium|\n|256|[paint-house](https://leetcode.com/problems/paint-house)|:lock:||Medium|\n|257|[binary-tree-paths](https://leetcode.com/problems/binary-tree-paths)|||Easy|\n|258|[add-digits](https://leetcode.com/problems/add-digits)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/258-add-digits/add-digits.js)||Easy|\n|259|[3sum-smaller](https://leetcode.com/problems/3sum-smaller)|:lock:|[:memo:](https://leetcode.com/articles/3sum-smaller/)|Medium|\n|260|[single-number-iii](https://leetcode.com/problems/single-number-iii)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/260-single-number-iii/single-number-iii.js)||Medium|\n|261|[graph-valid-tree](https://leetcode.com/problems/graph-valid-tree)|:lock:||Medium|\n|263|[ugly-number](https://leetcode.com/problems/ugly-number)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/263-ugly-number/ugly-number.js)||Easy|\n|264|[ugly-number-ii](https://leetcode.com/problems/ugly-number-ii)|||Medium|\n|265|[paint-house-ii](https://leetcode.com/problems/paint-house-ii)|:lock:||Hard|\n|266|[palindrome-permutation](https://leetcode.com/problems/palindrome-permutation)|:lock:||Easy|\n|267|[palindrome-permutation-ii](https://leetcode.com/problems/palindrome-permutation-ii)|:lock:||Medium|\n|268|[missing-number](https://leetcode.com/problems/missing-number)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/268-missing-number/missing-number.js)||Medium|\n|269|[alien-dictionary](https://leetcode.com/problems/alien-dictionary)|:lock:||Hard|\n|270|[closest-binary-search-tree-value](https://leetcode.com/problems/closest-binary-search-tree-value)|:lock:||Easy|\n|271|[encode-and-decode-strings](https://leetcode.com/problems/encode-and-decode-strings)|:lock:||Medium|\n|272|[closest-binary-search-tree-value-ii](https://leetcode.com/problems/closest-binary-search-tree-value-ii)|:lock:||Hard|\n|273|[integer-to-english-words](https://leetcode.com/problems/integer-to-english-words)|||Hard|\n|274|[h-index](https://leetcode.com/problems/h-index)||[:memo:](https://leetcode.com/articles/h-index/)|Medium|\n|275|[h-index-ii](https://leetcode.com/problems/h-index-ii)|||Medium|\n|276|[paint-fence](https://leetcode.com/problems/paint-fence)|:lock:||Easy|\n|277|[find-the-celebrity](https://leetcode.com/problems/find-the-celebrity)|:lock:||Medium|\n|278|[first-bad-version](https://leetcode.com/problems/first-bad-version)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/278-first-bad-version/first-bad-version.js)|[:memo:](https://leetcode.com/articles/first-bad-version/)|Easy|\n|279|[perfect-squares](https://leetcode.com/problems/perfect-squares)|||Medium|\n|280|[wiggle-sort](https://leetcode.com/problems/wiggle-sort)|:lock:|[:memo:](https://leetcode.com/articles/wiggle-sort/)|Medium|\n|281|[zigzag-iterator](https://leetcode.com/problems/zigzag-iterator)|:lock:||Medium|\n|282|[expression-add-operators](https://leetcode.com/problems/expression-add-operators)|||Hard|\n|283|[move-zeroes](https://leetcode.com/problems/move-zeroes)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/283-move-zeroes/move-zeroes.js)|[:memo:](https://leetcode.com/articles/move-zeroes/)|Easy|\n|284|[peeking-iterator](https://leetcode.com/problems/peeking-iterator)|||Medium|\n|285|[inorder-successor-in-bst](https://leetcode.com/problems/inorder-successor-in-bst)|:lock:||Medium|\n|286|[walls-and-gates](https://leetcode.com/problems/walls-and-gates)|:lock:|[:memo:](https://leetcode.com/articles/walls-and-gates/)|Medium|\n|287|[find-the-duplicate-number](https://leetcode.com/problems/find-the-duplicate-number)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/287-find-the-duplicate-number/find-the-duplicate-number.js)||Hard|\n|288|[unique-word-abbreviation](https://leetcode.com/problems/unique-word-abbreviation)|:lock:|[:memo:](https://leetcode.com/articles/unique-word-abbreviation/)|Easy|\n|289|[game-of-life](https://leetcode.com/problems/game-of-life)|||Medium|\n|290|[word-pattern](https://leetcode.com/problems/word-pattern)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/290-word-pattern/word-pattern.js)||Easy|\n|291|[word-pattern-ii](https://leetcode.com/problems/word-pattern-ii)|:lock:||Hard|\n|292|[nim-game](https://leetcode.com/problems/nim-game)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/292-nim-game/nim-game.js)|[:memo:](https://leetcode.com/articles/nim-game/)|Easy|\n|293|[flip-game](https://leetcode.com/problems/flip-game)|:lock:||Easy|\n|294|[flip-game-ii](https://leetcode.com/problems/flip-game-ii)|:lock:||Medium|\n|295|[find-median-from-data-stream](https://leetcode.com/problems/find-median-from-data-stream)|||Hard|\n|296|[best-meeting-point](https://leetcode.com/problems/best-meeting-point)|:lock:|[:memo:](https://leetcode.com/articles/best-meeting-point/)|Hard|\n|297|[serialize-and-deserialize-binary-tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree)|||Hard|\n|298|[binary-tree-longest-consecutive-sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence)|:lock:|[:memo:](https://leetcode.com/articles/binary-tree-longest-consecutive-sequence/)|Medium|\n|299|[bulls-and-cows](https://leetcode.com/problems/bulls-and-cows)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/299-bulls-and-cows/bulls-and-cows.js)||Easy|\n|300|[longest-increasing-subsequence](https://leetcode.com/problems/longest-increasing-subsequence)|||Medium|\n|301|[remove-invalid-parentheses](https://leetcode.com/problems/remove-invalid-parentheses)|||Hard|\n|302|[smallest-rectangle-enclosing-black-pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels)|:lock:||Hard|\n|303|[range-sum-query-immutable](https://leetcode.com/problems/range-sum-query-immutable)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/303-range-sum-query-immutable/range-sum-query-immutable.js)|[:memo:](https://leetcode.com/articles/range-sum-query-immutable/)|Easy|\n|304|[range-sum-query-2d-immutable](https://leetcode.com/problems/range-sum-query-2d-immutable)||[:memo:](https://leetcode.com/articles/range-sum-query-2d-immutable/)|Medium|\n|305|[number-of-islands-ii](https://leetcode.com/problems/number-of-islands-ii)|:lock:||Hard|\n|306|[additive-number](https://leetcode.com/problems/additive-number)|||Medium|\n|307|[range-sum-query-mutable](https://leetcode.com/problems/range-sum-query-mutable)||[:memo:](https://leetcode.com/articles/range-sum-query-mutable/)|Medium|\n|308|[range-sum-query-2d-mutable](https://leetcode.com/problems/range-sum-query-2d-mutable)|:lock:||Hard|\n|309|[best-time-to-buy-and-sell-stock-with-cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown)|||Medium|\n|310|[minimum-height-trees](https://leetcode.com/problems/minimum-height-trees)|||Medium|\n|311|[sparse-matrix-multiplication](https://leetcode.com/problems/sparse-matrix-multiplication)|:lock:||Medium|\n|312|[burst-balloons](https://leetcode.com/problems/burst-balloons)|||Hard|\n|313|[super-ugly-number](https://leetcode.com/problems/super-ugly-number)|||Medium|\n|314|[binary-tree-vertical-order-traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal)|:lock:||Medium|\n|315|[count-of-smaller-numbers-after-self](https://leetcode.com/problems/count-of-smaller-numbers-after-self)|||Hard|\n|316|[remove-duplicate-letters](https://leetcode.com/problems/remove-duplicate-letters)|||Hard|\n|317|[shortest-distance-from-all-buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings)|:lock:||Hard|\n|318|[maximum-product-of-word-lengths](https://leetcode.com/problems/maximum-product-of-word-lengths)|||Medium|\n|319|[bulb-switcher](https://leetcode.com/problems/bulb-switcher)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/319-bulb-switcher/bulb-switcher.js)||Medium|\n|320|[generalized-abbreviation](https://leetcode.com/problems/generalized-abbreviation)|:lock:||Medium|\n|321|[create-maximum-number](https://leetcode.com/problems/create-maximum-number)|||Hard|\n|322|[coin-change](https://leetcode.com/problems/coin-change)||[:memo:](https://leetcode.com/articles/coin-change/)|Medium|\n|323|[number-of-connected-components-in-an-undirected-graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph)|:lock:||Medium|\n|324|[wiggle-sort-ii](https://leetcode.com/problems/wiggle-sort-ii)|||Medium|\n|325|[maximum-size-subarray-sum-equals-k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k)|:lock:||Medium|\n|326|[power-of-three](https://leetcode.com/problems/power-of-three)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/326-power-of-three/power-of-three.js)|[:memo:](https://leetcode.com/articles/power-of-three/)|Easy|\n|327|[count-of-range-sum](https://leetcode.com/problems/count-of-range-sum)|||Hard|\n|328|[odd-even-linked-list](https://leetcode.com/problems/odd-even-linked-list)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/328-odd-even-linked-list/odd-even-linked-list.js)|[:memo:](https://leetcode.com/articles/odd-even-linked-list/)|Medium|\n|329|[longest-increasing-path-in-a-matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix)|||Hard|\n|330|[patching-array](https://leetcode.com/problems/patching-array)|||Hard|\n|331|[verify-preorder-serialization-of-a-binary-tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree)|||Medium|\n|332|[reconstruct-itinerary](https://leetcode.com/problems/reconstruct-itinerary)|||Medium|\n|333|[largest-bst-subtree](https://leetcode.com/problems/largest-bst-subtree)|:lock:||Medium|\n|334|[increasing-triplet-subsequence](https://leetcode.com/problems/increasing-triplet-subsequence)|||Medium|\n|335|[self-crossing](https://leetcode.com/problems/self-crossing)|||Hard|\n|336|[palindrome-pairs](https://leetcode.com/problems/palindrome-pairs)|||Hard|\n|337|[house-robber-iii](https://leetcode.com/problems/house-robber-iii)|||Medium|\n|338|[counting-bits](https://leetcode.com/problems/counting-bits)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/338-counting-bits/counting-bits.js)||Medium|\n|339|[nested-list-weight-sum](https://leetcode.com/problems/nested-list-weight-sum)|:lock:|[:memo:](https://leetcode.com/articles/nested-list-weight-sum/)|Easy|\n|340|[longest-substring-with-at-most-k-distinct-characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters)|:lock:||Hard|\n|341|[flatten-nested-list-iterator](https://leetcode.com/problems/flatten-nested-list-iterator)|||Medium|\n|342|[power-of-four](https://leetcode.com/problems/power-of-four)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/342-power-of-four/power-of-four.js)||Easy|\n|343|[integer-break](https://leetcode.com/problems/integer-break)|||Medium|\n|344|[reverse-string](https://leetcode.com/problems/reverse-string)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/344-reverse-string/reverse-string.js)||Easy|\n|345|[reverse-vowels-of-a-string](https://leetcode.com/problems/reverse-vowels-of-a-string)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/345-reverse-vowels-of-a-string/reverse-vowels-of-a-string.js)||Easy|\n|346|[moving-average-from-data-stream](https://leetcode.com/problems/moving-average-from-data-stream)|:lock:||Easy|\n|347|[top-k-frequent-elements](https://leetcode.com/problems/top-k-frequent-elements)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/347-top-k-frequent-elements/top-k-frequent-elements.js)||Medium|\n|348|[design-tic-tac-toe](https://leetcode.com/problems/design-tic-tac-toe)|:lock:||Medium|\n|349|[intersection-of-two-arrays](https://leetcode.com/problems/intersection-of-two-arrays)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/349-intersection-of-two-arrays/intersection-of-two-arrays.js)||Easy|\n|350|[intersection-of-two-arrays-ii](https://leetcode.com/problems/intersection-of-two-arrays-ii)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/350-intersection-of-two-arrays-ii/intersection-of-two-arrays-ii.js)||Easy|\n|351|[android-unlock-patterns](https://leetcode.com/problems/android-unlock-patterns)|:lock:|[:memo:](https://leetcode.com/articles/android-unlock-patterns/)|Medium|\n|352|[data-stream-as-disjoint-intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals)|||Hard|\n|353|[design-snake-game](https://leetcode.com/problems/design-snake-game)|:lock:||Medium|\n|354|[russian-doll-envelopes](https://leetcode.com/problems/russian-doll-envelopes)|||Hard|\n|355|[design-twitter](https://leetcode.com/problems/design-twitter)|||Medium|\n|356|[line-reflection](https://leetcode.com/problems/line-reflection)|:lock:||Medium|\n|357|[count-numbers-with-unique-digits](https://leetcode.com/problems/count-numbers-with-unique-digits)|||Medium|\n|358|[rearrange-string-k-distance-apart](https://leetcode.com/problems/rearrange-string-k-distance-apart)|:lock:||Hard|\n|359|[logger-rate-limiter](https://leetcode.com/problems/logger-rate-limiter)|:lock:||Easy|\n|360|[sort-transformed-array](https://leetcode.com/problems/sort-transformed-array)|:lock:||Medium|\n|361|[bomb-enemy](https://leetcode.com/problems/bomb-enemy)|:lock:||Medium|\n|362|[design-hit-counter](https://leetcode.com/problems/design-hit-counter)|:lock:||Medium|\n|363|[max-sum-of-sub-matrix-no-larger-than-k](https://leetcode.com/problems/max-sum-of-sub-matrix-no-larger-than-k)|||Hard|\n|364|[nested-list-weight-sum-ii](https://leetcode.com/problems/nested-list-weight-sum-ii)|:lock:||Medium|\n|365|[water-and-jug-problem](https://leetcode.com/problems/water-and-jug-problem)|||Medium|\n|366|[find-leaves-of-binary-tree](https://leetcode.com/problems/find-leaves-of-binary-tree)|:lock:||Medium|\n|367|[valid-perfect-square](https://leetcode.com/problems/valid-perfect-square)|||Medium|\n|368|[largest-divisible-subset](https://leetcode.com/problems/largest-divisible-subset)|||Medium|\n|369|[plus-one-linked-list](https://leetcode.com/problems/plus-one-linked-list)|:lock:||Medium|\n|370|[range-addition](https://leetcode.com/problems/range-addition)|:lock:|[:memo:](https://leetcode.com/articles/range-addition/)|Medium|\n|371|[sum-of-two-integers](https://leetcode.com/problems/sum-of-two-integers)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/371-sum-of-two-integers/sum-of-two-integers.js)||Easy|\n|372|[super-pow](https://leetcode.com/problems/super-pow)|||Medium|\n|373|[find-k-pairs-with-smallest-sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums)|||Medium|\n|374|[guess-number-higher-or-lower](https://leetcode.com/problems/guess-number-higher-or-lower)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/374-guess-number-higher-or-lower/guess-number-higher-or-lower.js)|[:memo:](https://leetcode.com/articles/guess-number-higher-or-lower/)|Easy|\n|375|[guess-number-higher-or-lower-ii](https://leetcode.com/problems/guess-number-higher-or-lower-ii)|||Medium|\n|376|[wiggle-subsequence](https://leetcode.com/problems/wiggle-subsequence)||[:memo:](https://leetcode.com/articles/wiggle-subsequence/)|Medium|\n|377|[combination-sum-iv](https://leetcode.com/problems/combination-sum-iv)|||Medium|\n|378|[kth-smallest-element-in-a-sorted-matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix)|||Medium|\n|379|[design-phone-directory](https://leetcode.com/problems/design-phone-directory)|:lock:||Medium|\n|380|[insert-delete-getrandom-o1](https://leetcode.com/problems/insert-delete-getrandom-o1)|||Hard|\n|381|[insert-delete-getrandom-o1-duplicates-allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed)|||Hard|\n|382|[linked-list-random-node](https://leetcode.com/problems/linked-list-random-node)|||Medium|\n|383|[ransom-note](https://leetcode.com/problems/ransom-note)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/383-ransom-note/ransom-note.js)||Easy|\n|384|[shuffle-an-array](https://leetcode.com/problems/shuffle-an-array)|||Medium|\n|385|[mini-parser](https://leetcode.com/problems/mini-parser)|||Medium|\n|386|[lexicographical-numbers](https://leetcode.com/problems/lexicographical-numbers)|||Medium|\n|387|[first-unique-character-in-a-string](https://leetcode.com/problems/first-unique-character-in-a-string)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/387-first-unique-character-in-a-string/first-unique-character-in-a-string.js)||Easy|\n|388|[longest-absolute-file-path](https://leetcode.com/problems/longest-absolute-file-path)|||Medium|\n|389|[find-the-difference](https://leetcode.com/problems/find-the-difference)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/389-find-the-difference/find-the-difference.js)||Easy|\n|390|[elimination-game](https://leetcode.com/problems/elimination-game)|||Medium|\n|391|[perfect-rectangle](https://leetcode.com/problems/perfect-rectangle)|||Hard|\n|392|[is-subsequence](https://leetcode.com/problems/is-subsequence)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/392-is-subsequence/is-subsequence.js)||Medium|\n|393|[utf-8-validation](https://leetcode.com/problems/utf-8-validation)|||Medium|\n|394|[decode-string](https://leetcode.com/problems/decode-string)|||Medium|\n|395|[longest-substring-with-at-least-k-repeating-characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters)|||Medium|\n|396|[rotate-function](https://leetcode.com/problems/rotate-function)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/396-rotate-function/rotate-function.js)||Easy|\n|397|[integer-replacement](https://leetcode.com/problems/integer-replacement)|||Medium|\n|398|[random-pick-index](https://leetcode.com/problems/random-pick-index)|||Medium|\n|399|[evaluate-division](https://leetcode.com/problems/evaluate-division)|||Medium|\n|400|[nth-digit](https://leetcode.com/problems/nth-digit)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/400-nth-digit/nth-digit.js)||Easy|\n|401|[binary-watch](https://leetcode.com/problems/binary-watch)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/401-binary-watch/binary-watch.js)||Easy|\n|402|[remove-k-digits](https://leetcode.com/problems/remove-k-digits)|||Medium|\n|403|[frog-jump](https://leetcode.com/problems/frog-jump)|||Hard|\n|404|[sum-of-left-leaves](https://leetcode.com/problems/sum-of-left-leaves)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/404-sum-of-left-leaves/sum-of-left-leaves.js)||Easy|\n|405|[convert-a-number-to-hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/405-convert-a-number-to-hexadecimal/convert-a-number-to-hexadecimal.js)||Easy|\n|406|[queue-reconstruction-by-height](https://leetcode.com/problems/queue-reconstruction-by-height)|||Medium|\n|407|[trapping-rain-water-ii](https://leetcode.com/problems/trapping-rain-water-ii)|||Hard|\n|408|[valid-word-abbreviation](https://leetcode.com/problems/valid-word-abbreviation)|:lock:||Easy|\n|409|[longest-palindrome](https://leetcode.com/problems/longest-palindrome)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/409-longest-palindrome/longest-palindrome.js)||Easy|\n|410|[split-array-largest-sum](https://leetcode.com/problems/split-array-largest-sum)|||Hard|\n|411|[minimum-unique-word-abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation)|:lock:||Hard|\n|412|[fizz-buzz](https://leetcode.com/problems/fizz-buzz)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/412-fizz-buzz/fizz-buzz.js)||Easy|\n|413|[arithmetic-slices](https://leetcode.com/problems/arithmetic-slices)|||Medium|\n|414|[third-maximum-number](https://leetcode.com/problems/third-maximum-number)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/414-third-maximum-number/third-maximum-number.js)||Easy|\n|415|[add-strings](https://leetcode.com/problems/add-strings)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/415-add-strings/add-strings.js)||Easy|\n|416|[partition-equal-subset-sum](https://leetcode.com/problems/partition-equal-subset-sum)|||Medium|\n|417|[pacific-atlantic-water-flow](https://leetcode.com/problems/pacific-atlantic-water-flow)|||Medium|\n|418|[sentence-screen-fitting](https://leetcode.com/problems/sentence-screen-fitting)|:lock:||Medium|\n|419|[battleships-in-a-board](https://leetcode.com/problems/battleships-in-a-board)|||Medium|\n|420|[strong-password-checker](https://leetcode.com/problems/strong-password-checker)|||Hard|\n|421|[maximum-xor-of-two-numbers-in-an-array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array)|||Medium|\n|422|[valid-word-square](https://leetcode.com/problems/valid-word-square)|:lock:||Easy|\n|423|[reconstruct-original-digits-from-english](https://leetcode.com/problems/reconstruct-original-digits-from-english)|||Medium|\n|424|[longest-repeating-character-replacement](https://leetcode.com/problems/longest-repeating-character-replacement)|||Medium|\n|425|[word-squares](https://leetcode.com/problems/word-squares)|:lock:||Hard|\n|432|[all-oone-data-structure](https://leetcode.com/problems/all-oone-data-structure)|||Hard|\n|435|[non-overlapping-intervals](https://leetcode.com/problems/non-overlapping-intervals)|||Medium|\n|436|[find-right-interval](https://leetcode.com/problems/find-right-interval)|||Medium|\n|437|[path-sum-iii](https://leetcode.com/problems/path-sum-iii)|||Easy|\n|438|[find-all-anagrams-in-a-string](https://leetcode.com/problems/find-all-anagrams-in-a-string)|||Easy|\n|439|[ternary-expression-parser](https://leetcode.com/problems/ternary-expression-parser)|:lock:||Medium|\n|440|[k-th-smallest-in-lexicographical-order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order)|||Hard|\n|441|[arranging-coins](https://leetcode.com/problems/arranging-coins)|[javascript](https://github.com/zz-zhangzhao/leetcode-javascript/blob/master/441-arranging-coins/arranging-coins.js)||Easy|\n|444|[sequence-reconstruction](https://leetcode.com/problems/sequence-reconstruction)|:lock:||Medium|\n|446|[arithmetic-slices-ii-subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence)|||Hard|\n|447|[number-of-boomerangs](https://leetcode.com/problems/number-of-boomerangs)|||Easy|\n|452|[minimum-number-of-arrows-to-burst-balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons)|||Medium|\n|453|[minimum-moves-to-equal-array-elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements)|||Easy|\n|454|[4sum-ii](https://leetcode.com/problems/4sum-ii)|||Medium|\n|455|[assign-cookies](https://leetcode.com/problems/assign-cookies)|||Easy|\n|456|[132-pattern](https://leetcode.com/problems/132-pattern)|||Medium|\n|459|[repeated-substring-pattern](https://leetcode.com/problems/repeated-substring-pattern)|||Easy|\n|462|[minimum-moves-to-equal-array-elements-ii](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii)|||Medium|\n|463|[island-perimeter](https://leetcode.com/problems/island-perimeter)|||Easy|\n|464|[can-i-win](https://leetcode.com/problems/can-i-win)|||Medium|\n|465|[optimal-account-balancing](https://leetcode.com/problems/optimal-account-balancing)|:lock:||Hard|\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frevan-zhang%2Fleetcode-javascript","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frevan-zhang%2Fleetcode-javascript","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frevan-zhang%2Fleetcode-javascript/lists"}