A string s is called good if there are no two different characters in s that have the same frequency.
Given a string s, return the minimum number of characters you need to delete to make s good.
The frequency of a character in a string is the number of times it appears in the string. For example, in the string "aab", the frequency of 'a' is 2, while the frequency of 'b' is 1.
Example 1:
Input: s = "aab"
Output: 0
Explanation: s is already good.
Example 2:
Input: s = "aaabbbcc" Output: 2 Explanation: You can delete two 'b's resulting in the good string "aaabcc". Another way it to delete one 'b' and one 'c' resulting in the good string "aaabbc".
Example 3:
Input: s = "ceabaacb" Output: 2 Explanation: You can delete both 'c's resulting in the good string "eabaab". Note that we only care about characters that are still in the string at the end (i.e. frequency of 0 is ignored).
Constraints:
1 <= s.length <= 105s contains only lowercase English letters.class Solution {
public:
vector<vector<int>> dp;
int solve(vector<int>& nums, vector<int>& multipliers, int start, int i) {
if(i>= multipliers.size())
return 0;
if(dp[start][i]==INT_MIN){
// Since, nums.size() - end + start - 1 = i => Therefore, we can say :
int end = nums.size() - 1 - i + start;
dp[start][i] = max(solve(nums, multipliers, start, i+1) + nums[end]*multipliers[i], solve(nums, multipliers, start+1, i+1) + nums[start]*multipliers[i]);
}
return dp[start][i];
}
int maximumScore(vector<int>& nums, vector<int>& multipliers) {
dp.resize(multipliers.size()+1,vector<int>(multipliers.size()+1,INT_MIN));
return solve(nums, multipliers, 0, 0);
}
};class Solution {
public:
int minDeletions(string s) {
int res = 0;
map <int, char> m1;
map <char, int> m2;
for(auto e: s)
m2[e]++;
for(auto [A, F]: m2){
int temp = F;
if(!m1[temp]);
else while(m1[temp] && temp--) res++;
m1[temp] = A;
}
return res;
}
};