Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/mutoe/leetcode
Personal leetcode playground.
https://github.com/mutoe/leetcode
golang leetcode
Last synced: 23 days ago
JSON representation
Personal leetcode playground.
- Host: GitHub
- URL: https://github.com/mutoe/leetcode
- Owner: mutoe
- Created: 2020-04-25T14:35:11.000Z (over 4 years ago)
- Default Branch: master
- Last Pushed: 2023-02-28T17:52:14.000Z (almost 2 years ago)
- Last Synced: 2024-10-16T18:42:55.615Z (2 months ago)
- Topics: golang, leetcode
- Language: Go
- Homepage:
- Size: 905 KB
- Stars: 2
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Leetcode solution
[](https://github.com/mutoe/leetcode/actions)
[](https://codecov.io/gh/mutoe/leetcode)
Thanks for [leetcode editor](https://plugins.jetbrains.com/plugin/12132-leetcode-editor/) provide convenient learning tools.
## Solutions
|ID|Title|Time| |Space|Ranking|
|---:|--|--:|:--|:--|--:|
| 1 | [two sum](https://leetcode.com/problems/two-sum) | 4ms | O(n) | O(n) | 95.58% 🟢 |
| 2 | [add two numbers](https://leetcode.com/problems/add-two-numbers) | 12ms | O(n) | O(n) | 64.05% 🟠|
| 3 | [longest substring without repeating characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | 584ms | O(n^2) | O(n) | 5.03% 🔴 |
| 6 | [zigzag conversion](https://leetcode.com/problems/zigzag-conversion) | 8ms | O(n) | O(n) | 74.58% 🟠|
| 7 | [reverse integer](https://leetcode.com/problems/reverse-integer) | 0ms | O(log(n)) | O(1) | 100% 🟢 |
| 8 | [string to integer atoi](https://leetcode.com/problems/string-to-integer-atoi) | 4ms | O(n) | O(1) | 47.51% 🔴 |
| 11 | [container with most water](https://leetcode.com/problems/container-with-most-water) | 296ms | O(n^2) | O(1) | 26.72% 🔴 |
| 12 | [integer to roman](https://leetcode.com/problems/integer-to-roman) | 12ms | O(log(n)) | O(1) | 44.82% 🔴 |
| 20 | [valid parentheses](https://leetcode.com/problems/valid-parentheses) | 0ms | O(n) | O(n) | 100% 🟢 |
| 21 | [merge two sorted lists](https://leetcode.com/problems/merge-two-sorted-lists) | 0ms | O(n) | O(1) | 100% 🟢 |
| 35 | [search insert position](https://leetcode.com/problems/search-insert-position) | 0ms | O(log(n)) | O(1) | 100% 🟢 |
| 69 | [sqrtx](https://leetcode.com/problems/sqrtx) | 8ms | O(log(n)) | O(1) | 19.58% 🔴 |
| 75 | [sort colors](https://leetcode.com/problems/sort-colors) | 0ms | O(n) | O(1) | 100% 🟢 |
| 83 | [remove duplicates from sorted list](https://leetcode.com/problems/remove-duplicates-from-sorted-list) | 0ms | O(n) | O(1) | 100% 🟢 |
| 100 | [same tree](https://leetcode.com/problems/same-tree) | 0ms | O(n) | O(1) | 100% 🟢 |
| 101 | [symmetric tree](https://leetcode.com/problems/symmetric-tree) | 0ms | O(n) | O(1) | 100% 🟢 |
| 102 | [binary tree level order traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | 0ms | O(n) | O(n) | 100% 🟢 |
| 104 | [maximum depth of binary tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | 4ms | O(n) | O(1) | 90.15% 🟢 |
| 107 | [binary tree level order traversal ii](https://leetcode.com/problems/binary-tree-level-order-traversal-ii) | 0ms | O(n) | O(n) | 100% 🟢 |
| 108 | [convert sorted array to binary search tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | 108ms | O(n) | O(n) | 62.9% 🟠|
| 110 | [balanced binary tree](https://leetcode.com/problems/balanced-binary-tree) | 4ms | O(n) | O(n) | 96.71% 🟢 |
| 111 | [minimum depth of binary tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | 228ms | O(n) | O(n) | 85.67% 🟠|
| 112 | [path sum](https://leetcode.com/problems/path-sum) | 4ms | O(n) | O(1) | 96.52% 🟢 |
| 119 | [pascals triangle ii](https://leetcode.com/problems/pascals-triangle-ii) | 1ms | O(n^2) | O(n^2) | 59.83% 🟠|
| 122 | [best time to buy and sell stock ii](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii) | 4ms | O(n) | O(1) | 94.38% 🟢 |
| 125 | [valid palindrome](https://leetcode.com/problems/valid-palindrome) | 0ms | O(n*log(n)) | O(1) | 100% 🟢 |
| 141 | [linked list cycle](https://leetcode.com/problems/linked-list-cycle) | 4ms | O(n) | O(1) | 96% 🟢 |
| 155 | [min stack](https://leetcode.com/problems/min-stack) | 12ms | O(n) | O(n) | 98.73% 🟢 |
| 160 | [intersection of two linked lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | 44ms | O(n) | O(n) | 30.1% 🔴 |
| 167 | [two sum ii input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | 4ms | O(n*log(n)) | O(1) | 94.87% 🟢 |
| 168 | [excel sheet column title](https://leetcode.com/problems/excel-sheet-column-title) | 0ms | O(log(n)) | O(1) | 100% 🟢 |
| 171 | [excel sheet column number](https://leetcode.com/problems/excel-sheet-column-number) | 0ms | O(n) | O(1) | 100% 🟢 |
| 182 | [duplicate emails](https://leetcode.com/problems/duplicate-emails) | 343ms | unknown | unknown | 42.48% 🔴 |
| 193 | [valid phone numbers](https://leetcode.com/problems/valid-phone-numbers) | 0ms | O(n) | O(1) | 100% 🟢 |
| 195 | [tenth line](https://leetcode.com/problems/tenth-line) | 0ms | O(1) | O(1) | 100% 🟢 |
| 200 | [number of islands](https://leetcode.com/problems/number-of-islands) | 0ms | O(n*m) | O(n) | 100% 🟢 |
| 201 | [bitwise and of numbers range](https://leetcode.com/problems/bitwise-and-of-numbers-range) | 626ms | O(n) | O(1) | 6.25% 🔴 |
| 202 | [happy number](https://leetcode.com/problems/happy-number) | 0ms | O(1) | O(1) | 100% 🟢 |
| 203 | [remove linked list elements](https://leetcode.com/problems/remove-linked-list-elements) | 8ms | O(n) | O(1) | 88.89% 🟠|
| 204 | [count primes](https://leetcode.com/problems/count-primes) | 8ms | O(n) | O(n) | 81.42% 🟠|
| 206 | [reverse linked list](https://leetcode.com/problems/reverse-linked-list) | 0ms | O(n) | O(1) | 100% 🟢 |
| 208 | [implement trie prefix tree](https://leetcode.com/problems/implement-trie-prefix-tree) | 72ms | O(n) | O(n) | 50.75% 🟠|
| 211 | [design add and search words data structure](https://leetcode.com/problems/design-add-and-search-words-data-structure) | 96ms | O(n) | O(n) | 38.61% 🔴 |
| 212 | [word search ii](https://leetcode.com/problems/word-search-ii) | 1432ms | unknown | O(n) | 26.06% 🔴 |
| 215 | [kth largest element in an array](https://leetcode.com/problems/kth-largest-element-in-an-array) | 4ms | O(n*log(n)) | O(1) | 98.66% 🟢 |
| 219 | [contains duplicate ii](https://leetcode.com/problems/contains-duplicate-ii) | 250ms | O(n) | O(n) | 37.93% 🔴 |
| 225 | [implement stack using queues](https://leetcode.com/problems/implement-stack-using-queues) | 0ms | O(n) | O(n) | 100% 🟢 |
| 226 | [invert binary tree](https://leetcode.com/problems/invert-binary-tree) | 0ms | O(n) | O(1) | 100% 🟢 |
| 231 | [power of two](https://leetcode.com/problems/power-of-two) | 0ms | O(log(n)) | O(1) | 100% 🟢 |
| 232 | [implement queue using stacks](https://leetcode.com/problems/implement-queue-using-stacks) | 0ms | O(n) | O(1) | 100% 🟢 |
| 235 | [lowest common ancestor of a binary search tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree) | 20ms | O(n) | O(1) | 80.11% 🟠|
| 237 | [delete node in a linked list](https://leetcode.com/problems/delete-node-in-a-linked-list) | 0ms | O(1) | O(1) | 100% 🟢 |
| 242 | [valid anagram](https://leetcode.com/problems/valid-anagram) | 0ms | O(n) | O(1) | 100% 🟢 |
| 258 | [add digits](https://leetcode.com/problems/add-digits) | 0ms | O(1) | O(1) | 100% 🟢 |
| 263 | [ugly number](https://leetcode.com/problems/ugly-number) | 0ms | O(log(n)) | O(1) | 100% 🟢 |
| 278 | [first bad version](https://leetcode.com/problems/first-bad-version) | 0ms | O(log(n)) | O(1) | 100% 🟢 |
| 283 | [move zeroes](https://leetcode.com/problems/move-zeroes) | 12ms | O(n*log(n)) | O(1) | 6.22% 🔴 |
| 303 | [range sum query immutable](https://leetcode.com/problems/range-sum-query-immutable) | 24ms | O(n) | O(n) | 98.41% 🟢 |
| 326 | [power of three](https://leetcode.com/problems/power-of-three) | 8ms | O(1) | O(1) | 99.32% 🟢 |
| 345 | [reverse vowels of a string](https://leetcode.com/problems/reverse-vowels-of-a-string) | 0ms | O(n*log(n)) | O(n) | 100% 🟢 |
| 347 | [top k frequent elements](https://leetcode.com/problems/top-k-frequent-elements) | 12ms | O(n) | O(n) | 87.27% 🟠|
| 349 | [intersection of two arrays](https://leetcode.com/problems/intersection-of-two-arrays) | 0ms | O(n) | O(n) | 100% 🟢 |
| 350 | [intersection of two arrays ii](https://leetcode.com/problems/intersection-of-two-arrays-ii) | 4ms | O(n) | O(n) | 79.29% 🟠|
| 367 | [valid perfect square](https://leetcode.com/problems/valid-perfect-square) | 0ms | O(log(n)) | O(1) | 100% 🟢 |
| 374 | [guess number higher or lower](https://leetcode.com/problems/guess-number-higher-or-lower) | 0ms | O(log(n)) | O(1) | 100% 🟢 |
| 387 | [first unique character in a string](https://leetcode.com/problems/first-unique-character-in-a-string) | 4ms | O(n) | O(1) | 97.53% 🟢 |
| 392 | [is subsequence](https://leetcode.com/problems/is-subsequence) | 0ms | O(n) | O(1) | 100% 🟢 |
| 404 | [sum of left leaves](https://leetcode.com/problems/sum-of-left-leaves) | 0ms | O(n) | O(1) | 100% 🟢 |
| 415 | [add strings](https://leetcode.com/problems/add-strings) | 0ms | O(n) | O(n) | 100% 🟢 |
| 441 | [arranging coins](https://leetcode.com/problems/arranging-coins) | 8ms | O(n) | O(1) | 38.46% 🔴 |
| 468 | [validate ip address](https://leetcode.com/problems/validate-ip-address) | 0ms | O(1) | O(1) | 100% 🟢 |
| 496 | [next greater element i](https://leetcode.com/problems/next-greater-element-i) | 0ms | O(n^2) | O(n) | 100% 🟢 |
| 501 | [find mode in binary search tree](https://leetcode.com/problems/find-mode-in-binary-search-tree) | 12ms | O(n) | O(n) | 51.16% 🟠|
| 506 | [relative ranks](https://leetcode.com/problems/relative-ranks) | 12ms | O(n*log(n)) | O(log(n)) | 93.94% 🟢 |
| 507 | [perfect number](https://leetcode.com/problems/perfect-number) | 0ms | O(log(n)) | O(1) | 100% 🟢 |
| 530 | [minimum absolute difference in bst](https://leetcode.com/problems/minimum-absolute-difference-in-bst) | 12ms | O(n) | O(1) | 72.92% 🟠|
| 563 | [binary tree tilt](https://leetcode.com/problems/binary-tree-tilt) | 8ms | O(n) | O(1) | 94.08% 🟢 |
| 572 | [subtree of another tree](https://leetcode.com/problems/subtree-of-another-tree) | 20ms | O(n^2) | O(1) | 47.97% 🔴 |
| 617 | [merge two binary trees](https://leetcode.com/problems/merge-two-binary-trees) | 28ms | O(n) | O(n) | 87.26% 🟠|
| 628 | [maximum product of three numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | 28ms | O(n) | O(1) | 100% 🟢 |
| 637 | [average of levels in binary tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | 8ms | O(n) | O(n) | 89.47% 🟠|
| 658 | [find k closest elements](https://leetcode.com/problems/find-k-closest-elements) | 123ms | O(n*log(n)) | O(n) | 6.82% 🔴 |
| 677 | [map sum pairs](https://leetcode.com/problems/map-sum-pairs) | 0ms | O(n) | O(n) | 100% 🟢 |
| 682 | [baseball game](https://leetcode.com/problems/baseball-game) | 0ms | O(n) | O(n) | 100% 🟢 |
| 690 | [employee importance](https://leetcode.com/problems/employee-importance) | 12ms | O(n) | O(n) | 100% 🟢 |
| 700 | [search in a binary search tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | 24ms | O(n) | O(1) | 84.67% 🟠|
| 703 | [kth largest element in a stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | 32ms | O(n*log(n)) | O(n) | 78.22% 🟠|
| 704 | [binary search](https://leetcode.com/problems/binary-search) | 36ms | O(log(n)) | O(1) | 67.19% 🟠|
| 724 | [find pivot index](https://leetcode.com/problems/find-pivot-index) | 12ms | O(n) | O(n) | 100% 🟢 |
| 733 | [flood fill](https://leetcode.com/problems/flood-fill) | 4ms | O(n^2) | O(n) | 99.07% 🟢 |
| 744 | [find smallest letter greater than target](https://leetcode.com/problems/find-smallest-letter-greater-than-target) | 0ms | O(log(n)) | O(1) | 100% 🟢 |
| 786 | [k th smallest prime fraction](https://leetcode.com/problems/k-th-smallest-prime-fraction) | 486ms | O(n^2) | O(n) | 50% 🟠|
| 844 | [backspace string compare](https://leetcode.com/problems/backspace-string-compare) | 0ms | O(n) | O(1) | 100% 🟢 |
| 852 | [peak index in a mountain array](https://leetcode.com/problems/peak-index-in-a-mountain-array) | 0ms | O(log(n)) | O(1) | 100% 🟢 |
| 875 | [koko eating bananas](https://leetcode.com/problems/koko-eating-bananas) | 48ms | O(n*log(n)) | O(1) | 55.77% 🟠|
| 876 | [middle of the linked list](https://leetcode.com/problems/middle-of-the-linked-list) | 0ms | O(n) | O(1) | 100% 🟢 |
| 922 | [sort array by parity ii](https://leetcode.com/problems/sort-array-by-parity-ii) | 16ms | O(n) | O(1) | 98.46% 🟢 |
| 925 | [long pressed name](https://leetcode.com/problems/long-pressed-name) | 0ms | O(n) | O(1) | 100% 🟢 |
| 933 | [number of recent calls](https://leetcode.com/problems/number-of-recent-calls) | 128ms | O(n) | O(n) | 79.37% 🟠|
| 976 | [largest perimeter triangle](https://leetcode.com/problems/largest-perimeter-triangle) | 24ms | O(n*log(n)) | O(1) | 100% 🟢 |
| 989 | [add to array form of integer](https://leetcode.com/problems/add-to-array-form-of-integer) | 24ms | O(n) | O(1) | 100% 🟢 |
| 1011 | [capacity to ship packages within d days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days) | 40ms | O(n*log(n)) | O(1) | 41.46% 🔴 |
| 1021 | [remove outermost parentheses](https://leetcode.com/problems/remove-outermost-parentheses) | 0ms | O(n) | O(n) | 100% 🟢 |
| 1030 | [matrix cells in distance order](https://leetcode.com/problems/matrix-cells-in-distance-order) | 36ms | O(n^2) | O(n^2) | 15.38% 🔴 |
| 1046 | [last stone weight](https://leetcode.com/problems/last-stone-weight) | 0ms | O(n) | O(n) | 100% 🟢 |
| 1047 | [remove all adjacent duplicates in string](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string) | 4ms | O(n) | O(n) | 87.67% 🟠|
| 1122 | [relative sort array](https://leetcode.com/problems/relative-sort-array) | 0ms | O(n^2) | O(n) | 100% 🟢 |
| 1147 | [longest chunked palindrome decomposition](https://leetcode.com/problems/longest-chunked-palindrome-decomposition) | 0ms | O(n) | O(n) | 100% 🟢 |
| 1290 | [convert binary number in a linked list to integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer) | 0ms | O(n) | O(1) | 100% 🟢 |
| 1323 | [maximum 69 number](https://leetcode.com/problems/maximum-69-number) | 0ms | O(n) | O(1) | 100% 🟢 |
| 1337 | [the k weakest rows in a matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix) | 12ms | O(n*m) | O(n) | 82.89% 🟠|
| 1346 | [check if n and its double exist](https://leetcode.com/problems/check-if-n-and-its-double-exist) | 4ms | O(n) | O(n) | 87.06% 🟠|
| 1351 | [count negative numbers in a sorted matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix) | 8ms | O(log(n)) | O(1) | 99.26% 🟢 |
| 1356 | [sort integers by the number of 1 bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits) | 12ms | O(n*log(n)) | O(n) | 13.46% 🔴 |
| 1370 | [increasing decreasing string](https://leetcode.com/problems/increasing-decreasing-string) | 0ms | O(n) | O(n) | 100% 🟢 |
| 1392 | [longest happy prefix](https://leetcode.com/problems/longest-happy-prefix) | 16ms | O(n) | O(n) | 72.22% 🟠|
| 1399 | [count largest group](https://leetcode.com/problems/count-largest-group) | 0ms | O(n) | O(n) | 100% 🟢 |
| 1403 | [minimum subsequence in non increasing order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order) | 4ms | O(n*log(n)) | O(n) | 97.44% 🟢 |
| 1413 | [minimum value to get positive step by step sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum) | 0ms | O(n) | O(n) | 100% 🟢 |
| 1417 | [reformat the string](https://leetcode.com/problems/reformat-the-string) | 0ms | O(n) | O(n) | 100% 🟢 |
| 1436 | [destination city](https://leetcode.com/problems/destination-city) | 4ms | O(n) | O(n) | 91.94% 🟢 |
| 1437 | [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) | 64ms | O(n) | O(1) | 75% 🟠|
| 1441 | [build an array with stack operations](https://leetcode.com/problems/build-an-array-with-stack-operations) | 0ms | O(n) | O(n) | 100% 🟢 |
| 1464 | [maximum product of two elements in an array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array) | 4ms | O(n) | O(n) | 91.3% 🟢 |
| 1480 | [running sum of 1d array](https://leetcode.com/problems/running-sum-of-1d-array) | 0ms | O(n) | O(n) | 100% 🟢 |
| 1491 | [average salary excluding the minimum and maximum salary](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary) | 0ms | O(n) | O(1) | 100% 🟢 |
| 1502 | [can make arithmetic progression from sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence) | 0ms | O(n*log(n)) | O(n) | 100% 🟢 |
| 1507 | [reformat date](https://leetcode.com/problems/reformat-date) | 0ms | O(1) | O(1) | 100% 🟢 |
| 1528 | [shuffle string](https://leetcode.com/problems/shuffle-string) | 4ms | O(n) | O(n) | 87.5% 🟠|
| 1544 | [make the string great](https://leetcode.com/problems/make-the-string-great) | 0ms | O(n) | O(n) | 100% 🟢 |
| 1598 | [crawler log folder](https://leetcode.com/problems/crawler-log-folder) | 0ms | O(n) | O(1) | 100% 🟢 |
| 1640 | [check array formation through concatenation](https://leetcode.com/problems/check-array-formation-through-concatenation) | 0ms | O(n) | O(n) | 100% 🟢 |
| 1672 | [richest customer wealth](https://leetcode.com/problems/richest-customer-wealth) | 0ms | O(n^2) | O(n) | 100% 🟢 |
| 1673 | [find the most competitive subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence) | 2860ms | O(n^2) | O(n) | 8.33% 🔴 |
| 1684 | [count the number of consistent strings](https://leetcode.com/problems/count-the-number-of-consistent-strings) | 32ms | O(n^2) | O(n) | 65% 🟠|
| 1688 | [count of matches in tournament](https://leetcode.com/problems/count-of-matches-in-tournament) | 0ms | O(log(n)) | O(1) | 100% 🟢 |
| 1822 | [sign of the product of an array](https://leetcode.com/problems/sign-of-the-product-of-an-array) | 4ms | O(n) | O(1) | 96.21% 🟢 |
| 1827 | [minimum operations to make the array increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing) | 8ms | O(n) | O(1) | 100% 🟢 |
| 1832 | [check if the sentence is pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram) | 0ms | O(n) | O(1) | 100% 🟢 |
| 1903 | [largest odd number in string](https://leetcode.com/problems/largest-odd-number-in-string) | 4ms | O(n) | O(1) | 97.06% 🟢 |
| 1974 | [minimum time to type word using special typewriter](https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter) | 0ms | O(n) | O(1) | 100% 🟢 |
| 1984 | [minimum difference between highest and lowest of k scores](https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores) | 15ms | O(n*log(n)) | O(1) | 85.85% 🟠|
| 1991 | [find the middle index in array](https://leetcode.com/problems/find-the-middle-index-in-array) | 0ms | O(n) | O(n) | 100% 🟢 |
| 1995 | [count special quadruplets](https://leetcode.com/problems/count-special-quadruplets) | 12ms | O(n^4) | O(1) | 82.41% 🟠|
| 2000 | [reverse prefix of word](https://leetcode.com/problems/reverse-prefix-of-word) | 0ms | O(n) | O(n) | 100% 🟢 |
| 2001 | [number of pairs of interchangeable rectangles](https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles) | 280ms | O(n) | O(n) | 98.28% 🟢 |
| 2006 | [count number of pairs with absolute difference k](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k) | 4ms | O(n^2) | O(1) | 100% 🟢 |
| 2011 | [final value of variable after performing operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations) | 4ms | O(n) | O(1) | 100% 🟢 |
| 2016 | [maximum difference between increasing elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements) | 0ms | O(n) | O(1) | 100% 🟢 |
| 2027 | [minimum moves to convert string](https://leetcode.com/problems/minimum-moves-to-convert-string) | 0ms | O(n) | O(1) | 100% 🟢 |
| 2500 | [delete greatest value in each row](https://leetcode.com/problems/delete-greatest-value-in-each-row) | 32ms | O(n^2) | O(1) | 100% 🟢 |
| 2501 | [longest square streak in an array](https://leetcode.com/problems/longest-square-streak-in-an-array) | 487ms | O(n) | O(n) | 100% 🟢 |
## JetBrains Leetcode Plugin Setup
file name template
```
$!{question.frontendQuestionId}_$!velocityTool.snakeCaseName(${question.titleSlug})/$!velocityTool.snakeCaseName(${question.titleSlug})
```
code template
```
package $!velocityTool.snakeCaseName(${question.titleSlug})
// https://leetcode.com/problems/${question.titleSlug}
// level: ${question.level}
// time:
// space:
${question.code}
```