Minimum number of letters needed to make a total of n in C++.

Problem statement

Given an integer n and let a = 1, b = 2, c= 3, ….., z = 26. The task is to find the minimum number of letters needed to make a total of n

If n = 23 then output is 1
If n = 72 then output is 3(26 + 26 + 20)

Algorithm

1. If n is divisible by 26 then answer is (n/26)
2. If n is not divisible by 26 then answer is (n/26) + 1

Example

#include <iostream>
using namespace std;
int minRequiredSets(int n){
   if (n % 26 == 0) {
      return (n / 26);
   } else {
      return (n / 26) + 1;
   }
}
int main(){
   int n = 72;
   cout << "Minimum required sets: " << minRequiredSets(n) << endl;
   return 0;
}

Output

When you compile and execute the above program. It generates the following output −

Minimum required sets: 3

Narendra Kumar

Published on 31-Oct-2019 07:02:45

• Related Questions & Answers
• Minimum number of Appends needed to make a string palindrome in C++
• Find minimum number of Log value needed to calculate Log upto N in C++
• Program to check minimum number of characters needed to make string palindrome in Python
• Minimum number of deletions to make a string palindrome in C++.
• Find minimum operations needed to make an Array beautiful in C++
• Minimum number of given moves required to make N divisible by 25 using C++.
• Count total number of digits from 1 to N in C++
• Program to find number of operations needed to decrease n to 0 in C++
• Program to find minimum number of rocketships needed for rescue in Python
• Program to find minimum number of swaps needed to arrange all pair of socks together in C++
• Minimum Number of Steps to Make Two Strings Anagram in C++
• Convert a number m to n using minimum number of given operations in C++
• Minimum numbers needed to express every integer below N as a sum in C++
• Program to find number of coins needed to make the changes in Python
• Minimum number of coins that make a given value