Leetcode 546. Remove Boxes

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).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 546. Remove Boxes

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact