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 part of 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 max one part. For example, if part 1 has letters [a, m, i, g, d] then these letters cannot be present in any other part. Complete the solve() function. This function takes the following argument: S : Represents the string to be sliced. Input format for custom testing: Note: Use this input format if you are testing against custom input or writing code in a language where we don't provide boilerplate code. The first line contains a string S denoting the String to be slic