Minimum number of letters needed to make a total of n
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.
Examples:
Input: n = 48
Output: 2
48 can be written as z + v, where z = 26 and v = 22
Input: n = 23
Output: 1
Approach: There are 2 possible cases:
- If n is divisible by 26 then the answer will be n / 26.
- If n is not divisible by 26 then the answer will be (n / 26) + 1.
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 minimum letters // required to make a total of n int minLettersNeeded( int n) { if (n % 26 == 0) return (n / 26); else return ((n / 26) + 1); } // Driver code int main() { int n = 52; cout << minLettersNeeded(n); return 0; } |
Java
// Java implementation of the approach class GFG { // Function to return the minimum letters // required to make a total of n static int minLettersNeeded( int n) { if (n % 26 == 0 ) return (n / 26 ); else return ((n / 26 ) + 1 ); } // Driver code public static void main(String args[]) { int n = 52 ; System.out.print(minLettersNeeded(n)); } } |
Python3
# Python3 implementation of the approach # Function to return the minimum letters # required to make a total of n def minLettersNeeded(n): if n % 26 = = 0 : return (n / / 26 ) else : return ((n / / 26 ) + 1 ) # Driver code n = 52 print (minLettersNeeded(n)) |
C#
// C# implementation of the approach using System; class GFG { // Function to return the minimum letters // required to make a total of n static int minLettersNeeded( int n) { if (n % 26 == 0) return (n / 26); else return ((n / 26) + 1); } // Driver code public static void Main() { int n = 52; Console.Write(minLettersNeeded(n)); } } |
PHP
<?php // PHP implementation of the approach // Function to return the minimum // letters required to make a // total of n function minLettersNeeded( $n ) { if ( $n % 26 == 0) return floor (( $n / 26)); else return floor (( $n / 26) + 1); } // Driver code $n = 52; echo minLettersNeeded( $n ); // This code is contributed by Ryuga ?> |
Javascript
<script> // Javascript implementation of the approach // Function to return the minimum letters // required to make a total of n function minLettersNeeded(n) { if (n % 26 == 0) return parseInt(n / 26); else return (parseInt(n / 26) + 1); } // Driver code var n = 52; document.write(minLettersNeeded(n)); // This code is contributed by noob2000 </script> |
Output:
2
Time Complexity: O(1)
Auxiliary Space: O(1)