Add Leetcode 546. Remove Boxes in C++

[Abhi01goenka]

Description

Contribute Remove Boxes Problem

Why This Problem?

This problem falls under Leetcode Hard category involving the concept of Partition Dynamic Programming.

Contribution Guidelines

To contribute this DSA problem, I am willing to:

• Provide well-formatted description of the problem
• Give Examples and constraints
• Provide a sample solution in C++
• Use descriptive variable names and detailed comments.

DSA Problem

Problem Details

Problem Name: Remove Boxes

Problem Description:

You are given several boxes with different colors represented by different positive numbers. You may experience several rounds to remove boxes until there is no box left. Each time you can choose some continuous boxes with the same color (i.e., composed of k boxes, k >= 1), remove them and get k * k points. Return the maximum points you can get.

Constraints:

• 1 <= boxes.length <= 100
• 1 <= boxes[i] <= 100

Screenshots

[iamdestinychild]

make sure you give the project a star and read the contribution.md to know how to contribute