From 96a1fa36ae96b12e77f246257a8baa1f05f6692f Mon Sep 17 00:00:00 2001 From: wingkwong Date: Thu, 20 Jun 2024 05:40:46 +0000 Subject: [PATCH] deploy: 2c647d90442c432f96249fad5657c33c91f7a3b6 --- 404.html | 4 +- assets/js/274d1c27.c59bbdb4.js | 1 - assets/js/274d1c27.f2a15cad.js | 1 + assets/js/33a6419c.afd6db52.js | 1 + assets/js/3e0aee77.aa2a41e2.js | 1 + assets/js/3e0aee77.c90b7523.js | 1 - ...a5532.0f687605.js => 46fa5532.4dd349e6.js} | 2 +- ...e2202.8c1eeaf9.js => 6cae2202.195e2cb4.js} | 2 +- assets/js/d398e51b.d7efb7be.js | 1 - assets/js/d398e51b.dbd65eaa.js | 1 + assets/js/e8f83d04.45348956.js | 1 - assets/js/e8f83d04.545ac708.js | 1 + .../js/{main.d649bbe4.js => main.5bb87119.js} | 4 +- ...CENSE.txt => main.5bb87119.js.LICENSE.txt} | 0 assets/js/runtime~main.0f588b76.js | 1 - assets/js/runtime~main.2f6cb6d2.js | 1 + blog.html | 4 +- blog/archive.html | 4 +- blog/first-blog-post.html | 4 +- blog/long-blog-post.html | 4 +- blog/mdx-blog-post.html | 4 +- blog/tags.html | 4 +- blog/tags/docusaurus.html | 4 +- blog/tags/facebook.html | 4 +- blog/tags/hello.html | 4 +- blog/tags/hola.html | 4 +- blog/welcome.html | 4 +- index.html | 4 +- roadmap.html | 4 +- roadmap/backtracking.html | 4 +- roadmap/data-structure-i.html | 4 +- roadmap/dynamic-programming.html | 4 +- roadmap/heap.html | 4 +- roadmap/leetcode-summer-intensive.html | 4 +- roadmap/programming-skills-i.html | 6 +-- search.html | 4 +- sitemap.xml | 2 +- ...ove-Duplicates-from-Sorted-Array-easy.html | 4 +- solutions/0000-0099/add-binary-easy.html | 4 +- .../0000-0099/add-two-numbers-medium.html | 4 +- .../binary-tree-inorder-traversal-easy.html | 4 +- solutions/0000-0099/climbing-stairs-easy.html | 4 +- .../0000-0099/combination-sum-ii-medium.html | 4 +- .../0000-0099/combination-sum-medium.html | 4 +- solutions/0000-0099/combinations-medium.html | 4 +- .../container-with-most-water-medium.html | 4 +- solutions/0000-0099/decode-ways-medium.html | 4 +- solutions/0000-0099/edit-distance-hard.html | 4 +- ...ion-of-element-in-sorted-array-medium.html | 4 +- ...the-first-occurrence-in-a-string-easy.html | 4 +- .../generate-parentheses-medium.html | 4 +- .../0000-0099/group-anagrams-medium.html | 4 +- .../0000-0099/insert-interval-medium.html | 4 +- .../0000-0099/integer-to-roman-medium.html | 4 +- .../0000-0099/interleaving-string-medium.html | 4 +- solutions/0000-0099/jump-game-ii-medium.html | 4 +- solutions/0000-0099/jump-game-medium.html | 4 +- .../largest-rectangle-in-histogram-hard.html | 4 +- .../0000-0099/length-of-last-word-easy.html | 4 +- ...combinations-of-a-phone-number-medium.html | 4 +- .../0000-0099/longest-common-prefix-easy.html | 4 +- .../longest-palindromic-substring-medium.html | 4 +- ...g-without-repeating-characters-medium.html | 4 +- .../0000-0099/maximum-subarray-medium.html | 4 +- .../median-of-two-sorted-arrays-hard.html | 4 +- .../0000-0099/merge-intervals-medium.html | 4 +- .../0000-0099/merge-k-sorted-lists-hard.html | 4 +- .../0000-0099/merge-sorted-array-easy.html | 4 +- .../merge-two-sorted-lists-easy.html | 4 +- .../minimum-window-substring-hard.html | 4 +- solutions/0000-0099/n-queens-hard.html | 4 +- .../0000-0099/palindrome-number-easy.html | 4 +- solutions/0000-0099/permutations-medium.html | 4 +- solutions/0000-0099/plus-one-easy.html | 4 +- solutions/0000-0099/pow-x-n-medium.html | 4 +- .../regular-expression-matching-hard.html | 4 +- solutions/0000-0099/remove-element-easy.html | 4 +- ...move-nth-node-from-end-of-list-medium.html | 4 +- .../restore-ip-addresses-medium.html | 4 +- .../0000-0099/reverse-integer-medium.html | 4 +- .../reverse-nodes-in-k-group-hard.html | 4 +- .../0000-0099/roman-to-integer-easy.html | 4 +- solutions/0000-0099/rotate-image-medium.html | 4 +- solutions/0000-0099/rotate-list-medium.html | 4 +- .../0000-0099/search-a-2d-matrix-medium.html | 4 +- ...search-in-rotated-sorted-array-medium.html | 4 +- .../search-insert-position-easy.html | 4 +- .../0000-0099/set-matrix-zeroes-medium.html | 4 +- solutions/0000-0099/sort-colors-medium.html | 4 +- solutions/0000-0099/spiral-matrix-medium.html | 4 +- solutions/0000-0099/sqrt-x-easy.html | 4 +- solutions/0000-0099/subsets-ii-medium.html | 4 +- solutions/0000-0099/subsets-medium.html | 4 +- solutions/0000-0099/sudoku-solver-hard.html | 4 +- .../0000-0099/swap-nodes-in-pairs-medium.html | 4 +- .../0000-0099/trapping-rain-water-hard.html | 4 +- solutions/0000-0099/two-sum.html | 4 +- .../0000-0099/unique-paths-ii-medium.html | 4 +- solutions/0000-0099/unique-paths-medium.html | 4 +- .../0000-0099/valid-parentheses-easy.html | 4 +- solutions/0000-0099/valid-sudoku-easy.html | 4 +- .../validate-binary-search-tree-medium.html | 4 +- solutions/0000-0099/word-search-medium.html | 4 +- .../0000-0099/zigzag-conversion-medium.html | 4 +- .../0100-0199/balanced-binary-tree-easy.html | 4 +- .../best-time-to-buy-and-sell-stock-easy.html | 4 +- ...st-time-to-buy-and-sell-stock-iv-hard.html | 4 +- ...ary-tree-level-order-traversal-medium.html | 4 +- .../binary-tree-maximum-path-sum-hard.html | 4 +- .../binary-tree-postorder-traversal-easy.html | 4 +- .../binary-tree-preorder-traversal-easy.html | 4 +- .../binary-tree-right-side-view-medium.html | 4 +- ...e-zigzag-level-order-traversal-medium.html | 4 +- solutions/0100-0199/clone-graph-medium.html | 4 +- .../compare-version-numbers-medium.html | 4 +- ...preorder-and-inorder-traversal-medium.html | 4 +- .../copy-list-with-random-pointer-medium.html | 4 +- .../0100-0199/distinct-subsequences-hard.html | 4 +- ...valuate-reverse-olish-notation-medium.html | 4 +- ...nimum-in-rotated-sorted-array-ii-hard.html | 4 +- .../0100-0199/find-peak-element-medium.html | 4 +- solutions/0100-0199/gas-station-medium.html | 4 +- solutions/0100-0199/house-robber-medium.html | 4 +- solutions/0100-0199/linked-list-cycle.html | 4 +- solutions/0100-0199/lru-cache-medium.html | 4 +- .../0100-0199/majority-element-easy.html | 4 +- .../maximum-depth-of-binary-tree-easy.html | 4 +- .../maximum-product-subarray-medium.html | 4 +- solutions/0100-0199/min-stack-medium.html | 4 +- .../0100-0199/number-of-1-bits-easy.html | 4 +- .../palindrome-partitioning-medium.html | 4 +- .../0100-0199/pascals-triangle-easy.html | 4 +- solutions/0100-0199/path-sum-easy.html | 4 +- solutions/0100-0199/path-sum-ii-medium.html | 4 +- solutions/0100-0199/reorder-list-medium.html | 4 +- solutions/0100-0199/same-tree-easy.html | 4 +- solutions/0100-0199/single-number-easy.html | 4 +- solutions/0100-0199/sort-list-medium.html | 4 +- .../sum-root-to-leaf-numbers-medium.html | 4 +- .../0100-0199/surrounded-regions-medium.html | 4 +- solutions/0100-0199/symmetric-tree-easy.html | 4 +- solutions/0100-0199/valid-palindrome.html | 4 +- solutions/0100-0199/word-break-medium.html | 4 +- solutions/0100-0199/word-ladder-hard.html | 4 +- solutions/0200-0299/add-digits-easy.html | 4 +- ...e-longest-consecutive-sequence-medium.html | 4 +- .../0200-0299/bulls-and-cows-medium.html | 4 +- .../0200-0299/contains-duplicate-easy.html | 4 +- .../0200-0299/contains-duplicate-ii-easy.html | 4 +- solutions/0200-0299/count-primes.html | 4 +- .../0200-0299/course-schedule-ii-medium.html | 4 +- .../0200-0299/course-schedule-medium.html | 4 +- .../delete-node-in-a-linked-list-medium.html | 4 +- ...nd-search-words-data-structure-medium.html | 4 +- .../find-median-from-data-stream-hard.html | 4 +- .../find-the-duplicate-number-medium.html | 4 +- .../0200-0299/first-bad-version-easy.html | 4 +- .../0200-0299/graph-valid-tree-medium.html | 4 +- solutions/0200-0299/happy-number-easy.html | 4 +- .../0200-0299/house-robber-ii-medium.html | 4 +- .../implement-stack-using-queues-easy.html | 4 +- .../0200-0299/implement-trie-medium.html | 4 +- .../0200-0299/invert-binary-tree-easy.html | 4 +- .../0200-0299/isomorphic-strings-easy.html | 4 +- ...th-largest-element-in-an-array-medium.html | 4 +- .../kth-smallest-element-in-a-bst-medium.html | 4 +- ...cestor-of-a-binary-search-tree-medium.html | 4 +- solutions/0200-0299/missing-number-easy.html | 4 +- solutions/0200-0299/move-zeroes-easy.html | 4 +- .../0200-0299/number-of-islands-medium.html | 4 +- .../palindrome-linked-list-easy.html | 4 +- solutions/0200-0299/power-of-two-easy.html | 4 +- .../0200-0299/reverse-linked-list-easy.html | 4 +- ...lize-and-deserialize-binary-tree-hard.html | 4 +- .../0200-0299/shortest-palindrome-hard.html | 4 +- .../sliding-maximum-window-hard.html | 4 +- .../strobogrammatic-number-easy.html | 4 +- solutions/0200-0299/summary-ranges-easy.html | 4 +- solutions/0200-0299/ugly-number-easy.html | 4 +- solutions/0200-0299/valid-anagram-easy.html | 4 +- .../0200-0299/walls-and-gates-medium.html | 4 +- solutions/0200-0299/word-pattern-easy.html | 4 +- solutions/0200-0299/word-search-ii-hard.html | 4 +- ...y-and-sell-stock-with-cooldown-medium.html | 4 +- solutions/0300-0399/burst-balloons-hard.html | 4 +- solutions/0300-0399/coin-change-medium.html | 4 +- .../0300-0399/combination-sum-iv-medium.html | 4 +- .../0300-0399/count-of-range-sum-hard.html | 4 +- solutions/0300-0399/counting-bits-easy.html | 4 +- .../0300-0399/design-twitter-medium.html | 4 +- .../0300-0399/find-the-difference-easy.html | 4 +- ...rst-unique-character-in-a-string-easy.html | 4 +- .../guess-number-higher-or-lower-easy.html | 4 +- ...increasing-triplet-subsequence-medium.html | 4 +- .../intersection-of-two-arrays-easy.html | 4 +- solutions/0300-0399/is-subsequence-easy.html | 4 +- ...gest-increasing-path-in-a-matrix-hard.html | 4 +- ...longest-increasing-subsequence-medium.html | 4 +- .../moving-average-from-data-stream-easy.html | 4 +- ...ponents-in-an-undirected-graph-medium.html | 4 +- solutions/0300-0399/power-of-four-easy.html | 4 +- .../range-sum-query-mutable-medium.html | 4 +- solutions/0300-0399/ransom-note-easy.html | 4 +- .../0300-0399/reconstruct-itinerary-hard.html | 4 +- solutions/0300-0399/reverse-string-easy.html | 4 +- .../reverse-vowels-of-a-string-easy.html | 4 +- .../top-k-frequent-elements-medium.html | 4 +- .../0300-0399/utf-8-validation-medium.html | 4 +- .../0300-0399/valid-perfect-square-easy.html | 4 +- .../water-and-jug-problem-medium.html | 4 +- solutions/0400-0499/0454-4sum-ii-medium.html | 4 +- solutions/0400-0499/Add-Two-Numbers-II.html | 4 +- solutions/0400-0499/Frog-Jump.html | 4 +- .../0400-0499/arithmetic-slices-medium.html | 4 +- solutions/0400-0499/arranging-coins-easy.html | 4 +- solutions/0400-0499/can-i-win-medium.html | 4 +- .../0400-0499/concatenated-words-hard.html | 4 +- .../find-all-anagrams-in-a-string-medium.html | 4 +- ...epeating-character-replacement-medium.html | 4 +- .../matchsticks-to-square-medium.html | 4 +- ...aximum-xor-of-two-numbers-in-an-array.html | 4 +- .../minimum-genetic-mutation-medium.html | 4 +- ...er-of-arrows-to-burst-balloons-medium.html | 4 +- ...ary-tree-level-order-traversal-medium.html | 4 +- .../next-greater-element-i-easy.html | 4 +- .../non-decreasing-subsequences-medium.html | 4 +- .../non-overlapping-intervals-medium.html | 4 +- .../optimal-account-balancing-hard.html | 4 +- .../pacific-atlantic-water-flow-medium.html | 4 +- .../partition-equal-subset-sum-medium.html | 4 +- solutions/0400-0499/path-sum-iii-medium.html | 4 +- .../0400-0499/remove-k-digits-medium.html | 4 +- solutions/0400-0499/reverse-pairs-hard.html | 4 +- .../sort-characters-by-frequency-medium.html | 4 +- .../0400-0499/string-compression-medium.html | 4 +- .../0400-0499/sum-of-left-leaves-easy.html | 4 +- solutions/0400-0499/target-sum-medium.html | 4 +- .../0500-0599/0542-01-matrix-medium.html | 4 +- solutions/0500-0599/coin-change-2-medium.html | 4 +- .../0500-0599/contiguous-array-medium.html | 4 +- .../continuous-subarray-sum-medium.html | 4 +- solutions/0500-0599/detect-capital-easy.html | 4 +- .../diameter-of-binary-tree-easy.html | 4 +- .../find-mode-in-binary-search-tree-easy.html | 4 +- .../k-diff-pairs-in-an-array-medium.html | 4 +- .../maximum-depth-of-n-ary-tree-easy.html | 4 +- .../most-frequent-subtree-sum-medium.html | 4 +- .../n-ary-tree-preorder-traversal-easy.html | 4 +- .../permutation-in-string-medium.html | 4 +- .../reverse-words-in-a-string-iii-easy.html | 4 +- ...t-unsorted-continuous-subarray-medium.html | 4 +- ...ngle-element-in-a-sorted-array-medium.html | 4 +- .../subarray-sum-equals-k-medium.html | 4 +- .../subtree-of-another-tree-easy.html | 4 +- .../0600-0699/add-one-row-to-tree-medium.html | 4 +- ...erage-of-levels-in-binary-tree-medium.html | 4 +- solutions/0600-0699/baseball-game-easy.html | 4 +- .../0600-0699/can-place-flowers-easy.html | 4 +- ...onstruct-string-from-binary-tree-easy.html | 4 +- .../design-circular-queue-medium.html | 4 +- .../find-duplicate-file-in-system-medium.html | 4 +- .../0600-0699/max-area-of-island-medium.html | 4 +- .../maximum-width-of-binary-tree-medium.html | 4 +- .../palindromic-substrings-medium.html | 4 +- ...rtition-to-k-equal-sum-subsets-medium.html | 4 +- .../redundant-connection-medium.html | 4 +- solutions/0600-0699/set-mismatch-easy.html | 4 +- .../sum-of-square-numbers-medium.html | 4 +- .../0600-0699/task-scheduler-medium.html | 4 +- .../top-k-frequent-words-medium.html | 4 +- .../0600-0699/two-keys-keyboard-medium.html | 4 +- .../two-sum-IV-input-is-a-BST-easy.html | 4 +- .../0600-0699/valid-palindrome-ii-easy.html | 4 +- .../valid-parenthesis-string-medium.html | 4 +- solutions/0700-0799/binary-search-easy.html | 4 +- .../0700-0799/champagne-tower-medium.html | 4 +- ...heapest-flights-within-k-stops-medium.html | 4 +- .../0700-0799/daily-temperatures-medium.html | 4 +- .../0700-0799/delete-and-earn-medium.html | 4 +- .../0700-0799/design-hashmap-medium.html | 4 +- .../0700-0799/find-pivot-index-easy.html | 4 +- ...llest-letter-greater-than-target-easy.html | 4 +- solutions/0700-0799/flood-fill-easy.html | 4 +- .../0700-0799/is-graph-bipartite-medium.html | 4 +- .../kth-largest-element-in-a-stream-easy.html | 4 +- ...um-length-of-repeated-subarray-medium.html | 4 +- .../min-cost-climbing-stairs-easy.html | 4 +- solutions/0700-0799/my-calendar-iii-hard.html | 4 +- .../0700-0799/network-delay-time-medium.html | 4 +- .../0700-0799/partition-labels-medium.html | 4 +- .../subarray-product-less-than-k-medium.html | 4 +- .../0700-0799/swim-in-rising-water-hard.html | 4 +- .../backspace-string-compare-easy.html | 4 +- .../0800-0899/binary-tree-pruning-medium.html | 4 +- .../boats-to-save-people-medium.html | 4 +- solutions/0800-0899/car-fleet-medium.html | 4 +- .../consecutive-numbers-sum-hard.html | 4 +- .../0800-0899/hand-of-straights-medium.html | 4 +- .../0800-0899/keys-and-rooms-medium.html | 4 +- .../0800-0899/koko-eating-bananas-medium.html | 4 +- .../largest-sum-of-averages-medium.html | 4 +- .../middle-of-the-linked-list-easy.html | 4 +- solutions/0800-0899/monotonic-array-easy.html | 4 +- solutions/0800-0899/orderly-queue-hard.html | 4 +- .../peak-index-in-a-mountain-array-easy.html | 4 +- solutions/0800-0899/push-dominoes-medium.html | 4 +- .../reordered-power-of-2-medium.html | 4 +- ...shortest-path-visiting-all-nodes-hard.html | 4 +- solutions/0800-0899/stone-game-medium.html | 4 +- .../0800-0899/transpose-matrix-easy.html | 4 +- .../0923-3sum-with-multiplicity-medium.html | 4 +- solutions/0900-0999/bag-of-tokens-medium.html | 4 +- .../0900-0999/broken-calculator-medium.html | 4 +- .../delete-columns-to-make-sorted-easy.html | 4 +- ...-string-to-monotone-increasing-medium.html | 4 +- .../0900-0999/fruit-into-baskets-medium.html | 4 +- .../k-closest-points-to-origin-medium.html | 4 +- solutions/0900-0999/knight-dialer-medium.html | 4 +- ...-component-size-by-common-factor-hard.html | 4 +- .../largest-perimeter-triangle-easy.html | 4 +- .../maximum-sum-circular-subarray-medium.html | 4 +- ...emoved-with-same-row-or-column-medium.html | 4 +- ...h-same-consecutive-differences-medium.html | 4 +- .../0900-0999/online-stock-span-medium.html | 4 +- .../0900-0999/rotting-oranges-medium.html | 4 +- ...iability-of-equality-equations-medium.html | 4 +- .../0900-0999/snakes-and-ladders-medium.html | 4 +- solutions/0900-0999/sort-an-array-medium.html | 4 +- .../0900-0999/stamping-the-sequence-hard.html | 4 +- .../subarray-sums-divisible-by-k-medium.html | 4 +- ...arrays-with-k-different-integers-hard.html | 4 +- ...-of-even-numbers-after-queries.medium.html | 4 +- .../sum-of-subarray-minimums-medium.html | 4 +- .../time-based-key-value-store-medium.html | 4 +- .../0900-0999/valid-mountain-array-easy.html | 4 +- .../validate-stack-sequences-medium.html | 4 +- ...order-traversal-of-a-binary-tree-hard.html | 4 +- .../1000-1099/campus-bikes-ii-medium.html | 4 +- ...to-ship-packages-within-d-days-medium.html | 4 +- .../1000-1099/find-the-town-judge-easy.html | 4 +- ...eatest-common-divisor-of-strings-easy.html | 4 +- .../1000-1099/last-stone-weight-easy.html | 4 +- ...lly-smallest-equivalent-string-medium.html | 4 +- .../max-consecutive-ones-iii-medium.html | 4 +- .../minimum-cost-to-merge-stones-hard.html | 4 +- .../next-greater-node-in-linked-list.html | 4 +- ...artition-array-for-maximum-sum-medium.html | 4 +- ...ll-adjacent-duplicates-in-string-easy.html | 4 +- .../1000-1099/two-city-scheduling-medium.html | 4 +- .../as-far-from-land-as-possible-medium.html | 4 +- ...cting-cities-with-minimum-cost-medium.html | 4 +- ...chunked-palindrome-decomposition-hard.html | 4 +- .../longest-common-subsequence-medium.html | 4 +- .../1100-1199/make-the-string-great-easy.html | 4 +- .../n-th-tribonacci-number-easy.html | 4 +- ...-of-dice-rolls-with-target-sum-medium.html | 4 +- ...-water-distribution-in-a-village-hard.html | 4 +- .../smallest-sufficient-team-hard.html | 4 +- solutions/1100-1199/stone-game-ii-medium.html | 4 +- .../check-if-it-is-a-straight-line-easy.html | 4 +- .../handshakes-that-dont-cross-hard.html | 4 +- ...-string-with-unique-characters-medium.html | 4 +- ...maximum-profit-in-job-scheduling-hard.html | 4 +- ...-the-same-place-after-some-steps-hard.html | 4 +- .../path-with-maximum-gold-medium.html | 4 +- ...h-greatest-element-on-right-side-easy.html | 4 +- ...-grid-with-obstacles-elimination-hard.html | 4 +- .../smallest-string-with-swaps-medium.html | 4 +- ...-and-sum-of-digits-of-an-integer-easy.html | 4 +- .../1200-1299/ugly-number-iii-medium.html | 4 +- ...nts-in-two-binary-search-trees-medium.html | 4 +- .../1300-1399/break-a-palindrome-medium.html | 4 +- .../check-if-n-and-its-double-exist-easy.html | 4 +- ...alid-pickup-and-delivery-options-hard.html | 4 +- ...ghbors-at-a-threshold-distance-medium.html | 4 +- ...ntaining-vowels-in-even-counts-medium.html | 4 +- ...-smaller-than-the-current-number-easy.html | 4 +- ...t-zigzag-path-in-a-binary-tree-medium.html | 4 +- .../maximum-performance-of-a-team-hard.html | 4 +- .../maximum-students-taking-exam-hard.html | 4 +- ...mum-difficulty-of-a-job-schedule-hard.html | 4 +- ...ps-to-make-two-strings-anagram-medium.html | 4 +- ...f-taps-to-open-to-water-a-garden-hard.html | 4 +- .../rank-transform-of-an-array-easy.html | 4 +- ...integers-by-the-number-of-1-bits-easy.html | 4 +- .../sort-the-matrix-diagonally-medium.html | 4 +- .../the-k-weakest-rows-in-a-matrix-easy.html | 4 +- ...g-the-minimum-and-maximum-salary-easy.html | 4 +- ...ount-good-nodes-in-binary-tree-medium.html | 4 +- ...ith-a-special-discount-in-a-shop-easy.html | 4 +- ...h-the-greatest-number-of-candies-easy.html | 4 +- ...duct-of-two-elements-in-an-array-easy.html | 4 +- ...ber-of-days-to-make-m-bouquets-medium.html | 4 +- ...-time-to-collect-all-apples-in-a-tree.html | 4 +- ...ear-different-hats-to-each-other-hard.html | 4 +- .../1400-1499/parallel-courses-ii-hard.html | 4 +- solutions/1400-1499/path-crossing-easy.html | 4 +- ...ndromic-paths-in-a-binary-tree-medium.html | 4 +- .../running-sum-of-1d-array-easy.html | 4 +- .../1400-1499/shuffle-the-array-easy.html | 4 +- ...hmetic-progression-from-sequence-easy.html | 4 +- .../count-all-possible-routes-hard.html | 4 +- ...odd-numbers-in-an-interval-range-easy.html | 4 +- .../kth-missing-positive-number-easy.html | 4 +- .../1500-1599/make-the-string-great-easy.html | 4 +- .../make_sum_divisible_by_p-medium.html | 4 +- .../1500-1599/matrix-diagonal-sum-easy.html | 4 +- ...min-cost-to-connect-all-points-medium.html | 4 +- .../minimum-cost-to-cut-a-stick-hard.html | 4 +- ...mum-time-to-make-rope-colorful-medium.html | 4 +- ...e-sub-tree-with-the-same-label-medium.html | 4 +- .../path-with-maximum-probability.html | 4 +- solutions/1500-1599/stone-game-iv-hard.html | 4 +- .../1500-1599/string-compression-ii-hard.html | 4 +- .../sum-of-all-odd-length-subarrays-easy.html | 4 +- .../arithmetic-subarrays-medium.html | 4 +- .../best-team-with-no-conflicts-medium.html | 4 +- ...two-string-arrays-are-equivalent-easy.html | 4 +- ...-of-consecutive-binary-numbers-medium.html | 4 +- ...count-ways-to-distribute-candies-hard.html | 4 +- ...efine-if-two-strings-are-close-medium.html | 4 +- ...ing-between-two-equal-characters-easy.html | 4 +- .../max-number-of-k-sum-pairs-medium.html | 4 +- ...target-string-given-a-dictionary-hard.html | 4 +- .../path-with-minimum-effort-medium.html | 4 +- .../richest-customer-wealth-easy.html | 4 +- ...ing-with-a-given-numeric-value-medium.html | 4 +- ...-differences-in-a-sorted-array-medium.html | 4 +- .../ways-to-make-a-fair-array-medium.html | 4 +- .../buildings-with-an-ocean-view-medium.html | 6 +-- ...ring-swap-can-make-strings-equal-easy.html | 8 +-- ...rmine-if-string-halves-are-alike-easy.html | 6 +-- ...t-has-the-same-x-or-y-coordinate-easy.html | 53 +++++++++++++++++++ ...-submatrix-with-rearrangements-medium.html | 6 +-- ...f-events-that-can-be-attended-ii-hard.html | 6 +-- ...ming-multiplication-operations-medium.html | 8 +-- ...maximum-score-of-a-good-subarray-hard.html | 6 +-- .../merge-strings-alternately-easy.html | 6 +-- ...o-make-alternating-binary-string-easy.html | 6 +-- .../sum-of-unique-elements-easy.html | 6 +-- .../where-will-the-ball-fall-medium.html | 6 +-- .../maximum-ascending-subarray-sum-easy.html | 4 +- ...tance-between-a-pair-of-values-medium.html | 4 +- .../maximum-ice-cream-bars-medium.html | 4 +- .../maximum-population-year-easy.html | 4 +- ...riplets-to-form-target-triplet-medium.html | 4 +- ...m-interval-to-include-each-query-hard.html | 4 +- ...nge-sticks-with-k-sticks-visible-hard.html | 4 +- .../sign-of-the-product-of-an-array-easy.html | 4 +- .../1800-1899/sorting-the-sentence-easy.html | 4 +- .../concatenation-of-array-easy.html | 4 +- ...-ways-to-build-rooms-in-an-ant-colony.html | 4 +- .../find-all-groups-of-farmland-medium.html | 4 +- .../find-unique-binary-string-medium.html | 4 +- .../largest-odd-number-in-string-easy.html | 4 +- ...uct-difference-between-two-pairs-easy.html | 4 +- ...est-exit-from-entrance-in-maze-medium.html | 4 +- ...of-weak-characters-in-the-game-medium.html | 4 +- .../decode-the-slanted-ciphertext-medium.html | 4 +- .../2000-2099/detect-squares-medium.html | 4 +- ...ginal-array-from-doubled-array-medium.html | 4 +- solutions/2000-2099/grid-game-medium.html | 4 +- ...rations-to-make-array-continuous-hard.html | 4 +- .../2000-2099/parallel-courses-iii-hard.html | 4 +- .../2000-2099/two-out-of-three-easy.html | 4 +- ...a-number-after-a-double-reversal-easy.html | 4 +- .../adding-spaces-to-a-string-medium.html | 4 +- ...de-in-a-directed-acyclic-graph-medium.html | 4 +- ...ighest-score-of-a-binary-array-medium.html | 4 +- ...nd-k-integers-with-minimal-sum-medium.html | 4 +- ...lls-in-a-range-on-an-excel-sheet-easy.html | 4 +- ...count-array-pairs-divisible-by-k-hard.html | 4 +- ...rtifacts-that-can-be-extracted-medium.html | 4 +- ...tly-smaller-and-greater-elements-easy.html | 4 +- ...-and-divisible-pairs-in-an-array-easy.html | 4 +- .../count-good-triplets-in-an-array-hard.html | 4 +- ...unt-integers-with-even-digit-sum-easy.html | 4 +- .../count-operations-to-obtain-zero-easy.html | 4 +- .../count-the-hidden-sequences-medium.html | 4 +- ...unting-words-with-a-given-prefix-easy.html | 4 +- ...-binary-tree-from-descriptions-medium.html | 4 +- solutions/2100-2199/design-bitset-medium.html | 4 +- .../divide-array-into-equal-pairs-easy.html | 4 +- ...instructions-staying-in-a-grid-medium.html | 4 +- ...ll-k-distant-indices-in-an-array-easy.html | 4 +- ...ll-lonely-numbers-in-the-array-medium.html | 4 +- ...-palindromic-string-in-the-array-easy.html | 4 +- ...ubstring-with-given-hash-value-medium.html | 4 +- ...ers-that-sum-to-a-given-number-medium.html | 4 +- ...als-between-identical-elements-medium.html | 4 +- ...ked-items-within-a-price-range-medium.html | 4 +- ...-multiplying-found-values-by-two-easy.html | 4 +- ...concatenating-two-letter-words-medium.html | 4 +- ...er-of-subsequences-in-a-string-medium.html | 4 +- ...-topmost-element-after-k-moves-medium.html | 4 +- .../maximum-and-sum-of-array-hard.html | 4 +- ...oyees-to-be-invited-to-a-meeting-hard.html | 4 +- ...-good-people-based-on-statements-hard.html | 4 +- ...plit-of-positive-even-integers-medium.html | 4 +- ...-of-buying-candies-with-discount-easy.html | 4 +- ...nimum-cost-to-set-cooking-time-medium.html | 4 +- ...n-sums-after-removal-of-elements-hard.html | 4 +- ...mber-of-moves-to-make-palindrome-hard.html | 4 +- ...to-make-two-strings-anagram-ii-medium.html | 4 +- ...-to-make-the-array-alternating-medium.html | 4 +- ...s-to-make-the-array-k-increasing-hard.html | 4 +- ...it-number-after-splitting-digits-easy.html | 4 +- ...minimum-time-to-complete-trips-medium.html | 4 +- .../minimum-time-to-finish-the-race-hard.html | 4 +- ...ll-cars-containing-illegal-goods-hard.html | 4 +- ...subgraph-with-the-required-paths-hard.html | 4 +- ...number-following-key-in-an-array-easy.html | 4 +- ...oth-descent-periods-of-a-stock-medium.html | 4 +- ...f-ways-to-divide-a-long-corridor-hard.html | 4 +- ...array-according-to-given-pivot-medium.html | 4 +- ...arrange-array-elements-by-sign-medium.html | 4 +- .../recover-the-original-array-hard.html | 4 +- ...-minimum-number-of-magic-beans-medium.html | 4 +- ...ace-non-coprime-numbers-in-array-hard.html | 4 +- ...value-of-the-rearranged-number-medium.html | 4 +- ...en-and-odd-indices-independently-easy.html | 4 +- .../sort-the-jumbled-numbers-medium.html | 4 +- .../2200-2299/add-two-integers-easy.html | 4 +- .../calculate-digit-sum-of-a-string-easy.html | 4 +- ...check-if-an-array-is-consecutive-easy.html | 4 +- ...-a-valid-parentheses-string-path-hard.html | 4 +- .../count-integers-in-intervals-hard.html | 4 +- ...lattice-points-inside-a-circle-medium.html | 4 +- ...es-equal-to-average-of-subtree-medium.html | 4 +- ...ctangles-containing-each-point-medium.html | 4 +- .../count-number-of-texts-medium.html | 4 +- ...treet-with-required-brightness-medium.html | 4 +- ...count-prefixes-of-a-given-string-easy.html | 4 +- .../design-an-atm-machine-medium.html | 4 +- .../encrypt-and-decrypt-strings-hard.html | 4 +- .../find-closest-number-to-zero-easy.html | 4 +- ...layers-with-zero-or-one-losses-medium.html | 4 +- ...nt-array-after-removing-anagrams-easy.html | 4 +- .../intersection-of-multiple-arrays-easy.html | 4 +- ...k-divisible-elements-subarrays-medium.html | 4 +- ...st-3-same-digit-number-in-string-easy.html | 4 +- ...-bitwise-and-greater-than-zero-medium.html | 4 +- ...mber-after-digit-swaps-by-parity-easy.html | 4 +- ...th-different-adjacent-characters-hard.html | 4 +- ...ags-with-full-capacity-of-rock-medium.html | 4 +- ...andies-allocated-to-k-children-medium.html | 4 +- ...-floors-without-special-floors-medium.html | 4 +- ...mum-product-after-k-increments-medium.html | 4 +- ...maximum-score-of-a-node-sequence-hard.html | 4 +- ...imum-value-of-k-coins-from-piles-hard.html | 4 +- ...ding-parentheses-to-expression-medium.html | 4 +- .../minimum-average-difference-medium.html | 4 +- ...m-consecutive-cards-to-pick-up-medium.html | 4 +- .../minimum-health-to-beat-game-medium.html | 4 +- ...ines-to-represent-a-line-chart-medium.html | 4 +- ...er-of-operations-to-convert-time-easy.html | 4 +- ...um-operations-to-halve-array-sum-easy.html | 4 +- ...m-rounds-to-complete-all-tasks-medium.html | 4 +- ...iles-after-covering-with-carpets-hard.html | 4 +- .../number-of-flowers-in-full-bloom-hard.html | 4 +- ...f-ways-to-buy-pens-and-pencils-medium.html | 4 +- .../percentage-of-letter-in-string.html | 4 +- ...t-from-number-to-maximize-result-easy.html | 4 +- .../sum-of-scores-of-built-strings-hard.html | 4 +- .../total-appeal-of-a-string-hard.html | 4 +- .../build-a-matrix-with-conditions-hard.html | 4 +- .../count-special-integers-hard.html | 4 +- ...ount-subarrays-with-score-less-than-k.html | 4 +- .../equal-row-and-column-pairs-medium.html | 4 +- .../evaluate-boolean-binary-tree-easy.html | 4 +- ...losest-node-to-given-two-nodes-medium.html | 4 +- .../first-letter-to-appear-twice-easy.html | 4 +- ...largest-local-values-in-a-matrix-easy.html | 4 +- .../largest-palindromic-number-medium.html | 4 +- .../longest-cycle-in-a-graph-hard.html | 4 +- ...ero-by-subtracting-equal-amounts-easy.html | 4 +- ...-groups-entering-a-competition-medium.html | 4 +- ...of-training-to-win-a-competition-easy.html | 4 +- ...o-get-k-consecutive-black-blocks-easy.html | 4 +- .../number-of-excellent-pairs-hard.html | 4 +- .../2300-2399/shifting-letters-ii-medium.html | 4 +- ...ul-pairs-of-spells-and-potions-medium.html | 4 +- ...d-to-rearrange-a-binary-string-medium.html | 4 +- ...-to-string-to-make-subsequence-medium.html | 4 +- ...bers-that-are-divisible-by-three-easy.html | 4 +- .../bitwise-xor-of-all-pairs-medium.html | 4 +- .../convert-the-temperature-easy.html | 4 +- ...es-and-zeros-in-row-and-column-medium.html | 4 +- ...-into-minimum-number-of-groups-medium.html | 4 +- .../find-all-good-indices-medium.html | 4 +- ...e-original-array-of-prefix-xor-medium.html | 4 +- .../find-the-pivot-integer-easy.html | 4 +- ...er-that-exists-with-its-negative-easy.html | 4 +- .../longest-nice-subarray-medium.html | 4 +- ...array-with-maximum-bitwise-and-medium.html | 4 +- ...stinct-subarrays-with-length-k-medium.html | 4 +- .../minimize-maximum-of-array-medium.html | 4 +- ...-cost-to-report-to-the-capital-medium.html | 4 +- .../most-frequent-even-element-easy.html | 4 +- .../2400-2499/number-of-good-paths-hard.html | 4 +- ...number-of-nodes-with-value-one-medium.html | 4 +- ...position-after-exactly-k-steps-medium.html | 4 +- .../optimal-partition-of-string-medium.html | 4 +- .../remove-nodes-from-linked-list-medium.html | 4 +- .../smallest-even-multiple-easy.html | 4 +- solutions/2400-2499/sort-the-people-easy.html | 4 +- ...-that-worked-on-the-longest-task-easy.html | 4 +- ...closest-prime-numbers-in-range-medium.html | 4 +- ...-the-digits-that-divide-a-number-easy.html | 4 +- ...nt-sum-and-digit-sum-of-an-array-easy.html | 4 +- ...me-factors-of-product-of-array-medium.html | 4 +- ...gest-square-streak-in-an-array-medium.html | 4 +- ...r-of-distinct-characters-equal-medium.html | 4 +- ...re-after-applying-k-operations-medium.html | 4 +- ...ive-integer-and-negative-integer-easy.html | 4 +- ...ations-to-reduce-an-integer-to-0-easy.html | 4 +- ...nto-a-2d-array-with-conditions-medium.html | 4 +- ...d-the-maximum-divisibility-score-easy.html | 4 +- ...d-the-width-of-columns-of-a-grid-easy.html | 4 +- solutions/2600-2699/maximum-or-medium.html | 4 +- ...he-maximum-difference-of-pairs-medium.html | 4 +- .../number-of-senior-citizens-easy.html | 4 +- solutions/2600-2699/power-of-heroes-hard.html | 4 +- .../2600-2699/prime-in-diagonal-easy.html | 4 +- .../2600-2699/sum-in-a-matrix-medium.html | 4 +- .../2600-2699/sum-of-distances-medium.html | 4 +- ...reatest-common-divisor-traversal-hard.html | 4 +- .../prime-pairs-with-target-sum-medium.html | 4 +- ...plit-array-into-good-subarrays-medium.html | 4 +- ...-it-is-possible-to-split-array-medium.html | 4 +- ...-be-made-equal-with-operations-i-easy.html | 4 +- ...-made-equal-with-operations-ii-medium.html | 4 +- .../count-symmetric-integers-easy.html | 4 +- solutions/2800-2899/faulty-keyboard-easy.html | 4 +- .../max-pair-sum-in-an-array-easy.html | 4 +- .../maximum-odd-binary-number-easy.html | 4 +- ...-sum-of-almost-unique-subarray-medium.html | 4 +- ...alues-at-indices-with-k-set-bits-easy.html | 4 +- ...ith-index-and-value-difference-i-easy.html | 4 +- ...-index-and-value-difference-ii-medium.html | 4 +- ...o-make-binary-string-beautiful-medium.html | 4 +- ...istinct-element-sum-of-squares-i-easy.html | 4 +- ...-elements-with-maximum-frequency-easy.html | 4 +- ...mber-using-bitwise-questions-i-medium.html | 4 +- ...m-palindromes-after-operations-medium.html | 4 +- .../3000-3099/modify-the-matrix-easy.html | 4 +- ...barrays-that-match-a-pattern-i-medium.html | 4 +- ...eck-if-grid-satisfies-conditions-easy.html | 4 +- solutions/category/0000---0099.html | 4 +- solutions/category/0100---0199.html | 4 +- solutions/category/0200---0299.html | 4 +- solutions/category/0300---0399.html | 4 +- solutions/category/0400---0499.html | 4 +- solutions/category/0500---0599.html | 4 +- solutions/category/0600---0699.html | 4 +- solutions/category/0700---0799.html | 4 +- solutions/category/0800---0899.html | 4 +- solutions/category/0900---0999.html | 4 +- solutions/category/1000---1099.html | 4 +- solutions/category/1100---1199.html | 4 +- solutions/category/1200---1299.html | 4 +- solutions/category/1300---1399.html | 4 +- solutions/category/1400---1499.html | 4 +- solutions/category/1500---1599.html | 4 +- solutions/category/1600---1699.html | 4 +- solutions/category/1700---1799.html | 6 +-- solutions/category/1800---1899.html | 4 +- solutions/category/1900---1999.html | 4 +- solutions/category/2000---2099.html | 4 +- solutions/category/2100---2199.html | 4 +- solutions/category/2200---2299.html | 4 +- solutions/category/2300---2399.html | 4 +- solutions/category/2400---2499.html | 4 +- solutions/category/2500---2599.html | 4 +- solutions/category/2600---2699.html | 4 +- solutions/category/2700---2799.html | 4 +- solutions/category/2800---2899.html | 4 +- solutions/category/2900---2999.html | 4 +- solutions/category/3000---3099.html | 4 +- solutions/category/3100---3199.html | 4 +- solutions/tags.html | 6 +-- solutions/tags/array.html | 8 +-- solutions/tags/backtracking.html | 4 +- solutions/tags/bfs.html | 4 +- solutions/tags/binary-indexed-tree.html | 4 +- solutions/tags/binary-search-tree.html | 4 +- solutions/tags/binary-search.html | 4 +- solutions/tags/binary-tree.html | 4 +- solutions/tags/bit-manipulation.html | 4 +- solutions/tags/bit-manupulation.html | 4 +- solutions/tags/bit-masking.html | 4 +- solutions/tags/bitmask.html | 4 +- solutions/tags/breadth-first-search.html | 4 +- solutions/tags/bucket-sort.html | 4 +- solutions/tags/combinatorics.html | 4 +- solutions/tags/counting.html | 4 +- solutions/tags/data-stream.html | 4 +- solutions/tags/depth-first-search.html | 4 +- solutions/tags/design.html | 4 +- solutions/tags/dfs.html | 4 +- solutions/tags/divide-and-conquer.html | 4 +- solutions/tags/doubly-linked-list.html | 4 +- solutions/tags/dsu.html | 4 +- solutions/tags/dynamic-programming.html | 4 +- solutions/tags/enumeration.html | 4 +- solutions/tags/eulerian-circuit.html | 4 +- solutions/tags/game-theory.html | 4 +- solutions/tags/geometry.html | 4 +- solutions/tags/graph.html | 4 +- solutions/tags/graphs.html | 4 +- solutions/tags/greedy.html | 4 +- solutions/tags/hash-function.html | 4 +- solutions/tags/hash-map.html | 4 +- solutions/tags/hash-table.html | 4 +- solutions/tags/hashmap.html | 4 +- solutions/tags/heap-priority-queue.html | 4 +- solutions/tags/interactive.html | 4 +- solutions/tags/line-sweep.html | 4 +- solutions/tags/linked-list.html | 4 +- solutions/tags/math.html | 4 +- solutions/tags/matrix.html | 4 +- solutions/tags/memoization.html | 4 +- solutions/tags/merge-sort.html | 4 +- solutions/tags/minimum-spanning-tree.html | 4 +- solutions/tags/monotonic-queue.html | 4 +- solutions/tags/monotonic-stack.html | 4 +- solutions/tags/number-theory.html | 4 +- solutions/tags/ordered-set.html | 4 +- solutions/tags/prefix-sum.html | 4 +- solutions/tags/prime-factor.html | 4 +- solutions/tags/priority-queue.html | 4 +- solutions/tags/queue.html | 4 +- solutions/tags/quick-select.html | 4 +- solutions/tags/quickselect.html | 4 +- solutions/tags/recursion.html | 4 +- solutions/tags/rolling-hash.html | 4 +- solutions/tags/segment-tree.html | 4 +- solutions/tags/shortest-path.html | 4 +- solutions/tags/simulation.html | 4 +- solutions/tags/sliding-window.html | 4 +- solutions/tags/sorting.html | 4 +- solutions/tags/stack.html | 4 +- solutions/tags/string.html | 4 +- solutions/tags/topological-sort.html | 4 +- solutions/tags/tree.html | 4 +- solutions/tags/trie.html | 4 +- solutions/tags/two-pointer.html | 4 +- solutions/tags/two-pointers.html | 4 +- solutions/tags/union-find.html | 4 +- templates.html | 4 +- templates/binary-search.html | 4 +- templates/bit-manipulation.html | 4 +- templates/euler.html | 4 +- templates/fenwick-tree.html | 4 +- templates/graph-theory.html | 4 +- templates/linked-list.html | 4 +- templates/manachers-algorithm.html | 4 +- templates/ordered-set.html | 4 +- templates/prefix-sum.html | 4 +- templates/segment-tree.html | 4 +- templates/sparse-table.html | 4 +- templates/two-pointers.html | 4 +- tutorials/basic-topics/arrays.html | 4 +- tutorials/basic-topics/backtracking.html | 4 +- tutorials/basic-topics/binary-search.html | 4 +- tutorials/basic-topics/brute-force.html | 4 +- tutorials/basic-topics/greedy.html | 4 +- tutorials/basic-topics/hash-map.html | 4 +- tutorials/basic-topics/heap.html | 4 +- tutorials/basic-topics/kadane.html | 4 +- tutorials/basic-topics/linear-search.html | 4 +- tutorials/basic-topics/linked-list.html | 4 +- tutorials/basic-topics/mod.html | 4 +- tutorials/basic-topics/prefix-sum.html | 4 +- tutorials/basic-topics/queue-and-stack.html | 4 +- tutorials/basic-topics/sliding-window.html | 4 +- .../basic-topics/sorting/bubble-sort.html | 4 +- .../basic-topics/sorting/cyclic-sort.html | 4 +- .../basic-topics/sorting/insertion-sort.html | 4 +- .../basic-topics/sorting/introduction.html | 4 +- .../basic-topics/sorting/merge-sort.html | 4 +- .../basic-topics/sorting/selection-sort.html | 4 +- .../basic-topics/sorting/shell-sort.html | 4 +- tutorials/basic-topics/sorting/tim-sort.html | 4 +- tutorials/basic-topics/time-complexity.html | 4 +- tutorials/basic-topics/trie.html | 4 +- tutorials/basic-topics/two-pointers.html | 4 +- tutorials/category/basic-topics.html | 4 +- tutorials/category/graph-theory.html | 4 +- tutorials/category/math.html | 4 +- tutorials/category/number-theory.html | 4 +- tutorials/category/sorting.html | 4 +- tutorials/category/strings.html | 4 +- .../graph-theory/bellman-ford-algorithm.html | 4 +- .../graph-theory/binary-search-tree.html | 4 +- tutorials/graph-theory/binary-tree.html | 4 +- .../graph-theory/breadth-first-search.html | 4 +- .../graph-theory/depth-first-search.html | 4 +- tutorials/graph-theory/dijkstra.html | 4 +- .../graph-theory/disjoint-set-union.html | 4 +- tutorials/graph-theory/introduction.html | 4 +- tutorials/graph-theory/kahns-algorithm.html | 4 +- .../graph-theory/kruskals-algorithm.html | 4 +- tutorials/graph-theory/lca.html | 4 +- .../graph-theory/minimum-spanning-tree.html | 4 +- tutorials/graph-theory/tarjans-algorithm.html | 4 +- .../graph-theory/topological-sorting.html | 4 +- tutorials/math/bit-manipulation.html | 4 +- tutorials/math/combinatorics.html | 4 +- tutorials/math/matrix-exponentiation.html | 4 +- .../number-theory/binary-exponentiation.html | 4 +- .../number-theory/sieve-of-eratosthenes.html | 4 +- tutorials/math/prime-factors.html | 4 +- tutorials/strings/manachers-algorithm.html | 4 +- tutorials/strings/palindrome.html | 4 +- 815 files changed, 1678 insertions(+), 1624 deletions(-) delete mode 100644 assets/js/274d1c27.c59bbdb4.js create mode 100644 assets/js/274d1c27.f2a15cad.js create mode 100644 assets/js/33a6419c.afd6db52.js create mode 100644 assets/js/3e0aee77.aa2a41e2.js delete mode 100644 assets/js/3e0aee77.c90b7523.js rename assets/js/{46fa5532.0f687605.js => 46fa5532.4dd349e6.js} (72%) rename assets/js/{6cae2202.8c1eeaf9.js => 6cae2202.195e2cb4.js} (98%) delete mode 100644 assets/js/d398e51b.d7efb7be.js create mode 100644 assets/js/d398e51b.dbd65eaa.js delete mode 100644 assets/js/e8f83d04.45348956.js create mode 100644 assets/js/e8f83d04.545ac708.js rename assets/js/{main.d649bbe4.js => main.5bb87119.js} (63%) rename assets/js/{main.d649bbe4.js.LICENSE.txt => main.5bb87119.js.LICENSE.txt} (100%) delete mode 100644 assets/js/runtime~main.0f588b76.js create mode 100644 assets/js/runtime~main.2f6cb6d2.js create mode 100644 solutions/1700-1799/find-nearest-point-that-has-the-same-x-or-y-coordinate-easy.html diff --git a/404.html b/404.html index 911cef60800..554f9838ed0 100644 --- a/404.html +++ b/404.html @@ -21,8 +21,8 @@ - - + +
Skip to main content