{"id":17351757,"url":"https://github.com/mutoe/leetcode","last_synced_at":"2025-03-27T12:26:02.433Z","repository":{"id":64193539,"uuid":"258797270","full_name":"mutoe/leetcode","owner":"mutoe","description":"Personal leetcode playground.","archived":false,"fork":false,"pushed_at":"2023-02-28T17:52:14.000Z","size":927,"stargazers_count":2,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-01T16:48:46.850Z","etag":null,"topics":["golang","leetcode"],"latest_commit_sha":null,"homepage":"","language":"Go","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/mutoe.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-04-25T14:35:11.000Z","updated_at":"2022-12-14T23:16:14.000Z","dependencies_parsed_at":"2024-06-21T15:30:59.160Z","dependency_job_id":null,"html_url":"https://github.com/mutoe/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/mutoe%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mutoe%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mutoe%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mutoe%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mutoe","download_url":"https://codeload.github.com/mutoe/leetcode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245843205,"owners_count":20681471,"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":["golang","leetcode"],"created_at":"2024-10-15T17:11:06.025Z","updated_at":"2025-03-27T12:26:02.412Z","avatar_url":"https://github.com/mutoe.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Leetcode solution\n\n[![GitHub Workflow Status](https://img.shields.io/github/actions/workflow/status/mutoe/leetcode/go.yml?label=test\u0026logo=github\u0026style=flat-square)](https://github.com/mutoe/leetcode/actions)\n[![Codecov](https://img.shields.io/codecov/c/gh/mutoe/leetcode?logo=codecov\u0026style=flat-square)](https://codecov.io/gh/mutoe/leetcode)\n\nThanks for [leetcode editor](https://plugins.jetbrains.com/plugin/12132-leetcode-editor/) provide convenient learning tools.\n\n## Solutions\n\n\u003c!-- golang inject solutions start --\u003e\n\n|ID|Title|Time| |Space|Ranking|\n|---:|--|--:|:--|:--|--:|\n| 1\t| [two sum](https://leetcode.com/problems/two-sum)\t| 4ms\t| O(n)\t| O(n)\t| 95.58% 🟢\t|\n| 2\t| [add two numbers](https://leetcode.com/problems/add-two-numbers)\t| 12ms\t| O(n)\t| O(n)\t| 64.05% 🟠\t|\n| 3\t| [longest substring without repeating characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)\t| 584ms\t| O(n^2)\t| O(n)\t| 5.03% 🔴\t|\n| 6\t| [zigzag conversion](https://leetcode.com/problems/zigzag-conversion)\t| 8ms\t| O(n)\t| O(n)\t| 74.58% 🟠\t|\n| 7\t| [reverse integer](https://leetcode.com/problems/reverse-integer)\t| 0ms\t| O(log(n))\t| O(1)\t| 100% 🟢\t|\n| 8\t| [string to integer atoi](https://leetcode.com/problems/string-to-integer-atoi)\t| 4ms\t| O(n)\t| O(1)\t| 47.51% 🔴\t|\n| 11\t| [container with most water](https://leetcode.com/problems/container-with-most-water)\t| 296ms\t| O(n^2)\t| O(1)\t| 26.72% 🔴\t|\n| 12\t| [integer to roman](https://leetcode.com/problems/integer-to-roman)\t| 12ms\t| O(log(n))\t| O(1)\t| 44.82% 🔴\t|\n| 20\t| [valid parentheses](https://leetcode.com/problems/valid-parentheses)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 21\t| [merge two sorted lists](https://leetcode.com/problems/merge-two-sorted-lists)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 35\t| [search insert position](https://leetcode.com/problems/search-insert-position)\t| 0ms\t| O(log(n))\t| O(1)\t| 100% 🟢\t|\n| 69\t| [sqrtx](https://leetcode.com/problems/sqrtx)\t| 8ms\t| O(log(n))\t| O(1)\t| 19.58% 🔴\t|\n| 75\t| [sort colors](https://leetcode.com/problems/sort-colors)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 83\t| [remove duplicates from sorted list](https://leetcode.com/problems/remove-duplicates-from-sorted-list)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 100\t| [same tree](https://leetcode.com/problems/same-tree)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 101\t| [symmetric tree](https://leetcode.com/problems/symmetric-tree)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 102\t| [binary tree level order traversal](https://leetcode.com/problems/binary-tree-level-order-traversal)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 104\t| [maximum depth of binary tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)\t| 4ms\t| O(n)\t| O(1)\t| 90.15% 🟢\t|\n| 107\t| [binary tree level order traversal ii](https://leetcode.com/problems/binary-tree-level-order-traversal-ii)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 108\t| [convert sorted array to binary search tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree)\t| 108ms\t| O(n)\t| O(n)\t| 62.9% 🟠\t|\n| 110\t| [balanced binary tree](https://leetcode.com/problems/balanced-binary-tree)\t| 4ms\t| O(n)\t| O(n)\t| 96.71% 🟢\t|\n| 111\t| [minimum depth of binary tree](https://leetcode.com/problems/minimum-depth-of-binary-tree)\t| 228ms\t| O(n)\t| O(n)\t| 85.67% 🟠\t|\n| 112\t| [path sum](https://leetcode.com/problems/path-sum)\t| 4ms\t| O(n)\t| O(1)\t| 96.52% 🟢\t|\n| 119\t| [pascals triangle ii](https://leetcode.com/problems/pascals-triangle-ii)\t| 1ms\t| O(n^2)\t| O(n^2)\t| 59.83% 🟠\t|\n| 122\t| [best time to buy and sell stock ii](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii)\t| 4ms\t| O(n)\t| O(1)\t| 94.38% 🟢\t|\n| 125\t| [valid palindrome](https://leetcode.com/problems/valid-palindrome)\t| 0ms\t| O(n*log(n))\t| O(1)\t| 100% 🟢\t|\n| 141\t| [linked list cycle](https://leetcode.com/problems/linked-list-cycle)\t| 4ms\t| O(n)\t| O(1)\t| 96% 🟢\t|\n| 155\t| [min stack](https://leetcode.com/problems/min-stack)\t| 12ms\t| O(n)\t| O(n)\t| 98.73% 🟢\t|\n| 160\t| [intersection of two linked lists](https://leetcode.com/problems/intersection-of-two-linked-lists)\t| 44ms\t| O(n)\t| O(n)\t| 30.1% 🔴\t|\n| 167\t| [two sum ii input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted)\t| 4ms\t| O(n*log(n))\t| O(1)\t| 94.87% 🟢\t|\n| 168\t| [excel sheet column title](https://leetcode.com/problems/excel-sheet-column-title)\t| 0ms\t| O(log(n))\t| O(1)\t| 100% 🟢\t|\n| 171\t| [excel sheet column number](https://leetcode.com/problems/excel-sheet-column-number)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 182\t| [duplicate emails](https://leetcode.com/problems/duplicate-emails)\t| 343ms\t| unknown\t| unknown\t| 42.48% 🔴\t|\n| 193\t| [valid phone numbers](https://leetcode.com/problems/valid-phone-numbers)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 195\t| [tenth line](https://leetcode.com/problems/tenth-line)\t| 0ms\t| O(1)\t| O(1)\t| 100% 🟢\t|\n| 200\t| [number of islands](https://leetcode.com/problems/number-of-islands)\t| 0ms\t| O(n*m)\t| O(n)\t| 100% 🟢\t|\n| 201\t| [bitwise and of numbers range](https://leetcode.com/problems/bitwise-and-of-numbers-range)\t| 626ms\t| O(n)\t| O(1)\t| 6.25% 🔴\t|\n| 202\t| [happy number](https://leetcode.com/problems/happy-number)\t| 0ms\t| O(1)\t| O(1)\t| 100% 🟢\t|\n| 203\t| [remove linked list elements](https://leetcode.com/problems/remove-linked-list-elements)\t| 8ms\t| O(n)\t| O(1)\t| 88.89% 🟠\t|\n| 204\t| [count primes](https://leetcode.com/problems/count-primes)\t| 8ms\t| O(n)\t| O(n)\t| 81.42% 🟠\t|\n| 206\t| [reverse linked list](https://leetcode.com/problems/reverse-linked-list)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 208\t| [implement trie prefix tree](https://leetcode.com/problems/implement-trie-prefix-tree)\t| 72ms\t| O(n)\t| O(n)\t| 50.75% 🟠\t|\n| 211\t| [design add and search words data structure](https://leetcode.com/problems/design-add-and-search-words-data-structure)\t| 96ms\t| O(n)\t| O(n)\t| 38.61% 🔴\t|\n| 212\t| [word search ii](https://leetcode.com/problems/word-search-ii)\t| 1432ms\t| unknown\t| O(n)\t| 26.06% 🔴\t|\n| 215\t| [kth largest element in an array](https://leetcode.com/problems/kth-largest-element-in-an-array)\t| 4ms\t| O(n*log(n))\t| O(1)\t| 98.66% 🟢\t|\n| 219\t| [contains duplicate ii](https://leetcode.com/problems/contains-duplicate-ii)\t| 250ms\t| O(n)\t| O(n)\t| 37.93% 🔴\t|\n| 225\t| [implement stack using queues](https://leetcode.com/problems/implement-stack-using-queues)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 226\t| [invert binary tree](https://leetcode.com/problems/invert-binary-tree)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 231\t| [power of two](https://leetcode.com/problems/power-of-two)\t| 0ms\t| O(log(n))\t| O(1)\t| 100% 🟢\t|\n| 232\t| [implement queue using stacks](https://leetcode.com/problems/implement-queue-using-stacks)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 235\t| [lowest common ancestor of a binary search tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree)\t| 20ms\t| O(n)\t| O(1)\t| 80.11% 🟠\t|\n| 237\t| [delete node in a linked list](https://leetcode.com/problems/delete-node-in-a-linked-list)\t| 0ms\t| O(1)\t| O(1)\t| 100% 🟢\t|\n| 242\t| [valid anagram](https://leetcode.com/problems/valid-anagram)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 258\t| [add digits](https://leetcode.com/problems/add-digits)\t| 0ms\t| O(1)\t| O(1)\t| 100% 🟢\t|\n| 263\t| [ugly number](https://leetcode.com/problems/ugly-number)\t| 0ms\t| O(log(n))\t| O(1)\t| 100% 🟢\t|\n| 278\t| [first bad version](https://leetcode.com/problems/first-bad-version)\t| 0ms\t| O(log(n))\t| O(1)\t| 100% 🟢\t|\n| 283\t| [move zeroes](https://leetcode.com/problems/move-zeroes)\t| 12ms\t| O(n*log(n))\t| O(1)\t| 6.22% 🔴\t|\n| 303\t| [range sum query immutable](https://leetcode.com/problems/range-sum-query-immutable)\t| 24ms\t| O(n)\t| O(n)\t| 98.41% 🟢\t|\n| 326\t| [power of three](https://leetcode.com/problems/power-of-three)\t| 8ms\t| O(1)\t| O(1)\t| 99.32% 🟢\t|\n| 345\t| [reverse vowels of a string](https://leetcode.com/problems/reverse-vowels-of-a-string)\t| 0ms\t| O(n*log(n))\t| O(n)\t| 100% 🟢\t|\n| 347\t| [top k frequent elements](https://leetcode.com/problems/top-k-frequent-elements)\t| 12ms\t| O(n)\t| O(n)\t| 87.27% 🟠\t|\n| 349\t| [intersection of two arrays](https://leetcode.com/problems/intersection-of-two-arrays)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 350\t| [intersection of two arrays ii](https://leetcode.com/problems/intersection-of-two-arrays-ii)\t| 4ms\t| O(n)\t| O(n)\t| 79.29% 🟠\t|\n| 367\t| [valid perfect square](https://leetcode.com/problems/valid-perfect-square)\t| 0ms\t| O(log(n))\t| O(1)\t| 100% 🟢\t|\n| 374\t| [guess number higher or lower](https://leetcode.com/problems/guess-number-higher-or-lower)\t| 0ms\t| O(log(n))\t| O(1)\t| 100% 🟢\t|\n| 387\t| [first unique character in a string](https://leetcode.com/problems/first-unique-character-in-a-string)\t| 4ms\t| O(n)\t| O(1)\t| 97.53% 🟢\t|\n| 392\t| [is subsequence](https://leetcode.com/problems/is-subsequence)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 404\t| [sum of left leaves](https://leetcode.com/problems/sum-of-left-leaves)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 415\t| [add strings](https://leetcode.com/problems/add-strings)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 441\t| [arranging coins](https://leetcode.com/problems/arranging-coins)\t| 8ms\t| O(n)\t| O(1)\t| 38.46% 🔴\t|\n| 468\t| [validate ip address](https://leetcode.com/problems/validate-ip-address)\t| 0ms\t| O(1)\t| O(1)\t| 100% 🟢\t|\n| 496\t| [next greater element i](https://leetcode.com/problems/next-greater-element-i)\t| 0ms\t| O(n^2)\t| O(n)\t| 100% 🟢\t|\n| 501\t| [find mode in binary search tree](https://leetcode.com/problems/find-mode-in-binary-search-tree)\t| 12ms\t| O(n)\t| O(n)\t| 51.16% 🟠\t|\n| 506\t| [relative ranks](https://leetcode.com/problems/relative-ranks)\t| 12ms\t| O(n*log(n))\t| O(log(n))\t| 93.94% 🟢\t|\n| 507\t| [perfect number](https://leetcode.com/problems/perfect-number)\t| 0ms\t| O(log(n))\t| O(1)\t| 100% 🟢\t|\n| 530\t| [minimum absolute difference in bst](https://leetcode.com/problems/minimum-absolute-difference-in-bst)\t| 12ms\t| O(n)\t| O(1)\t| 72.92% 🟠\t|\n| 563\t| [binary tree tilt](https://leetcode.com/problems/binary-tree-tilt)\t| 8ms\t| O(n)\t| O(1)\t| 94.08% 🟢\t|\n| 572\t| [subtree of another tree](https://leetcode.com/problems/subtree-of-another-tree)\t| 20ms\t| O(n^2)\t| O(1)\t| 47.97% 🔴\t|\n| 617\t| [merge two binary trees](https://leetcode.com/problems/merge-two-binary-trees)\t| 28ms\t| O(n)\t| O(n)\t| 87.26% 🟠\t|\n| 628\t| [maximum product of three numbers](https://leetcode.com/problems/maximum-product-of-three-numbers)\t| 28ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 637\t| [average of levels in binary tree](https://leetcode.com/problems/average-of-levels-in-binary-tree)\t| 8ms\t| O(n)\t| O(n)\t| 89.47% 🟠\t|\n| 658\t| [find k closest elements](https://leetcode.com/problems/find-k-closest-elements)\t| 123ms\t| O(n*log(n))\t| O(n)\t| 6.82% 🔴\t|\n| 677\t| [map sum pairs](https://leetcode.com/problems/map-sum-pairs)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 682\t| [baseball game](https://leetcode.com/problems/baseball-game)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 690\t| [employee importance](https://leetcode.com/problems/employee-importance)\t| 12ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 700\t| [search in a binary search tree](https://leetcode.com/problems/search-in-a-binary-search-tree)\t| 24ms\t| O(n)\t| O(1)\t| 84.67% 🟠\t|\n| 703\t| [kth largest element in a stream](https://leetcode.com/problems/kth-largest-element-in-a-stream)\t| 32ms\t| O(n*log(n))\t| O(n)\t| 78.22% 🟠\t|\n| 704\t| [binary search](https://leetcode.com/problems/binary-search)\t| 36ms\t| O(log(n))\t| O(1)\t| 67.19% 🟠\t|\n| 724\t| [find pivot index](https://leetcode.com/problems/find-pivot-index)\t| 12ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 733\t| [flood fill](https://leetcode.com/problems/flood-fill)\t| 4ms\t| O(n^2)\t| O(n)\t| 99.07% 🟢\t|\n| 744\t| [find smallest letter greater than target](https://leetcode.com/problems/find-smallest-letter-greater-than-target)\t| 0ms\t| O(log(n))\t| O(1)\t| 100% 🟢\t|\n| 786\t| [k th smallest prime fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction)\t| 486ms\t| O(n^2)\t| O(n)\t| 50% 🟠\t|\n| 844\t| [backspace string compare](https://leetcode.com/problems/backspace-string-compare)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 852\t| [peak index in a mountain array](https://leetcode.com/problems/peak-index-in-a-mountain-array)\t| 0ms\t| O(log(n))\t| O(1)\t| 100% 🟢\t|\n| 875\t| [koko eating bananas](https://leetcode.com/problems/koko-eating-bananas)\t| 48ms\t| O(n*log(n))\t| O(1)\t| 55.77% 🟠\t|\n| 876\t| [middle of the linked list](https://leetcode.com/problems/middle-of-the-linked-list)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 922\t| [sort array by parity ii](https://leetcode.com/problems/sort-array-by-parity-ii)\t| 16ms\t| O(n)\t| O(1)\t| 98.46% 🟢\t|\n| 925\t| [long pressed name](https://leetcode.com/problems/long-pressed-name)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 933\t| [number of recent calls](https://leetcode.com/problems/number-of-recent-calls)\t| 128ms\t| O(n)\t| O(n)\t| 79.37% 🟠\t|\n| 976\t| [largest perimeter triangle](https://leetcode.com/problems/largest-perimeter-triangle)\t| 24ms\t| O(n*log(n))\t| O(1)\t| 100% 🟢\t|\n| 989\t| [add to array form of integer](https://leetcode.com/problems/add-to-array-form-of-integer)\t| 24ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 1011\t| [capacity to ship packages within d days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days)\t| 40ms\t| O(n*log(n))\t| O(1)\t| 41.46% 🔴\t|\n| 1021\t| [remove outermost parentheses](https://leetcode.com/problems/remove-outermost-parentheses)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 1030\t| [matrix cells in distance order](https://leetcode.com/problems/matrix-cells-in-distance-order)\t| 36ms\t| O(n^2)\t| O(n^2)\t| 15.38% 🔴\t|\n| 1046\t| [last stone weight](https://leetcode.com/problems/last-stone-weight)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 1047\t| [remove all adjacent duplicates in string](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string)\t| 4ms\t| O(n)\t| O(n)\t| 87.67% 🟠\t|\n| 1122\t| [relative sort array](https://leetcode.com/problems/relative-sort-array)\t| 0ms\t| O(n^2)\t| O(n)\t| 100% 🟢\t|\n| 1147\t| [longest chunked palindrome decomposition](https://leetcode.com/problems/longest-chunked-palindrome-decomposition)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 1290\t| [convert binary number in a linked list to integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 1323\t| [maximum 69 number](https://leetcode.com/problems/maximum-69-number)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 1337\t| [the k weakest rows in a matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix)\t| 12ms\t| O(n*m)\t| O(n)\t| 82.89% 🟠\t|\n| 1346\t| [check if n and its double exist](https://leetcode.com/problems/check-if-n-and-its-double-exist)\t| 4ms\t| O(n)\t| O(n)\t| 87.06% 🟠\t|\n| 1351\t| [count negative numbers in a sorted matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix)\t| 8ms\t| O(log(n))\t| O(1)\t| 99.26% 🟢\t|\n| 1356\t| [sort integers by the number of 1 bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits)\t| 12ms\t| O(n*log(n))\t| O(n)\t| 13.46% 🔴\t|\n| 1370\t| [increasing decreasing string](https://leetcode.com/problems/increasing-decreasing-string)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 1392\t| [longest happy prefix](https://leetcode.com/problems/longest-happy-prefix)\t| 16ms\t| O(n)\t| O(n)\t| 72.22% 🟠\t|\n| 1399\t| [count largest group](https://leetcode.com/problems/count-largest-group)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 1403\t| [minimum subsequence in non increasing order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order)\t| 4ms\t| O(n*log(n))\t| O(n)\t| 97.44% 🟢\t|\n| 1413\t| [minimum value to get positive step by step sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 1417\t| [reformat the string](https://leetcode.com/problems/reformat-the-string)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 1436\t| [destination city](https://leetcode.com/problems/destination-city)\t| 4ms\t| O(n)\t| O(n)\t| 91.94% 🟢\t|\n| 1437\t| [check if all 1s are at least length k places away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away)\t| 64ms\t| O(n)\t| O(1)\t| 75% 🟠\t|\n| 1441\t| [build an array with stack operations](https://leetcode.com/problems/build-an-array-with-stack-operations)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 1464\t| [maximum product of two elements in an array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array)\t| 4ms\t| O(n)\t| O(n)\t| 91.3% 🟢\t|\n| 1480\t| [running sum of 1d array](https://leetcode.com/problems/running-sum-of-1d-array)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 1491\t| [average salary excluding the minimum and maximum salary](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 1502\t| [can make arithmetic progression from sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence)\t| 0ms\t| O(n*log(n))\t| O(n)\t| 100% 🟢\t|\n| 1507\t| [reformat date](https://leetcode.com/problems/reformat-date)\t| 0ms\t| O(1)\t| O(1)\t| 100% 🟢\t|\n| 1528\t| [shuffle string](https://leetcode.com/problems/shuffle-string)\t| 4ms\t| O(n)\t| O(n)\t| 87.5% 🟠\t|\n| 1544\t| [make the string great](https://leetcode.com/problems/make-the-string-great)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 1598\t| [crawler log folder](https://leetcode.com/problems/crawler-log-folder)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 1640\t| [check array formation through concatenation](https://leetcode.com/problems/check-array-formation-through-concatenation)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 1672\t| [richest customer wealth](https://leetcode.com/problems/richest-customer-wealth)\t| 0ms\t| O(n^2)\t| O(n)\t| 100% 🟢\t|\n| 1673\t| [find the most competitive subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence)\t| 2860ms\t| O(n^2)\t| O(n)\t| 8.33% 🔴\t|\n| 1684\t| [count the number of consistent strings](https://leetcode.com/problems/count-the-number-of-consistent-strings)\t| 32ms\t| O(n^2)\t| O(n)\t| 65% 🟠\t|\n| 1688\t| [count of matches in tournament](https://leetcode.com/problems/count-of-matches-in-tournament)\t| 0ms\t| O(log(n))\t| O(1)\t| 100% 🟢\t|\n| 1822\t| [sign of the product of an array](https://leetcode.com/problems/sign-of-the-product-of-an-array)\t| 4ms\t| O(n)\t| O(1)\t| 96.21% 🟢\t|\n| 1827\t| [minimum operations to make the array increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing)\t| 8ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 1832\t| [check if the sentence is pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 1903\t| [largest odd number in string](https://leetcode.com/problems/largest-odd-number-in-string)\t| 4ms\t| O(n)\t| O(1)\t| 97.06% 🟢\t|\n| 1974\t| [minimum time to type word using special typewriter](https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 1984\t| [minimum difference between highest and lowest of k scores](https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores)\t| 15ms\t| O(n*log(n))\t| O(1)\t| 85.85% 🟠\t|\n| 1991\t| [find the middle index in array](https://leetcode.com/problems/find-the-middle-index-in-array)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 1995\t| [count special quadruplets](https://leetcode.com/problems/count-special-quadruplets)\t| 12ms\t| O(n^4)\t| O(1)\t| 82.41% 🟠\t|\n| 2000\t| [reverse prefix of word](https://leetcode.com/problems/reverse-prefix-of-word)\t| 0ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n| 2001\t| [number of pairs of interchangeable rectangles](https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles)\t| 280ms\t| O(n)\t| O(n)\t| 98.28% 🟢\t|\n| 2006\t| [count number of pairs with absolute difference k](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k)\t| 4ms\t| O(n^2)\t| O(1)\t| 100% 🟢\t|\n| 2011\t| [final value of variable after performing operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations)\t| 4ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 2016\t| [maximum difference between increasing elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 2027\t| [minimum moves to convert string](https://leetcode.com/problems/minimum-moves-to-convert-string)\t| 0ms\t| O(n)\t| O(1)\t| 100% 🟢\t|\n| 2500\t| [delete greatest value in each row](https://leetcode.com/problems/delete-greatest-value-in-each-row)\t| 32ms\t| O(n^2)\t| O(1)\t| 100% 🟢\t|\n| 2501\t| [longest square streak in an array](https://leetcode.com/problems/longest-square-streak-in-an-array)\t| 487ms\t| O(n)\t| O(n)\t| 100% 🟢\t|\n\n\u003c!-- golang inject solutions end --\u003e\n\n## JetBrains Leetcode Plugin Setup\n\nfile name template\n```\n$!{question.frontendQuestionId}_$!velocityTool.snakeCaseName(${question.titleSlug})/$!velocityTool.snakeCaseName(${question.titleSlug})\n```\n\ncode template\n```\npackage $!velocityTool.snakeCaseName(${question.titleSlug})\n\n// https://leetcode.com/problems/${question.titleSlug}\n\n// level: ${question.level}\n// time:\n// space:\n\n${question.code}\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmutoe%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmutoe%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmutoe%2Fleetcode/lists"}