Crayon Removal Scoring Game

Problem Statement

Crayon Removal Scoring Game You have a container filled with crayons of various colors, where each color is represented by a different alphabet letter. In each move, you can eliminate a sequence of adjacent crayons that share the same color. You may repeat this process multiple times until the container becomes empty. For each move, you must select a continuous group of identical colored crayons (group of x crayons, where x ≥ 1). Upon removing them, you earn x*x points. You are provided with an integer N representing the total count of crayons in the container. You also receive an array colors containing the N colors in the container, where each color is denoted by an English alphabet letter. Calculate the maximum points you can achieve in this scenario. Function description Complete the solve() function. This function takes the following 2 arguments and returns the answer. Parameters: N : Represents the total crayons in the box colors[] : Represents the array of colors of crayons i