Company: amazon_3march
Difficulty: medium
A team at Amazon is working to ensure all packages are correctly sorted for delivery. Each package has a label represented by an uppercase English letter. The full list of labels is given as the string packages , where the i th character is the label of the i th package. To optimize the sorting process, the team wants to analyze each prefix of the string packages (from length 1 to n ) and determine the maximum number of equal parts it can be divided into. Each part must satisfy the following conditions: Each part must have the same frequency of every character as every other part in that division Given a string packages , calculate for each prefix t (from length 1 to n ), the maximum number of equal parts into which the prefix can be divided, such that each part has the same number of occurrences of each character. Example Given, packages = "ABAB". In the given example t represents prefix string and length represents the length of the prefix string. Prefix string length Explanation Max