Minimize String Length

Given a string s, you have two types of operation:

1. Choose an index i in the string, and let c be the character in position i. Delete the closest occurrence of c to the left of i (if exists).

2. Choose an index i in the string, and let c be the character in position i. Delete the closest occurrence of c to the right of i (if exists).

Your task is to minimize the length of s by performing the above operations zero or more times.

Return an integer denoting the length of the minimized string.

LeetCode Problem - 2716

class Solution {
    public int minimizedStringLength(String s) {
        // Initialize a set to store unique characters from the string
        Set<Character> set = new HashSet<>();

        // Iterate through each character in the string
        for (char ch : s.toCharArray()) {
            // Add each character to the set (duplicates are automatically handled)
            set.add(ch);
        }

        // The size of the set represents the number of unique characters
        return set.size();
    }
}