Unique Character Groups

Given a string composed of lowercase letters, divide it into groups such that each group contains unique characters only. Your task is to find the minimum number of groups needed such that every group has unique characters. If a character appears multiple times, it must be placed in separate groups. Input Format: A single line containing a string of lowercase letters. Output Format: An integer representing the minimum number of groups needed. Example: Input: aabbccdde Output: 5 Explanation: We can create the groups as follows: {'a', 'b', 'c', 'd', 'e'}, with each letter from the input occupying its own position in different groups until they are exhausted.