Files

.cursor
leetcode
- 1.two-sum.md
- 100.same-tree.md
- 1002.find-common-characters.md
- 1004.max-consecutive-ones-iii.md
- 101.symmetric-tree.md
- 1010.pairs-of-songs-with-total-durations-divisible-by-60.md
- 1011.capacity-to-ship-packages-within-d-days.md
- 1014.best-sightseeing-pair.md
- 102.binary-tree-level-order-traversal.md
- 1021.remove-outermost-parentheses.md
- 1022.sum-of-root-to-leaf-binary-numbers.md
- 1024.video-stitching.md
- 1026.maximum-difference-betwwen-node-and-ancestor.md
- 103.binary-tree-zigzag-level-order-traversal.md
- 1031.maximum-sum-of-two-non-overlapping-subarrays.md
- 1038.binary-search-tree-to-greater-sum-tree.md
- 104.maximum-depth-of-binary-tree.md
- 1042.flower-planting-with-no-adjacent.md
- 1046.last-stone-weight.md
- 1047.remove-all-adjacent-duplicates-in-string.md
- 105.construct-binary-tree-from-preorder-and-inorder-traversal.md
- 1051.height-checker.md
- 108.convert-sorted-array-to-binary-search-tree.md
- 1089.duplicate-zeros.md
- 1091.shortest-path-in-binary-matrix.md
- 1094.car-pooling.md
- 1095.find-in-mountain-array.md
- 11.container-with-most-water.md
- 110.balanced-binary-tree.md
- 1106.parsing-a-boolean-expression.md
- 111.minimum-depth-of-binary-tree.md
- 1110.delete-nodes-and-return-forest.md
- 112.path-sum.md
- 1129.shortest-path-with-alternating-colors.md
- 113.path-sum-ii.md
- 114.flatten-binary-tree-to-linked-list.md
- 1145.binary-tree-coloring-game.md
- 1146.snapshot-array.md
- 1155.number-of-dice-rolls-with-target-sum.md
- 116.populating-next-right-pointers-in-each-node.md
- 1161.maximum-level-sum-of-a-binary-tree.md
- 1162.as-far-from-land-as-possible.md
- 1171.remove-zero-sum-consecutive-nodes-from-linked-list.md
- 1190.reverse-substrings-between-each-pair-of-parentheses.md
- 121.best-time-to-buy-and-sell-stock.md
- 122.best-time-to-buy-and-sell-stock-ii.md
- 123.best-time-to-buy-and-sell-stock-iii.md
- 1234.replace-the-substring-for-balanced-string.md
- 1235.maximum-profit-in-job-scheduling.md
- 124.binary-tree-maximum-path-sum.md
- 1249.minimum-remove-to-make-valid-parentheses.md
- 1254.number-of-closed-islands.md
- 127.word-ladder.md
- 128.longest-consecutive-sequence.md
- 1283.find-the-smallest-divisor-given-a-threshold.md
- 1288.remove-covered-intervals.md
- 129.sum-root-to-leaf-numbers.md
- 1293.shortest-path-in-a-grid-with-obstacles-elimination.md
- 1295.find-numbers-with-even-number-of-digits.md
- 1299.replace-elements-with-greatest-element-on-right-side.md
- 130.surrounded-regions.md
- 1306.jump-game-iii.md
- 131.palindrome-partitioning.md
- 1315.sum-of-nodes-with-even-valued-grandparent.md
- 1319.number-of-operations-to-make-network-connected.md
- 1325.delete-leaves-with-a-given-value.md
- 1326.minimum-number-of-taps-to-open-to-water-a-garden.md
- 133.clone-graph.md
- 1337.the-k-weakest-rows-in-a-matrix.md
- 1339.maximum-product-of-splitted-binary-tree.md
- 134.gas-station.md
- 1343.number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.md
- 1346.check-if-n-and-its-double-exist.md
- 135.candy.md
- 1351.count-negative-numbers-in-a-sorted-matrix.md
- 136.single-number.md
- 1367.linked-list-in-binary-tree.md
- 1372.longest-zigzag-path-in-a-binary-tree.md
- 1376.time-needed-to-inform-all-employees.md
- 138.copy-list-with-random-pointers.md
- 1382.balance-a-binary-search-tree.md
- 139.word-break.md
- 1396.design-underground-system.md
- 1405.longest-happy-string.md
- 141.linked-list-cycle.md
- 142.linked-list-cycle-ii.md
- 1423.maximum-points-you-can-obtain-from-cards.md
- 143.reorder-list.md
- 1439.find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows.md
- 1443.minimum-time-to-collect-all-apples-in-a-tree.md
- 1446.consecutive-characters.md
- 1448.count-good-nodes-in-binary-tree.md
- 1456.maximum-number-of-vowels-in-a-substring-of-given-length.md
- 1457.pseudo-palindromic-paths-in-a-binary-tree.md
- 146.lru-cache.md
- 1461.check-if-a-string-contains-all-binary-codes-of-size-k.md
- 1472.design-browser-history.md
- 148.sort-list.md
- 1482.minimum-number-of-days-to-make-m-bouquets.md
- 1493.longest-subarray-of-1s-after-deleting-one-element.md
- 15.3sum.md
- 150.evaluate-reverse-polish-notation.md
- 1509.minimum-difference-between-largest-and-smallest-value-in-three-moves.md
- 1512.number-of-good-pairs.md
- 1514.path-with-maximum-probability.md
- 1519.number-of-nodes-in-the-sub-tree-with-the-same-label.md
- 152.maximum-product-subarray.md
- 1529.minimum-suffix-flips.md
- 153.find-minimum-in-rotated-sorted-array.md
- 1530.number-of-good-leaf-nodes-pairs.md
- 1541.minimum-insertions-to-balance-a-parentheses-string.md
- 1544.make-the-string-great.md
- 155.min-stack.md
- 1552.magnetic-force-between-two-balls.md
- 1559.detect-cycles-in-2d-grid.md
- 1574.shortest-subarray-to-be-removed-to-make-array-sorted.md
- 1578.minimum-time-to-make-rope-colorful.md
- 1588.sum-of-all-odd-length-subarrays.md
- 16.3sum-closest.md
- 160.intersection-of-two-linked-lists.md
- 1614.maximum-nesting-depth-of-the-parentheses.md
- 162.find-peak-element.md
- 1631.path-with-minimum-effort.md
- 1636.sort-array-by-increasing-frequency.md
- 1642.furthest-building-you-can-reach.md
- 1647.minimum-deletions-to-make-character-frequencies-unique.md
- 1652.defuse-the-bomb.md
- 1669.merge-in-between-linked-lists.md
- 167.two-sum-ii-input-array-is-sorted.md
- 1679.max-number-of-k-sum-pairs.md
- 1685.sum-of-absolute-differences-in-a-sorted-array.md
- 169.majority-element.md
- 1695.maximum-erasure-value.md
- 17.letter-combinations-of-a-phone-number.md
- 173.binary-search-tree-iterator.md
- 1749.maximum-absolute-sum-of-any-subarray.md
- 1750.minimum-length-of-string-after-deleting-similar-ends.md
- 1759.count-number-of-homogenous-substrings.md
- 1760.minimum-limit-of-balls-in-a-bag.md
- 1775.equal-sum-arrays-with-minimum-number-of-operations.md
- 1790.check-if-one-string-swap-can-make-strings-equal.md
- 1814.count-nice-pairs-in-an-array.md
- 1823.find-the-winner-of-the-circular-game.md
- 1834.single-threaded-cpu.md
- 1845.seat-reservation-manager.md
- 1855.maximum-distance-between-a-pair-of-values.md
- 1870.minimum-speed-to-arrive-on-time.md
- 1876.substrings-of-size-three-with-distinct-characters.md
- 1887.reduction-operations-to-make-the-array-elements-equal.md
- 189.rotate-array.md
- 1893.check-if-all-the-integers-in-a-range-are-covered.md
- 19.remove-nth-node-from-end-of-list.md
- 1905.count-sub-islands.md
- 1926.nearest-exit-from-entrance-in-maze.md
- 1963.minimum-number-of-swaps-to-make-the-string-balanced.md
- 1971.find-if-path-exists-in-graph.md
- 198.house-robber.md
- 1984.minimum-difference-between-highest-and-lowest-of-k-scores.md
- 199.binary-tree-right-side-view.md
- 2.add-two-numbers.md
- 20.valid-parentheses.md
- 200.number-of-islands.md
- 202.happy-number.md
- 203.remove-linked-list-elements.md
- 2054.two-best-non-overlapping-events.md
- 2055.plates-between-candle.md
- 206.reverse-linked-list.md
- 2064.minimized-maximum-of-products-distributed-to-any-store.md
- 207.course-schedule.md
- 208.implement-trie.md
- 209.minimum-size-subarray-sum.md
- 2090.k-radius-subarray-averages.md
- 2092.find-all-people-with-secret.md
- 2095.delete-the-middle-node-of-a-linked-list.md
- 21.merge-two-sorted-lists.md
- 210.course-schedule-ii.md
- 2101.detonate-the-maximum-bombs.md
- 2104.sum-of-subarray-ranges.md
- 2115.find-all-possible-recipes-from-given-supplies.md
- 212.word-search-ii.md
- 213.house-robber-ii.md
- 215.kth-largest-element-in-an-array.md
- 216.combination-sum-iii.md
- 217.contains-duplicate.md
- 2181.merge-nodes-in-between-zeros.md
- 2187.minimum-time-to-complete-trips.md
- 219.contains-duplicate-ii.md
- 2192.all-ancestors-of-a-node-in-a-directed-acyclic-graph.md
- 2196.create-binary-tree-from-descriptions.md
- 22.generate-parentheses.md
- 221.maximal-square.md
- 2226.maximum-candies-allocated-to-k-children.md
- 224.basic-calculator.md
- 2246.longest-path-with-different-adjacent-characters.md
- 225.implement-stack-using-queues.md
- 226.invert-binary-tree.md
- 2265.count-nodes-equal-to-average-of-subtree.md
- 227.basic-calculator-ii.md
- 228.summary-ranges.md
- 23.merge-k-sorted-lists.md
- 230.kth-smallest-element-in-a-bst.md
- 2300.successful-pairs-of-spells-and-potions.md
- 2316.count-unreachable-pairs-of-nodes-in-an-undirected-graph.md
- 232.implement-queue-using-stacks.md
- 2331.evaluate-boolean-binary-tree.md
- 2336.smallest-number-in-infinite-set.md
- 2337.move-pieces-to-obtain-a-string.md
- 234.palindrome-linked-list.md
- 235.lowest-common-acestor-of-a-binary-search-tree.md
- 236.lowest-common-ancestor-of-a-binary-tree.md
- 237.delete-node-in-a-linked-list.md
- 238.product-of-array-except-self.md
- 2381.shifting-letters-ii.md
- 2385.amount-of-time-for-binary-tree-to-be-infected.md
- 2389.longest-subsequence-with-limited-sum.md
- 239.sliding-window-maximium.md
- 24.swap-nodes-in-pairs.md
- 240.search-a-2d-matrix-ii.md
- 2406.divide-intervals-into-minimum-number-of-groups.md
- 242.valid-anagram.md
- 2439.minimize-maximum-of-array.md
- 2461.maximum-sum-of-distinct-subarrays-with-length-k.md
- 2462.total-cost-to-hire-k-workers.md
- 2471.minimum-number-of-operations-to-sort-a-binary-tree-by-level.md
- 2477.minimum-fuel-cost-to-report-to-the-capital.md
- 2487.remove-nodes-from-linked-list.md
- 2492.minimum-score-of-a-path-between-two-cities.md
- 25.reverse-nodes-in-k-group.md
- 252.meeting-rooms-i.md
- 253.meeting-rooms-ii.md
- 2559.count-vowel-strings-in-ranges.md
- 2560.house-robber-iv.md
- 2563.count-the-number-of-fair-pairs.md
- 257.binary-tree-paths.md
- 2576.find-the-maximum-number-of-marked-indices.md
- 2592.maximize-greatness-of-an-array.md
- 2594.minimum-time-to-repair-cars.md
- 26.remove-duplicates-from-sorted-array.md
- 263.ugly-number.md
- 264.ugly-number-ii.md
- 2641.cousins-in-binary-tree-ii.md
- 268.missing-number.md
- 27.remove-element.md
- 2779.maximum-beauty-of-an-array-after-applying-operation.md
- 278.first-bad-version.md
- 279.perfect-squares.md
- 2799.count-complete-subarrays-in-an-array.md
- 283.move-zeros.md
- 2848.points-that-intersect-with-cars.md
- 2866.beautiful-towers-ii.md
- 287.find-the-duplicate-number.md
- 2874.maximum-value-of-an-ordered-triplet-ii.md
- 2875.minimum-size-subarray-in-infinite-array.md
- 290.word-pattern.md
- 2909.minimum-sum-of-mountain-triplets-ii.md
- 295.find-median-from-data-stream.md
- 297.serialize-and-deserialize-binary-tree.md
- 3.longest-substring-without-repeating-characters.md
- 300.longest-increasing-subsequence.md
- 303.range-sum-query-immutable.md
- 309.best-time-to-buy-and-sell-stock-with-cooldown.md
- 31.next-permutation.md
- 310.minimum-height-trees.md
- 313.super-ugly-number.md
- 316.remove-duplicate-letters.md
- 32.longest-valid-parentheses.md
- 322.coin-change.md
- 328.odd-even-linked-list.md
- 33.search-in-rotated-sorted-array.md
- 3319.k-th-largest-perfect-subtree-size-in-binary-tree.md
- 3325.count-substrings-with-k-frequency-characters-i.md
- 334.increasing-triplet-subsequence.md
- 3355.zero-array-transformation-i.md
- 337.house-robber-iii.md
- 3397.maximum-number-of-distinct-elements-after-operations.md
- 34.find-first-and-last-position-of-element-in-sorted-array.md
- 3408.design-task-manager.md
- 341.flatten-nested-list-iterator.md
- 3413.maximum-coins-from-k-consecutive-bags.md
- 344.reverse-string.md
- 347.top-k-frequent-elements.md
- 3478.choose-k-elements-with-maximum-sum.md
- 35.search-insert-position.md
- 350.intersection-of-two-arrays-ii.md
- 355.design-twitter.md
- 3552.grid-teleportation-traversal.md
- 3568.minimum-moves-to-clean-the-classroom.md
- 36.valid-sudoku.md
- 373.find-k-pairs-with-smallest-sums.md
- 374.guess-number-higher-or-lower.md
- 377.combination-sum-iv.md
- 378.kth-smallest-element-in-a-sorted-matrix.md
- 380.insert-delete-getrandom-o1.md
- 381.insert-delete-getrandom-o1-duplicates-allowed.md
- 382.linked-list-random-node.md
- 387.first-unique-character-in-a-string.md
- 39.combination-sum.md
- 392.is-subsequence.md
- 394.decode-string.md
- 399.evaluate-division.md
- 40.combination-sum-ii.md
- 402.remove-k-digits.md
- 404.sum-of-left-leaves.md
- 41.first-missing-positive.md
- 410.split-array-largest-sum.md
- 416.partition-equal-subset-sum.md
- 417.pacific-atlantic-water-flow.md
- 42.trapping-rain-water.md
- 424.longest-repeating-character-replacement.md
- 430.flatten-a-multilevel-doubly-linked-list.md
- 433.minimum-genetic-mutation.md
- 435.non-overlapping-intervals.md
- 437.path-sum-iii.md
- 438.find-all-anagrams-in-a-string.md
- 442.find-all-duplicates-in-an-array.md
- 448.find-all-numbers-disappeared-in-an-array.md
- 45.jump-game-ii.md
- 450.delete-node-in-a-bst.md
- 451.sort-charaters-by-frequency.md
- 452.minimum-number-of-arrows-to-burst-balloons.md
- 455.assign-cookies.md
- 46.permutations.md
- 463.island-perimeter.md
- 47.permutations-ii.md
- 475.heaters.md
- 48.rotate-image.md
- 485.max-consecutive-ones.md
- 49.group-anagrams.md
- 494.target-sum.md
- 496.next-greater-element-i.md
- 5.longest-palindromic-substring.md
- 502.ipo.md
- 503.next-greater-element-ii.md
- 508.most-frequent-subtree-sum.md
- 509.fibonacci-number.md
- 513.find-bottom-left-tree-value.md
- 516.longest-palindromic-subsequence.md
- 518.coin-change-2.md
- 53.maximum-subarray.md
- 530.minimum-absolute-difference-in-bst.md
- 532.k-diff-pairs-in-an-array.md
- 535.encode-and-decode-tinyurl.md
- 54.spiral-matrix.md
- 540.single-element-in-a-sorted-array.md
- 542.01-matrix.md
- 543.diameter-of-binary-tree.md
- 55.jump-game.md
- 554.brick-wall.md
- 56.merge-intervals.md
- 560.subarray-sum-equals-k.md
- 563.binary-tree-tilt.md
- 567.permutation-in-string.md
- 57.insert-interval.md
- 572.subtree-of-another-tree.md
- 581.shortest-unsorted-continuous-subarray.md
- 59.spiral-matrix-ii.md
- 605.can-place-flowers.md
- 606.construct-string-from-binary-tree.md
- 61.rotate-list.md
- 611.valid-triangle-number.md
- 617.merge-two-binary-trees.md
- 62.unique-paths.md
- 621.task-scheduler.md
- 622.design-circular-queue.md
- 623.add-one-row-to-tree.md
- 624.maximum-distance-in-arrays.md
- 63.unique-paths.ii.md
- 633.sum-of-square-numbers.md
- 636.exclusive-time-of-functions.md
- 637.average-of-levels-in-binary-tree.md
- 64.minimum-path-sum.md
- 641.design-circular-deque.md
- 645.set-mismatch.md
- 646.maximum-length-of-pair-chain.md
- 647.palindromic-substrings.md
- 652.find-duplicate-subtrees.md
- 653.two-sum-iv-input-is-a-bst.md
- 654.maximum-binary-tree.md
- 658.find-k-closest-elements.md
- 662.maximum-width-of-binary-tree.md
- 665.non-decreasing-array.md
- 669.trim-a-binary-search-tree.md
- 671.second-minimum-node-in-a-binary-tree.md
- 673.number-of-longest-increasing-subsequence.md
- 674.longest-continuous-increasing-subsequence.md
- 678.valid-parenthesis-string.md
- 684.redundant-connection.md
- 687.longest-univalue-path.md
- 69.sqrt(x).md
- 692.top-k-frequent-words.md
- 695.max-area-of-island.md
- 697.degree-of-an-array.md
- 70.climbing-stairs.md
- 700.search-in-a-binary-search-tree.md
- 701.insert-into-a-binary-search-tree.md
- 703.kth-largest-element-in-a-stream.md
- 704.binary-search.md
- 705.design-hashset.md
- 706.design-hashmap.md
- 707.design-linked-list.md
- 71.simplify-path.md
- 713.subarray-product-less-than-k.md
- 718.maximum-length-of-repeated-subarray.md
- 721.accounts-merge.md
- 725.split-linked-list-in-parts.md
- 726.number-of-atoms.md
- 729.my-calendar-i.md
- 73.set-matrix-zeros.md
- 733.flood-fill.md
- 735.asteroid-collision.md
- 739.daily-temperatures.md
- 74.search-a-2d-matrix.md
- 743.network-delay-time.md
- 746.min-cost-climbing-stairs.md
- 75.sort-colors.md
- 752.open-the-lock.md
- 759.employee-free-time.md
- 76.minimum-window-substring.md
- 763.partition-labels.md
- 766.toeplitz-matrix.md
- 767.reorganize-string.md
- 77.combinations.md
- 777.swap-adjacent-in-lr-string.md
- 78.subsets.md
- 785.is-graph-bipartite.md
- 787.cheapest-flights-within-k-stops.md
- 79.word-search.md
- 792.number-of-matching-subsequences.md
- 797.all-paths-from-source-to-target.md
- 799.champagne-tower.md
- 80.remove-duplicates-from-sorted-array-ii.md
- 814.binary-tree-pruning.md
- 817.linked-list-components.md
- 82.remove-dpulicates-from-sorted-list-ii.md
- 826.most-profit-assigning-work.md
- 827.making-a-large-island.md
- 83.remove-duplicates-from-sorted-list.md
- 84.largest-rentangle-in-histogram.md
- 841.keys-and-rooms.md
- 844.backspace-string-compare.md
- 845.longest-mountain-in-array.md
- 856.score-of-parentheses.md
- 857.minimum-cost-to-hire-k-workers.md
- 859.buddy-strings.md
- 86.partition-list.md
- 861.score-after-flipping-matrix.md
- 863.all-nodes-distance-k-in-binary-tree.md
- 865.smallest-subtree-with-all-the-deepest-nodes.md
- 871.minimum-number-of-refueling-stops.md
- 872.leaf-similar-trees.md
- 875.koko-eating-bananas.md
- 876.middle-of-the-linked-list.md
- 88.merge-sorted-array.md
- 881.boats-to-save-people.md
- 886.possible-bipartition.md
- 895.maximum-frequency-stack.md
- 896.monotonic-array.md
- 897.increasing-order-search-tree.md
- 90.subsets-ii.md
- 901.online-stock-span.md
- 904.fruit-into-baskets.md
- 905.sort-array-by-parity.md
- 907.sum-of-subarray-minimums.md
- 916.word-subsets.md
- 919.complete-binary-tree-inserter.md
- 92.reverse-linked-list-ii.md
- 921.minimum-add-to-make-parentheses-valid.md
- 922.sort-array-by-parity-ii.md
- 923.3sum-with-multiplicity.md
- 925.long-pressed-name.md
- 934.shortest-bridge.md
- 94.binary-tree-inorder-traversal.md
- 941.valid-mountain-array.md
- 945.minimum-increment-to-make-array-unique.md
- 946.validate-stack-sequences.md
- 948.bag-of-tokens.md
- 958.check-completeness-of-a-binary-tree.md
- 96.unique-binary-search-trees.md
- 965.univalued-binary-tree.md
- 967.numbers-with-same-consecutive-differences.md
- 973.k-closest-points-to-origin.md
- 977.squares-of-a-sorted-array.md
- 978.longest-turbulent-subarray.md
- 979.distribute-coins-in-binary-tree.md
- 98.validate-binary-search-tree.md
- 980.unique-paths-iii.md
- 981.time-based-key-value-store.md
- 983.minimum-cost-for-tickets.md
- 984.string-without-aaa-or-bbb.md
- 986.interval-list-intersections.md
- 988.smallest-string-starting-from-leaf.md
- 989.add-to-array-form-of-integer.md
- 993.cousins-in-binary-tree.md
- 994.rotting-orange.md
media
problems
topics
.gitignore
Algorithms.code-workspace
LICENSE
README.md

647.palindromic-substrings.md

Problems/dp (#25 )

Aug 8, 2022

8242fc5 · Aug 8, 2022

647. Palindromic Substrings

It was very similar to 5. Longest Palindromic Substring, so just use the same way (with small modification) to solve it.