Index / TOC

.
├── LICENSE.md
├── README.md
├── _00
│   ├── 0013-roman-to-integer
│   ├── 0015-3sum
│   ├── 0033-search-in-rotated-sorted-array
│   ├── 0040-combination-sum-ii
│   ├── 0048-rotate-image
│   ├── 0055-jump-game
│   ├── 0068-text-justification
│   ├── 0070-climbing-stairs
│   ├── 0073-set-matrix-zeroes
│   └── 0079-word-search
├── _01
│   ├── 0102-binary-tree-level-order-traversal
│   ├── 0111-minimum-depth-of-binary-tree
│   ├── 0112-path-sum
│   ├── 0114-flatten-binary-tree-to-linked-list
│   ├── 0121-best-time-to-buy-and-sell-stock
│   ├── 0128-longest-consecutive-sequence
│   ├── 0130-surrounded-regions
│   ├── 0133-clone-graph
│   ├── 0136-single-number
│   ├── 0145-binary-tree-postorder-traversal
│   ├── 0146-lru-cache
│   ├── 0150-evaluate-reverse-polish-notation
│   ├── 0150-reverse-words-in-a-string
│   ├── 0151-reverse-words-in-a-string
│   └── 0155-min-stack
├── _02
│   ├── 0206-reverse-linked-list
│   ├── 0211-design-add-and-search-words-data-structure
│   ├── 0222-count-complete-tree-nodes
│   ├── 0238-product-of-array-except-self
│   ├── 0264-ugly-number-ii
│   ├── 0274-h-index
│   └── 0289-game-of-life
├── _03
│   ├── 0334-increasing-triplet-subsequence
│   ├── 0345-reverse-vowels-of-a-string
│   └── 0380-insert-delete-getrandom-o1
├── _04
│   ├── 0407-trapping-rain-water-ii
│   ├── 0437-path-sum-iii
│   ├── 0443-string-compression
│   └── 0494-target-sum
├── _05
│   ├── 0515-find-largest-value-in-each-tree-row
│   ├── 0539-minimum-time-difference
│   ├── 0590-n-ary-tree-postorder-traversal
│   └── 0592-fraction-addition-and-subtraction
├── _06
│   ├── 0605-can-place-flowers
│   ├── 0624-maximum-distance-in-arrays
│   ├── 0637-average-of-levels-in-binary-tree
│   ├── 0641-design-circular-deque
│   ├── 0643-maximum-average-subarray-i
│   ├── 0684-redundant-connection
│   └── 0696-count-binary-substrings
├── _07
│   ├── 0700-search-in-a-binary-search-tree
│   ├── 0703-kth-largest-element-in-a-stream
│   ├── 0724-find-pivot-index
│   ├── 0725-split-linked-list-in-parts
│   └── 0744-find-smallest-letter-greater-than-target
├── _08
│   ├── 0802-find-eventual-safe-states
│   ├── 0827-making-a-large-island
│   ├── 0840-magic-squares-in-grid
│   ├── 0841-keys-and-rooms
│   ├── 0874-walking-robot-simulation
│   └── 0884-uncommon-words-from-two-sentences
├── _09
│   ├── 0916-word-subsets
│   ├── 0933-number-of-recent-calls
│   ├── 0934-shortest-bridge
│   ├── 0967-numbers-with-same-consecutive-differences
│   └── 0983-minimum-cost-for-tickets
├── _10
│   ├── 1014-best-sightseeing-pair
│   ├── 1071-greatest-common-divisor-of-strings
│   └── 1072-flip-columns-for-maximum-number-of-equal-rows
├── _12
│   └── 1267-count-servers-that-communicate
├── _13
│   ├── 1310-xor-queries-of-a-subarray
│   ├── 1331-rank-transform-of-an-array
│   ├── 1346-check-if-n-and-its-double-exist
│   ├── 1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
│   ├── 1376-time-needed-to-inform-all-employees
│   └── 1381-design-a-stack-with-increment-operation
├── _14
│   ├── 1400-construct-k-palindrome-strings
│   ├── 1408-string-matching-in-an-array
│   ├── 1422-maximum-score-after-splitting-a-string
│   ├── 1431-kids-with-the-greatest-number-of-candies
│   ├── 1448-count-good-nodes-in-binary-tree
│   ├── 1455-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
│   ├── 1456-maximum-number-of-vowels-in-a-substring-of-given-length
│   ├── 1460-make-two-arrays-equal-by-reversing-subarrays
│   ├── 1462-course-schedule-iv
│   ├── 1475-final-prices-with-a-special-discount-in-a-shop
│   └── 1497-check-if-array-pairs-are-divisible-by-k
├── _16
│   ├── 1652-defuse-the-bomb
│   ├── 1657-determine-if-two-strings-are-close
│   └── 1684-count-the-number-of-consistent-strings
├── _17
│   ├── 1726-tuple-with-same-product
│   ├── 1732-find-the-highest-altitude
│   ├── 1752-check-if-array-is-sorted-and-rotated
│   ├── 1765-map-of-highest-peak
│   ├── 1769-minimum-number-of-operations-to-move-all-balls-to-each-box
│   ├── 1790-check-if-one-string-swap-can-make-strings-equal
│   └── 1792-maximum-average-pass-ratio
├── _18
│   ├── 1800-maximum-ascending-subarray-sum
│   ├── 1861-rotating-the-box
│   └── 1894-find-the-student-that-will-replace-the-chalk
├── _19
│   ├── 1905-count-sub-islands
│   ├── 1930-unique-length-3-palindromic-subsequences
│   ├── 1945-sum-of-digits-of-string-after-convert
│   └── 1975-maximum-matrix-sum
├── _20
│   ├── 2017-grid-game
│   ├── 2022-convert-1d-array-into-2d-array
│   ├── 2095-delete-the-middle-node-of-a-linked-list
│   └── 2097-valid-arrangement-of-pairs
├── _21
│   ├── 2109-adding-spaces-to-a-string
│   ├── 2116-check-if-a-parentheses-string-can-be-valid
│   ├── 2127-maximum-employees-to-be-invited-to-a-meeting
│   └── 2185-counting-words-with-a-given-prefix
├── _22
│   ├── 2215-find-the-difference-of-two-arrays
│   ├── 2220-minimum-bit-flips-to-convert-number
│   ├── 2257-count-unguarded-cells-in-the-grid
│   ├── 2270-number-of-ways-to-split-array
│   └── 2287-rearrange-characters-to-make-target-string
├── _23
│   ├── 2326-spiral-matrix-iv
│   ├── 2381-shifting-letters-ii
│   └── 2389-longest-subsequence-with-limited-sum
├── _24
│   ├── 2415-reverse-odd-levels-of-binary-tree
│   ├── 2419-longest-subarray-with-maximum-bitwise-and
│   ├── 2425-bitwise-xor-of-all-pairings
│   ├── 2429-minimize-xor
│   ├── 2466-count-ways-to-build-good-strings
│   ├── 2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level
│   └── 2493-divide-nodes-into-the-maximum-number-of-groups
├── _25
│   ├── 2501-longest-square-streak-in-an-array
│   ├── 2516-take-k-of-each-character-from-left-and-right
│   ├── 2558-take-gifts-from-the-richest-pile
│   ├── 2559-count-vowel-strings-in-ranges
│   └── 2593-find-score-of-an-array-after-marking-all-elements
├── _26
│   ├── 2657-find-the-prefix-common-array-of-two-arrays
│   ├── 2658-maximum-number-of-fish-in-a-grid
│   ├── 2661-first-completely-painted-row-or-column
│   └── 2683-neighboring-bitwise-xor
├── _27
│   └── 2762-continuous-subarrays
├── _29
│   ├── 2924-find-champion-ii
│   ├── 2937-make-three-strings-equal
│   ├── 2948-make-lexicographically-smallest-array-by-swapping-elements
│   ├── 2976-minimum-cost-to-convert-string-i
│   └── 2981-find-longest-special-substring-that-occurs-thrice-i
├── _30
│   ├── 3010-divide-an-array-into-subarrays-with-minimum-cost-i
│   ├── 3042-count-prefix-and-suffix-pairs-i
│   └── 3043-find-the-length-of-the-longest-common-prefix
├── _31
│   ├── 3105-longest-strictly-increasing-or-strictly-decreasing-subarray
│   ├── 3151-special-array-i
│   └── 3160-find-the-number-of-distinct-colors-among-the-balls
├── _32
│   ├── 3223-minimum-length-of-string-after-operations
│   ├── 3243-shortest-distance-after-road-addition-queries-i
│   ├── 3254-find-the-power-of-k-size-subarrays-i
│   └── 3264-final-array-state-after-k-multiplication-operations-i
└── regen-readme.sh

License

WTFPL