├── .github ├── FUNDING.yml ├── issue_template.md ├── pull_request_template.md └── workflows │ └── deploy.yml ├── .gitignore ├── .prettierrc ├── CONTRIBUTING.md ├── README.md ├── babel.config.js ├── blog ├── 2019-05-28-first-blog-post.md ├── 2019-05-29-long-blog-post.md ├── 2021-08-01-mdx-blog-post.mdx ├── 2021-08-26-welcome │ ├── docusaurus-plushie-banner.jpeg │ └── index.md └── authors.yml ├── config.json ├── converter ├── README.md ├── background.js ├── content.js ├── manifest.json ├── popup.css ├── popup.html └── popup.js ├── docs └── index.md ├── docusaurus.config.js ├── package.json ├── pnpm-lock.yaml ├── renovate.json ├── roadmap ├── arrays.md ├── backtracking.md ├── binary-search.md ├── data-structure-i.md ├── dynamic-programming.md ├── graph-theory.md ├── heap.md ├── index.md ├── leetcode-summer-intensive.md ├── programming-skills-i.md ├── sliding-windows.md ├── stack.md ├── tree.md ├── trie.md └── two-pointers.md ├── sidebars.js ├── solutions ├── 0000-0099 │ ├── 0001-two-sum.md │ ├── 0002-add-two-numbers-medium.md │ ├── 0003-longest-substring-without-repeating-characters-medium.md │ ├── 0004-median-of-two-sorted-arrays-hard.md │ ├── 0005-longest-palindromic-substring-medium.md │ ├── 0006-zigzag-conversion-medium.md │ ├── 0007-reverse-integer-medium.md │ ├── 0009-palindrome-number-easy.md │ ├── 0010-regular-expression-matching-hard.md │ ├── 0011-container-with-most-water-medium.md │ ├── 0012-integer-to-roman-medium.md │ ├── 0013-roman-to-integer-easy.md │ ├── 0014-longest-common-prefix-easy.md │ ├── 0017-letter-combinations-of-a-phone-number-medium.md │ ├── 0019-remove-nth-node-from-end-of-list-medium.md │ ├── 0020-valid-parentheses-easy.md │ ├── 0021-merge-two-sorted-lists-easy.md │ ├── 0022-generate-parentheses-medium.md │ ├── 0023-merge-k-sorted-lists-hard.md │ ├── 0024-swap-nodes-in-pairs-medium.md │ ├── 0025-reverse-nodes-in-k-group-hard.md │ ├── 0026-Remove-Duplicates-from-Sorted-Array-easy.md │ ├── 0027-remove-element-easy.md │ ├── 0028-find-the-index-of-the-first-occurrence-in-a-string-easy.md │ ├── 0033-search-in-rotated-sorted-array-medium.md │ ├── 0034-find-first-and-last-position-of-element-in-sorted-array-medium.md │ ├── 0035-search-insert-position-easy.md │ ├── 0036-valid-sudoku-easy.md │ ├── 0037-sudoku-solver-hard.md │ ├── 0039-combination-sum-medium.md │ ├── 0040-combination-sum-ii-medium.md │ ├── 0042-trapping-rain-water-hard.md │ ├── 0045-jump-game-ii-medium.md │ ├── 0046-permutations-medium.md │ ├── 0048-rotate-image-medium.md │ ├── 0049-group-anagrams-medium.md │ ├── 0050-pow-x-n-medium.md │ ├── 0051-n-queens-hard.md │ ├── 0053-maximum-subarray-medium.md │ ├── 0054-spiral-matrix-medium.md │ ├── 0055-jump-game-medium.md │ ├── 0056-merge-intervals-medium.md │ ├── 0057-insert-interval-medium.md │ ├── 0058-length-of-last-word-easy.md │ ├── 0061-rotate-list-medium.md │ ├── 0062-unique-paths-medium.md │ ├── 0063-unique-paths-ii-medium.md │ ├── 0066-plus-one-easy.md │ ├── 0067-add-binary-easy.md │ ├── 0069-sqrt-x-easy.md │ ├── 0070-climbing-stairs-easy.md │ ├── 0072-edit-distance-hard.md │ ├── 0073-set-matrix-zeroes-medium.md │ ├── 0074-search-a-2d-matrix-medium.md │ ├── 0075-sort-colors-medium.md │ ├── 0076-minimum-window-substring-hard.md │ ├── 0077-combinations-medium.md │ ├── 0078-subsets-medium.md │ ├── 0079-word-search-medium.md │ ├── 0084-largest-rectangle-in-histogram-hard.md │ ├── 0088-merge-sorted-array-easy.md │ ├── 0090-subsets-ii-medium.md │ ├── 0091-decode-ways-medium.md │ ├── 0093-restore-ip-addresses-medium.md │ ├── 0094-binary-tree-inorder-traversal-easy.md │ ├── 0097-interleaving-string-medium.md │ ├── 0098-validate-binary-search-tree-medium.md │ └── _category_.json ├── 0100-0199 │ ├── 0100-same-tree-easy.md │ ├── 0101-symmetric-tree-easy.md │ ├── 0102-binary-tree-level-order-traversal-medium.md │ ├── 0103-binary-tree-zigzag-level-order-traversal-medium.md │ ├── 0104-maximum-depth-of-binary-tree-easy.md │ ├── 0105-construct-binary-tree-from-preorder-and-inorder-traversal-medium.md │ ├── 0110-balanced-binary-tree-easy.md │ ├── 0112-path-sum-easy.md │ ├── 0113-path-sum-ii-medium.md │ ├── 0115-distinct-subsequences-hard.md │ ├── 0118-pascals-triangle-easy.md │ ├── 0121-best-time-to-buy-and-sell-stock-easy.md │ ├── 0124-binary-tree-maximum-path-sum-hard.md │ ├── 0125-valid-palindrome.md │ ├── 0127-word-ladder-hard.md │ ├── 0129-sum-root-to-leaf-numbers-medium.md │ ├── 0130-surrounded-regions-medium.md │ ├── 0131-palindrome-partitioning-medium.md │ ├── 0133-clone-graph-medium.md │ ├── 0134-gas-station-medium.md │ ├── 0136-single-number-easy.md │ ├── 0138-copy-list-with-random-pointer-medium.md │ ├── 0139-word-break-medium.md │ ├── 0141-linked-list-cycle.md │ ├── 0143-reorder-list-medium.md │ ├── 0144-binary-tree-preorder-traversal-easy.md │ ├── 0145-binary-tree-postorder-traversal-easy.md │ ├── 0146-lru-cache-medium.md │ ├── 0148-sort-list-medium.md │ ├── 0150-evaluate-reverse-olish-notation-medium.md │ ├── 0152-maximum-product-subarray-medium.md │ ├── 0154-find-minimum-in-rotated-sorted-array-ii-hard.md │ ├── 0155-min-stack-medium.md │ ├── 0162-find-peak-element-medium.md │ ├── 0165-compare-version-numbers-medium.md │ ├── 0169-majority-element-easy.md │ ├── 0188-best-time-to-buy-and-sell-stock-iv-hard.md │ ├── 0191-number-of-1-bits-easy.md │ ├── 0198-house-robber-medium.md │ ├── 0199-binary-tree-right-side-view-medium.md │ └── _category_.json ├── 0200-0299 │ ├── 0200-number-of-islands-medium.md │ ├── 0202-happy-number-easy.md │ ├── 0204-count-primes.md │ ├── 0205-isomorphic-strings-easy.md │ ├── 0206-reverse-linked-list-easy.md │ ├── 0207-course-schedule-medium.md │ ├── 0208-implement-trie-medium.md │ ├── 0210-course-schedule-ii-medium.md │ ├── 0211-design-add-and-search-words-data-structure-medium.md │ ├── 0212-word-search-ii-hard.md │ ├── 0213-house-robber-ii-medium.md │ ├── 0214-shortest-palindrome-hard.md │ ├── 0215-kth-largest-element-in-an-array-medium.md │ ├── 0217-contains-duplicate-easy.md │ ├── 0219-contains-duplicate-ii-easy.md │ ├── 0225-implement-stack-using-queues-easy.md │ ├── 0226-invert-binary-tree-easy.md │ ├── 0228-summary-ranges-easy.md │ ├── 0230-kth-smallest-element-in-a-bst-medium.md │ ├── 0231-power-of-two-easy.md │ ├── 0234-palindrome-linked-list-easy.md │ ├── 0235-lowest-common-ancestor-of-a-binary-search-tree-medium.md │ ├── 0237-delete-node-in-a-linked-list-medium.md │ ├── 0239-sliding-maximum-window-hard.md │ ├── 0242-valid-anagram-easy.md │ ├── 0246-strobogrammatic-number-easy.md │ ├── 0258-add-digits-easy.md │ ├── 0261-graph-valid-tree-medium.md │ ├── 0263-ugly-number-easy.md │ ├── 0268-missing-number-easy.md │ ├── 0278-first-bad-version-easy.md │ ├── 0283-move-zeroes-easy.md │ ├── 0286-walls-and-gates-medium.md │ ├── 0287-find-the-duplicate-number-medium.md │ ├── 0290-word-pattern-easy.md │ ├── 0295-find-median-from-data-stream-hard.md │ ├── 0297-serialize-and-deserialize-binary-tree-hard.md │ ├── 0298-binary-tree-longest-consecutive-sequence-medium.md │ ├── 0299-bulls-and-cows-medium.md │ └── _category_.json ├── 0300-0399 │ ├── 0300-longest-increasing-subsequence-medium.md │ ├── 0307-range-sum-query-mutable-medium.md │ ├── 0309-best-time-to-buy-and-sell-stock-with-cooldown-medium.md │ ├── 0312-burst-balloons-hard.md │ ├── 0322-coin-change-medium.md │ ├── 0323-number-of-connected-components-in-an-undirected-graph-medium.md │ ├── 0327-count-of-range-sum-hard.md │ ├── 0329-longest-increasing-path-in-a-matrix-hard.md │ ├── 0332-reconstruct-itinerary-hard.md │ ├── 0334-increasing-triplet-subsequence-medium.md │ ├── 0338-counting-bits-easy.md │ ├── 0342-power-of-four-easy.md │ ├── 0344-reverse-string-easy.md │ ├── 0345-reverse-vowels-of-a-string-easy.md │ ├── 0346-moving-average-from-data-stream-easy.md │ ├── 0347-top-k-frequent-elements-medium.md │ ├── 0349-intersection-of-two-arrays-easy.md │ ├── 0350-intersection-of-two-arrays-ii-easy.md │ ├── 0355-design-twitter-medium.md │ ├── 0365-water-and-jug-problem-medium.md │ ├── 0367-valid-perfect-square-easy.md │ ├── 0374-guess-number-higher-or-lower-easy.md │ ├── 0377-combination-sum-iv-medium.md │ ├── 0383-ransom-note-easy.md │ ├── 0387-first-unique-character-in-a-string-easy.md │ ├── 0389-find-the-difference-easy.md │ ├── 0392-is-subsequence-easy.md │ ├── 0393-utf-8-validation-medium.md │ └── _category_.json ├── 0400-0499 │ ├── 0402-remove-k-digits-medium.md │ ├── 0403-Frog-Jump.md │ ├── 0404-sum-of-left-leaves-easy.md │ ├── 0413-arithmetic-slices-medium.md │ ├── 0416-partition-equal-subset-sum-medium.md │ ├── 0417-pacific-atlantic-water-flow-medium.md │ ├── 0421-maximum-xor-of-two-numbers-in-an-array.md │ ├── 0424-longest-repeating-character-replacement-medium.md │ ├── 0429-n-ary-tree-level-order-traversal-medium.md │ ├── 0433-minimum-genetic-mutation-medium.md │ ├── 0435-non-overlapping-intervals-medium.md │ ├── 0437-path-sum-iii-medium.md │ ├── 0438-find-all-anagrams-in-a-string-medium.md │ ├── 0441-arranging-coins-easy.md │ ├── 0443-string-compression-medium.md │ ├── 0445-Add-Two-Numbers-II.md │ ├── 0451-sort-characters-by-frequency-medium.md │ ├── 0452-minimum-number-of-arrows-to-burst-balloons-medium.md │ ├── 0454-4sum-ii-medium.md │ ├── 0464-can-i-win-medium.md │ ├── 0465-optimal-account-balancing-hard.md │ ├── 0472-concatenated-words-hard.md │ ├── 0473-matchsticks-to-square-medium.md │ ├── 0491-non-decreasing-subsequences-medium.md │ ├── 0493-reverse-pairs-hard.md │ ├── 0494-target-sum-medium.md │ ├── 0496-next-greater-element-i-easy.md │ └── _category_.json ├── 0500-0599 │ ├── 0501-find-mode-in-binary-search-tree-easy.md │ ├── 0508-most-frequent-subtree-sum-medium.md │ ├── 0518-coin-change-2-medium.md │ ├── 0520-detect-capital-easy.md │ ├── 0523-continuous-subarray-sum-medium.md │ ├── 0525-contiguous-array-medium.md │ ├── 0532-k-diff-pairs-in-an-array-medium.md │ ├── 0540-single-element-in-a-sorted-array-medium.md │ ├── 0542-01-matrix-medium.md │ ├── 0543-diameter-of-binary-tree-easy.md │ ├── 0557-reverse-words-in-a-string-iii-easy.md │ ├── 0559-maximum-depth-of-n-ary-tree-easy.md │ ├── 0560-subarray-sum-equals-k-medium.md │ ├── 0567-permutation-in-string-medium.md │ ├── 0572-subtree-of-another-tree-easy.md │ ├── 0581-shortest-unsorted-continuous-subarray-medium.md │ ├── 0589-n-ary-tree-preorder-traversal-easy.md │ └── _category_.json ├── 0600-0699 │ ├── 0605-can-place-flowers-easy.md │ ├── 0606-construct-string-from-binary-tree-easy.md │ ├── 0609-find-duplicate-file-in-system-medium.md │ ├── 0621-task-scheduler-medium.md │ ├── 0622-design-circular-queue-medium.md │ ├── 0623-add-one-row-to-tree-medium.md │ ├── 0633-sum-of-square-numbers-medium.md │ ├── 0637-average-of-levels-in-binary-tree-medium.md │ ├── 0645-set-mismatch-easy.md │ ├── 0647-palindromic-substrings-medium.md │ ├── 0650-two-keys-keyboard-medium.md │ ├── 0653-two-sum-IV-input-is-a-BST-easy.md │ ├── 0659-split-array-into-consecutive-subsequences-medium.md │ ├── 0662-maximum-width-of-binary-tree-medium.md │ ├── 0678-valid-parenthesis-string-medium.md │ ├── 0680-valid-palindrome-ii-easy.md │ ├── 0682-baseball-game-easy.md │ ├── 0684-redundant-connection-medium.md │ ├── 0692-top-k-frequent-words-medium.md │ ├── 0695-max-area-of-island-medium.md │ ├── 0698-partition-to-k-equal-sum-subsets-medium.md │ └── _category_.json ├── 0700-0799 │ ├── 0703-kth-largest-element-in-a-stream-easy.md │ ├── 0704-binary-search-easy.md │ ├── 0706-design-hashmap-medium.md │ ├── 0713-subarray-product-less-than-k-medium.md │ ├── 0718-maximum-length-of-repeated-subarray-medium.md │ ├── 0724-find-pivot-index-easy.md │ ├── 0732-my-calendar-iii-hard.md │ ├── 0733-flood-fill-easy.md │ ├── 0739-daily-temperatures-medium.md │ ├── 0740-delete-and-earn-medium.md │ ├── 0743-network-delay-time-medium.md │ ├── 0744-find-smallest-letter-greater-than-target-easy.md │ ├── 0746-min-cost-climbing-stairs-easy.md │ ├── 0763-partition-labels-medium.md │ ├── 0778-swim-in-rising-water-hard.md │ ├── 0785-is-graph-bipartite-medium.md │ ├── 0787-cheapest-flights-within-k-stops-medium.md │ ├── 0799-champagne-tower-medium.md │ └── _category_.json ├── 0800-0899 │ ├── 0813-largest-sum-of-averages-medium.md │ ├── 0814-binary-tree-pruning-medium.md │ ├── 0829-consecutive-numbers-sum-hard.md │ ├── 0838-push-dominoes-medium.md │ ├── 0841-keys-and-rooms-medium.md │ ├── 0844-backspace-string-compare-easy.md │ ├── 0846-hand-of-straights-medium.md │ ├── 0847-shortest-path-visiting-all-nodes-hard.md │ ├── 0852-peak-index-in-a-mountain-array-easy.md │ ├── 0853-car-fleet-medium.md │ ├── 0867-transpose-matrix-easy.md │ ├── 0869-reordered-power-of-2-medium.md │ ├── 0871-minimum-number-of-refueling-stops-hard.md │ ├── 0875-koko-eating-bananas-medium.md │ ├── 0876-middle-of-the-linked-list-easy.md │ ├── 0877-stone-game-medium.md │ ├── 0881-boats-to-save-people-medium.md │ ├── 0896-monotonic-array-easy.md │ ├── 0899-orderly-queue-hard.md │ └── _category_.json ├── 0900-0999 │ ├── 0901-online-stock-span-medium.md │ ├── 0904-fruit-into-baskets-medium.md │ ├── 0907-sum-of-subarray-minimums-medium.md │ ├── 0909-snakes-and-ladders-medium.md │ ├── 0912-sort-an-array-medium.md │ ├── 0918-maximum-sum-circular-subarray-medium.md │ ├── 0923-3sum-with-multiplicity-medium.md │ ├── 0926-flip-string-to-monotone-increasing-medium.md │ ├── 0935-knight-dialer-medium.md │ ├── 0936-stamping-the-sequence-hard.md │ ├── 0941-valid-mountain-array-easy.md │ ├── 0944-delete-columns-to-make-sorted-easy.md │ ├── 0946-validate-stack-sequences-medium.md │ ├── 0947-most-stones-removed-with-same-row-or-column-medium.md │ ├── 0948-bag-of-tokens-medium.md │ ├── 0952-largest-component-size-by-common-factor-hard.md │ ├── 0967-numbers-with-same-consecutive-differences-medium.md │ ├── 0973-k-closest-points-to-origin-medium.md │ ├── 0974-subarray-sums-divisible-by-k-medium.md │ ├── 0976-largest-perimeter-triangle-easy.md │ ├── 0981-time-based-key-value-store-medium.md │ ├── 0985-sum-of-even-numbers-after-queries.medium.md │ ├── 0987-vertical-order-traversal-of-a-binary-tree-hard.md │ ├── 0990-satisfiability-of-equality-equations-medium.md │ ├── 0991-broken-calculator-medium.md │ ├── 0992-subarrays-with-k-different-integers-hard.md │ ├── 0994-rotting-oranges-medium.md │ └── _category_.json ├── 1000-1099 │ ├── 0997-find-the-town-judge-easy.md │ ├── 1000-minimum-cost-to-merge-stones-hard.md │ ├── 1004-max-consecutive-ones-iii-medium.md │ ├── 1011-capacity-to-ship-packages-within-d-days-medium.md │ ├── 1019-next-greater-node-in-linked-list.md │ ├── 1029-two-city-scheduling-medium.md │ ├── 1043-partition-array-for-maximum-sum-medium.md │ ├── 1046-last-stone-weight-easy.md │ ├── 1047-remove-all-adjacent-duplicates-in-string-easy.md │ ├── 1061-lexicographically-smallest-equivalent-string-medium.md │ ├── 1066-campus-bikes-ii-medium.md │ ├── 1071-greatest-common-divisor-of-strings-easy.md │ └── _category_.json ├── 1100-1199 │ ├── 1123-lowest-common-ancestor-of-deepest-leaves-medium.md │ ├── 1125-smallest-sufficient-team-hard.md │ ├── 1135-connecting-cities-with-minimum-cost-medium.md │ ├── 1137-n-th-tribonacci-number-easy.md │ ├── 1140-stone-game-ii-medium.md │ ├── 1143-longest-common-subsequence-medium.md │ ├── 1147-longest-chunked-palindrome-decomposition-hard.md │ ├── 1154-make-the-string-great-easy.md │ ├── 1155-number-of-dice-rolls-with-target-sum-medium.md │ ├── 1162-as-far-from-land-as-possible-medium.md │ ├── 1168-optimize-water-distribution-in-a-village-hard.md │ └── _category_.json ├── 1200-1299 │ ├── 1201-ugly-number-iii-medium.md │ ├── 1202-smallest-string-with-swaps-medium.md │ ├── 1219-path-with-maximum-gold-medium.md │ ├── 1232-check-if-it-is-a-straight-line-easy.md │ ├── 1235-maximum-profit-in-job-scheduling-hard.md │ ├── 1239-maximum-length-of-a-concatenated-string-with-unique-characters-medium.md │ ├── 1259-handshakes-that-dont-cross-hard.md │ ├── 1269-number-of-ways-to-stay-in-the-same-place-after-some-steps-hard.md │ ├── 1281-subtract-the-product-and-sum-of-digits-of-an-integer-easy.md │ ├── 1293-shortest-path-in-a-grid-with-obstacles-elimination-hard.md │ ├── 1299-replace-elements-with-greatest-element-on-right-side-easy.md │ └── _category_.json ├── 1300-1399 │ ├── 1305-all-elements-in-two-binary-search-trees-medium.md │ ├── 1326-minimum-number-of-taps-to-open-to-water-a-garden-hard.md │ ├── 1328-break-a-palindrome-medium.md │ ├── 1329-sort-the-matrix-diagonally-medium.md │ ├── 1331-rank-transform-of-an-array-easy.md │ ├── 1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance-medium.md │ ├── 1335-minimum-difficulty-of-a-job-schedule-hard.md │ ├── 1337-the-k-weakest-rows-in-a-matrix-easy.md │ ├── 1346-check-if-n-and-its-double-exist-easy.md │ ├── 1347-minimum-number-of-steps-to-make-two-strings-anagram-medium.md │ ├── 1349-maximum-students-taking-exam-hard.md │ ├── 1356-sort-integers-by-the-number-of-1-bits-easy.md │ ├── 1359-count-all-valid-pickup-and-delivery-options-hard.md │ ├── 1365-how-many-numbers-are-smaller-than-the-current-number-easy.md │ ├── 1371-find-the-longest-substring-containing-vowels-in-even-counts-medium.md │ ├── 1372-longest-zigzag-path-in-a-binary-tree-medium.md │ ├── 1383-maximum-performance-of-a-team-hard.md │ └── _category_.json ├── 1400-1499 │ ├── 1431-kids-with-the-greatest-number-of-candies-easy.md │ ├── 1434-number-of-ways-to-wear-different-hats-to-each-other-hard.md │ ├── 1443-minimum-time-to-collect-all-apples-in-a-tree.md │ ├── 1448-count-good-nodes-in-binary-tree-medium.md │ ├── 1457-pseudo-palindromic-paths-in-a-binary-tree-medium.md │ ├── 1460-make-two-arrays-equal-by-reversing-subarrays-easy.md │ ├── 1464-maximum-product-of-two-elements-in-an-array-easy.md │ ├── 1470-shuffle-the-array-easy.md │ ├── 1475-final-prices-with-a-special-discount-in-a-shop-easy.md │ ├── 1480-running-sum-of-1d-array-easy.md │ ├── 1482-minimum-number-of-days-to-make-m-bouquets-medium.md │ ├── 1491-average-salary-excluding-the-minimum-and-maximum-salary-easy.md │ ├── 1494-parallel-courses-ii-hard.md │ ├── 1496-path-crossing-easy.md │ └── _category_.json ├── 1500-1599 │ ├── 1502-can-make-arithmetic-progression-from-sequence-easy.md │ ├── 1510-stone-game-iv-hard.md │ ├── 1514-path-with-maximum-probability.md │ ├── 1519-number-of-nodes-in-the-sub-tree-with-the-same-label-medium.md │ ├── 1523-count-odd-numbers-in-an-interval-range-easy.md │ ├── 1531-string-compression-ii-hard.md │ ├── 1539-kth-missing-positive-number-easy.md │ ├── 1544-make-the-string-great-easy.md │ ├── 1547-minimum-cost-to-cut-a-stick-hard.md │ ├── 1550-three-consecutive-odds-easy.md │ ├── 1572-matrix-diagonal-sum-easy.md │ ├── 1575-count-all-possible-routes-hard.md │ ├── 1578-minimum-time-to-make-rope-colorful-medium.md │ ├── 1584-min-cost-to-connect-all-points-medium.md │ ├── 1588-sum-of-all-odd-length-subarrays-easy.md │ ├── 1590-make_sum_divisible_by_p-medium.md │ └── _category_.json ├── 1600-1699 │ ├── 1624-largest-substring-between-two-equal-characters-easy.md │ ├── 1626-best-team-with-no-conflicts-medium.md │ ├── 1630-arithmetic-subarrays-medium.md │ ├── 1631-path-with-minimum-effort-medium.md │ ├── 1633-smallest-string-with-a-given-numeric-value-medium.md │ ├── 1639-number-of-ways-to-form-a-target-string-given-a-dictionary-hard.md │ ├── 1655-distribute-repeating-integers-hard.md │ ├── 1657-define-if-two-strings-are-close-medium.md │ ├── 1662-check-if-two-string-arrays-are-equivalent-easy.md │ ├── 1664-ways-to-make-a-fair-array-medium.md │ ├── 1672-richest-customer-wealth-easy.md │ ├── 1675-minimize-deviation-in-array-hard.md │ ├── 1679-max-number-of-k-sum-pairs-medium.md │ ├── 1680-concatenation-of-consecutive-binary-numbers-medium.md │ ├── 1685-sum-of-absolute-differences-in-a-sorted-array-medium.md │ ├── 1692-count-ways-to-distribute-candies-hard.md │ └── _category_.json ├── 1700-1799 │ ├── 1704-determine-if-string-halves-are-alike-easy.md │ ├── 1706-where-will-the-ball-fall-medium.md │ ├── 1727-largest-submatrix-with-rearrangements-medium.md │ ├── 1748-sum-of-unique-elements-easy.md │ ├── 1751-maximum-number-of-events-that-can-be-attended-ii-hard.md │ ├── 1758-minimum-changes-to-make-alternating-binary-string-easy.md │ ├── 1762-buildings-with-an-ocean-view-medium.md │ ├── 1768-merge-strings-alternately-easy.md │ ├── 1770-maximum-score-from-performing-multiplication-operations-medium.md │ ├── 1779-find-nearest-point-that-has-the-same-x-or-y-coordinate-easy.md │ ├── 1790-check-if-one-string-swap-can-make-strings-equal-easy.md │ ├── 1791-find-center-of-star-graph-easy.md │ ├── 1793-maximum-score-of-a-good-subarray-hard.md │ └── _category_.json ├── 1800-1899 │ ├── 1800-maximum-ascending-subarray-sum-easy.md │ ├── 1822-sign-of-the-product-of-an-array-easy.md │ ├── 1823-find-the-winner-of-the-circular-game-medium.md │ ├── 1833-maximum-ice-cream-bars-medium.md │ ├── 1851-minimum-interval-to-include-each-query-hard.md │ ├── 1852-distinct-numbers-in-each-subarray-medium.md │ ├── 1854-maximum-population-year-easy.md │ ├── 1855-maximum-distance-between-a-pair-of-values-medium.md │ ├── 1859-sorting-the-sentence-easy.md │ ├── 1863-sum-of-all-subset-xor-totals-easy.md │ ├── 1866-number-of-ways-to-rearrange-sticks-with-k-sticks-visible-hard.md │ ├── 1899-merge-triplets-to-form-target-triplet-medium.md │ └── _category_.json ├── 1900-1999 │ ├── 1903-largest-odd-number-in-string-easy.md │ ├── 1913-maximum-product-difference-between-two-pairs-easy.md │ ├── 1916-count-ways-to-build-rooms-in-an-ant-colony.md │ ├── 1922-count-good-numbers-medium.md │ ├── 1926-nearest-exit-from-entrance-in-maze-medium.md │ ├── 1929-concatenation-of-array-easy.md │ ├── 1980-find-unique-binary-string-medium.md │ ├── 1992-find-all-groups-of-farmland-medium.md │ ├── 1996-the-number-of-weak-characters-in-the-game-medium.md │ └── _category_.json ├── 2000-2099 │ ├── 2007-find-original-array-from-doubled-array-medium.md │ ├── 2009-minimum-number-of-operations-to-make-array-continuous-hard.md │ ├── 2013-detect-squares-medium.md │ ├── 2017-grid-game-medium.md │ ├── 2032-two-out-of-three-easy.md │ ├── 2050-parallel-courses-iii-hard.md │ ├── 2075-decode-the-slanted-ciphertext-medium.md │ └── _category_.json ├── 2100-2199 │ ├── 2104-solving-questions-with-brainpower-medium.md │ ├── 2108-find-first-palindromic-string-in-the-array-easy.md │ ├── 2109-adding-spaces-to-a-string-medium.md │ ├── 2110-number-of-smooth-descent-periods-of-a-stock-medium.md │ ├── 2111-minimum-operations-to-make-the-array-k-increasing-hard.md │ ├── 2119-a-number-after-a-double-reversal-easy.md │ ├── 2120-execution-of-all-suffix-instructions-staying-in-a-grid-medium.md │ ├── 2121-intervals-between-identical-elements-medium.md │ ├── 2122-recover-the-original-array-hard.md │ ├── 2127-maximum-employees-to-be-invited-to-a-meeting-hard.md │ ├── 2131-longest-palindrome-by-concatenating-two-letter-words-medium.md │ ├── 2144-minimum-cost-of-buying-candies-with-discount-easy.md │ ├── 2145-count-the-hidden-sequences-medium.md │ ├── 2146-k-highest-ranked-items-within-a-price-range-medium.md │ ├── 2147-number-of-ways-to-divide-a-long-corridor-hard.md │ ├── 2148-count-elements-with-strictly-smaller-and-greater-elements-easy.md │ ├── 2149-rearrange-array-elements-by-sign-medium.md │ ├── 2150-find-all-lonely-numbers-in-the-array-medium.md │ ├── 2151-maximum-good-people-based-on-statements-hard.md │ ├── 2154-keep-multiplying-found-values-by-two-easy.md │ ├── 2155-all-divisions-with-the-highest-score-of-a-binary-array-medium.md │ ├── 2156-find-substring-with-given-hash-value-medium.md │ ├── 2160-minimum-sum-of-four-digit-number-after-splitting-digits-easy.md │ ├── 2161-partition-array-according-to-given-pivot-medium.md │ ├── 2162-minimum-cost-to-set-cooking-time-medium.md │ ├── 2163-minimum-difference-in-sums-after-removal-of-elements-hard.md │ ├── 2164-sort-even-and-odd-indices-independently-easy.md │ ├── 2165-smallest-value-of-the-rearranged-number-medium.md │ ├── 2166-design-bitset-medium.md │ ├── 2167-minimum-time-to-remove-all-cars-containing-illegal-goods-hard.md │ ├── 2169-count-operations-to-obtain-zero-easy.md │ ├── 2170-minimum-operations-to-make-the-array-alternating-medium.md │ ├── 2171-removing-minimum-number-of-magic-beans-medium.md │ ├── 2172-maximum-and-sum-of-array-hard.md │ ├── 2176-count-equal-and-divisible-pairs-in-an-array-easy.md │ ├── 2177-find-three-consecutive-integers-that-sum-to-a-given-number-medium.md │ ├── 2178-maximum-split-of-positive-even-integers-medium.md │ ├── 2179-count-good-triplets-in-an-array-hard.md │ ├── 2180-count-integers-with-even-digit-sum-easy.md │ ├── 2181-merge-nodes-in-between-zeros-medium.md │ ├── 2182-construct-string-with-repeat-limit-medium.md │ ├── 2183-count-array-pairs-divisible-by-k-hard.md │ ├── 2185-counting-words-with-a-given-prefix-easy.md │ ├── 2186-minimum-number-of-steps-to-make-two-strings-anagram-ii-medium.md │ ├── 2187-minimum-time-to-complete-trips-medium.md │ ├── 2188-minimum-time-to-finish-the-race-hard.md │ ├── 2190-most-frequent-number-following-key-in-an-array-easy.md │ ├── 2191-sort-the-jumbled-numbers-medium.md │ ├── 2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph-medium.md │ ├── 2193-minimum-number-of-moves-to-make-palindrome-hard.md │ ├── 2194-cells-in-a-range-on-an-excel-sheet-easy.md │ ├── 2195-append-k-integers-with-minimal-sum-medium.md │ ├── 2196-create-binary-tree-from-descriptions-medium.md │ ├── 2197-replace-non-coprime-numbers-in-array-hard.md │ ├── 2200-find-all-k-distant-indices-in-an-array-easy.md │ ├── 2201-count-artifacts-that-can-be-extracted-medium.md │ ├── 2202-maximize-the-topmost-element-after-k-moves-medium.md │ ├── 2203-minimum-weighted-subgraph-with-the-required-paths-hard.md │ ├── 2206-divide-array-into-equal-pairs-easy.md │ ├── 2207-maximize-number-of-subsequences-in-a-string-medium.md │ └── _category_.json ├── 2200-2299 │ ├── 2208-minimum-operations-to-halve-array-sum-easy.md │ ├── 2209-minimum-white-tiles-after-covering-with-carpets-hard.md │ ├── 2214-minimum-health-to-beat-game-medium.md │ ├── 2215-find-the-difference-of-two-arrays-easy.md │ ├── 2216-minimum-deletions-to-make-array-beautiful-medium.md │ ├── 2217-find-palindrome-with-fixed-length-medium.md │ ├── 2218-maximum-value-of-k-coins-from-piles-hard.md │ ├── 2223-sum-of-scores-of-built-strings-hard.md │ ├── 2224-minimum-number-of-operations-to-convert-time-easy.md │ ├── 2225-find-players-with-zero-or-one-losses-medium.md │ ├── 2226-maximum-candies-allocated-to-k-children-medium.md │ ├── 2227-encrypt-and-decrypt-strings-hard.md │ ├── 2229-check-if-an-array-is-consecutive-easy.md │ ├── 2231-largest-number-after-digit-swaps-by-parity-easy.md │ ├── 2232-minimize-result-by-adding-parentheses-to-expression-medium.md │ ├── 2233-maximum-product-after-k-increments-medium.md │ ├── 2235-add-two-integers-easy.md │ ├── 2237-count-positions-on-street-with-required-brightness-medium.md │ ├── 2239-find-closest-number-to-zero-easy.md │ ├── 2240-number-of-ways-to-buy-pens-and-pencils-medium.md │ ├── 2241-design-an-atm-machine-medium.md │ ├── 2242-maximum-score-of-a-node-sequence-hard.md │ ├── 2243-calculate-digit-sum-of-a-string-easy.md │ ├── 2244-minimum-rounds-to-complete-all-tasks-medium.md │ ├── 2246-longest-path-with-different-adjacent-characters-hard.md │ ├── 2248-intersection-of-multiple-arrays-easy.md │ ├── 2249-count-lattice-points-inside-a-circle-medium.md │ ├── 2250-count-number-of-rectangles-containing-each-point-medium.md │ ├── 2251-number-of-flowers-in-full-bloom-hard.md │ ├── 2255-count-prefixes-of-a-given-string-easy.md │ ├── 2256-minimum-average-difference-medium.md │ ├── 2259-remove-digit-from-number-to-maximize-result-easy.md │ ├── 2260-minimum-consecutive-cards-to-pick-up-medium.md │ ├── 2261-k-divisible-elements-subarrays-medium.md │ ├── 2262-total-appeal-of-a-string-hard.md │ ├── 2264-largest-3-same-digit-number-in-string-easy.md │ ├── 2265-count-nodes-equal-to-average-of-subtree-medium.md │ ├── 2266-count-number-of-texts-medium.md │ ├── 2267-check-if-there-is-a-valid-parentheses-string-path-hard.md │ ├── 2273-find-resultant-array-after-removing-anagrams-easy.md │ ├── 2274-maximum-consecutive-floors-without-special-floors-medium.md │ ├── 2275-largest-combination-with-bitwise-and-greater-than-zero-medium.md │ ├── 2276-count-integers-in-intervals-hard.md │ ├── 2278-percentage-of-letter-in-string.md │ ├── 2279-maximum-bags-with-full-capacity-of-rock-medium.md │ ├── 2280-minimum-lines-to-represent-a-line-chart-medium.md │ └── _category_.json ├── 2300-2399 │ ├── 2300-successful-pairs-of-spells-and-potions-medium.md │ ├── 2302-count-subarrays-with-score-less-than-k.md │ ├── 2331-evaluate-boolean-binary-tree-easy.md │ ├── 2332-the-latest-time-to-catch-a-bus-medium.md │ ├── 2333-minimum-sum-of-squared-difference-medium.md │ ├── 2334-subarray-with-elements-greater-than-varying-threshold-hard.md │ ├── 2335-minimum-amount-of-time-to-fill-cups-easy.md │ ├── 2336-smallest-number-in-infinite-set-medium.md │ ├── 2337-move-pieces-to-obtain-a-string-medium.md │ ├── 2338-count-the-number-of-ideal-arrays-hard.md │ ├── 2351-first-letter-to-appear-twice-easy.md │ ├── 2352-equal-row-and-column-pairs-medium.md │ ├── 2353-design-a-food-rating-system-medium.md │ ├── 2354-number-of-excellent-pairs-hard.md │ ├── 2357-make-array-zero-by-subtracting-equal-amounts-easy.md │ ├── 2358-maximum-number-of-groups-entering-a-competition-medium.md │ ├── 2359-find-closest-node-to-given-two-nodes-medium.md │ ├── 2360-longest-cycle-in-a-graph-hard.md │ ├── 2373-largest-local-values-in-a-matrix-easy.md │ ├── 2376-count-special-integers-hard.md │ ├── 2379-minimum-recolors-to-get-k-consecutive-black-blocks-easy.md │ ├── 2380-time-needed-to-rearrange-a-binary-string-medium.md │ ├── 2381-shifting-letters-ii-medium.md │ ├── 2383-minimum-hours-of-training-to-win-a-competition-easy.md │ ├── 2384-largest-palindromic-number-medium.md │ ├── 2392-build-a-matrix-with-conditions-hard.md │ └── _category_.json ├── 2400-2499 │ ├── 2400-number-of-ways-to-reach-a-position-after-exactly-k-steps-medium.md │ ├── 2401-longest-nice-subarray-medium.md │ ├── 2404-most-frequent-even-element-easy.md │ ├── 2405-optimal-partition-of-string-medium.md │ ├── 2406-divide-intervals-into-minimum-number-of-groups-medium.md │ ├── 2413-smallest-even-multiple-easy.md │ ├── 2418-sort-the-people-easy.md │ ├── 2419-longest-subarray-with-maximum-bitwise-and-medium.md │ ├── 2420-find-all-good-indices-medium.md │ ├── 2421-number-of-good-paths-hard.md │ ├── 2425-bitwise-xor-of-all-pairs-medium.md │ ├── 2432-the-employee-that-worked-on-the-longest-task-easy.md │ ├── 2433-find-the-original-array-of-prefix-xor-medium.md │ ├── 2439-minimize-maximum-of-array-medium.md │ ├── 2441-largest-positive-integer-that-exists-with-its-negative-easy.md │ ├── 2445-number-of-nodes-with-value-one-medium.md │ ├── 2455-average-value-of-even-numbers-that-are-divisible-by-three-easy.md │ ├── 2461-maximum-sum-of-distinct-subarrays-with-length-k-medium.md │ ├── 2469-convert-the-temperature-easy.md │ ├── 2477-minimum-fuel-cost-to-report-to-the-capital-medium.md │ ├── 2482-difference-between-ones-and-zeros-in-row-and-column-medium.md │ ├── 2485-find-the-pivot-integer-easy.md │ ├── 2486-append-characters-to-string-to-make-subsequence-medium.md │ ├── 2487-remove-nodes-from-linked-list-medium.md │ └── _category_.json ├── 2500-2599 │ ├── 2501-longest-square-streak-in-an-array-medium.md │ ├── 2520-count-the-digits-that-divide-a-number-easy.md │ ├── 2521-distinct-prime-factors-of-product-of-array-medium.md │ ├── 2523-closest-prime-numbers-in-range-medium.md │ ├── 2529-maximum-count-of-positive-integer-and-negative-integer-easy.md │ ├── 2530-maximal-score-after-applying-k-operations-medium.md │ ├── 2531-make-number-of-distinct-characters-equal-medium.md │ ├── 2535-difference-between-element-sum-and-digit-sum-of-an-array-easy.md │ ├── 2571-minimum-operations-to-reduce-an-integer-to-0-easy.md │ └── _category_.json ├── 2600-2699 │ ├── 2610-convert-an-array-into-a-2d-array-with-conditions-medium.md │ ├── 2614-prime-in-diagonal-easy.md │ ├── 2615-sum-of-distances-medium.md │ ├── 2616-minimize-the-maximum-difference-of-pairs-medium.md │ ├── 2639-find-the-width-of-columns-of-a-grid-easy.md │ ├── 2644-find-the-maximum-divisibility-score-easy.md │ ├── 2678-number-of-senior-citizens-easy.md │ ├── 2679-sum-in-a-matrix-medium.md │ ├── 2680-maximum-or-medium.md │ ├── 2681-power-of-heroes-hard.md │ └── _category_.json ├── 2700-2799 │ ├── 2709-greatest-common-divisor-traversal-hard.md │ ├── 2750-ways-to-split-array-into-good-subarrays-medium.md │ ├── 2761-prime-pairs-with-target-sum-medium.md │ └── _category_.json ├── 2800-2899 │ ├── 2810-faulty-keyboard-easy.md │ ├── 2811-check-if-it-is-possible-to-split-array-medium.md │ ├── 2815-max-pair-sum-in-an-array-easy.md │ ├── 2839-check-if-strings-can-be-made-equal-with-operations-i-easy.md │ ├── 2840-check-if-strings-can-be-made-equal-with-operations-ii-medium.md │ ├── 2841-maximum-sum-of-almost-unique-subarray-medium.md │ ├── 2843-count-symmetric-integers-easy.md │ ├── 2859-sum-of-values-at-indices-with-k-set-bits-easy.md │ ├── 2864-maximum-odd-binary-number-easy.md │ ├── 2873-maximum-value-of-an-ordered-triplet-i-easy.md │ ├── 2873-maximum-value-of-an-ordered-triplet-ii-medium.md │ └── _category_.json ├── 2900-2999 │ ├── 2095-find-indices-with-index-and-value-difference-ii-medium.md │ ├── 2903-find-indices-with-index-and-value-difference-i-easy.md │ ├── 2913-subarrays-distinct-element-sum-of-squares-i-easy.md │ ├── 2914-minimum-number-of-changes-to-make-binary-string-beautiful-medium.md │ └── _category_.json ├── 3000-3099 │ ├── 3005-count-elements-with-maximum-frequency-easy.md │ ├── 3033-modify-the-matrix-easy.md │ ├── 3034-number-of-subarrays-that-match-a-pattern-i-medium.md │ ├── 3035-maximum-palindromes-after-operations-medium.md │ ├── 3064-guess-the-number-using-bitwise-questions-i-medium.md │ └── _category_.json ├── 3100-3199 │ ├── 3142-check-if-grid-satisfies-conditions-easy.md │ └── _category_.json ├── 3200-3299 │ ├── 3289-the-two-sneaky-numbers-of-digitville-easy.md │ └── _category_.json └── 3300-3399 │ ├── 3300-minimum-element-after-replacement-with-digit-sum-easy.md │ ├── 3375-minimum-operations-to-make-array-values-equal-to-k-easy.md │ └── _category_.json ├── src ├── components │ ├── HomepageFeatures │ │ ├── index.js │ │ └── styles.module.css │ ├── SolutionAuthor │ │ └── index.js │ ├── Table │ │ └── index.js │ ├── Tags │ │ └── index.js │ └── TutorialCredits │ │ └── index.js ├── css │ └── custom.css ├── pages │ ├── index.js │ └── index.module.css └── theme │ └── MDXComponents.js ├── static ├── .nojekyll ├── CNAME ├── ads.txt ├── img │ ├── banner.png │ ├── favicon.ico │ ├── logo.svg │ ├── undraw_community_re_cyrm.svg │ ├── undraw_learning_sketching_nd4f.svg │ └── undraw_onboarding_re_6osc.svg └── robots.txt ├── templates ├── binary-search.md ├── bit-manipulation.md ├── euler.md ├── fenwick-tree.md ├── graph-theory.md ├── index.md ├── linked-list.md ├── manachers-algorithm.md ├── ordered-set.md ├── prefix-sum.md ├── segment-tree.md ├── sparse-table.md └── two-pointers.md └── tutorials ├── basic-topics ├── _category_.json ├── arrays.md ├── backtracking.md ├── binary-search.md ├── brute-force.md ├── divide-and-conquer.md ├── doubly-linked-list.md ├── greedy.md ├── hash-map.md ├── heap.md ├── kadane.md ├── linear-search.md ├── linked-list.md ├── mod.md ├── prefix-sum.md ├── queue-and-stack.md ├── sliding-window.md ├── sorting │ ├── _category_.json │ ├── bubble-sort.md │ ├── bucket-sort.md │ ├── counting-sort.md │ ├── cyclic-sort.md │ ├── heap-sort.md │ ├── insertion-sort.md │ ├── introduction.md │ ├── merge-sort.md │ ├── quick-sort.md │ ├── radix-sort.md │ ├── selection-sort.md │ ├── shell-sort.md │ └── tim-sort.md ├── time-complexity.md ├── trie.md └── two-pointers.md ├── dynamic-programming.md ├── graph-theory ├── _category_.json ├── bellman-ford-algorithm.md ├── binary-search-tree.md ├── binary-tree.md ├── breadth-first-search.md ├── depth-first-search.md ├── dijkstra.md ├── disjoint-set-union.md ├── floyd-warshall-algorithm.md ├── introduction.md ├── kahns-algorithm.md ├── kruskals-algorithm.md ├── lca.md ├── minimum-spanning-tree.md ├── prims-algorithm.md ├── tarjans-algorithm.md └── topological-sorting.md ├── math ├── _category_.json ├── bit-manipulation.md ├── combinatorics.md ├── matrix-exponentiation.md ├── number-theory │ ├── _category_.json │ ├── binary-exponentiation.md │ └── sieve-of-eratosthenes.md └── prime-factors.md └── strings ├── _category_.json ├── knuth–morris–pratt-algorithm.md ├── levenshtein-distance.md ├── manachers-algorithm.md ├── palindrome.md ├── rabin-karp-algorithm.md └── z-algorithm.md /.github/FUNDING.yml: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/.github/FUNDING.yml -------------------------------------------------------------------------------- /.github/issue_template.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/.github/issue_template.md -------------------------------------------------------------------------------- /.github/pull_request_template.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/.github/pull_request_template.md -------------------------------------------------------------------------------- /.github/workflows/deploy.yml: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/.github/workflows/deploy.yml -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/.gitignore -------------------------------------------------------------------------------- /.prettierrc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/.prettierrc -------------------------------------------------------------------------------- /CONTRIBUTING.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/CONTRIBUTING.md -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/README.md -------------------------------------------------------------------------------- /babel.config.js: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/babel.config.js -------------------------------------------------------------------------------- /blog/2019-05-28-first-blog-post.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/blog/2019-05-28-first-blog-post.md -------------------------------------------------------------------------------- /blog/2019-05-29-long-blog-post.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/blog/2019-05-29-long-blog-post.md -------------------------------------------------------------------------------- /blog/2021-08-01-mdx-blog-post.mdx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/blog/2021-08-01-mdx-blog-post.mdx -------------------------------------------------------------------------------- /blog/2021-08-26-welcome/docusaurus-plushie-banner.jpeg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/blog/2021-08-26-welcome/docusaurus-plushie-banner.jpeg -------------------------------------------------------------------------------- /blog/2021-08-26-welcome/index.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/blog/2021-08-26-welcome/index.md -------------------------------------------------------------------------------- /blog/authors.yml: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/blog/authors.yml -------------------------------------------------------------------------------- /config.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/config.json -------------------------------------------------------------------------------- /converter/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/converter/README.md -------------------------------------------------------------------------------- /converter/background.js: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/converter/background.js -------------------------------------------------------------------------------- /converter/content.js: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/converter/content.js -------------------------------------------------------------------------------- /converter/manifest.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/converter/manifest.json -------------------------------------------------------------------------------- /converter/popup.css: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/converter/popup.css -------------------------------------------------------------------------------- /converter/popup.html: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/converter/popup.html -------------------------------------------------------------------------------- /converter/popup.js: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/converter/popup.js -------------------------------------------------------------------------------- /docs/index.md: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /docusaurus.config.js: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/docusaurus.config.js -------------------------------------------------------------------------------- /package.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/package.json -------------------------------------------------------------------------------- /pnpm-lock.yaml: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/pnpm-lock.yaml -------------------------------------------------------------------------------- /renovate.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/renovate.json -------------------------------------------------------------------------------- /roadmap/arrays.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/roadmap/arrays.md -------------------------------------------------------------------------------- /roadmap/backtracking.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/roadmap/backtracking.md -------------------------------------------------------------------------------- /roadmap/binary-search.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/roadmap/binary-search.md -------------------------------------------------------------------------------- /roadmap/data-structure-i.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/roadmap/data-structure-i.md -------------------------------------------------------------------------------- /roadmap/dynamic-programming.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/roadmap/dynamic-programming.md -------------------------------------------------------------------------------- /roadmap/graph-theory.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/roadmap/graph-theory.md -------------------------------------------------------------------------------- /roadmap/heap.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/roadmap/heap.md -------------------------------------------------------------------------------- /roadmap/index.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/roadmap/index.md -------------------------------------------------------------------------------- /roadmap/leetcode-summer-intensive.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/roadmap/leetcode-summer-intensive.md -------------------------------------------------------------------------------- /roadmap/programming-skills-i.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/roadmap/programming-skills-i.md -------------------------------------------------------------------------------- /roadmap/sliding-windows.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/roadmap/sliding-windows.md -------------------------------------------------------------------------------- /roadmap/stack.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/roadmap/stack.md -------------------------------------------------------------------------------- /roadmap/tree.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/roadmap/tree.md -------------------------------------------------------------------------------- /roadmap/trie.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/roadmap/trie.md -------------------------------------------------------------------------------- /roadmap/two-pointers.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/roadmap/two-pointers.md -------------------------------------------------------------------------------- /sidebars.js: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/sidebars.js -------------------------------------------------------------------------------- /solutions/0000-0099/0001-two-sum.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0001-two-sum.md -------------------------------------------------------------------------------- /solutions/0000-0099/0002-add-two-numbers-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0002-add-two-numbers-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0004-median-of-two-sorted-arrays-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0004-median-of-two-sorted-arrays-hard.md -------------------------------------------------------------------------------- /solutions/0000-0099/0005-longest-palindromic-substring-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0005-longest-palindromic-substring-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0006-zigzag-conversion-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0006-zigzag-conversion-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0007-reverse-integer-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0007-reverse-integer-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0009-palindrome-number-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0009-palindrome-number-easy.md -------------------------------------------------------------------------------- /solutions/0000-0099/0010-regular-expression-matching-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0010-regular-expression-matching-hard.md -------------------------------------------------------------------------------- /solutions/0000-0099/0011-container-with-most-water-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0011-container-with-most-water-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0012-integer-to-roman-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0012-integer-to-roman-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0013-roman-to-integer-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0013-roman-to-integer-easy.md -------------------------------------------------------------------------------- /solutions/0000-0099/0014-longest-common-prefix-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0014-longest-common-prefix-easy.md -------------------------------------------------------------------------------- /solutions/0000-0099/0017-letter-combinations-of-a-phone-number-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0017-letter-combinations-of-a-phone-number-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0019-remove-nth-node-from-end-of-list-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0019-remove-nth-node-from-end-of-list-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0020-valid-parentheses-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0020-valid-parentheses-easy.md -------------------------------------------------------------------------------- /solutions/0000-0099/0021-merge-two-sorted-lists-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0021-merge-two-sorted-lists-easy.md -------------------------------------------------------------------------------- /solutions/0000-0099/0022-generate-parentheses-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0022-generate-parentheses-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0023-merge-k-sorted-lists-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0023-merge-k-sorted-lists-hard.md -------------------------------------------------------------------------------- /solutions/0000-0099/0024-swap-nodes-in-pairs-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0024-swap-nodes-in-pairs-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0025-reverse-nodes-in-k-group-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0025-reverse-nodes-in-k-group-hard.md -------------------------------------------------------------------------------- /solutions/0000-0099/0026-Remove-Duplicates-from-Sorted-Array-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0026-Remove-Duplicates-from-Sorted-Array-easy.md -------------------------------------------------------------------------------- /solutions/0000-0099/0027-remove-element-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0027-remove-element-easy.md -------------------------------------------------------------------------------- /solutions/0000-0099/0033-search-in-rotated-sorted-array-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0033-search-in-rotated-sorted-array-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0035-search-insert-position-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0035-search-insert-position-easy.md -------------------------------------------------------------------------------- /solutions/0000-0099/0036-valid-sudoku-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0036-valid-sudoku-easy.md -------------------------------------------------------------------------------- /solutions/0000-0099/0037-sudoku-solver-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0037-sudoku-solver-hard.md -------------------------------------------------------------------------------- /solutions/0000-0099/0039-combination-sum-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0039-combination-sum-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0040-combination-sum-ii-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0040-combination-sum-ii-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0042-trapping-rain-water-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0042-trapping-rain-water-hard.md -------------------------------------------------------------------------------- /solutions/0000-0099/0045-jump-game-ii-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0045-jump-game-ii-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0046-permutations-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0046-permutations-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0048-rotate-image-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0048-rotate-image-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0049-group-anagrams-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0049-group-anagrams-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0050-pow-x-n-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0050-pow-x-n-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0051-n-queens-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0051-n-queens-hard.md -------------------------------------------------------------------------------- /solutions/0000-0099/0053-maximum-subarray-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0053-maximum-subarray-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0054-spiral-matrix-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0054-spiral-matrix-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0055-jump-game-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0055-jump-game-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0056-merge-intervals-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0056-merge-intervals-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0057-insert-interval-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0057-insert-interval-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0058-length-of-last-word-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0058-length-of-last-word-easy.md -------------------------------------------------------------------------------- /solutions/0000-0099/0061-rotate-list-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0061-rotate-list-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0062-unique-paths-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0062-unique-paths-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0063-unique-paths-ii-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0063-unique-paths-ii-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0066-plus-one-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0066-plus-one-easy.md -------------------------------------------------------------------------------- /solutions/0000-0099/0067-add-binary-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0067-add-binary-easy.md -------------------------------------------------------------------------------- /solutions/0000-0099/0069-sqrt-x-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0069-sqrt-x-easy.md -------------------------------------------------------------------------------- /solutions/0000-0099/0070-climbing-stairs-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0070-climbing-stairs-easy.md -------------------------------------------------------------------------------- /solutions/0000-0099/0072-edit-distance-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0072-edit-distance-hard.md -------------------------------------------------------------------------------- /solutions/0000-0099/0073-set-matrix-zeroes-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0073-set-matrix-zeroes-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0074-search-a-2d-matrix-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0074-search-a-2d-matrix-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0075-sort-colors-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0075-sort-colors-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0076-minimum-window-substring-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0076-minimum-window-substring-hard.md -------------------------------------------------------------------------------- /solutions/0000-0099/0077-combinations-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0077-combinations-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0078-subsets-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0078-subsets-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0079-word-search-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0079-word-search-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0084-largest-rectangle-in-histogram-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0084-largest-rectangle-in-histogram-hard.md -------------------------------------------------------------------------------- /solutions/0000-0099/0088-merge-sorted-array-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0088-merge-sorted-array-easy.md -------------------------------------------------------------------------------- /solutions/0000-0099/0090-subsets-ii-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0090-subsets-ii-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0091-decode-ways-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0091-decode-ways-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0093-restore-ip-addresses-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0093-restore-ip-addresses-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0094-binary-tree-inorder-traversal-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0094-binary-tree-inorder-traversal-easy.md -------------------------------------------------------------------------------- /solutions/0000-0099/0097-interleaving-string-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0097-interleaving-string-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/0098-validate-binary-search-tree-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/0098-validate-binary-search-tree-medium.md -------------------------------------------------------------------------------- /solutions/0000-0099/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0000-0099/_category_.json -------------------------------------------------------------------------------- /solutions/0100-0199/0100-same-tree-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0100-same-tree-easy.md -------------------------------------------------------------------------------- /solutions/0100-0199/0101-symmetric-tree-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0101-symmetric-tree-easy.md -------------------------------------------------------------------------------- /solutions/0100-0199/0102-binary-tree-level-order-traversal-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0102-binary-tree-level-order-traversal-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0103-binary-tree-zigzag-level-order-traversal-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0103-binary-tree-zigzag-level-order-traversal-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0104-maximum-depth-of-binary-tree-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0104-maximum-depth-of-binary-tree-easy.md -------------------------------------------------------------------------------- /solutions/0100-0199/0110-balanced-binary-tree-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0110-balanced-binary-tree-easy.md -------------------------------------------------------------------------------- /solutions/0100-0199/0112-path-sum-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0112-path-sum-easy.md -------------------------------------------------------------------------------- /solutions/0100-0199/0113-path-sum-ii-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0113-path-sum-ii-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0115-distinct-subsequences-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0115-distinct-subsequences-hard.md -------------------------------------------------------------------------------- /solutions/0100-0199/0118-pascals-triangle-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0118-pascals-triangle-easy.md -------------------------------------------------------------------------------- /solutions/0100-0199/0121-best-time-to-buy-and-sell-stock-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0121-best-time-to-buy-and-sell-stock-easy.md -------------------------------------------------------------------------------- /solutions/0100-0199/0124-binary-tree-maximum-path-sum-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0124-binary-tree-maximum-path-sum-hard.md -------------------------------------------------------------------------------- /solutions/0100-0199/0125-valid-palindrome.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0125-valid-palindrome.md -------------------------------------------------------------------------------- /solutions/0100-0199/0127-word-ladder-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0127-word-ladder-hard.md -------------------------------------------------------------------------------- /solutions/0100-0199/0129-sum-root-to-leaf-numbers-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0129-sum-root-to-leaf-numbers-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0130-surrounded-regions-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0130-surrounded-regions-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0131-palindrome-partitioning-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0131-palindrome-partitioning-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0133-clone-graph-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0133-clone-graph-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0134-gas-station-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0134-gas-station-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0136-single-number-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0136-single-number-easy.md -------------------------------------------------------------------------------- /solutions/0100-0199/0138-copy-list-with-random-pointer-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0138-copy-list-with-random-pointer-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0139-word-break-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0139-word-break-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0141-linked-list-cycle.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0141-linked-list-cycle.md -------------------------------------------------------------------------------- /solutions/0100-0199/0143-reorder-list-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0143-reorder-list-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0144-binary-tree-preorder-traversal-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0144-binary-tree-preorder-traversal-easy.md -------------------------------------------------------------------------------- /solutions/0100-0199/0145-binary-tree-postorder-traversal-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0145-binary-tree-postorder-traversal-easy.md -------------------------------------------------------------------------------- /solutions/0100-0199/0146-lru-cache-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0146-lru-cache-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0148-sort-list-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0148-sort-list-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0150-evaluate-reverse-olish-notation-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0150-evaluate-reverse-olish-notation-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0152-maximum-product-subarray-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0152-maximum-product-subarray-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0154-find-minimum-in-rotated-sorted-array-ii-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0154-find-minimum-in-rotated-sorted-array-ii-hard.md -------------------------------------------------------------------------------- /solutions/0100-0199/0155-min-stack-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0155-min-stack-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0162-find-peak-element-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0162-find-peak-element-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0165-compare-version-numbers-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0165-compare-version-numbers-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0169-majority-element-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0169-majority-element-easy.md -------------------------------------------------------------------------------- /solutions/0100-0199/0188-best-time-to-buy-and-sell-stock-iv-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0188-best-time-to-buy-and-sell-stock-iv-hard.md -------------------------------------------------------------------------------- /solutions/0100-0199/0191-number-of-1-bits-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0191-number-of-1-bits-easy.md -------------------------------------------------------------------------------- /solutions/0100-0199/0198-house-robber-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0198-house-robber-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/0199-binary-tree-right-side-view-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/0199-binary-tree-right-side-view-medium.md -------------------------------------------------------------------------------- /solutions/0100-0199/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0100-0199/_category_.json -------------------------------------------------------------------------------- /solutions/0200-0299/0200-number-of-islands-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0200-number-of-islands-medium.md -------------------------------------------------------------------------------- /solutions/0200-0299/0202-happy-number-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0202-happy-number-easy.md -------------------------------------------------------------------------------- /solutions/0200-0299/0204-count-primes.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0204-count-primes.md -------------------------------------------------------------------------------- /solutions/0200-0299/0205-isomorphic-strings-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0205-isomorphic-strings-easy.md -------------------------------------------------------------------------------- /solutions/0200-0299/0206-reverse-linked-list-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0206-reverse-linked-list-easy.md -------------------------------------------------------------------------------- /solutions/0200-0299/0207-course-schedule-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0207-course-schedule-medium.md -------------------------------------------------------------------------------- /solutions/0200-0299/0208-implement-trie-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0208-implement-trie-medium.md -------------------------------------------------------------------------------- /solutions/0200-0299/0210-course-schedule-ii-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0210-course-schedule-ii-medium.md -------------------------------------------------------------------------------- /solutions/0200-0299/0211-design-add-and-search-words-data-structure-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0211-design-add-and-search-words-data-structure-medium.md -------------------------------------------------------------------------------- /solutions/0200-0299/0212-word-search-ii-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0212-word-search-ii-hard.md -------------------------------------------------------------------------------- /solutions/0200-0299/0213-house-robber-ii-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0213-house-robber-ii-medium.md -------------------------------------------------------------------------------- /solutions/0200-0299/0214-shortest-palindrome-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0214-shortest-palindrome-hard.md -------------------------------------------------------------------------------- /solutions/0200-0299/0215-kth-largest-element-in-an-array-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0215-kth-largest-element-in-an-array-medium.md -------------------------------------------------------------------------------- /solutions/0200-0299/0217-contains-duplicate-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0217-contains-duplicate-easy.md -------------------------------------------------------------------------------- /solutions/0200-0299/0219-contains-duplicate-ii-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0219-contains-duplicate-ii-easy.md -------------------------------------------------------------------------------- /solutions/0200-0299/0225-implement-stack-using-queues-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0225-implement-stack-using-queues-easy.md -------------------------------------------------------------------------------- /solutions/0200-0299/0226-invert-binary-tree-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0226-invert-binary-tree-easy.md -------------------------------------------------------------------------------- /solutions/0200-0299/0228-summary-ranges-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0228-summary-ranges-easy.md -------------------------------------------------------------------------------- /solutions/0200-0299/0230-kth-smallest-element-in-a-bst-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0230-kth-smallest-element-in-a-bst-medium.md -------------------------------------------------------------------------------- /solutions/0200-0299/0231-power-of-two-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0231-power-of-two-easy.md -------------------------------------------------------------------------------- /solutions/0200-0299/0234-palindrome-linked-list-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0234-palindrome-linked-list-easy.md -------------------------------------------------------------------------------- /solutions/0200-0299/0237-delete-node-in-a-linked-list-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0237-delete-node-in-a-linked-list-medium.md -------------------------------------------------------------------------------- /solutions/0200-0299/0239-sliding-maximum-window-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0239-sliding-maximum-window-hard.md -------------------------------------------------------------------------------- /solutions/0200-0299/0242-valid-anagram-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0242-valid-anagram-easy.md -------------------------------------------------------------------------------- /solutions/0200-0299/0246-strobogrammatic-number-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0246-strobogrammatic-number-easy.md -------------------------------------------------------------------------------- /solutions/0200-0299/0258-add-digits-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0258-add-digits-easy.md -------------------------------------------------------------------------------- /solutions/0200-0299/0261-graph-valid-tree-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0261-graph-valid-tree-medium.md -------------------------------------------------------------------------------- /solutions/0200-0299/0263-ugly-number-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0263-ugly-number-easy.md -------------------------------------------------------------------------------- /solutions/0200-0299/0268-missing-number-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0268-missing-number-easy.md -------------------------------------------------------------------------------- /solutions/0200-0299/0278-first-bad-version-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0278-first-bad-version-easy.md -------------------------------------------------------------------------------- /solutions/0200-0299/0283-move-zeroes-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0283-move-zeroes-easy.md -------------------------------------------------------------------------------- /solutions/0200-0299/0286-walls-and-gates-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0286-walls-and-gates-medium.md -------------------------------------------------------------------------------- /solutions/0200-0299/0287-find-the-duplicate-number-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0287-find-the-duplicate-number-medium.md -------------------------------------------------------------------------------- /solutions/0200-0299/0290-word-pattern-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0290-word-pattern-easy.md -------------------------------------------------------------------------------- /solutions/0200-0299/0295-find-median-from-data-stream-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0295-find-median-from-data-stream-hard.md -------------------------------------------------------------------------------- /solutions/0200-0299/0297-serialize-and-deserialize-binary-tree-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0297-serialize-and-deserialize-binary-tree-hard.md -------------------------------------------------------------------------------- /solutions/0200-0299/0298-binary-tree-longest-consecutive-sequence-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0298-binary-tree-longest-consecutive-sequence-medium.md -------------------------------------------------------------------------------- /solutions/0200-0299/0299-bulls-and-cows-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/0299-bulls-and-cows-medium.md -------------------------------------------------------------------------------- /solutions/0200-0299/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0200-0299/_category_.json -------------------------------------------------------------------------------- /solutions/0300-0399/0300-longest-increasing-subsequence-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0300-longest-increasing-subsequence-medium.md -------------------------------------------------------------------------------- /solutions/0300-0399/0307-range-sum-query-mutable-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0307-range-sum-query-mutable-medium.md -------------------------------------------------------------------------------- /solutions/0300-0399/0312-burst-balloons-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0312-burst-balloons-hard.md -------------------------------------------------------------------------------- /solutions/0300-0399/0322-coin-change-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0322-coin-change-medium.md -------------------------------------------------------------------------------- /solutions/0300-0399/0327-count-of-range-sum-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0327-count-of-range-sum-hard.md -------------------------------------------------------------------------------- /solutions/0300-0399/0329-longest-increasing-path-in-a-matrix-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0329-longest-increasing-path-in-a-matrix-hard.md -------------------------------------------------------------------------------- /solutions/0300-0399/0332-reconstruct-itinerary-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0332-reconstruct-itinerary-hard.md -------------------------------------------------------------------------------- /solutions/0300-0399/0334-increasing-triplet-subsequence-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0334-increasing-triplet-subsequence-medium.md -------------------------------------------------------------------------------- /solutions/0300-0399/0338-counting-bits-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0338-counting-bits-easy.md -------------------------------------------------------------------------------- /solutions/0300-0399/0342-power-of-four-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0342-power-of-four-easy.md -------------------------------------------------------------------------------- /solutions/0300-0399/0344-reverse-string-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0344-reverse-string-easy.md -------------------------------------------------------------------------------- /solutions/0300-0399/0345-reverse-vowels-of-a-string-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0345-reverse-vowels-of-a-string-easy.md -------------------------------------------------------------------------------- /solutions/0300-0399/0346-moving-average-from-data-stream-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0346-moving-average-from-data-stream-easy.md -------------------------------------------------------------------------------- /solutions/0300-0399/0347-top-k-frequent-elements-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0347-top-k-frequent-elements-medium.md -------------------------------------------------------------------------------- /solutions/0300-0399/0349-intersection-of-two-arrays-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0349-intersection-of-two-arrays-easy.md -------------------------------------------------------------------------------- /solutions/0300-0399/0350-intersection-of-two-arrays-ii-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0350-intersection-of-two-arrays-ii-easy.md -------------------------------------------------------------------------------- /solutions/0300-0399/0355-design-twitter-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0355-design-twitter-medium.md -------------------------------------------------------------------------------- /solutions/0300-0399/0365-water-and-jug-problem-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0365-water-and-jug-problem-medium.md -------------------------------------------------------------------------------- /solutions/0300-0399/0367-valid-perfect-square-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0367-valid-perfect-square-easy.md -------------------------------------------------------------------------------- /solutions/0300-0399/0374-guess-number-higher-or-lower-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0374-guess-number-higher-or-lower-easy.md -------------------------------------------------------------------------------- /solutions/0300-0399/0377-combination-sum-iv-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0377-combination-sum-iv-medium.md -------------------------------------------------------------------------------- /solutions/0300-0399/0383-ransom-note-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0383-ransom-note-easy.md -------------------------------------------------------------------------------- /solutions/0300-0399/0387-first-unique-character-in-a-string-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0387-first-unique-character-in-a-string-easy.md -------------------------------------------------------------------------------- /solutions/0300-0399/0389-find-the-difference-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0389-find-the-difference-easy.md -------------------------------------------------------------------------------- /solutions/0300-0399/0392-is-subsequence-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0392-is-subsequence-easy.md -------------------------------------------------------------------------------- /solutions/0300-0399/0393-utf-8-validation-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/0393-utf-8-validation-medium.md -------------------------------------------------------------------------------- /solutions/0300-0399/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0300-0399/_category_.json -------------------------------------------------------------------------------- /solutions/0400-0499/0402-remove-k-digits-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0402-remove-k-digits-medium.md -------------------------------------------------------------------------------- /solutions/0400-0499/0403-Frog-Jump.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0403-Frog-Jump.md -------------------------------------------------------------------------------- /solutions/0400-0499/0404-sum-of-left-leaves-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0404-sum-of-left-leaves-easy.md -------------------------------------------------------------------------------- /solutions/0400-0499/0413-arithmetic-slices-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0413-arithmetic-slices-medium.md -------------------------------------------------------------------------------- /solutions/0400-0499/0416-partition-equal-subset-sum-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0416-partition-equal-subset-sum-medium.md -------------------------------------------------------------------------------- /solutions/0400-0499/0417-pacific-atlantic-water-flow-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0417-pacific-atlantic-water-flow-medium.md -------------------------------------------------------------------------------- /solutions/0400-0499/0421-maximum-xor-of-two-numbers-in-an-array.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0421-maximum-xor-of-two-numbers-in-an-array.md -------------------------------------------------------------------------------- /solutions/0400-0499/0424-longest-repeating-character-replacement-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0424-longest-repeating-character-replacement-medium.md -------------------------------------------------------------------------------- /solutions/0400-0499/0429-n-ary-tree-level-order-traversal-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0429-n-ary-tree-level-order-traversal-medium.md -------------------------------------------------------------------------------- /solutions/0400-0499/0433-minimum-genetic-mutation-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0433-minimum-genetic-mutation-medium.md -------------------------------------------------------------------------------- /solutions/0400-0499/0435-non-overlapping-intervals-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0435-non-overlapping-intervals-medium.md -------------------------------------------------------------------------------- /solutions/0400-0499/0437-path-sum-iii-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0437-path-sum-iii-medium.md -------------------------------------------------------------------------------- /solutions/0400-0499/0438-find-all-anagrams-in-a-string-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0438-find-all-anagrams-in-a-string-medium.md -------------------------------------------------------------------------------- /solutions/0400-0499/0441-arranging-coins-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0441-arranging-coins-easy.md -------------------------------------------------------------------------------- /solutions/0400-0499/0443-string-compression-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0443-string-compression-medium.md -------------------------------------------------------------------------------- /solutions/0400-0499/0445-Add-Two-Numbers-II.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0445-Add-Two-Numbers-II.md -------------------------------------------------------------------------------- /solutions/0400-0499/0451-sort-characters-by-frequency-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0451-sort-characters-by-frequency-medium.md -------------------------------------------------------------------------------- /solutions/0400-0499/0452-minimum-number-of-arrows-to-burst-balloons-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0452-minimum-number-of-arrows-to-burst-balloons-medium.md -------------------------------------------------------------------------------- /solutions/0400-0499/0454-4sum-ii-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0454-4sum-ii-medium.md -------------------------------------------------------------------------------- /solutions/0400-0499/0464-can-i-win-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0464-can-i-win-medium.md -------------------------------------------------------------------------------- /solutions/0400-0499/0465-optimal-account-balancing-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0465-optimal-account-balancing-hard.md -------------------------------------------------------------------------------- /solutions/0400-0499/0472-concatenated-words-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0472-concatenated-words-hard.md -------------------------------------------------------------------------------- /solutions/0400-0499/0473-matchsticks-to-square-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0473-matchsticks-to-square-medium.md -------------------------------------------------------------------------------- /solutions/0400-0499/0491-non-decreasing-subsequences-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0491-non-decreasing-subsequences-medium.md -------------------------------------------------------------------------------- /solutions/0400-0499/0493-reverse-pairs-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0493-reverse-pairs-hard.md -------------------------------------------------------------------------------- /solutions/0400-0499/0494-target-sum-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0494-target-sum-medium.md -------------------------------------------------------------------------------- /solutions/0400-0499/0496-next-greater-element-i-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/0496-next-greater-element-i-easy.md -------------------------------------------------------------------------------- /solutions/0400-0499/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0400-0499/_category_.json -------------------------------------------------------------------------------- /solutions/0500-0599/0501-find-mode-in-binary-search-tree-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0500-0599/0501-find-mode-in-binary-search-tree-easy.md -------------------------------------------------------------------------------- /solutions/0500-0599/0508-most-frequent-subtree-sum-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0500-0599/0508-most-frequent-subtree-sum-medium.md -------------------------------------------------------------------------------- /solutions/0500-0599/0518-coin-change-2-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0500-0599/0518-coin-change-2-medium.md -------------------------------------------------------------------------------- /solutions/0500-0599/0520-detect-capital-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0500-0599/0520-detect-capital-easy.md -------------------------------------------------------------------------------- /solutions/0500-0599/0523-continuous-subarray-sum-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0500-0599/0523-continuous-subarray-sum-medium.md -------------------------------------------------------------------------------- /solutions/0500-0599/0525-contiguous-array-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0500-0599/0525-contiguous-array-medium.md -------------------------------------------------------------------------------- /solutions/0500-0599/0532-k-diff-pairs-in-an-array-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0500-0599/0532-k-diff-pairs-in-an-array-medium.md -------------------------------------------------------------------------------- /solutions/0500-0599/0540-single-element-in-a-sorted-array-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0500-0599/0540-single-element-in-a-sorted-array-medium.md -------------------------------------------------------------------------------- /solutions/0500-0599/0542-01-matrix-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0500-0599/0542-01-matrix-medium.md -------------------------------------------------------------------------------- /solutions/0500-0599/0543-diameter-of-binary-tree-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0500-0599/0543-diameter-of-binary-tree-easy.md -------------------------------------------------------------------------------- /solutions/0500-0599/0557-reverse-words-in-a-string-iii-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0500-0599/0557-reverse-words-in-a-string-iii-easy.md -------------------------------------------------------------------------------- /solutions/0500-0599/0559-maximum-depth-of-n-ary-tree-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0500-0599/0559-maximum-depth-of-n-ary-tree-easy.md -------------------------------------------------------------------------------- /solutions/0500-0599/0560-subarray-sum-equals-k-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0500-0599/0560-subarray-sum-equals-k-medium.md -------------------------------------------------------------------------------- /solutions/0500-0599/0567-permutation-in-string-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0500-0599/0567-permutation-in-string-medium.md -------------------------------------------------------------------------------- /solutions/0500-0599/0572-subtree-of-another-tree-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0500-0599/0572-subtree-of-another-tree-easy.md -------------------------------------------------------------------------------- /solutions/0500-0599/0581-shortest-unsorted-continuous-subarray-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0500-0599/0581-shortest-unsorted-continuous-subarray-medium.md -------------------------------------------------------------------------------- /solutions/0500-0599/0589-n-ary-tree-preorder-traversal-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0500-0599/0589-n-ary-tree-preorder-traversal-easy.md -------------------------------------------------------------------------------- /solutions/0500-0599/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0500-0599/_category_.json -------------------------------------------------------------------------------- /solutions/0600-0699/0605-can-place-flowers-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0605-can-place-flowers-easy.md -------------------------------------------------------------------------------- /solutions/0600-0699/0606-construct-string-from-binary-tree-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0606-construct-string-from-binary-tree-easy.md -------------------------------------------------------------------------------- /solutions/0600-0699/0609-find-duplicate-file-in-system-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0609-find-duplicate-file-in-system-medium.md -------------------------------------------------------------------------------- /solutions/0600-0699/0621-task-scheduler-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0621-task-scheduler-medium.md -------------------------------------------------------------------------------- /solutions/0600-0699/0622-design-circular-queue-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0622-design-circular-queue-medium.md -------------------------------------------------------------------------------- /solutions/0600-0699/0623-add-one-row-to-tree-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0623-add-one-row-to-tree-medium.md -------------------------------------------------------------------------------- /solutions/0600-0699/0633-sum-of-square-numbers-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0633-sum-of-square-numbers-medium.md -------------------------------------------------------------------------------- /solutions/0600-0699/0637-average-of-levels-in-binary-tree-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0637-average-of-levels-in-binary-tree-medium.md -------------------------------------------------------------------------------- /solutions/0600-0699/0645-set-mismatch-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0645-set-mismatch-easy.md -------------------------------------------------------------------------------- /solutions/0600-0699/0647-palindromic-substrings-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0647-palindromic-substrings-medium.md -------------------------------------------------------------------------------- /solutions/0600-0699/0650-two-keys-keyboard-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0650-two-keys-keyboard-medium.md -------------------------------------------------------------------------------- /solutions/0600-0699/0653-two-sum-IV-input-is-a-BST-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0653-two-sum-IV-input-is-a-BST-easy.md -------------------------------------------------------------------------------- /solutions/0600-0699/0659-split-array-into-consecutive-subsequences-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0659-split-array-into-consecutive-subsequences-medium.md -------------------------------------------------------------------------------- /solutions/0600-0699/0662-maximum-width-of-binary-tree-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0662-maximum-width-of-binary-tree-medium.md -------------------------------------------------------------------------------- /solutions/0600-0699/0678-valid-parenthesis-string-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0678-valid-parenthesis-string-medium.md -------------------------------------------------------------------------------- /solutions/0600-0699/0680-valid-palindrome-ii-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0680-valid-palindrome-ii-easy.md -------------------------------------------------------------------------------- /solutions/0600-0699/0682-baseball-game-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0682-baseball-game-easy.md -------------------------------------------------------------------------------- /solutions/0600-0699/0684-redundant-connection-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0684-redundant-connection-medium.md -------------------------------------------------------------------------------- /solutions/0600-0699/0692-top-k-frequent-words-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0692-top-k-frequent-words-medium.md -------------------------------------------------------------------------------- /solutions/0600-0699/0695-max-area-of-island-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0695-max-area-of-island-medium.md -------------------------------------------------------------------------------- /solutions/0600-0699/0698-partition-to-k-equal-sum-subsets-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/0698-partition-to-k-equal-sum-subsets-medium.md -------------------------------------------------------------------------------- /solutions/0600-0699/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0600-0699/_category_.json -------------------------------------------------------------------------------- /solutions/0700-0799/0703-kth-largest-element-in-a-stream-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/0703-kth-largest-element-in-a-stream-easy.md -------------------------------------------------------------------------------- /solutions/0700-0799/0704-binary-search-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/0704-binary-search-easy.md -------------------------------------------------------------------------------- /solutions/0700-0799/0706-design-hashmap-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/0706-design-hashmap-medium.md -------------------------------------------------------------------------------- /solutions/0700-0799/0713-subarray-product-less-than-k-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/0713-subarray-product-less-than-k-medium.md -------------------------------------------------------------------------------- /solutions/0700-0799/0718-maximum-length-of-repeated-subarray-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/0718-maximum-length-of-repeated-subarray-medium.md -------------------------------------------------------------------------------- /solutions/0700-0799/0724-find-pivot-index-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/0724-find-pivot-index-easy.md -------------------------------------------------------------------------------- /solutions/0700-0799/0732-my-calendar-iii-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/0732-my-calendar-iii-hard.md -------------------------------------------------------------------------------- /solutions/0700-0799/0733-flood-fill-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/0733-flood-fill-easy.md -------------------------------------------------------------------------------- /solutions/0700-0799/0739-daily-temperatures-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/0739-daily-temperatures-medium.md -------------------------------------------------------------------------------- /solutions/0700-0799/0740-delete-and-earn-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/0740-delete-and-earn-medium.md -------------------------------------------------------------------------------- /solutions/0700-0799/0743-network-delay-time-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/0743-network-delay-time-medium.md -------------------------------------------------------------------------------- /solutions/0700-0799/0744-find-smallest-letter-greater-than-target-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/0744-find-smallest-letter-greater-than-target-easy.md -------------------------------------------------------------------------------- /solutions/0700-0799/0746-min-cost-climbing-stairs-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/0746-min-cost-climbing-stairs-easy.md -------------------------------------------------------------------------------- /solutions/0700-0799/0763-partition-labels-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/0763-partition-labels-medium.md -------------------------------------------------------------------------------- /solutions/0700-0799/0778-swim-in-rising-water-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/0778-swim-in-rising-water-hard.md -------------------------------------------------------------------------------- /solutions/0700-0799/0785-is-graph-bipartite-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/0785-is-graph-bipartite-medium.md -------------------------------------------------------------------------------- /solutions/0700-0799/0787-cheapest-flights-within-k-stops-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/0787-cheapest-flights-within-k-stops-medium.md -------------------------------------------------------------------------------- /solutions/0700-0799/0799-champagne-tower-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/0799-champagne-tower-medium.md -------------------------------------------------------------------------------- /solutions/0700-0799/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0700-0799/_category_.json -------------------------------------------------------------------------------- /solutions/0800-0899/0813-largest-sum-of-averages-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0813-largest-sum-of-averages-medium.md -------------------------------------------------------------------------------- /solutions/0800-0899/0814-binary-tree-pruning-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0814-binary-tree-pruning-medium.md -------------------------------------------------------------------------------- /solutions/0800-0899/0829-consecutive-numbers-sum-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0829-consecutive-numbers-sum-hard.md -------------------------------------------------------------------------------- /solutions/0800-0899/0838-push-dominoes-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0838-push-dominoes-medium.md -------------------------------------------------------------------------------- /solutions/0800-0899/0841-keys-and-rooms-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0841-keys-and-rooms-medium.md -------------------------------------------------------------------------------- /solutions/0800-0899/0844-backspace-string-compare-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0844-backspace-string-compare-easy.md -------------------------------------------------------------------------------- /solutions/0800-0899/0846-hand-of-straights-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0846-hand-of-straights-medium.md -------------------------------------------------------------------------------- /solutions/0800-0899/0847-shortest-path-visiting-all-nodes-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0847-shortest-path-visiting-all-nodes-hard.md -------------------------------------------------------------------------------- /solutions/0800-0899/0852-peak-index-in-a-mountain-array-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0852-peak-index-in-a-mountain-array-easy.md -------------------------------------------------------------------------------- /solutions/0800-0899/0853-car-fleet-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0853-car-fleet-medium.md -------------------------------------------------------------------------------- /solutions/0800-0899/0867-transpose-matrix-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0867-transpose-matrix-easy.md -------------------------------------------------------------------------------- /solutions/0800-0899/0869-reordered-power-of-2-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0869-reordered-power-of-2-medium.md -------------------------------------------------------------------------------- /solutions/0800-0899/0871-minimum-number-of-refueling-stops-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0871-minimum-number-of-refueling-stops-hard.md -------------------------------------------------------------------------------- /solutions/0800-0899/0875-koko-eating-bananas-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0875-koko-eating-bananas-medium.md -------------------------------------------------------------------------------- /solutions/0800-0899/0876-middle-of-the-linked-list-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0876-middle-of-the-linked-list-easy.md -------------------------------------------------------------------------------- /solutions/0800-0899/0877-stone-game-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0877-stone-game-medium.md -------------------------------------------------------------------------------- /solutions/0800-0899/0881-boats-to-save-people-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0881-boats-to-save-people-medium.md -------------------------------------------------------------------------------- /solutions/0800-0899/0896-monotonic-array-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0896-monotonic-array-easy.md -------------------------------------------------------------------------------- /solutions/0800-0899/0899-orderly-queue-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/0899-orderly-queue-hard.md -------------------------------------------------------------------------------- /solutions/0800-0899/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0800-0899/_category_.json -------------------------------------------------------------------------------- /solutions/0900-0999/0901-online-stock-span-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0901-online-stock-span-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0904-fruit-into-baskets-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0904-fruit-into-baskets-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0907-sum-of-subarray-minimums-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0907-sum-of-subarray-minimums-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0909-snakes-and-ladders-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0909-snakes-and-ladders-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0912-sort-an-array-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0912-sort-an-array-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0918-maximum-sum-circular-subarray-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0918-maximum-sum-circular-subarray-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0923-3sum-with-multiplicity-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0923-3sum-with-multiplicity-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0926-flip-string-to-monotone-increasing-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0926-flip-string-to-monotone-increasing-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0935-knight-dialer-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0935-knight-dialer-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0936-stamping-the-sequence-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0936-stamping-the-sequence-hard.md -------------------------------------------------------------------------------- /solutions/0900-0999/0941-valid-mountain-array-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0941-valid-mountain-array-easy.md -------------------------------------------------------------------------------- /solutions/0900-0999/0944-delete-columns-to-make-sorted-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0944-delete-columns-to-make-sorted-easy.md -------------------------------------------------------------------------------- /solutions/0900-0999/0946-validate-stack-sequences-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0946-validate-stack-sequences-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0947-most-stones-removed-with-same-row-or-column-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0947-most-stones-removed-with-same-row-or-column-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0948-bag-of-tokens-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0948-bag-of-tokens-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0952-largest-component-size-by-common-factor-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0952-largest-component-size-by-common-factor-hard.md -------------------------------------------------------------------------------- /solutions/0900-0999/0967-numbers-with-same-consecutive-differences-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0967-numbers-with-same-consecutive-differences-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0973-k-closest-points-to-origin-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0973-k-closest-points-to-origin-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0974-subarray-sums-divisible-by-k-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0974-subarray-sums-divisible-by-k-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0976-largest-perimeter-triangle-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0976-largest-perimeter-triangle-easy.md -------------------------------------------------------------------------------- /solutions/0900-0999/0981-time-based-key-value-store-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0981-time-based-key-value-store-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0985-sum-of-even-numbers-after-queries.medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0985-sum-of-even-numbers-after-queries.medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0987-vertical-order-traversal-of-a-binary-tree-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0987-vertical-order-traversal-of-a-binary-tree-hard.md -------------------------------------------------------------------------------- /solutions/0900-0999/0990-satisfiability-of-equality-equations-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0990-satisfiability-of-equality-equations-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0991-broken-calculator-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0991-broken-calculator-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/0992-subarrays-with-k-different-integers-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0992-subarrays-with-k-different-integers-hard.md -------------------------------------------------------------------------------- /solutions/0900-0999/0994-rotting-oranges-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/0994-rotting-oranges-medium.md -------------------------------------------------------------------------------- /solutions/0900-0999/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/0900-0999/_category_.json -------------------------------------------------------------------------------- /solutions/1000-1099/0997-find-the-town-judge-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1000-1099/0997-find-the-town-judge-easy.md -------------------------------------------------------------------------------- /solutions/1000-1099/1000-minimum-cost-to-merge-stones-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1000-1099/1000-minimum-cost-to-merge-stones-hard.md -------------------------------------------------------------------------------- /solutions/1000-1099/1004-max-consecutive-ones-iii-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1000-1099/1004-max-consecutive-ones-iii-medium.md -------------------------------------------------------------------------------- /solutions/1000-1099/1011-capacity-to-ship-packages-within-d-days-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1000-1099/1011-capacity-to-ship-packages-within-d-days-medium.md -------------------------------------------------------------------------------- /solutions/1000-1099/1019-next-greater-node-in-linked-list.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1000-1099/1019-next-greater-node-in-linked-list.md -------------------------------------------------------------------------------- /solutions/1000-1099/1029-two-city-scheduling-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1000-1099/1029-two-city-scheduling-medium.md -------------------------------------------------------------------------------- /solutions/1000-1099/1043-partition-array-for-maximum-sum-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1000-1099/1043-partition-array-for-maximum-sum-medium.md -------------------------------------------------------------------------------- /solutions/1000-1099/1046-last-stone-weight-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1000-1099/1046-last-stone-weight-easy.md -------------------------------------------------------------------------------- /solutions/1000-1099/1047-remove-all-adjacent-duplicates-in-string-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1000-1099/1047-remove-all-adjacent-duplicates-in-string-easy.md -------------------------------------------------------------------------------- /solutions/1000-1099/1066-campus-bikes-ii-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1000-1099/1066-campus-bikes-ii-medium.md -------------------------------------------------------------------------------- /solutions/1000-1099/1071-greatest-common-divisor-of-strings-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1000-1099/1071-greatest-common-divisor-of-strings-easy.md -------------------------------------------------------------------------------- /solutions/1000-1099/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1000-1099/_category_.json -------------------------------------------------------------------------------- /solutions/1100-1199/1123-lowest-common-ancestor-of-deepest-leaves-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1100-1199/1123-lowest-common-ancestor-of-deepest-leaves-medium.md -------------------------------------------------------------------------------- /solutions/1100-1199/1125-smallest-sufficient-team-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1100-1199/1125-smallest-sufficient-team-hard.md -------------------------------------------------------------------------------- /solutions/1100-1199/1135-connecting-cities-with-minimum-cost-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1100-1199/1135-connecting-cities-with-minimum-cost-medium.md -------------------------------------------------------------------------------- /solutions/1100-1199/1137-n-th-tribonacci-number-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1100-1199/1137-n-th-tribonacci-number-easy.md -------------------------------------------------------------------------------- /solutions/1100-1199/1140-stone-game-ii-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1100-1199/1140-stone-game-ii-medium.md -------------------------------------------------------------------------------- /solutions/1100-1199/1143-longest-common-subsequence-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1100-1199/1143-longest-common-subsequence-medium.md -------------------------------------------------------------------------------- /solutions/1100-1199/1147-longest-chunked-palindrome-decomposition-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1100-1199/1147-longest-chunked-palindrome-decomposition-hard.md -------------------------------------------------------------------------------- /solutions/1100-1199/1154-make-the-string-great-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1100-1199/1154-make-the-string-great-easy.md -------------------------------------------------------------------------------- /solutions/1100-1199/1155-number-of-dice-rolls-with-target-sum-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1100-1199/1155-number-of-dice-rolls-with-target-sum-medium.md -------------------------------------------------------------------------------- /solutions/1100-1199/1162-as-far-from-land-as-possible-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1100-1199/1162-as-far-from-land-as-possible-medium.md -------------------------------------------------------------------------------- /solutions/1100-1199/1168-optimize-water-distribution-in-a-village-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1100-1199/1168-optimize-water-distribution-in-a-village-hard.md -------------------------------------------------------------------------------- /solutions/1100-1199/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1100-1199/_category_.json -------------------------------------------------------------------------------- /solutions/1200-1299/1201-ugly-number-iii-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1200-1299/1201-ugly-number-iii-medium.md -------------------------------------------------------------------------------- /solutions/1200-1299/1202-smallest-string-with-swaps-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1200-1299/1202-smallest-string-with-swaps-medium.md -------------------------------------------------------------------------------- /solutions/1200-1299/1219-path-with-maximum-gold-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1200-1299/1219-path-with-maximum-gold-medium.md -------------------------------------------------------------------------------- /solutions/1200-1299/1232-check-if-it-is-a-straight-line-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1200-1299/1232-check-if-it-is-a-straight-line-easy.md -------------------------------------------------------------------------------- /solutions/1200-1299/1235-maximum-profit-in-job-scheduling-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1200-1299/1235-maximum-profit-in-job-scheduling-hard.md -------------------------------------------------------------------------------- /solutions/1200-1299/1259-handshakes-that-dont-cross-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1200-1299/1259-handshakes-that-dont-cross-hard.md -------------------------------------------------------------------------------- /solutions/1200-1299/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1200-1299/_category_.json -------------------------------------------------------------------------------- /solutions/1300-1399/1305-all-elements-in-two-binary-search-trees-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1300-1399/1305-all-elements-in-two-binary-search-trees-medium.md -------------------------------------------------------------------------------- /solutions/1300-1399/1328-break-a-palindrome-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1300-1399/1328-break-a-palindrome-medium.md -------------------------------------------------------------------------------- /solutions/1300-1399/1329-sort-the-matrix-diagonally-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1300-1399/1329-sort-the-matrix-diagonally-medium.md -------------------------------------------------------------------------------- /solutions/1300-1399/1331-rank-transform-of-an-array-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1300-1399/1331-rank-transform-of-an-array-easy.md -------------------------------------------------------------------------------- /solutions/1300-1399/1335-minimum-difficulty-of-a-job-schedule-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1300-1399/1335-minimum-difficulty-of-a-job-schedule-hard.md -------------------------------------------------------------------------------- /solutions/1300-1399/1337-the-k-weakest-rows-in-a-matrix-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1300-1399/1337-the-k-weakest-rows-in-a-matrix-easy.md -------------------------------------------------------------------------------- /solutions/1300-1399/1346-check-if-n-and-its-double-exist-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1300-1399/1346-check-if-n-and-its-double-exist-easy.md -------------------------------------------------------------------------------- /solutions/1300-1399/1349-maximum-students-taking-exam-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1300-1399/1349-maximum-students-taking-exam-hard.md -------------------------------------------------------------------------------- /solutions/1300-1399/1356-sort-integers-by-the-number-of-1-bits-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1300-1399/1356-sort-integers-by-the-number-of-1-bits-easy.md -------------------------------------------------------------------------------- /solutions/1300-1399/1359-count-all-valid-pickup-and-delivery-options-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1300-1399/1359-count-all-valid-pickup-and-delivery-options-hard.md -------------------------------------------------------------------------------- /solutions/1300-1399/1372-longest-zigzag-path-in-a-binary-tree-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1300-1399/1372-longest-zigzag-path-in-a-binary-tree-medium.md -------------------------------------------------------------------------------- /solutions/1300-1399/1383-maximum-performance-of-a-team-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1300-1399/1383-maximum-performance-of-a-team-hard.md -------------------------------------------------------------------------------- /solutions/1300-1399/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1300-1399/_category_.json -------------------------------------------------------------------------------- /solutions/1400-1499/1431-kids-with-the-greatest-number-of-candies-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1400-1499/1431-kids-with-the-greatest-number-of-candies-easy.md -------------------------------------------------------------------------------- /solutions/1400-1499/1443-minimum-time-to-collect-all-apples-in-a-tree.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1400-1499/1443-minimum-time-to-collect-all-apples-in-a-tree.md -------------------------------------------------------------------------------- /solutions/1400-1499/1448-count-good-nodes-in-binary-tree-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1400-1499/1448-count-good-nodes-in-binary-tree-medium.md -------------------------------------------------------------------------------- /solutions/1400-1499/1457-pseudo-palindromic-paths-in-a-binary-tree-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1400-1499/1457-pseudo-palindromic-paths-in-a-binary-tree-medium.md -------------------------------------------------------------------------------- /solutions/1400-1499/1460-make-two-arrays-equal-by-reversing-subarrays-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1400-1499/1460-make-two-arrays-equal-by-reversing-subarrays-easy.md -------------------------------------------------------------------------------- /solutions/1400-1499/1464-maximum-product-of-two-elements-in-an-array-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1400-1499/1464-maximum-product-of-two-elements-in-an-array-easy.md -------------------------------------------------------------------------------- /solutions/1400-1499/1470-shuffle-the-array-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1400-1499/1470-shuffle-the-array-easy.md -------------------------------------------------------------------------------- /solutions/1400-1499/1480-running-sum-of-1d-array-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1400-1499/1480-running-sum-of-1d-array-easy.md -------------------------------------------------------------------------------- /solutions/1400-1499/1482-minimum-number-of-days-to-make-m-bouquets-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1400-1499/1482-minimum-number-of-days-to-make-m-bouquets-medium.md -------------------------------------------------------------------------------- /solutions/1400-1499/1494-parallel-courses-ii-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1400-1499/1494-parallel-courses-ii-hard.md -------------------------------------------------------------------------------- /solutions/1400-1499/1496-path-crossing-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1400-1499/1496-path-crossing-easy.md -------------------------------------------------------------------------------- /solutions/1400-1499/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1400-1499/_category_.json -------------------------------------------------------------------------------- /solutions/1500-1599/1502-can-make-arithmetic-progression-from-sequence-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1500-1599/1502-can-make-arithmetic-progression-from-sequence-easy.md -------------------------------------------------------------------------------- /solutions/1500-1599/1510-stone-game-iv-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1500-1599/1510-stone-game-iv-hard.md -------------------------------------------------------------------------------- /solutions/1500-1599/1514-path-with-maximum-probability.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1500-1599/1514-path-with-maximum-probability.md -------------------------------------------------------------------------------- /solutions/1500-1599/1523-count-odd-numbers-in-an-interval-range-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1500-1599/1523-count-odd-numbers-in-an-interval-range-easy.md -------------------------------------------------------------------------------- /solutions/1500-1599/1531-string-compression-ii-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1500-1599/1531-string-compression-ii-hard.md -------------------------------------------------------------------------------- /solutions/1500-1599/1539-kth-missing-positive-number-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1500-1599/1539-kth-missing-positive-number-easy.md -------------------------------------------------------------------------------- /solutions/1500-1599/1544-make-the-string-great-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1500-1599/1544-make-the-string-great-easy.md -------------------------------------------------------------------------------- /solutions/1500-1599/1547-minimum-cost-to-cut-a-stick-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1500-1599/1547-minimum-cost-to-cut-a-stick-hard.md -------------------------------------------------------------------------------- /solutions/1500-1599/1550-three-consecutive-odds-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1500-1599/1550-three-consecutive-odds-easy.md -------------------------------------------------------------------------------- /solutions/1500-1599/1572-matrix-diagonal-sum-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1500-1599/1572-matrix-diagonal-sum-easy.md -------------------------------------------------------------------------------- /solutions/1500-1599/1575-count-all-possible-routes-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1500-1599/1575-count-all-possible-routes-hard.md -------------------------------------------------------------------------------- /solutions/1500-1599/1578-minimum-time-to-make-rope-colorful-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1500-1599/1578-minimum-time-to-make-rope-colorful-medium.md -------------------------------------------------------------------------------- /solutions/1500-1599/1584-min-cost-to-connect-all-points-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1500-1599/1584-min-cost-to-connect-all-points-medium.md -------------------------------------------------------------------------------- /solutions/1500-1599/1588-sum-of-all-odd-length-subarrays-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1500-1599/1588-sum-of-all-odd-length-subarrays-easy.md -------------------------------------------------------------------------------- /solutions/1500-1599/1590-make_sum_divisible_by_p-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1500-1599/1590-make_sum_divisible_by_p-medium.md -------------------------------------------------------------------------------- /solutions/1500-1599/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1500-1599/_category_.json -------------------------------------------------------------------------------- /solutions/1600-1699/1626-best-team-with-no-conflicts-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1600-1699/1626-best-team-with-no-conflicts-medium.md -------------------------------------------------------------------------------- /solutions/1600-1699/1630-arithmetic-subarrays-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1600-1699/1630-arithmetic-subarrays-medium.md -------------------------------------------------------------------------------- /solutions/1600-1699/1631-path-with-minimum-effort-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1600-1699/1631-path-with-minimum-effort-medium.md -------------------------------------------------------------------------------- /solutions/1600-1699/1633-smallest-string-with-a-given-numeric-value-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1600-1699/1633-smallest-string-with-a-given-numeric-value-medium.md -------------------------------------------------------------------------------- /solutions/1600-1699/1655-distribute-repeating-integers-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1600-1699/1655-distribute-repeating-integers-hard.md -------------------------------------------------------------------------------- /solutions/1600-1699/1657-define-if-two-strings-are-close-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1600-1699/1657-define-if-two-strings-are-close-medium.md -------------------------------------------------------------------------------- /solutions/1600-1699/1662-check-if-two-string-arrays-are-equivalent-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1600-1699/1662-check-if-two-string-arrays-are-equivalent-easy.md -------------------------------------------------------------------------------- /solutions/1600-1699/1664-ways-to-make-a-fair-array-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1600-1699/1664-ways-to-make-a-fair-array-medium.md -------------------------------------------------------------------------------- /solutions/1600-1699/1672-richest-customer-wealth-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1600-1699/1672-richest-customer-wealth-easy.md -------------------------------------------------------------------------------- /solutions/1600-1699/1675-minimize-deviation-in-array-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1600-1699/1675-minimize-deviation-in-array-hard.md -------------------------------------------------------------------------------- /solutions/1600-1699/1679-max-number-of-k-sum-pairs-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1600-1699/1679-max-number-of-k-sum-pairs-medium.md -------------------------------------------------------------------------------- /solutions/1600-1699/1680-concatenation-of-consecutive-binary-numbers-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1600-1699/1680-concatenation-of-consecutive-binary-numbers-medium.md -------------------------------------------------------------------------------- /solutions/1600-1699/1692-count-ways-to-distribute-candies-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1600-1699/1692-count-ways-to-distribute-candies-hard.md -------------------------------------------------------------------------------- /solutions/1600-1699/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1600-1699/_category_.json -------------------------------------------------------------------------------- /solutions/1700-1799/1704-determine-if-string-halves-are-alike-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1700-1799/1704-determine-if-string-halves-are-alike-easy.md -------------------------------------------------------------------------------- /solutions/1700-1799/1706-where-will-the-ball-fall-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1700-1799/1706-where-will-the-ball-fall-medium.md -------------------------------------------------------------------------------- /solutions/1700-1799/1727-largest-submatrix-with-rearrangements-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1700-1799/1727-largest-submatrix-with-rearrangements-medium.md -------------------------------------------------------------------------------- /solutions/1700-1799/1748-sum-of-unique-elements-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1700-1799/1748-sum-of-unique-elements-easy.md -------------------------------------------------------------------------------- /solutions/1700-1799/1762-buildings-with-an-ocean-view-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1700-1799/1762-buildings-with-an-ocean-view-medium.md -------------------------------------------------------------------------------- /solutions/1700-1799/1768-merge-strings-alternately-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1700-1799/1768-merge-strings-alternately-easy.md -------------------------------------------------------------------------------- /solutions/1700-1799/1791-find-center-of-star-graph-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1700-1799/1791-find-center-of-star-graph-easy.md -------------------------------------------------------------------------------- /solutions/1700-1799/1793-maximum-score-of-a-good-subarray-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1700-1799/1793-maximum-score-of-a-good-subarray-hard.md -------------------------------------------------------------------------------- /solutions/1700-1799/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1700-1799/_category_.json -------------------------------------------------------------------------------- /solutions/1800-1899/1800-maximum-ascending-subarray-sum-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1800-1899/1800-maximum-ascending-subarray-sum-easy.md -------------------------------------------------------------------------------- /solutions/1800-1899/1822-sign-of-the-product-of-an-array-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1800-1899/1822-sign-of-the-product-of-an-array-easy.md -------------------------------------------------------------------------------- /solutions/1800-1899/1823-find-the-winner-of-the-circular-game-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1800-1899/1823-find-the-winner-of-the-circular-game-medium.md -------------------------------------------------------------------------------- /solutions/1800-1899/1833-maximum-ice-cream-bars-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1800-1899/1833-maximum-ice-cream-bars-medium.md -------------------------------------------------------------------------------- /solutions/1800-1899/1851-minimum-interval-to-include-each-query-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1800-1899/1851-minimum-interval-to-include-each-query-hard.md -------------------------------------------------------------------------------- /solutions/1800-1899/1852-distinct-numbers-in-each-subarray-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1800-1899/1852-distinct-numbers-in-each-subarray-medium.md -------------------------------------------------------------------------------- /solutions/1800-1899/1854-maximum-population-year-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1800-1899/1854-maximum-population-year-easy.md -------------------------------------------------------------------------------- /solutions/1800-1899/1855-maximum-distance-between-a-pair-of-values-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1800-1899/1855-maximum-distance-between-a-pair-of-values-medium.md -------------------------------------------------------------------------------- /solutions/1800-1899/1859-sorting-the-sentence-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1800-1899/1859-sorting-the-sentence-easy.md -------------------------------------------------------------------------------- /solutions/1800-1899/1863-sum-of-all-subset-xor-totals-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1800-1899/1863-sum-of-all-subset-xor-totals-easy.md -------------------------------------------------------------------------------- /solutions/1800-1899/1899-merge-triplets-to-form-target-triplet-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1800-1899/1899-merge-triplets-to-form-target-triplet-medium.md -------------------------------------------------------------------------------- /solutions/1800-1899/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1800-1899/_category_.json -------------------------------------------------------------------------------- /solutions/1900-1999/1903-largest-odd-number-in-string-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1900-1999/1903-largest-odd-number-in-string-easy.md -------------------------------------------------------------------------------- /solutions/1900-1999/1913-maximum-product-difference-between-two-pairs-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1900-1999/1913-maximum-product-difference-between-two-pairs-easy.md -------------------------------------------------------------------------------- /solutions/1900-1999/1916-count-ways-to-build-rooms-in-an-ant-colony.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1900-1999/1916-count-ways-to-build-rooms-in-an-ant-colony.md -------------------------------------------------------------------------------- /solutions/1900-1999/1922-count-good-numbers-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1900-1999/1922-count-good-numbers-medium.md -------------------------------------------------------------------------------- /solutions/1900-1999/1926-nearest-exit-from-entrance-in-maze-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1900-1999/1926-nearest-exit-from-entrance-in-maze-medium.md -------------------------------------------------------------------------------- /solutions/1900-1999/1929-concatenation-of-array-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1900-1999/1929-concatenation-of-array-easy.md -------------------------------------------------------------------------------- /solutions/1900-1999/1980-find-unique-binary-string-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1900-1999/1980-find-unique-binary-string-medium.md -------------------------------------------------------------------------------- /solutions/1900-1999/1992-find-all-groups-of-farmland-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1900-1999/1992-find-all-groups-of-farmland-medium.md -------------------------------------------------------------------------------- /solutions/1900-1999/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/1900-1999/_category_.json -------------------------------------------------------------------------------- /solutions/2000-2099/2007-find-original-array-from-doubled-array-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2000-2099/2007-find-original-array-from-doubled-array-medium.md -------------------------------------------------------------------------------- /solutions/2000-2099/2013-detect-squares-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2000-2099/2013-detect-squares-medium.md -------------------------------------------------------------------------------- /solutions/2000-2099/2017-grid-game-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2000-2099/2017-grid-game-medium.md -------------------------------------------------------------------------------- /solutions/2000-2099/2032-two-out-of-three-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2000-2099/2032-two-out-of-three-easy.md -------------------------------------------------------------------------------- /solutions/2000-2099/2050-parallel-courses-iii-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2000-2099/2050-parallel-courses-iii-hard.md -------------------------------------------------------------------------------- /solutions/2000-2099/2075-decode-the-slanted-ciphertext-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2000-2099/2075-decode-the-slanted-ciphertext-medium.md -------------------------------------------------------------------------------- /solutions/2000-2099/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2000-2099/_category_.json -------------------------------------------------------------------------------- /solutions/2100-2199/2104-solving-questions-with-brainpower-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2104-solving-questions-with-brainpower-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2108-find-first-palindromic-string-in-the-array-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2108-find-first-palindromic-string-in-the-array-easy.md -------------------------------------------------------------------------------- /solutions/2100-2199/2109-adding-spaces-to-a-string-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2109-adding-spaces-to-a-string-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2119-a-number-after-a-double-reversal-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2119-a-number-after-a-double-reversal-easy.md -------------------------------------------------------------------------------- /solutions/2100-2199/2121-intervals-between-identical-elements-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2121-intervals-between-identical-elements-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2122-recover-the-original-array-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2122-recover-the-original-array-hard.md -------------------------------------------------------------------------------- /solutions/2100-2199/2145-count-the-hidden-sequences-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2145-count-the-hidden-sequences-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2147-number-of-ways-to-divide-a-long-corridor-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2147-number-of-ways-to-divide-a-long-corridor-hard.md -------------------------------------------------------------------------------- /solutions/2100-2199/2149-rearrange-array-elements-by-sign-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2149-rearrange-array-elements-by-sign-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2150-find-all-lonely-numbers-in-the-array-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2150-find-all-lonely-numbers-in-the-array-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2151-maximum-good-people-based-on-statements-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2151-maximum-good-people-based-on-statements-hard.md -------------------------------------------------------------------------------- /solutions/2100-2199/2154-keep-multiplying-found-values-by-two-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2154-keep-multiplying-found-values-by-two-easy.md -------------------------------------------------------------------------------- /solutions/2100-2199/2156-find-substring-with-given-hash-value-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2156-find-substring-with-given-hash-value-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2161-partition-array-according-to-given-pivot-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2161-partition-array-according-to-given-pivot-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2162-minimum-cost-to-set-cooking-time-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2162-minimum-cost-to-set-cooking-time-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2164-sort-even-and-odd-indices-independently-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2164-sort-even-and-odd-indices-independently-easy.md -------------------------------------------------------------------------------- /solutions/2100-2199/2165-smallest-value-of-the-rearranged-number-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2165-smallest-value-of-the-rearranged-number-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2166-design-bitset-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2166-design-bitset-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2169-count-operations-to-obtain-zero-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2169-count-operations-to-obtain-zero-easy.md -------------------------------------------------------------------------------- /solutions/2100-2199/2171-removing-minimum-number-of-magic-beans-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2171-removing-minimum-number-of-magic-beans-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2172-maximum-and-sum-of-array-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2172-maximum-and-sum-of-array-hard.md -------------------------------------------------------------------------------- /solutions/2100-2199/2178-maximum-split-of-positive-even-integers-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2178-maximum-split-of-positive-even-integers-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2179-count-good-triplets-in-an-array-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2179-count-good-triplets-in-an-array-hard.md -------------------------------------------------------------------------------- /solutions/2100-2199/2180-count-integers-with-even-digit-sum-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2180-count-integers-with-even-digit-sum-easy.md -------------------------------------------------------------------------------- /solutions/2100-2199/2181-merge-nodes-in-between-zeros-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2181-merge-nodes-in-between-zeros-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2182-construct-string-with-repeat-limit-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2182-construct-string-with-repeat-limit-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2183-count-array-pairs-divisible-by-k-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2183-count-array-pairs-divisible-by-k-hard.md -------------------------------------------------------------------------------- /solutions/2100-2199/2185-counting-words-with-a-given-prefix-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2185-counting-words-with-a-given-prefix-easy.md -------------------------------------------------------------------------------- /solutions/2100-2199/2187-minimum-time-to-complete-trips-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2187-minimum-time-to-complete-trips-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2188-minimum-time-to-finish-the-race-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2188-minimum-time-to-finish-the-race-hard.md -------------------------------------------------------------------------------- /solutions/2100-2199/2191-sort-the-jumbled-numbers-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2191-sort-the-jumbled-numbers-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2193-minimum-number-of-moves-to-make-palindrome-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2193-minimum-number-of-moves-to-make-palindrome-hard.md -------------------------------------------------------------------------------- /solutions/2100-2199/2194-cells-in-a-range-on-an-excel-sheet-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2194-cells-in-a-range-on-an-excel-sheet-easy.md -------------------------------------------------------------------------------- /solutions/2100-2199/2195-append-k-integers-with-minimal-sum-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2195-append-k-integers-with-minimal-sum-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2196-create-binary-tree-from-descriptions-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2196-create-binary-tree-from-descriptions-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2197-replace-non-coprime-numbers-in-array-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2197-replace-non-coprime-numbers-in-array-hard.md -------------------------------------------------------------------------------- /solutions/2100-2199/2200-find-all-k-distant-indices-in-an-array-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2200-find-all-k-distant-indices-in-an-array-easy.md -------------------------------------------------------------------------------- /solutions/2100-2199/2201-count-artifacts-that-can-be-extracted-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2201-count-artifacts-that-can-be-extracted-medium.md -------------------------------------------------------------------------------- /solutions/2100-2199/2206-divide-array-into-equal-pairs-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/2206-divide-array-into-equal-pairs-easy.md -------------------------------------------------------------------------------- /solutions/2100-2199/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2100-2199/_category_.json -------------------------------------------------------------------------------- /solutions/2200-2299/2208-minimum-operations-to-halve-array-sum-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2208-minimum-operations-to-halve-array-sum-easy.md -------------------------------------------------------------------------------- /solutions/2200-2299/2214-minimum-health-to-beat-game-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2214-minimum-health-to-beat-game-medium.md -------------------------------------------------------------------------------- /solutions/2200-2299/2215-find-the-difference-of-two-arrays-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2215-find-the-difference-of-two-arrays-easy.md -------------------------------------------------------------------------------- /solutions/2200-2299/2217-find-palindrome-with-fixed-length-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2217-find-palindrome-with-fixed-length-medium.md -------------------------------------------------------------------------------- /solutions/2200-2299/2218-maximum-value-of-k-coins-from-piles-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2218-maximum-value-of-k-coins-from-piles-hard.md -------------------------------------------------------------------------------- /solutions/2200-2299/2223-sum-of-scores-of-built-strings-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2223-sum-of-scores-of-built-strings-hard.md -------------------------------------------------------------------------------- /solutions/2200-2299/2225-find-players-with-zero-or-one-losses-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2225-find-players-with-zero-or-one-losses-medium.md -------------------------------------------------------------------------------- /solutions/2200-2299/2226-maximum-candies-allocated-to-k-children-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2226-maximum-candies-allocated-to-k-children-medium.md -------------------------------------------------------------------------------- /solutions/2200-2299/2227-encrypt-and-decrypt-strings-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2227-encrypt-and-decrypt-strings-hard.md -------------------------------------------------------------------------------- /solutions/2200-2299/2229-check-if-an-array-is-consecutive-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2229-check-if-an-array-is-consecutive-easy.md -------------------------------------------------------------------------------- /solutions/2200-2299/2231-largest-number-after-digit-swaps-by-parity-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2231-largest-number-after-digit-swaps-by-parity-easy.md -------------------------------------------------------------------------------- /solutions/2200-2299/2233-maximum-product-after-k-increments-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2233-maximum-product-after-k-increments-medium.md -------------------------------------------------------------------------------- /solutions/2200-2299/2235-add-two-integers-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2235-add-two-integers-easy.md -------------------------------------------------------------------------------- /solutions/2200-2299/2239-find-closest-number-to-zero-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2239-find-closest-number-to-zero-easy.md -------------------------------------------------------------------------------- /solutions/2200-2299/2240-number-of-ways-to-buy-pens-and-pencils-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2240-number-of-ways-to-buy-pens-and-pencils-medium.md -------------------------------------------------------------------------------- /solutions/2200-2299/2241-design-an-atm-machine-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2241-design-an-atm-machine-medium.md -------------------------------------------------------------------------------- /solutions/2200-2299/2242-maximum-score-of-a-node-sequence-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2242-maximum-score-of-a-node-sequence-hard.md -------------------------------------------------------------------------------- /solutions/2200-2299/2243-calculate-digit-sum-of-a-string-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2243-calculate-digit-sum-of-a-string-easy.md -------------------------------------------------------------------------------- /solutions/2200-2299/2244-minimum-rounds-to-complete-all-tasks-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2244-minimum-rounds-to-complete-all-tasks-medium.md -------------------------------------------------------------------------------- /solutions/2200-2299/2248-intersection-of-multiple-arrays-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2248-intersection-of-multiple-arrays-easy.md -------------------------------------------------------------------------------- /solutions/2200-2299/2249-count-lattice-points-inside-a-circle-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2249-count-lattice-points-inside-a-circle-medium.md -------------------------------------------------------------------------------- /solutions/2200-2299/2251-number-of-flowers-in-full-bloom-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2251-number-of-flowers-in-full-bloom-hard.md -------------------------------------------------------------------------------- /solutions/2200-2299/2255-count-prefixes-of-a-given-string-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2255-count-prefixes-of-a-given-string-easy.md -------------------------------------------------------------------------------- /solutions/2200-2299/2256-minimum-average-difference-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2256-minimum-average-difference-medium.md -------------------------------------------------------------------------------- /solutions/2200-2299/2260-minimum-consecutive-cards-to-pick-up-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2260-minimum-consecutive-cards-to-pick-up-medium.md -------------------------------------------------------------------------------- /solutions/2200-2299/2261-k-divisible-elements-subarrays-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2261-k-divisible-elements-subarrays-medium.md -------------------------------------------------------------------------------- /solutions/2200-2299/2262-total-appeal-of-a-string-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2262-total-appeal-of-a-string-hard.md -------------------------------------------------------------------------------- /solutions/2200-2299/2264-largest-3-same-digit-number-in-string-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2264-largest-3-same-digit-number-in-string-easy.md -------------------------------------------------------------------------------- /solutions/2200-2299/2265-count-nodes-equal-to-average-of-subtree-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2265-count-nodes-equal-to-average-of-subtree-medium.md -------------------------------------------------------------------------------- /solutions/2200-2299/2266-count-number-of-texts-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2266-count-number-of-texts-medium.md -------------------------------------------------------------------------------- /solutions/2200-2299/2276-count-integers-in-intervals-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2276-count-integers-in-intervals-hard.md -------------------------------------------------------------------------------- /solutions/2200-2299/2278-percentage-of-letter-in-string.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2278-percentage-of-letter-in-string.md -------------------------------------------------------------------------------- /solutions/2200-2299/2279-maximum-bags-with-full-capacity-of-rock-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2279-maximum-bags-with-full-capacity-of-rock-medium.md -------------------------------------------------------------------------------- /solutions/2200-2299/2280-minimum-lines-to-represent-a-line-chart-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/2280-minimum-lines-to-represent-a-line-chart-medium.md -------------------------------------------------------------------------------- /solutions/2200-2299/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2200-2299/_category_.json -------------------------------------------------------------------------------- /solutions/2300-2399/2300-successful-pairs-of-spells-and-potions-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2300-successful-pairs-of-spells-and-potions-medium.md -------------------------------------------------------------------------------- /solutions/2300-2399/2302-count-subarrays-with-score-less-than-k.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2302-count-subarrays-with-score-less-than-k.md -------------------------------------------------------------------------------- /solutions/2300-2399/2331-evaluate-boolean-binary-tree-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2331-evaluate-boolean-binary-tree-easy.md -------------------------------------------------------------------------------- /solutions/2300-2399/2332-the-latest-time-to-catch-a-bus-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2332-the-latest-time-to-catch-a-bus-medium.md -------------------------------------------------------------------------------- /solutions/2300-2399/2333-minimum-sum-of-squared-difference-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2333-minimum-sum-of-squared-difference-medium.md -------------------------------------------------------------------------------- /solutions/2300-2399/2335-minimum-amount-of-time-to-fill-cups-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2335-minimum-amount-of-time-to-fill-cups-easy.md -------------------------------------------------------------------------------- /solutions/2300-2399/2336-smallest-number-in-infinite-set-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2336-smallest-number-in-infinite-set-medium.md -------------------------------------------------------------------------------- /solutions/2300-2399/2337-move-pieces-to-obtain-a-string-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2337-move-pieces-to-obtain-a-string-medium.md -------------------------------------------------------------------------------- /solutions/2300-2399/2338-count-the-number-of-ideal-arrays-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2338-count-the-number-of-ideal-arrays-hard.md -------------------------------------------------------------------------------- /solutions/2300-2399/2351-first-letter-to-appear-twice-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2351-first-letter-to-appear-twice-easy.md -------------------------------------------------------------------------------- /solutions/2300-2399/2352-equal-row-and-column-pairs-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2352-equal-row-and-column-pairs-medium.md -------------------------------------------------------------------------------- /solutions/2300-2399/2353-design-a-food-rating-system-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2353-design-a-food-rating-system-medium.md -------------------------------------------------------------------------------- /solutions/2300-2399/2354-number-of-excellent-pairs-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2354-number-of-excellent-pairs-hard.md -------------------------------------------------------------------------------- /solutions/2300-2399/2359-find-closest-node-to-given-two-nodes-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2359-find-closest-node-to-given-two-nodes-medium.md -------------------------------------------------------------------------------- /solutions/2300-2399/2360-longest-cycle-in-a-graph-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2360-longest-cycle-in-a-graph-hard.md -------------------------------------------------------------------------------- /solutions/2300-2399/2373-largest-local-values-in-a-matrix-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2373-largest-local-values-in-a-matrix-easy.md -------------------------------------------------------------------------------- /solutions/2300-2399/2376-count-special-integers-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2376-count-special-integers-hard.md -------------------------------------------------------------------------------- /solutions/2300-2399/2380-time-needed-to-rearrange-a-binary-string-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2380-time-needed-to-rearrange-a-binary-string-medium.md -------------------------------------------------------------------------------- /solutions/2300-2399/2381-shifting-letters-ii-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2381-shifting-letters-ii-medium.md -------------------------------------------------------------------------------- /solutions/2300-2399/2384-largest-palindromic-number-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2384-largest-palindromic-number-medium.md -------------------------------------------------------------------------------- /solutions/2300-2399/2392-build-a-matrix-with-conditions-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/2392-build-a-matrix-with-conditions-hard.md -------------------------------------------------------------------------------- /solutions/2300-2399/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2300-2399/_category_.json -------------------------------------------------------------------------------- /solutions/2400-2499/2401-longest-nice-subarray-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2400-2499/2401-longest-nice-subarray-medium.md -------------------------------------------------------------------------------- /solutions/2400-2499/2404-most-frequent-even-element-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2400-2499/2404-most-frequent-even-element-easy.md -------------------------------------------------------------------------------- /solutions/2400-2499/2405-optimal-partition-of-string-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2400-2499/2405-optimal-partition-of-string-medium.md -------------------------------------------------------------------------------- /solutions/2400-2499/2413-smallest-even-multiple-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2400-2499/2413-smallest-even-multiple-easy.md -------------------------------------------------------------------------------- /solutions/2400-2499/2418-sort-the-people-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2400-2499/2418-sort-the-people-easy.md -------------------------------------------------------------------------------- /solutions/2400-2499/2420-find-all-good-indices-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2400-2499/2420-find-all-good-indices-medium.md -------------------------------------------------------------------------------- /solutions/2400-2499/2421-number-of-good-paths-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2400-2499/2421-number-of-good-paths-hard.md -------------------------------------------------------------------------------- /solutions/2400-2499/2425-bitwise-xor-of-all-pairs-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2400-2499/2425-bitwise-xor-of-all-pairs-medium.md -------------------------------------------------------------------------------- /solutions/2400-2499/2433-find-the-original-array-of-prefix-xor-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2400-2499/2433-find-the-original-array-of-prefix-xor-medium.md -------------------------------------------------------------------------------- /solutions/2400-2499/2439-minimize-maximum-of-array-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2400-2499/2439-minimize-maximum-of-array-medium.md -------------------------------------------------------------------------------- /solutions/2400-2499/2445-number-of-nodes-with-value-one-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2400-2499/2445-number-of-nodes-with-value-one-medium.md -------------------------------------------------------------------------------- /solutions/2400-2499/2469-convert-the-temperature-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2400-2499/2469-convert-the-temperature-easy.md -------------------------------------------------------------------------------- /solutions/2400-2499/2485-find-the-pivot-integer-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2400-2499/2485-find-the-pivot-integer-easy.md -------------------------------------------------------------------------------- /solutions/2400-2499/2487-remove-nodes-from-linked-list-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2400-2499/2487-remove-nodes-from-linked-list-medium.md -------------------------------------------------------------------------------- /solutions/2400-2499/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2400-2499/_category_.json -------------------------------------------------------------------------------- /solutions/2500-2599/2501-longest-square-streak-in-an-array-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2500-2599/2501-longest-square-streak-in-an-array-medium.md -------------------------------------------------------------------------------- /solutions/2500-2599/2520-count-the-digits-that-divide-a-number-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2500-2599/2520-count-the-digits-that-divide-a-number-easy.md -------------------------------------------------------------------------------- /solutions/2500-2599/2523-closest-prime-numbers-in-range-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2500-2599/2523-closest-prime-numbers-in-range-medium.md -------------------------------------------------------------------------------- /solutions/2500-2599/2531-make-number-of-distinct-characters-equal-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2500-2599/2531-make-number-of-distinct-characters-equal-medium.md -------------------------------------------------------------------------------- /solutions/2500-2599/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2500-2599/_category_.json -------------------------------------------------------------------------------- /solutions/2600-2699/2614-prime-in-diagonal-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2600-2699/2614-prime-in-diagonal-easy.md -------------------------------------------------------------------------------- /solutions/2600-2699/2615-sum-of-distances-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2600-2699/2615-sum-of-distances-medium.md -------------------------------------------------------------------------------- /solutions/2600-2699/2616-minimize-the-maximum-difference-of-pairs-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2600-2699/2616-minimize-the-maximum-difference-of-pairs-medium.md -------------------------------------------------------------------------------- /solutions/2600-2699/2639-find-the-width-of-columns-of-a-grid-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2600-2699/2639-find-the-width-of-columns-of-a-grid-easy.md -------------------------------------------------------------------------------- /solutions/2600-2699/2644-find-the-maximum-divisibility-score-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2600-2699/2644-find-the-maximum-divisibility-score-easy.md -------------------------------------------------------------------------------- /solutions/2600-2699/2678-number-of-senior-citizens-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2600-2699/2678-number-of-senior-citizens-easy.md -------------------------------------------------------------------------------- /solutions/2600-2699/2679-sum-in-a-matrix-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2600-2699/2679-sum-in-a-matrix-medium.md -------------------------------------------------------------------------------- /solutions/2600-2699/2680-maximum-or-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2600-2699/2680-maximum-or-medium.md -------------------------------------------------------------------------------- /solutions/2600-2699/2681-power-of-heroes-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2600-2699/2681-power-of-heroes-hard.md -------------------------------------------------------------------------------- /solutions/2600-2699/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2600-2699/_category_.json -------------------------------------------------------------------------------- /solutions/2700-2799/2709-greatest-common-divisor-traversal-hard.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2700-2799/2709-greatest-common-divisor-traversal-hard.md -------------------------------------------------------------------------------- /solutions/2700-2799/2750-ways-to-split-array-into-good-subarrays-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2700-2799/2750-ways-to-split-array-into-good-subarrays-medium.md -------------------------------------------------------------------------------- /solutions/2700-2799/2761-prime-pairs-with-target-sum-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2700-2799/2761-prime-pairs-with-target-sum-medium.md -------------------------------------------------------------------------------- /solutions/2700-2799/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2700-2799/_category_.json -------------------------------------------------------------------------------- /solutions/2800-2899/2810-faulty-keyboard-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2800-2899/2810-faulty-keyboard-easy.md -------------------------------------------------------------------------------- /solutions/2800-2899/2811-check-if-it-is-possible-to-split-array-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2800-2899/2811-check-if-it-is-possible-to-split-array-medium.md -------------------------------------------------------------------------------- /solutions/2800-2899/2815-max-pair-sum-in-an-array-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2800-2899/2815-max-pair-sum-in-an-array-easy.md -------------------------------------------------------------------------------- /solutions/2800-2899/2841-maximum-sum-of-almost-unique-subarray-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2800-2899/2841-maximum-sum-of-almost-unique-subarray-medium.md -------------------------------------------------------------------------------- /solutions/2800-2899/2843-count-symmetric-integers-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2800-2899/2843-count-symmetric-integers-easy.md -------------------------------------------------------------------------------- /solutions/2800-2899/2859-sum-of-values-at-indices-with-k-set-bits-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2800-2899/2859-sum-of-values-at-indices-with-k-set-bits-easy.md -------------------------------------------------------------------------------- /solutions/2800-2899/2864-maximum-odd-binary-number-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2800-2899/2864-maximum-odd-binary-number-easy.md -------------------------------------------------------------------------------- /solutions/2800-2899/2873-maximum-value-of-an-ordered-triplet-i-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2800-2899/2873-maximum-value-of-an-ordered-triplet-i-easy.md -------------------------------------------------------------------------------- /solutions/2800-2899/2873-maximum-value-of-an-ordered-triplet-ii-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2800-2899/2873-maximum-value-of-an-ordered-triplet-ii-medium.md -------------------------------------------------------------------------------- /solutions/2800-2899/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2800-2899/_category_.json -------------------------------------------------------------------------------- /solutions/2900-2999/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/2900-2999/_category_.json -------------------------------------------------------------------------------- /solutions/3000-3099/3005-count-elements-with-maximum-frequency-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/3000-3099/3005-count-elements-with-maximum-frequency-easy.md -------------------------------------------------------------------------------- /solutions/3000-3099/3033-modify-the-matrix-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/3000-3099/3033-modify-the-matrix-easy.md -------------------------------------------------------------------------------- /solutions/3000-3099/3035-maximum-palindromes-after-operations-medium.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/3000-3099/3035-maximum-palindromes-after-operations-medium.md -------------------------------------------------------------------------------- /solutions/3000-3099/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/3000-3099/_category_.json -------------------------------------------------------------------------------- /solutions/3100-3199/3142-check-if-grid-satisfies-conditions-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/3100-3199/3142-check-if-grid-satisfies-conditions-easy.md -------------------------------------------------------------------------------- /solutions/3100-3199/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/3100-3199/_category_.json -------------------------------------------------------------------------------- /solutions/3200-3299/3289-the-two-sneaky-numbers-of-digitville-easy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/3200-3299/3289-the-two-sneaky-numbers-of-digitville-easy.md -------------------------------------------------------------------------------- /solutions/3200-3299/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/3200-3299/_category_.json -------------------------------------------------------------------------------- /solutions/3300-3399/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/solutions/3300-3399/_category_.json -------------------------------------------------------------------------------- /src/components/HomepageFeatures/index.js: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/src/components/HomepageFeatures/index.js -------------------------------------------------------------------------------- /src/components/HomepageFeatures/styles.module.css: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/src/components/HomepageFeatures/styles.module.css -------------------------------------------------------------------------------- /src/components/SolutionAuthor/index.js: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/src/components/SolutionAuthor/index.js -------------------------------------------------------------------------------- /src/components/Table/index.js: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/src/components/Table/index.js -------------------------------------------------------------------------------- /src/components/Tags/index.js: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/src/components/Tags/index.js -------------------------------------------------------------------------------- /src/components/TutorialCredits/index.js: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/src/components/TutorialCredits/index.js -------------------------------------------------------------------------------- /src/css/custom.css: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/src/css/custom.css -------------------------------------------------------------------------------- /src/pages/index.js: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/src/pages/index.js -------------------------------------------------------------------------------- /src/pages/index.module.css: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/src/pages/index.module.css -------------------------------------------------------------------------------- /src/theme/MDXComponents.js: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/src/theme/MDXComponents.js -------------------------------------------------------------------------------- /static/.nojekyll: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /static/CNAME: -------------------------------------------------------------------------------- 1 | leetcodethehardway.com -------------------------------------------------------------------------------- /static/ads.txt: -------------------------------------------------------------------------------- 1 | google.com, pub-4531209581366540, DIRECT, f08c47fec0942fa0 -------------------------------------------------------------------------------- /static/img/banner.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/static/img/banner.png -------------------------------------------------------------------------------- /static/img/favicon.ico: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/static/img/favicon.ico -------------------------------------------------------------------------------- /static/img/logo.svg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/static/img/logo.svg -------------------------------------------------------------------------------- /static/img/undraw_community_re_cyrm.svg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/static/img/undraw_community_re_cyrm.svg -------------------------------------------------------------------------------- /static/img/undraw_learning_sketching_nd4f.svg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/static/img/undraw_learning_sketching_nd4f.svg -------------------------------------------------------------------------------- /static/img/undraw_onboarding_re_6osc.svg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/static/img/undraw_onboarding_re_6osc.svg -------------------------------------------------------------------------------- /static/robots.txt: -------------------------------------------------------------------------------- 1 | User-agent: * 2 | Disallow: -------------------------------------------------------------------------------- /templates/binary-search.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/templates/binary-search.md -------------------------------------------------------------------------------- /templates/bit-manipulation.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/templates/bit-manipulation.md -------------------------------------------------------------------------------- /templates/euler.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/templates/euler.md -------------------------------------------------------------------------------- /templates/fenwick-tree.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/templates/fenwick-tree.md -------------------------------------------------------------------------------- /templates/graph-theory.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/templates/graph-theory.md -------------------------------------------------------------------------------- /templates/index.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/templates/index.md -------------------------------------------------------------------------------- /templates/linked-list.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/templates/linked-list.md -------------------------------------------------------------------------------- /templates/manachers-algorithm.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/templates/manachers-algorithm.md -------------------------------------------------------------------------------- /templates/ordered-set.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/templates/ordered-set.md -------------------------------------------------------------------------------- /templates/prefix-sum.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/templates/prefix-sum.md -------------------------------------------------------------------------------- /templates/segment-tree.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/templates/segment-tree.md -------------------------------------------------------------------------------- /templates/sparse-table.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/templates/sparse-table.md -------------------------------------------------------------------------------- /templates/two-pointers.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/templates/two-pointers.md -------------------------------------------------------------------------------- /tutorials/basic-topics/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/_category_.json -------------------------------------------------------------------------------- /tutorials/basic-topics/arrays.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/arrays.md -------------------------------------------------------------------------------- /tutorials/basic-topics/backtracking.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/backtracking.md -------------------------------------------------------------------------------- /tutorials/basic-topics/binary-search.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/binary-search.md -------------------------------------------------------------------------------- /tutorials/basic-topics/brute-force.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/brute-force.md -------------------------------------------------------------------------------- /tutorials/basic-topics/divide-and-conquer.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/divide-and-conquer.md -------------------------------------------------------------------------------- /tutorials/basic-topics/doubly-linked-list.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/doubly-linked-list.md -------------------------------------------------------------------------------- /tutorials/basic-topics/greedy.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/greedy.md -------------------------------------------------------------------------------- /tutorials/basic-topics/hash-map.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/hash-map.md -------------------------------------------------------------------------------- /tutorials/basic-topics/heap.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/heap.md -------------------------------------------------------------------------------- /tutorials/basic-topics/kadane.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/kadane.md -------------------------------------------------------------------------------- /tutorials/basic-topics/linear-search.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/linear-search.md -------------------------------------------------------------------------------- /tutorials/basic-topics/linked-list.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/linked-list.md -------------------------------------------------------------------------------- /tutorials/basic-topics/mod.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/mod.md -------------------------------------------------------------------------------- /tutorials/basic-topics/prefix-sum.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/prefix-sum.md -------------------------------------------------------------------------------- /tutorials/basic-topics/queue-and-stack.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/queue-and-stack.md -------------------------------------------------------------------------------- /tutorials/basic-topics/sliding-window.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/sliding-window.md -------------------------------------------------------------------------------- /tutorials/basic-topics/sorting/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/sorting/_category_.json -------------------------------------------------------------------------------- /tutorials/basic-topics/sorting/bubble-sort.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/sorting/bubble-sort.md -------------------------------------------------------------------------------- /tutorials/basic-topics/sorting/bucket-sort.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/sorting/bucket-sort.md -------------------------------------------------------------------------------- /tutorials/basic-topics/sorting/counting-sort.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/sorting/counting-sort.md -------------------------------------------------------------------------------- /tutorials/basic-topics/sorting/cyclic-sort.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/sorting/cyclic-sort.md -------------------------------------------------------------------------------- /tutorials/basic-topics/sorting/heap-sort.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/sorting/heap-sort.md -------------------------------------------------------------------------------- /tutorials/basic-topics/sorting/insertion-sort.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/sorting/insertion-sort.md -------------------------------------------------------------------------------- /tutorials/basic-topics/sorting/introduction.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/sorting/introduction.md -------------------------------------------------------------------------------- /tutorials/basic-topics/sorting/merge-sort.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/sorting/merge-sort.md -------------------------------------------------------------------------------- /tutorials/basic-topics/sorting/quick-sort.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/sorting/quick-sort.md -------------------------------------------------------------------------------- /tutorials/basic-topics/sorting/radix-sort.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/sorting/radix-sort.md -------------------------------------------------------------------------------- /tutorials/basic-topics/sorting/selection-sort.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/sorting/selection-sort.md -------------------------------------------------------------------------------- /tutorials/basic-topics/sorting/shell-sort.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/sorting/shell-sort.md -------------------------------------------------------------------------------- /tutorials/basic-topics/sorting/tim-sort.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/sorting/tim-sort.md -------------------------------------------------------------------------------- /tutorials/basic-topics/time-complexity.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/time-complexity.md -------------------------------------------------------------------------------- /tutorials/basic-topics/trie.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/trie.md -------------------------------------------------------------------------------- /tutorials/basic-topics/two-pointers.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/basic-topics/two-pointers.md -------------------------------------------------------------------------------- /tutorials/dynamic-programming.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/dynamic-programming.md -------------------------------------------------------------------------------- /tutorials/graph-theory/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/graph-theory/_category_.json -------------------------------------------------------------------------------- /tutorials/graph-theory/bellman-ford-algorithm.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/graph-theory/bellman-ford-algorithm.md -------------------------------------------------------------------------------- /tutorials/graph-theory/binary-search-tree.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/graph-theory/binary-search-tree.md -------------------------------------------------------------------------------- /tutorials/graph-theory/binary-tree.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/graph-theory/binary-tree.md -------------------------------------------------------------------------------- /tutorials/graph-theory/breadth-first-search.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/graph-theory/breadth-first-search.md -------------------------------------------------------------------------------- /tutorials/graph-theory/depth-first-search.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/graph-theory/depth-first-search.md -------------------------------------------------------------------------------- /tutorials/graph-theory/dijkstra.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/graph-theory/dijkstra.md -------------------------------------------------------------------------------- /tutorials/graph-theory/disjoint-set-union.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/graph-theory/disjoint-set-union.md -------------------------------------------------------------------------------- /tutorials/graph-theory/floyd-warshall-algorithm.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/graph-theory/floyd-warshall-algorithm.md -------------------------------------------------------------------------------- /tutorials/graph-theory/introduction.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/graph-theory/introduction.md -------------------------------------------------------------------------------- /tutorials/graph-theory/kahns-algorithm.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/graph-theory/kahns-algorithm.md -------------------------------------------------------------------------------- /tutorials/graph-theory/kruskals-algorithm.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/graph-theory/kruskals-algorithm.md -------------------------------------------------------------------------------- /tutorials/graph-theory/lca.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/graph-theory/lca.md -------------------------------------------------------------------------------- /tutorials/graph-theory/minimum-spanning-tree.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/graph-theory/minimum-spanning-tree.md -------------------------------------------------------------------------------- /tutorials/graph-theory/prims-algorithm.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/graph-theory/prims-algorithm.md -------------------------------------------------------------------------------- /tutorials/graph-theory/tarjans-algorithm.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/graph-theory/tarjans-algorithm.md -------------------------------------------------------------------------------- /tutorials/graph-theory/topological-sorting.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/graph-theory/topological-sorting.md -------------------------------------------------------------------------------- /tutorials/math/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/math/_category_.json -------------------------------------------------------------------------------- /tutorials/math/bit-manipulation.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/math/bit-manipulation.md -------------------------------------------------------------------------------- /tutorials/math/combinatorics.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/math/combinatorics.md -------------------------------------------------------------------------------- /tutorials/math/matrix-exponentiation.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/math/matrix-exponentiation.md -------------------------------------------------------------------------------- /tutorials/math/number-theory/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/math/number-theory/_category_.json -------------------------------------------------------------------------------- /tutorials/math/number-theory/binary-exponentiation.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/math/number-theory/binary-exponentiation.md -------------------------------------------------------------------------------- /tutorials/math/number-theory/sieve-of-eratosthenes.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/math/number-theory/sieve-of-eratosthenes.md -------------------------------------------------------------------------------- /tutorials/math/prime-factors.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/math/prime-factors.md -------------------------------------------------------------------------------- /tutorials/strings/_category_.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/strings/_category_.json -------------------------------------------------------------------------------- /tutorials/strings/knuth–morris–pratt-algorithm.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/strings/knuth–morris–pratt-algorithm.md -------------------------------------------------------------------------------- /tutorials/strings/levenshtein-distance.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/strings/levenshtein-distance.md -------------------------------------------------------------------------------- /tutorials/strings/manachers-algorithm.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/strings/manachers-algorithm.md -------------------------------------------------------------------------------- /tutorials/strings/palindrome.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/strings/palindrome.md -------------------------------------------------------------------------------- /tutorials/strings/rabin-karp-algorithm.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/strings/rabin-karp-algorithm.md -------------------------------------------------------------------------------- /tutorials/strings/z-algorithm.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/wingkwong/leetcode-the-hard-way/HEAD/tutorials/strings/z-algorithm.md --------------------------------------------------------------------------------