Problem Statement

Slice master Problem Description Your friends and you are playing a game called Slice master. You are given a string S. The motive of the game is to slice String S into parts such that each letter appears in at most one part. After slicing, your total points will be calculated as follows: For each length X, you will be allotted X^2 points. Return the minimum possible points a player can score while playing Slice master with String S. Note: The slicing should be such that a particular character is present in at most one part. For example: If part 1 has letters [a, m, i, q] then these letters cannot be present in any other part. Find the minimum possible points a player can score while playing Slice master with String S. Function description Complete the Solve() function. This function takes the following argument and the minimum possible points a player can get while playing Slice master: S: Represents the string to be sliced Input format for custom testing Note: Use this input format i