Available question text
Given an integer array, repeatedly remove contiguous subarrays that are palindromes and return the minimum number of moves to delete the whole array. This is an interval DP problem: compute minimal removals for each subarray with transitions for splitting and for merging when endpoints can be removed together (matching values).
Related questions
Continue with questions that share topics or the same question type.
- Break a Palindrome
Coding
- Can Make Palindrome from Substring
Coding
- Construct K Palindrome Strings
Coding
- Count Paths That Can Form a Palindrome in a Tree
Coding · Bit Manipulation · Depth-First Search · Hash Table
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Yahoo
Leetcode 1246. Palindrome Removal
Reported Jan 16, 2026 · 1 source report
JUNIOR
Source snapshot: Nov 12, 2026
View source