Skip to content
Related Articles

Related Articles

Minimize ASCII values sum after removing all occurrences of one character
  • Last Updated : 12 Apr, 2019

Given a string str, the task is to minimize the sum of ASCII values of each character of str after removing every occurrence of a particular character.

Examples:

Input: str = “geeksforgeeks”
Output: 977
‘g’ occurs twice -> 2 * 103 = 206
‘e’ occurs 4 times -> 4 * 101 = 404
‘k’ occurs twice -> 2 * 107 = 214
‘s’ occurs twice -> 2 * 115 = 230
‘f’ occurs once -> 1 * 102 = 102
‘o’ occurs once -> 1 * 111 = 111
‘r’ occurs once -> 1 * 114 = 114
Total sum = 1381
In order to minimize the sum, remove all the occurrences of ‘e’ from the string
And the new sum becomes 1381 – 404 = 977

Input: str = “abcd”
Output: 294

Approach:

  1. Take the sum of all ASCII values in the given string.
  2. Also store the occurrences of each of the character of the string.
  3. Remove every occurrence of the character which is contributing the maximum value to the sum i.e. whose occurrence * ASCII is maximum.

Below is the implementation of the above approach:

C++




// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
  
// Function to return the minimized sum
int getMinimizedSum(string str, int len)
{
    int i, maxVal = INT_MIN, sum = 0;
  
    // To store the occurrences of
    // each character of the string
    int occurrences[26] = { 0 };
    for (i = 0; i < len; i++) {
  
        // Update the occurrence
        occurrences[str[i] - 'a']++;
  
        // Calculate the sum
        sum += (int)str[i];
    }
  
    // Get the character which is contributing
    // the maximum value to the sum
    for (i = 0; i < 26; i++)
  
        // Count of occurrence of the character
        // multiplied by its ASCII value
        maxVal = max(maxVal, occurrences[i] * (i + 'a'));
  
    // Return the minimized sum
    return (sum - maxVal);
}
  
// Driver code
int main()
{
    string str = "geeksforgeeks";
    int len = str.length();
    cout << getMinimizedSum(str, len);
  
    return 0;
}

Java




// Java implementation of the approach
import java.util.Arrays;
import java.lang.Math;
  
class GfG
{
  
    // Function to return the minimized sum 
    static int getMinimizedSum(String str, int len) 
    
        int i, maxVal = Integer.MIN_VALUE, sum = 0
      
        // To store the occurrences of 
        // each character of the string 
        int occurrences[] = new int[26];
        Arrays.fill(occurrences, 0);
          
        for (i = 0; i < len; i++) 
        
      
            // Update the occurrence 
            occurrences[str.charAt(i) - 'a']++; 
      
            // Calculate the sum 
            sum += (int)str.charAt(i); 
        
      
        // Get the character which is contributing 
        // the maximum value to the sum 
        for (i = 0; i < 26; i++) 
      
            // Count of occurrence of the character 
            // multiplied by its ASCII value 
            maxVal = Math.max(maxVal, occurrences[i] * (i + 'a')); 
      
        // Return the minimized sum 
        return (sum - maxVal); 
    
  
    // Driver code
    public static void main(String []args){
          
        String str = "geeksforgeeks"
        int len = str.length(); 
        System.out.println(getMinimizedSum(str, len));
    }
}
  
// This code is contributed by Rituraj Jain

Python3




# Python3 implementation of the approach 
import sys
  
# Function to return the minimized sum 
def getMinimizedSum(string, length) :
  
    maxVal = -(sys.maxsize - 1)
    sum = 0
  
    # To store the occurrences of 
    # each character of the string 
    occurrences = [0] * 26;
      
    for i in range(length) :
  
        # Update the occurrence 
        occurrences[ord(string[i]) - 
                    ord('a')] += 1
  
        # Calculate the sum 
        sum += ord(string[i]); 
  
    # Get the character which is contributing 
    # the maximum value to the sum 
    for i in range(26) :
  
        # Count of occurrence of the character 
        # multiplied by its ASCII value 
        count = occurrences[i] * (i + ord('a'))
        maxVal = max(maxVal, count); 
  
    # Return the minimized sum 
    return (sum - maxVal); 
  
# Driver code 
if __name__ == "__main__"
  
    string = "geeksforgeeks"
    length = len(string); 
      
    print(getMinimizedSum(string, length)); 
  
# This code is contributed by Ryuga

C#




// C# implementation of the approach
using System;
  
class GfG
{
  
    // Function to return the minimized sum 
    static int getMinimizedSum(string str, int len) 
    
        int i, maxVal = Int32.MinValue, sum = 0; 
      
        // To store the occurrences of 
        // each character of the string 
        int [] occurrences = new int[26];
          
        for (i = 0; i < len; i++) 
        
      
            // Update the occurrence 
            occurrences[str[i] - 'a']++; 
      
            // Calculate the sum 
            sum += (int)str[i]; 
        
      
        // Get the character which is contributing 
        // the maximum value to the sum 
        for (i = 0; i < 26; i++) 
      
            // Count of occurrence of the character 
            // multiplied by its ASCII value 
            maxVal = Math.Max(maxVal, occurrences[i] * (i + 'a')); 
      
        // Return the minimized sum 
        return (sum - maxVal); 
    
  
    // Driver code
    public static void Main()
    {
        string str = "geeksforgeeks"
        int len = str.Length; 
        Console.WriteLine(getMinimizedSum(str, len));
    }
}
  
// This code is contributed by ihritik
Output:
977



My Personal Notes arrow_drop_up
Recommended Articles
Page :