|
.github
|
|
|
0H97ZC
|
|
|
0on3uN
|
|
|
1-bit-and-2-bit-characters
|
|
|
1fGaJU
|
|
|
1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof
|
|
|
2vYnGI
|
|
|
3Etpl5
|
|
|
3sum
|
|
|
3sum-closest
|
|
|
3u1WK4
|
|
|
4sum
|
|
|
4ueAj6
|
|
|
6eUYwP
|
|
|
6olJmJ
|
|
|
7p8L0Z
|
|
|
7WHec2
|
|
|
8Zf90G
|
|
|
132-pattern
|
|
|
a-number-after-a-double-reversal
|
|
|
abbreviating-the-product-of-a-range
|
|
|
add-binary
|
|
|
add-digits
|
|
|
add-edges-to-make-degrees-of-all-nodes-even
|
|
|
add-one-row-to-tree
|
|
|
add-strings
|
|
|
add-to-array-form-of-integer
|
|
|
add-two-integers
|
|
|
add-two-numbers
|
|
|
add-two-numbers-ii
|
|
|
add-two-polynomials-represented-as-linked-lists
|
|
|
add-without-plus-lcci
|
|
|
adding-two-negabinary-numbers
|
|
|
additive-number
|
|
|
advantage-shuffle
|
|
|
alert-using-same-key-card-three-or-more-times-in-a-one-hour-period
|
|
|
alien-dictionary
|
|
|
all-ancestors-of-a-node-in-a-directed-acyclic-graph
|
|
|
all-elements-in-two-binary-search-trees
|
|
|
all-oone-data-structure
|
|
|
all-paths-from-source-to-target
|
|
|
all-possible-full-binary-trees
|
|
|
allocate-mailboxes
|
|
|
allow-one-function-call
|
|
|
ambiguous-coordinates
|
|
|
aMhZSa
|
|
|
angle-between-hands-of-a-clock
|
|
|
animal-shelter-lcci
|
|
|
append-k-integers-with-minimal-sum
|
|
|
apply-discount-to-prices
|
|
|
apply-operations-to-an-array
|
|
|
apply-transform-over-each-element-in-array
|
|
|
armstrong-number
|
|
|
array-nesting
|
|
|
array-partition
|
|
|
array-prototype-last
|
|
|
array-reduce-transformation
|
|
|
as-far-from-land-as-possible
|
|
|
assign-cookies
|
|
|
average-of-levels-in-binary-tree
|
|
|
average-value-of-even-numbers-that-are-divisible-by-three
|
|
|
B1IidL
|
|
|
ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof
|
|
|
ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof
|
|
|
ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof
|
|
|
balanced-binary-tree
|
|
|
bao-han-minhan-shu-de-zhan-lcof
|
|
|
base-7
|
|
|
basic-calculator
|
|
|
basic-calculator-ii
|
|
|
basic-calculator-iii
|
|
|
basic-calculator-iv
|
|
|
beautiful-arrangement
|
|
|
beautiful-arrangement-ii
|
|
|
best-time-to-buy-and-sell-stock
|
|
|
best-time-to-buy-and-sell-stock-ii
|
|
|
best-time-to-buy-and-sell-stock-iii
|
|
|
best-time-to-buy-and-sell-stock-iv
|
|
|
best-time-to-buy-and-sell-stock-with-cooldown
|
|
|
best-time-to-buy-and-sell-stock-with-transaction-fee
|
|
|
bianry-number-to-string-lcci
|
|
|
biao-shi-shu-zhi-de-zi-fu-chuan-lcof
|
|
|
binary-gap
|
|
|
binary-search
|
|
|
binary-search-tree-iterator
|
|
|
binary-search-tree-iterator-ii
|
|
|
binary-search-tree-to-greater-sum-tree
|
|
|
binary-tree-cameras
|
|
|
binary-tree-inorder-traversal
|
|
|
binary-tree-level-order-traversal
|
|
|
binary-tree-level-order-traversal-ii
|
|
|
binary-tree-maximum-path-sum
|
|
|
binary-tree-paths
|
|
|
binary-tree-postorder-traversal
|
|
|
binary-tree-preorder-traversal
|
|
|
binary-tree-pruning
|
|
|
binary-tree-right-side-view
|
|
|
binary-tree-upside-down
|
|
|
binary-tree-zigzag-level-order-traversal
|
|
|
binary-watch
|
|
|
binode-lcci
|
|
|
bitwise-and-of-numbers-range
|
|
|
bLyHh0
|
|
|
boats-to-save-people
|
|
|
booking-concert-tickets-in-groups
|
|
|
boolean-evaluation-lcci
|
|
|
boundary-of-binary-tree
|
|
|
bP4bmD
|
|
|
brace-expansion
|
|
|
brace-expansion-ii
|
|
|
bracket-lcci
|
|
|
break-a-palindrome
|
|
|
bricks-falling-when-hit
|
|
|
broken-calculator
|
|
|
bu-ke-pai-zhong-de-shun-zi-lcof
|
|
|
bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof
|
|
|
buddy-strings
|
|
|
build-an-array-with-stack-operations
|
|
|
build-array-from-permutation
|
|
|
building-boxes
|
|
|
building-h2o
|
|
|
bulb-switcher
|
|
|
bulb-switcher-ii
|
|
|
bulls-and-cows
|
|
|
c32eOV
|
|
|
cache-with-time-limit
|
|
|
calculate-amount-paid-in-taxes
|
|
|
calculate-delayed-arrival-time
|
|
|
calculator-lcci
|
|
|
camelcase-matching
|
|
|
car-fleet
|
|
|
ccw6C7
|
|
|
cells-in-a-range-on-an-excel-sheet
|
|
|
cells-with-odd-values-in-a-matrix
|
|
|
champagne-tower
|
|
|
change-minimum-characters-to-satisfy-one-of-three-conditions
|
|
|
check-array-formation-through-concatenation
|
|
|
check-completeness-of-a-binary-tree
|
|
|
check-distances-between-same-letters
|
|
|
check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
|
|
|
check-if-all-characters-have-equal-number-of-occurrences
|
|
|
check-if-array-is-sorted-and-rotated
|
|
|
check-if-binary-string-has-at-most-one-segment-of-ones
|
|
|
check-if-it-is-a-good-array
|
|
|
check-if-n-and-its-double-exist
|
|
|
check-if-number-has-equal-digit-count-and-digit-value
|
|
|
check-if-number-is-a-sum-of-powers-of-three
|
|
|
check-if-numbers-are-ascending-in-a-sentence
|
|
|
check-if-object-instance-of-class
|
|
|
check-if-one-string-swap-can-make-strings-equal
|
|
|
check-if-point-is-reachable
|
|
|
check-if-string-is-a-prefix-of-array
|
|
|
check-if-the-sentence-is-pangram
|
|
|
check-if-there-is-a-valid-path-in-a-grid
|
|
|
check-if-two-string-arrays-are-equivalent
|
|
|
check-permutation-lcci
|
|
|
checking-existence-of-edge-length-limited-paths
|
|
|
checking-existence-of-edge-length-limited-paths-ii
|
|
|
chou-shu-lcof
|
|
|
chunk-array
|
|
|
circle-and-rectangle-overlapping
|
|
|
circular-sentence
|
|
|
climbing-stairs
|
|
|
clone-graph
|
|
|
clone-n-ary-tree
|
|
|
closest-dessert-cost
|
|
|
closest-nodes-queries-in-a-binary-search-tree
|
|
|
clumsy-factorial
|
|
|
coin-change
|
|
|
coin-change-ii
|
|
|
color-fill-lcci
|
|
|
coloring-a-border
|
|
|
combination-sum
|
|
|
combination-sum-ii
|
|
|
combination-sum-iii
|
|
|
combination-sum-iv
|
|
|
combinations
|
|
|
compare-version-numbers
|
|
|
complement-of-base-10-integer
|
|
|
complete-binary-tree-inserter
|
|
|
complex-number-multiplication
|
|
|
compress-string-lcci
|
|
|
concatenated-words
|
|
|
concatenation-of-array
|
|
|
cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof
|
|
|
cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof
|
|
|
cong-shang-dao-xia-da-yin-er-cha-shu-lcof
|
|
|
cong-wei-dao-tou-da-yin-lian-biao-lcof
|
|
|
consecutive-numbers-sum
|
|
|
construct-binary-search-tree-from-preorder-traversal
|
|
|
construct-binary-tree-from-inorder-and-postorder-traversal
|
|
|
construct-binary-tree-from-preorder-and-inorder-traversal
|
|
|
construct-binary-tree-from-string
|
|
|
construct-quad-tree
|
|
|
construct-string-from-binary-tree
|
|
|
construct-the-rectangle
|
|
|
container-with-most-water
|
|
|
contains-duplicate
|
|
|
contains-duplicate-ii
|
|
|
contains-duplicate-iii
|
|
|
continuous-median-lcci
|
|
|
convert-1d-array-into-2d-array
|
|
|
convert-a-number-to-hexadecimal
|
|
|
convert-binary-number-in-a-linked-list-to-integer
|
|
|
convert-binary-search-tree-to-sorted-doubly-linked-list
|
|
|
convert-bst-to-greater-tree
|
|
|
convert-integer-to-the-sum-of-two-no-zero-integers
|
|
|
convert-object-to-json-string
|
|
|
convert-sorted-array-to-binary-search-tree
|
|
|
convert-sorted-list-to-binary-search-tree
|
|
|
convert-the-temperature
|
|
|
coordinate-with-maximum-network-quality
|
|
|
copy-list-with-random-pointer
|
|
|
count-all-possible-routes
|
|
|
count-anagrams
|
|
|
count-and-say
|
|
|
count-asterisks
|
|
|
count-complete-tree-nodes
|
|
|
count-days-spent-together
|
|
|
count-integers-with-even-digit-sum
|
|
|
count-items-matching-a-rule
|
|
|
count-nice-pairs-in-an-array
|
|
|
count-number-of-bad-pairs
|
|
|
count-number-of-distinct-integers-after-reverse-operations
|
|
|
count-number-of-homogenous-substrings
|
|
|
count-number-of-pairs-with-absolute-difference-k
|
|
|
count-numbers-with-unique-digits
|
|
|
count-odd-numbers-in-an-interval-range
|
|
|
count-of-matches-in-tournament
|
|
|
count-of-smaller-numbers-after-self
|
|
|
count-pairs-of-similar-strings
|
|
|
count-pairs-with-xor-in-a-range
|
|
|
count-prefixes-of-a-given-string
|
|
|
count-servers-that-communicate
|
|
|
count-special-integers
|
|
|
count-subarrays-with-fixed-bounds
|
|
|
count-the-number-of-consistent-strings
|
|
|
count-unique-characters-of-all-substrings-of-a-given-string
|
|
|
count-vowel-strings-in-ranges
|
|
|
count-ways-to-build-good-string
|
|
|
counter
|
|
|
counter-ii
|
|
|
counting-bits
|
|
|
counting-words-with-a-given-prefix
|
|
|
couples-holding-hands
|
|
|
course-schedule
|
|
|
course-schedule-ii
|
|
|
cousins-in-binary-tree
|
|
|
cracking-the-safe
|
|
|
crawler-log-folder
|
|
|
create-hello-world-function
|
|
|
create-target-array-in-the-given-order
|
|
|
curry
|
|
|
custom-sort-string
|
|
|
cuyjEf
|
|
|
cycle-length-queries-in-a-tree
|
|
|
cyJERH
|
|
|
da-yin-cong-1dao-zui-da-de-nwei-shu-lcof
|
|
|
daily-temperatures
|
|
|
debounce
|
|
|
decode-string
|
|
|
decode-the-message
|
|
|
decode-ways
|
|
|
decode-xored-array
|
|
|
decompress-run-length-encoded-list
|
|
|
deep-dark-fraction
|
|
|
deepest-leaves-sum
|
|
|
defanging-an-ip-address
|
|
|
defuse-the-bomb
|
|
|
delete-characters-to-make-fancy-string
|
|
|
delete-middle-node-lcci
|
|
|
delete-node-in-a-bst
|
|
|
delete-node-in-a-linked-list
|
|
|
delete-operation-for-two-strings
|
|
|
delete-the-middle-node-of-a-linked-list
|
|
|
delete-tree-nodes
|
|
|
delivering-boxes-from-storage-to-ports
|
|
|
design-a-file-sharing-system
|
|
|
design-a-food-rating-system
|
|
|
design-a-number-container-system
|
|
|
design-a-stack-with-increment-operation
|
|
|
design-a-text-editor
|
|
|
design-add-and-search-words-data-structure
|
|
|
design-an-atm-machine
|
|
|
design-an-expression-tree-with-evaluate-function
|
|
|
design-an-ordered-stream
|
|
|
design-authentication-manager
|
|
|
design-bitset
|
|
|
design-browser-history
|
|
|
design-cancellable-function
|
|
|
design-circular-deque
|
|
|
design-circular-queue
|
|
|
design-compressed-string-iterator
|
|
|
design-file-system
|
|
|
design-front-middle-back-queue
|
|
|
design-hashmap
|
|
|
design-hashset
|
|
|
design-in-memory-file-system
|
|
|
design-linked-list
|
|
|
design-movie-rental-system
|
|
|
design-parking-system
|
|
|
design-skiplist
|
|
|
design-twitter
|
|
|
design-underground-system
|
|
|
detect-capital
|
|
|
determine-color-of-a-chessboard-square
|
|
|
determine-if-string-halves-are-alike
|
|
|
determine-if-two-events-have-conflict
|
|
|
detonate-the-maximum-bombs
|
|
|
di-string-match
|
|
|
di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof
|
|
|
diagonal-traverse
|
|
|
diagonal-traverse-ii
|
|
|
diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof
|
|
|
difference-between-element-sum-and-digit-sum-of-an-array
|
|
|
difference-between-ones-and-zeros-in-row-and-column
|
|
|
different-ways-to-add-parentheses
|
|
|
dinner-plate-stacks
|
|
|
display-table-of-food-orders-in-a-restaurant
|
|
|
distance-between-bus-stops
|
|
|
distinct-subsequences
|
|
|
distinct-subsequences-ii
|
|
|
distribute-candies
|
|
|
distribute-coins-in-binary-tree
|
|
|
divide-a-string-into-groups-of-size-k
|
|
|
divide-array-in-sets-of-k-consecutive-numbers
|
|
|
divide-nodes-into-the-maximum-number-of-groups
|
|
|
divide-players-into-teams-of-equal-skill
|
|
|
divide-two-integers
|
|
|
domino-and-tromino-tiling
|
|
|
dota2-senate
|
|
|
dui-cheng-de-er-cha-shu-lcof
|
|
|
dui-lie-de-zui-da-zhi-lcof
|
|
|
dungeon-game
|
|
|
duplicate-zeros
|
|
|
edit-distance
|
|
|
eight-queens-lcci
|
|
|
encode-and-decode-tinyurl
|
|
|
encode-n-ary-tree-to-binary-tree
|
|
|
encrypt-and-decrypt-strings
|
|
|
equal-row-and-column-pairs
|
|
|
equal-sum-arrays-with-minimum-number-of-operations
|
|
|
er-cha-shu-de-jing-xiang-lcof
|
|
|
er-cha-shu-de-shen-du-lcof
|
|
|
er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof
|
|
|
er-cha-shu-ran-se-UGC
|
|
|
er-cha-shu-ren-wu-diao-du
|
|
|
er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof
|
|
|
er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof
|
|
|
er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof
|
|
|
er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof
|
|
|
er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof
|
|
|
er-jin-zhi-zhong-1de-ge-shu-lcof
|
|
|
er-wei-shu-zu-zhong-de-cha-zhao-lcof
|
|
|
evaluate-boolean-binary-tree
|
|
|
evaluate-division
|
|
|
evaluate-reverse-polish-notation
|
|
|
evaluate-the-bracket-pairs-of-a-string
|
|
|
exam-room
|
|
|
excel-sheet-column-number
|
|
|
excel-sheet-column-title
|
|
|
exchange-lcci
|
|
|
exclusive-time-of-functions
|
|
|
expression-add-operators
|
|
|
expressive-words
|
|
|
factorial-trailing-zeroes
|
|
|
fan-zhuan-dan-ci-shun-xu-lcof
|
|
|
fan-zhuan-lian-biao-lcof
|
|
|
fancy-sequence
|
|
|
fei-bo-na-qi-shu-lie-lcof
|
|
|
fi9suh
|
|
|
fibonacci-number
|
|
|
filling-bookcase-shelves
|
|
|
filter-elements-from-array
|
|
|
final-prices-with-a-special-discount-in-a-shop
|
|
|
final-value-of-variable-after-performing-operations
|
|
|
find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
|
|
|
find-a-value-of-a-mysterious-function-closest-to-target
|
|
|
find-all-good-indices
|
|
|
find-all-numbers-disappeared-in-an-array
|
|
|
find-and-replace-pattern
|
|
|
find-bottom-left-tree-value
|
|
|
find-center-of-star-graph
|
|
|
find-closest-lcci
|
|
|
find-duplicate-file-in-system
|
|
|
find-duplicate-subtrees
|
|
|
find-elements-in-a-contaminated-binary-tree
|
|
|
find-first-and-last-position-of-element-in-sorted-array
|
|
|
find-if-path-exists-in-graph
|
|
|
find-k-closest-elements
|
|
|
find-k-pairs-with-smallest-sums
|
|
|
find-largest-value-in-each-tree-row
|
|
|
find-leaves-of-binary-tree
|
|
|
find-median-from-data-stream
|
|
|
find-minimum-in-rotated-sorted-array
|
|
|
find-minimum-in-rotated-sorted-array-ii
|
|
|
find-mode-in-binary-search-tree
|
|
|
find-nearest-point-that-has-the-same-x-or-y-coordinate
|
|
|
find-peak-element
|
|
|
find-pivot-index
|
|
|
find-players-with-zero-or-one-losses
|
|
|
find-positive-integer-solution-for-a-given-equation
|
|
|
find-servers-that-handled-most-number-of-requests
|
|
|
find-smallest-letter-greater-than-target
|
|
|
find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
|
|
|
find-the-difference
|
|
|
find-the-duplicate-number
|
|
|
find-the-highest-altitude
|
|
|
find-the-middle-index-in-array
|
|
|
find-the-minimum-and-maximum-number-of-nodes-between-critical-points
|
|
|
find-the-original-array-of-prefix-xor
|
|
|
find-the-pivot-integer
|
|
|
find-the-town-judge
|
|
|
find-the-winner-of-the-circular-game
|
|
|
finding-3-digit-even-numbers
|
|
|
finding-mk-average
|
|
|
finding-the-users-active-minutes
|
|
|
first-bad-version
|
|
|
first-common-ancestor-lcci
|
|
|
first-letter-to-appear-twice
|
|
|
first-missing-positive
|
|
|
first-unique-character-in-a-string
|
|
|
fizz-buzz
|
|
|
FJxjiD
|
|
|
flatten-2d-vector
|
|
|
flatten-a-multilevel-doubly-linked-list
|
|
|
flatten-binary-tree-to-linked-list
|
|
|
flatten-deeply-nested-array
|
|
|
flatten-nested-list-iterator
|
|
|
flip-columns-for-maximum-number-of-equal-rows
|
|
|
flip-string-to-monotone-increasing
|
|
|
flipping-an-image
|
|
|
flood-fill
|
|
|
form-array-by-concatenating-subarrays-of-another-array
|
|
|
FortPu
|
|
|
fraction-addition-and-subtraction
|
|
|
fraction-to-recurring-decimal
|
|
|
frog-jump-ii
|
|
|
fruit-into-baskets
|
|
|
fu-za-lian-biao-de-fu-zhi-lcof
|
|
|
function-composition
|
|
|
g5c51o
|
|
|
game-of-life
|
|
|
gas-station
|
|
|
generate-a-string-with-characters-that-have-odd-counts
|
|
|
generate-fibonacci-sequence
|
|
|
generate-parentheses
|
|
|
generate-random-point-in-a-circle
|
|
|
get-kth-magic-number-lcci
|
|
|
global-and-local-inversions
|
|
|
goal-parser-interpretation
|
|
|
goat-latin
|
|
|
gou-jian-cheng-ji-shu-zu-lcof
|
|
|
gray-code
|
|
|
greatest-english-letter-in-upper-and-lower-case
|
|
|
group-anagrams
|
|
|
group-by
|
|
|
group-the-people-given-the-group-size-they-belong-to
|
|
|
grumpy-bookstore-owner
|
|
|
gu-piao-de-zui-da-li-run-lcof
|
|
|
guess-number-higher-or-lower
|
|
|
guess-numbers
|
|
|
guess-the-word
|
|
|
GzCJIP
|
|
|
h-index
|
|
|
h-index-ii
|
|
|
h54YBf
|
|
|
H8086Q
|
|
|
hamming-distance
|
|
|
hand-of-straights
|
|
|
hanota-lcci
|
|
|
happy-number
|
|
|
he-bing-liang-ge-pai-xu-de-lian-biao-lcof
|
|
|
he-wei-sde-liang-ge-shu-zi-lcof
|
|
|
house-robber
|
|
|
house-robber-ii
|
|
|
house-robber-iii
|
|
|
hPov7L
|
|
|
html-entity-parser
|
|
|
hua-dong-chuang-kou-de-zui-da-zhi-lcof
|
|
|
IDBivT
|
|
|
iIQa4I
|
|
|
image-overlap
|
|
|
image-smoother
|
|
|
implement-magic-dictionary
|
|
|
implement-queue-using-stacks
|
|
|
implement-queue-using-stacks-lcci
|
|
|
implement-rand10-using-rand7
|
|
|
implement-stack-using-queues
|
|
|
implement-strstr
|
|
|
implement-trie-ii-prefix-tree
|
|
|
implement-trie-prefix-tree
|
|
|
increasing-order-search-tree
|
|
|
increasing-subsequences
|
|
|
inorder-successor-in-bst
|
|
|
inorder-successor-in-bst-ii
|
|
|
insert-delete-getrandom-o1
|
|
|
insert-delete-getrandom-o1-duplicates-allowed
|
|
|
insert-interval
|
|
|
insert-into-a-binary-search-tree
|
|
|
insert-into-a-sorted-circular-linked-list
|
|
|
insertion-sort-list
|
|
|
insufficient-nodes-in-root-to-leaf-paths
|
|
|
integer-break
|
|
|
integer-replacement
|
|
|
integer-to-english-words
|
|
|
integer-to-roman
|
|
|
interleaving-string
|
|
|
intersection-of-two-arrays
|
|
|
intersection-of-two-arrays-ii
|
|
|
intersection-of-two-linked-lists
|
|
|
intersection-of-two-linked-lists-lcci
|
|
|
interval-list-intersections
|
|
|
invert-binary-tree
|
|
|
ipo
|
|
|
is-graph-bipartite
|
|
|
is-subsequence
|
|
|
is-unique-lcci
|
|
|
island-perimeter
|
|
|
isomorphic-strings
|
|
|
iterator-for-combination
|
|
|
jBjn9C
|
|
|
JEj789
|
|
|
jewels-and-stones
|
|
|
Jf1JuT
|
|
|
JFETK5
|
|
|
jian-sheng-zi-ii-lcof
|
|
|
jian-sheng-zi-lcof
|
|
|
jJ0w9p
|
|
|
json-deep-equal
|
|
|
ju-zhen-zhong-de-lu-jing-lcof
|
|
|
jump-game
|
|
|
jump-game-ii
|
|
|
k-closest-points-to-origin
|
|
|
k-similar-strings
|
|
|
k-th-symbol-in-grammar
|
|
|
keyboard-row
|
|
|
kids-with-the-greatest-number-of-candies
|
|
|
KnLfVT
|
|
|
koko-eating-bananas
|
|
|
KqANN2
|
|
|
kth-largest-element-in-a-stream
|
|
|
kth-largest-element-in-an-array
|
|
|
kth-node-from-end-of-list-lcci
|
|
|
kth-smallest-element-in-a-bst
|
|
|
kth-smallest-element-in-a-sorted-matrix
|
|
|
kTOapQ
|
|
|
largest-3-same-digit-number-in-string
|
|
|
largest-component-size-by-common-factor
|
|
|
largest-local-values-in-a-matrix
|
|
|
largest-merge-of-two-strings
|
|
|
largest-number
|
|
|
largest-odd-number-in-string
|
|
|
largest-plus-sign
|
|
|
largest-positive-integer-that-exists-with-its-negative
|
|
|
largest-rectangle-in-histogram
|
|
|
largest-substring-between-two-equal-characters
|
|
|
largest-sum-of-averages
|
|
|
largest-triangle-area
|
|
|
last-day-where-you-can-still-cross
|
|
|
last-stone-weight
|
|
|
last-stone-weight-ii
|
|
|
leaf-similar-trees
|
|
|
left-and-right-sum-differences
|
|
|
length-of-last-word
|
|
|
letter-case-permutation
|
|
|
letter-combinations-of-a-phone-number
|
|
|
letter-tile-possibilities
|
|
|
lexicographical-numbers
|
|
|
lfu-cache
|
|
|
LGjMqU
|
|
|
lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof
|
|
|
lian-xu-zi-shu-zu-de-zui-da-he-lcof
|
|
|
liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof
|
|
|
license-key-formatting
|
|
|
linked-list-components
|
|
|
linked-list-cycle
|
|
|
linked-list-cycle-ii
|
|
|
linked-list-cycle-lcci
|
|
|
linked-list-in-binary-tree
|
|
|
linked-list-random-node
|
|
|
list-of-depth-lcci
|
|
|
lMSNwu
|
|
|
long-pressed-name
|
|
|
longest-absolute-file-path
|
|
|
longest-common-prefix
|
|
|
longest-common-subsequence
|
|
|
longest-consecutive-sequence
|
|
|
longest-continuous-increasing-subsequence
|
|
|
longest-increasing-subsequence
|
|
|
longest-palindromic-subsequence
|
|
|
longest-palindromic-substring
|
|
|
longest-string-chain
|
|
|
longest-subarray-with-maximum-bitwise-and
|
|
|
longest-substring-without-repeating-characters
|
|
|
longest-uncommon-subsequence-ii
|
|
|
longest-univalue-path
|
|
|
longest-uploaded-prefix
|
|
|
longest-valid-parentheses
|
|
|
longest-word-in-dictionary
|
|
|
lowest-common-ancestor-of-a-binary-search-tree
|
|
|
lowest-common-ancestor-of-a-binary-tree
|
|
|
lowest-common-ancestor-of-deepest-leaves
|
|
|
lru-cache
|
|
|
lru-cache-lcci
|
|
|
LwUNpT
|
|
|
M1oyTv
|
|
|
magical-string
|
|
|
majority-element
|
|
|
make-the-string-great
|
|
|
make-two-arrays-equal-by-reversing-sub-arrays
|
|
|
making-a-large-island
|
|
|
map-sum-pairs
|
|
|
master-mind-lcci
|
|
|
matchsticks-to-square
|
|
|
matrix-diagonal-sum
|
|
|
max-area-of-island
|
|
|
max-chunks-to-make-sorted
|
|
|
max-chunks-to-make-sorted-ii
|
|
|
max-consecutive-ones
|
|
|
max-consecutive-ones-iii
|
|
|
max-increase-to-keep-city-skyline
|
|
|
max-points-on-a-line
|
|
|
maximize-number-of-nice-divisors
|
|
|
maximize-score-after-n-operations
|
|
|
maximize-the-confusion-of-an-exam
|
|
|
maximum-and-sum-of-array
|
|
|
maximum-ascending-subarray-sum
|
|
|
maximum-binary-tree
|
|
|
maximum-binary-tree-ii
|
|
|
maximum-depth-of-binary-tree
|
|
|
maximum-depth-of-n-ary-tree
|
|
|
maximum-equal-frequency
|
|
|
maximum-erasure-value
|
|
|
maximum-frequency-stack
|
|
|
maximum-height-by-stacking-cuboids
|
|
|
maximum-lcci
|
|
|
maximum-length-of-pair-chain
|
|
|
maximum-length-of-repeated-subarray
|
|
|
maximum-level-sum-of-a-binary-tree
|
|
|
maximum-matching-of-players-with-trainers
|
|
|
maximum-nesting-depth-of-the-parentheses
|
|
|
maximum-number-of-balloons
|
|
|
maximum-number-of-balls-in-a-box
|
|
|
maximum-number-of-groups-entering-a-competition
|
|
|
maximum-number-of-groups-getting-fresh-donuts
|
|
|
maximum-number-of-non-overlapping-palindrome-substrings
|
|
|
maximum-number-of-pairs-in-array
|
|
|
maximum-number-of-points-from-grid-queries
|
|
|
maximum-number-of-vowels-in-a-substring-of-given-length
|
|
|
maximum-number-of-weeks-for-which-you-can-work
|
|
|
maximum-number-of-words-found-in-sentences
|
|
|
maximum-product-difference-between-two-pairs
|
|
|
maximum-product-of-splitted-binary-tree
|
|
|
maximum-product-of-two-elements-in-an-array
|
|
|
maximum-profit-in-job-scheduling
|
|
|
maximum-repeating-substring
|
|
|
maximum-rows-covered-by-columns
|
|
|
maximum-score-after-splitting-a-string
|
|
|
maximum-score-from-removing-stones
|
|
|
maximum-subarray
|
|
|
maximum-sum-bst-in-binary-tree
|
|
|
maximum-sum-of-distinct-subarrays-with-length-k
|
|
|
maximum-sum-of-two-non-overlapping-subarrays
|
|
|
maximum-sum-with-exactly-k-elements
|
|
|
maximum-swap
|
|
|
maximum-tastiness-of-candy-basket
|
|
|
maximum-twin-sum-of-a-linked-list
|
|
|
maximum-units-on-a-truck
|
|
|
maximum-value-at-a-given-index-in-a-bounded-array
|
|
|
maximum-value-of-a-string-in-an-array
|
|
|
maximum-width-of-binary-tree
|
|
|
maximum-xor-after-operations
|
|
|
mean-of-array-after-removing-some-elements
|
|
|
median-of-two-sorted-arrays
|
|
|
meeting-rooms
|
|
|
meeting-rooms-ii
|
|
|
memoize
|
|
|
memoize-ii
|
|
|
merge-in-between-linked-lists
|
|
|
merge-intervals
|
|
|
merge-k-sorted-lists
|
|
|
merge-nodes-in-between-zeros
|
|
|
merge-sorted-array
|
|
|
merge-strings-alternately
|
|
|
merge-two-binary-trees
|
|
|
merge-two-sorted-lists
|
|
|
middle-of-the-linked-list
|
|
|
min-cost-climbing-stairs
|
|
|
min-cost-to-connect-all-points
|
|
|
min-max-game
|
|
|
min-stack
|
|
|
min-stack-lcci
|
|
|
minesweeper
|
|
|
mini-parser
|
|
|
minimum-absolute-difference
|
|
|
minimum-absolute-difference-in-bst
|
|
|
minimum-absolute-difference-queries
|
|
|
minimum-add-to-make-parentheses-valid
|
|
|
minimum-addition-to-make-integer-beautiful
|
|
|
minimum-adjacent-swaps-for-k-consecutive-ones
|
|
|
minimum-amount-of-time-to-collect-garbage
|
|
|
minimum-area-rectangle
|
|
|
minimum-area-rectangle-ii
|
|
|
minimum-changes-to-make-alternating-binary-string
|
|
|
minimum-cost-to-hire-k-workers
|
|
|
minimum-cuts-to-divide-a-circle
|
|
|
minimum-depth-of-binary-tree
|
|
|
minimum-distance-between-bst-nodes
|
|
|
minimum-elements-to-add-to-form-a-given-sum
|
|
|
minimum-fuel-cost-to-report-to-the-capital
|
|
|
minimum-height-tree-lcci
|
|
|
minimum-increment-to-make-array-unique
|
|
|
minimum-index-sum-of-two-lists
|
|
|
minimum-length-of-string-after-deleting-similar-ends
|
|
|
minimum-limit-of-balls-in-a-bag
|
|
|
minimum-lines-to-represent-a-line-chart
|
|
|
minimum-moves-to-convert-string
|
|
|
minimum-moves-to-equal-array-elements-ii
|
|
|
minimum-moves-to-reach-target-with-rotations
|
|
|
minimum-number-of-frogs-croaking
|
|
|
minimum-number-of-moves-to-make-palindrome
|
|
|
minimum-number-of-moves-to-seat-everyone
|
|
|
minimum-number-of-operations-to-make-string-sorted
|
|
|
minimum-number-of-operations-to-move-all-balls-to-each-box
|
|
|
minimum-number-of-operations-to-reinitialize-a-permutation
|
|
|
minimum-number-of-operations-to-sort-a-binary-tree-by-level
|
|
|
minimum-number-of-refueling-stops
|
|
|
minimum-number-of-removals-to-make-mountain-array
|
|
|
minimum-operations-to-make-the-array-increasing
|
|
|
minimum-operations-to-reduce-x-to-zero
|
|
|
minimum-path-cost-in-a-hidden-grid
|
|
|
minimum-path-sum
|
|
|
minimum-score-after-removals-on-a-tree
|
|
|
minimum-score-of-a-path-between-two-cities
|
|
|
minimum-sideway-jumps
|
|
|
minimum-size-subarray-sum
|
|
|
minimum-subsequence-in-non-increasing-order
|
|
|
minimum-sum-of-four-digit-number-after-splitting-digits
|
|
|
minimum-swaps-to-make-sequences-increasing
|
|
|
minimum-time-difference
|
|
|
minimum-time-to-type-word-using-special-typewriter
|
|
|
minimum-total-distance-traveled
|
|
|
minimum-value-to-get-positive-step-by-step-sum
|
|
|
minimum-window-substring
|
|
|
missing-number
|
|
|
missing-ranges
|
|
|
missing-two-lcci
|
|
|
modify-graph-edge-weights
|
|
|
most-common-word
|
|
|
most-frequent-even-element
|
|
|
most-frequent-subtree-sum
|
|
|
most-profitable-path-in-a-tree
|
|
|
most-stones-removed-with-same-row-or-column
|
|
|
move-pieces-to-obtain-a-string
|
|
|
move-zeroes
|
|
|
moving-average-from-data-stream
|
|
|
multiply-strings
|
|
|
my-calendar-i
|
|
|
my-calendar-ii
|
|
|
my-calendar-iii
|
|
|
n-ary-tree-level-order-traversal
|
|
|
n-ary-tree-postorder-traversal
|
|
|
n-ary-tree-preorder-traversal
|
|
|
n-queens
|
|
|
n-repeated-element-in-size-2n-array
|
|
|
n-th-tribonacci-number
|
|
|
N6YdxV
|
|
|
na-ying-bi
|
|
|
nested-array-generator
|
|
|
network-delay-time
|
|
|
next-greater-element-i
|
|
|
next-greater-element-iii
|
|
|
next-greater-node-in-linked-list
|
|
|
next-permutation
|
|
|
nge-tou-zi-de-dian-shu-lcof
|
|
|
nGK0Fy
|
|
|
nim-game
|
|
|
nth-digit
|
|
|
nth-magical-number
|
|
|
number-complement
|
|
|
number-of-1-bits
|
|
|
number-of-arithmetic-triplets
|
|
|
number-of-atoms
|
|
|
number-of-beautiful-partitions
|
|
|
number-of-closed-islands
|
|
|
number-of-connected-components-in-an-undirected-graph
|
|
|
number-of-different-integers-in-a-string
|
|
|
number-of-different-subsequences-gcds
|
|
|
number-of-digit-one
|
|
|
number-of-distinct-averages
|
|
|
number-of-good-pairs
|
|
|
number-of-good-paths
|
|
|
number-of-great-partitions
|
|
|
number-of-islands
|
|
|
number-of-matching-subsequences
|
|
|
number-of-orders-in-the-backlog
|
|
|
number-of-pairs-satisfying-inequality
|
|
|
number-of-provinces
|
|
|
number-of-recent-calls
|
|
|
number-of-segments-in-a-string
|
|
|
number-of-students-doing-homework-at-a-given-time
|
|
|
number-of-students-unable-to-eat-lunch
|
|
|
number-of-subarrays-with-bounded-maximum
|
|
|
number-of-subarrays-with-gcd-equal-to-k
|
|
|
number-of-subarrays-with-lcm-equal-to-k
|
|
|
number-of-unequal-triplets-in-array
|
|
|
number-of-valid-clock-times
|
|
|
number-of-ways-to-arrive-at-destination
|
|
|
number-of-ways-to-buy-pens-and-pencils
|
|
|
number-of-ways-to-select-buildings
|
|
|
numbers-at-most-n-given-digit-set
|
|
|
numbers-with-repeated-digits
|
|
|
numbers-with-same-consecutive-differences
|
|
|
NUPfPr
|
|
|
NYBBNL
|
|
|
NyZD2B
|
|
|
O4NDxx
|
|
|
o8SXZn
|
|
|
odd-even-linked-list
|
|
|
one-away-lcci
|
|
|
ones-and-zeroes
|
|
|
online-stock-span
|
|
|
operations-lcci
|
|
|
opLdQZ
|
|
|
optimal-division
|
|
|
optimal-partition-of-string
|
|
|
orderly-queue
|
|
|
OrIXps
|
|
|
p0NxJO
|
|
|
P5rCT8
|
|
|
pacific-atlantic-water-flow
|
|
|
paint-house
|
|
|
pairs-with-sum-lcci
|
|
|
palindrome-linked-list
|
|
|
palindrome-linked-list-lcci
|
|
|
palindrome-number
|
|
|
palindromic-substrings
|
|
|
parse-lisp-expression
|
|
|
parsing-a-boolean-expression
|
|
|
partition-array-into-disjoint-intervals
|
|
|
partition-equal-subset-sum
|
|
|
partition-list
|
|
|
partition-list-lcci
|
|
|
partition-to-k-equal-sum-subsets
|
|
|
partitioning-into-minimum-number-of-deci-binary-numbers
|
|
|
pascals-triangle
|
|
|
pascals-triangle-ii
|
|
|
path-sum
|
|
|
path-sum-ii
|
|
|
path-sum-iii
|
|
|
path-with-minimum-effort
|
|
|
paths-with-sum-lcci
|
|
|
peak-index-in-a-mountain-array
|
|
|
peeking-iterator
|
|
|
percentage-of-letter-in-string
|
|
|
perfect-squares
|
|
|
permutation-i-lcci
|
|
|
permutation-ii-lcci
|
|
|
permutation-sequence
|
|
|
permutations
|
|
|
permutations-ii
|
|
|
ping-heng-er-cha-shu-lcof
|
|
|
plus-one
|
|
|
plus-one-linked-list
|
|
|
pOCWxh
|
|
|
populating-next-right-pointers-in-each-node
|
|
|
populating-next-right-pointers-in-each-node-ii
|
|
|
possible-bipartition
|
|
|
power-of-four
|
|
|
power-of-three
|
|
|
power-of-two
|
|
|
power-set-lcci
|
|
|
powerful-integers
|
|
|
powx-n
|
|
|
prefix-and-suffix-search
|
|
|
preimage-size-of-factorial-zeroes-function
|
|
|
prime-arrangements
|
|
|
print-binary-tree
|
|
|
print-foobar-alternately
|
|
|
print-immutable-linked-list-in-reverse
|
|
|
print-in-order
|
|
|
print-zero-even-odd
|
|
|
prison-cells-after-n-days
|
|
|
product-of-array-except-self
|
|
|
product-of-the-last-k-numbers
|
|
|
promise-pool
|
|
|
promise-time-limit
|
|
|
QA2IGt
|
|
|
QC3q1f
|
|
|
qi-wang-ge-shu-tong-ji
|
|
|
qing-wa-tiao-tai-jie-wen-ti-lcof
|
|
|
qIsx9U
|
|
|
qiu-12n-lcof
|
|
|
QO5KpG
|
|
|
que-shi-de-shu-zi-lcof
|
|
|
queries-on-number-of-points-inside-a-circle
|
|
|
queue-reconstruction-by-height
|
|
|
Qv1Da2
|
|
|
random-pick-index
|
|
|
random-pick-with-blacklist
|
|
|
random-pick-with-weight
|
|
|
random-point-in-non-overlapping-rectangles
|
|
|
range-addition-ii
|
|
|
range-module
|
|
|
range-product-queries-of-powers
|
|
|
range-sum-of-bst
|
|
|
range-sum-query-2d-immutable
|
|
|
range-sum-query-2d-mutable
|
|
|
range-sum-query-immutable
|
|
|
range-sum-query-mutable
|
|
|
rank-from-stream-lcci
|
|
|
rank-transform-of-a-matrix
|
|
|
rank-transform-of-an-array
|
|
|
ransom-note
|
|
|
reach-a-number
|
|
|
reachable-nodes-in-subdivided-graph
|
|
|
read-n-characters-given-read4
|
|
|
read-n-characters-given-read4-ii-call-multiple-times
|
|
|
rearrange-characters-to-make-target-string
|
|
|
rearrange-spaces-between-words
|
|
|
reconstruct-itinerary
|
|
|
reconstruct-original-digits-from-english
|
|
|
recover-a-tree-from-preorder-traversal
|
|
|
recover-binary-search-tree
|
|
|
rectangle-area
|
|
|
rectangle-area-ii
|
|
|
rectangle-overlap
|
|
|
recursive-mulitply-lcci
|
|
|
redundant-connection
|
|
|
redundant-connection-ii
|
|
|
reformat-date
|
|
|
reformat-phone-number
|
|
|
reformat-the-string
|
|
|
regions-cut-by-slashes
|
|
|
regular-expression-matching
|
|
|
relative-sort-array
|
|
|
remove-9
|
|
|
remove-all-adjacent-duplicates-in-string
|
|
|
remove-covered-intervals
|
|
|
remove-duplicate-letters
|
|
|
remove-duplicate-node-lcci
|
|
|
remove-duplicates-from-sorted-array
|
|
|
remove-duplicates-from-sorted-array-ii
|
|
|
remove-duplicates-from-sorted-list
|
|
|
remove-duplicates-from-sorted-list-ii
|
|
|
remove-element
|
|
|
remove-letter-to-equalize-frequency
|
|
|
remove-linked-list-elements
|
|
|
remove-nodes-from-linked-list
|
|
|
remove-nth-node-from-end-of-list
|
|
|
remove-outermost-parentheses
|
|
|
remove-vowels-from-a-string
|
|
|
remove-zero-sum-consecutive-nodes-from-linked-list
|
|
|
removing-minimum-and-maximum-from-array
|
|
|
removing-stars-from-a-string
|
|
|
reorder-list
|
|
|
repeated-dna-sequences
|
|
|
repeated-substring-pattern
|
|
|
replace-all-digits-with-characters
|
|
|
replace-all-s-to-avoid-consecutive-repeating-characters
|
|
|
replace-words
|
|
|
reshape-the-matrix
|
|
|
restore-ip-addresses
|
|
|
reveal-cards-in-increasing-order
|
|
|
reverse-bits
|
|
|
reverse-integer
|
|
|
reverse-linked-list
|
|
|
reverse-linked-list-ii
|
|
|
reverse-nodes-in-even-length-groups
|
|
|
reverse-nodes-in-k-group
|
|
|
reverse-odd-levels-of-binary-tree
|
|
|
reverse-prefix-of-word
|
|
|
reverse-string
|
|
|
reverse-vowels-of-a-string
|
|
|
reverse-words-in-a-string
|
|
|
reverse-words-in-a-string-ii
|
|
|
reverse-words-in-a-string-iii
|
|
|
richest-customer-wealth
|
|
|
rle-iterator
|
|
|
robot-bounded-in-circle
|
|
|
roman-to-integer
|
|
|
root-equals-sum-of-children
|
|
|
rotate-array
|
|
|
rotate-function
|
|
|
rotate-image
|
|
|
rotate-list
|
|
|
rotate-string
|
|
|
rotated-digits
|
|
|
rotting-oranges
|
|
|
running-sum-of-1d-array
|
|
|
russian-doll-envelopes
|
|
|
same-tree
|
|
|
satisfiability-of-equality-equations
|
|
|
score-of-parentheses
|
|
|
scramble-string
|
|
|
search-a-2d-matrix
|
|
|
search-a-2d-matrix-ii
|
|
|
search-in-a-binary-search-tree
|
|
|
search-in-a-sorted-array-of-unknown-size
|
|
|
search-in-rotated-sorted-array
|
|
|
search-in-rotated-sorted-array-ii
|
|
|
search-insert-position
|
|
|
second-largest-digit-in-a-string
|
|
|
sentence-similarity-iii
|
|
|
sequence-reconstruction
|
|
|
serialize-and-deserialize-binary-tree
|
|
|
serialize-and-deserialize-bst
|
|
|
serialize-and-deserialize-n-ary-tree
|
|
|
set-intersection-size-at-least-two
|
|
|
set-matrix-zeroes
|
|
|
shan-chu-lian-biao-de-jie-dian-lcof
|
|
|
shift-2d-grid
|
|
|
short-encoding-of-words
|
|
|
shortest-bridge
|
|
|
shortest-distance-to-a-character
|
|
|
shortest-distance-to-target-string-in-a-circular-array
|
|
|
shortest-path-in-a-hidden-grid
|
|
|
shortest-path-to-get-all-keys
|
|
|
shortest-path-visiting-all-nodes
|
|
|
shortest-subarray-with-sum-at-least-k
|
|
|
shortest-word-distance
|
|
|
shortest-word-distance-ii
|
|
|
shortest-word-distance-iii
|
|
|
shu-de-zi-jie-gou-lcof
|
|
|
shu-ju-liu-zhong-de-zhong-wei-shu-lcof
|
|
|
shu-zhi-de-zheng-shu-ci-fang-lcof
|
|
|
shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof
|
|
|
shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof
|
|
|
shu-zu-zhong-de-ni-xu-dui-lcof
|
|
|
shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof
|
|
|
shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof
|
|
|
shu-zu-zhong-zhong-fu-de-shu-zi-lcof
|
|
|
shuffle-string
|
|
|
shuffle-the-array
|
|
|
shun-shi-zhen-da-yin-ju-zhen-lcof
|
|
|
sign-of-the-product-of-an-array
|
|
|
simplify-path
|
|
|
single-number
|
|
|
single-number-ii
|
|
|
single-number-iii
|
|
|
single-threaded-cpu
|
|
|
sleep
|
|
|
sliding-window-maximum
|
|
|
SLwz0R
|
|
|
smallest-difference-lcci
|
|
|
smallest-even-multiple
|
|
|
smallest-index-with-equal-value
|
|
|
smallest-k-lcci
|
|
|
smallest-string-starting-from-leaf
|
|
|
smallest-string-with-a-given-numeric-value
|
|
|
smallest-subarrays-with-maximum-bitwise-or
|
|
|
smallest-subsequence-of-distinct-characters
|
|
|
smallest-subtree-with-all-the-deepest-nodes
|
|
|
smallest-value-after-replacing-with-sum-of-prime-factors
|
|
|
snail-traversal
|
|
|
snakes-and-ladders
|
|
|
snapshot-array
|
|
|
solve-the-equation
|
|
|
sort-an-array
|
|
|
sort-array-by-increasing-frequency
|
|
|
sort-array-by-parity
|
|
|
sort-characters-by-frequency
|
|
|
sort-colors
|
|
|
sort-integers-by-the-power-value
|
|
|
sort-list
|
|
|
sort-the-matrix-diagonally
|
|
|
sort-the-people
|
|
|
sort-the-students-by-their-kth-score
|
|
|
sorted-merge-lcci
|
|
|
soup-servings
|
|
|
special-array-with-x-elements-greater-than-or-equal-x
|
|
|
special-binary-string
|
|
|
special-positions-in-a-binary-matrix
|
|
|
spiral-matrix
|
|
|
spiral-matrix-ii
|
|
|
spiral-matrix-iv
|
|
|
split-a-circular-linked-list
|
|
|
split-a-string-in-balanced-strings
|
|
|
split-array-with-same-average
|
|
|
split-linked-list-in-parts
|
|
|
split-message-based-on-limit
|
|
|
sqrtx
|
|
|
squares-of-a-sorted-array
|
|
|
stack-of-plates-lcci
|
|
|
steps-to-make-array-non-decreasing
|
|
|
stone-game
|
|
|
strictly-palindromic-number
|
|
|
string-compression
|
|
|
string-matching-in-an-array
|
|
|
string-rotation-lcci
|
|
|
string-to-integer-atoi
|
|
|
string-to-url-lcci
|
|
|
strobogrammatic-number
|
|
|
strong-password-checker
|
|
|
strong-password-checker-ii
|
|
|
student-attendance-record-i
|
|
|
student-attendance-record-ii
|
|
|
subarray-sum-equals-k
|
|
|
subdomain-visit-count
|
|
|
subrectangle-queries
|
|
|
subsets
|
|
|
subsets-ii
|
|
|
substring-with-concatenation-of-all-words
|
|
|
subtract-the-product-and-sum-of-digits-of-an-integer
|
|
|
successor-lcci
|
|
|
sudoku-solver
|
|
|
sum-lists-lcci
|
|
|
sum-multiples
|
|
|
sum-of-all-odd-length-subarrays
|
|
|
sum-of-all-subset-xor-totals
|
|
|
sum-of-beauty-of-all-substrings
|
|
|
sum-of-digits-of-string-after-convert
|
|
|
sum-of-left-leaves
|
|
|
sum-of-number-and-its-reverse
|
|
|
sum-of-prefix-scores-of-strings
|
|
|
sum-of-root-to-leaf-binary-numbers
|
|
|
sum-of-subarray-minimums
|
|
|
sum-of-subsequence-widths
|
|
|
sum-of-total-strength-of-wizards
|
|
|
sum-root-to-leaf-numbers
|
|
|
summary-ranges
|
|
|
super-pow
|
|
|
super-ugly-number
|
|
|
surrounded-regions
|
|
|
swap-adjacent-in-lr-string
|
|
|
swap-nodes-in-pairs
|
|
|
swap-numbers-lcci
|
|
|
swapping-nodes-in-a-linked-list
|
|
|
symmetric-tree
|
|
|
sZ59z6
|
|
|
t9-lcci
|
|
|
tag-validator
|
|
|
take-k-of-each-character-from-left-and-right
|
|
|
target-sum
|
|
|
ternary-expression-parser
|
|
|
test
|
|
|
text-justification
|
|
|
the-employee-that-worked-on-the-longest-task
|
|
|
the-kth-factor-of-n
|
|
|
third-maximum-number
|
|
|
thousand-separator
|
|
|
three-consecutive-odds
|
|
|
three-equal-parts
|
|
|
three-in-one-lcci
|
|
|
three-steps-problem-lcci
|
|
|
ti-huan-kong-ge-lcof
|
|
|
time-based-key-value-store
|
|
|
time-needed-to-inform-all-employees
|
|
|
to-lower-case
|
|
|
toeplitz-matrix
|
|
|
top-k-frequent-elements
|
|
|
top-k-frequent-words
|
|
|
total-cost-to-hire-k-workers
|
|
|
traffic-light-controlled-intersection
|
|
|
transform-to-chessboard
|
|
|
transpose-matrix
|
|
|
trapping-rain-water
|
|
|
tree-of-coprimes
|
|
|
triangle
|
|
|
trim-a-binary-search-tree
|
|
|
truncate-sentence
|
|
|
TVdhkn
|
|
|
tweet-counts-per-frequency
|
|
|
two-out-of-three
|
|
|
two-sum
|
|
|
two-sum-ii-input-array-is-sorted
|
|
|
two-sum-iii-data-structure-design
|
|
|
two-sum-iv-input-is-a-bst
|
|
|
U7WvvU
|
|
|
ugly-number
|
|
|
ugly-number-ii
|
|
|
ugly-number-iii
|
|
|
UHnkqh
|
|
|
uncommon-words-from-two-sentences
|
|
|
uncrossed-lines
|
|
|
unique-binary-search-trees
|
|
|
unique-binary-search-trees-ii
|
|
|
unique-email-addresses
|
|
|
unique-morse-code-words
|
|
|
unique-paths
|
|
|
unique-paths-ii
|
|
|
univalued-binary-tree
|
|
|
ur2n8P
|
|
|
using-a-robot-to-print-the-lexicographically-smallest-string
|
|
|
utf-8-validation
|
|
|
utils
|
|
|
uUsW3B
|
|
|
valid-anagram
|
|
|
valid-boomerang
|
|
|
valid-number
|
|
|
valid-palindrome
|
|
|
valid-parentheses
|
|
|
valid-perfect-square
|
|
|
valid-square
|
|
|
valid-sudoku
|
|
|
validate-binary-search-tree
|
|
|
validate-binary-tree-nodes
|
|
|
validate-ip-address
|
|
|
validate-stack-sequences
|
|
|
vEAB3K
|
|
|
verifying-an-alien-dictionary
|
|
|
vertical-order-traversal-of-a-binary-tree
|
|
|
VLNEbD
|
|
|
vlzXQL
|
|
|
VvJkup
|
|
|
vvXgSW
|
|
|
w6cpku
|
|
|
web-crawler-multithreaded
|
|
|
WhsWhI
|
|
|
wiggle-sort-ii
|
|
|
wiggle-subsequence
|
|
|
wildcard-matching
|
|
|
wMGN0t
|
|
|
WNC0Lk
|
|
|
word-break
|
|
|
word-break-ii
|
|
|
word-ladder
|
|
|
word-ladder-ii
|
|
|
word-pattern
|
|
|
word-search
|
|
|
word-search-ii
|
|
|
words-frequency-lcci
|
|
|
WqXACV
|
|
|
xoh6Oh
|
|
|
xor-operation-in-an-array
|
|
|
xu-lie-hua-er-cha-shu-lcof
|
|
|
xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof
|
|
|
XxZZjK
|
|
|
yong-liang-ge-zhan-shi-xian-dui-lie-lcof
|
|
|
yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof
|
|
|
ZbAuEH
|
|
|
zero-matrix-lcci
|
|
|
zhan-de-ya-ru-dan-chu-xu-lie-lcof
|
|
|
zheng-ze-biao-da-shi-pi-pei-lcof
|
|
|
zhong-jian-er-cha-shu-lcof
|
|
|
zi-fu-chuan-de-pai-lie-lcof
|
|
|
zigzag-conversion
|
|
|
zigzag-iterator
|
|
|
zL2zJU
|
|
|
ZL6zAn
|
|
|
zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof
|
|
|
zui-xiao-de-kge-shu-lcof
|
|
|
zuo-xuan-zhuan-zi-fu-chuan-lcof
|
|
|
.clang-format
|
5.99 KB |
|
.gitattributes
|
154 B |
|
.gitignore
|
2.13 KB |
|
.prettierrc.json
|
89 B |
|
cache.ts
|
2.11 KB |
|
check.ts
|
2.14 KB |
|
CMakeLists.txt
|
162.24 KB |
|
compile_commands.json
|
6.58 KB |
|
deno.json
|
1.3 KB |
|
deps.ts
|
2.4 KB |
|
fmt.cmd
|
43 B |
|
format.json
|
80 B |
|
go.mod
|
1.59 KB |
|
go.sum
|
23.95 KB |
|
import_map.json
|
239 B |
|
install.lua
|
2.9 KB |
|
leetcode-test.iml
|
2.23 KB |
|
LICENSE
|
9.37 KB |
|
lua-format.ts
|
835 B |
|
mod.ts
|
8.69 KB |
|
package.json
|
526 B |
|
pom.xml
|
10.53 KB |
|
README.md
|
74.55 KB |
|
retry.ts
|
1.39 KB |
|
test.cmd
|
99 B |
|
xmake.lua
|
410 B |
|
xmake.ts
|
4.17 KB |