Available question text
Given an array of colored boxes where removing a contiguous group of k identical boxes yields k^2 points, compute the maximum score by choosing removals that may merge equal-colored boxes separated by others. This is a classic interval DP/memoization problem over subarray ranges with an extra parameter tracking same-color extensions (n ≤ 100).
Related questions
Continue with questions that share topics or the same question type.
- Apple Redistribution into Boxes
Coding
- Building Boxes
Coding · Binary Search · Greedy · Math
- Delivering Boxes from Storage to Ports
Coding
- Design a Data Structure with Insert, Remove, and GetRandom for Unique Elements in O(1)
Coding
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
No company association
Leetcode 546. Remove Boxes
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source