Prime String - GeeksforGeeks

05 May, 2021
Given a String str , the task is to check if the sum of ASCII value of all characters is a Prime Number or not.
Examples : 
Input  : geeksforgeeks
Output : Yes
Input  : GeeksForGeeks
Output : No
Algorithm  
Calculate the string lengthCalculate sum of ASCII value of all charactersNow we can check till n1/2 because a larger factor of n must be a multiple of smaller factor. (Please see Check If the Number is Prime or Not for details)If the Sum is Prime then print “Yes” otherwise “No”
Calculate the string length
Calculate sum of ASCII value of all characters
Now we can check till n1/2 because a larger factor of n must be a multiple of smaller factor. (Please see Check If the Number is Prime or Not for details)
If the Sum is Prime then print “Yes” otherwise “No”
Now the implementation of above approach given below: 
C++
Java
Python3
C#
PHP
Javascript
// C++ program to find if string is a// Prime or not.#include <bits/stdc++.h>using namespace std; // Function that checks if sum// is prime or notbool isPrimeString(string str){    int len = str.length(), n = 0;    for (int i = 0; i < len; i++)        n += (int)str[i];     // Corner cases    if (n <= 1)        return false;    if (n <= 3)        return true;     // This is checked so that we can skip    // middle five numbers in below loop    if (n % 2 == 0 || n % 3 == 0)        return false;     for (int i = 5; i * i <= n; i = i + 6)        if (n % i == 0 || n % (i + 2) == 0)            return false;     return true;} // Driver codeint main(){    string str = "geekRam";    if (isPrimeString(str))        cout << "Yes" << endl;    else        cout << "No" << endl;}
// Java program to find if// string is a Prime or not.import java.io.*; class GFG {         // Function that checks if    // sum is prime or not    static boolean isPrimeString(String str)    {        int len = str.length(), n = 0;        for (int i = 0; i < len; i++)            n += (int)str.charAt(i);             // Corner cases        if (n <= 1)            return false;        if (n <= 3)            return true;             // This is checked so that we can skip        // middle five numbers in below loop        if (n % 2 == 0 || n % 3 == 0)            return false;             for (int i = 5; i * i <= n; i = i + 6)            if (n % i == 0 || n % (i + 2) == 0)                return false;             return true;    }     // Driver code    public static void main (String[] args)    {        String str = "geekRam";                 if (isPrimeString(str))            System.out.println("Yes");        else            System.out.println("No");    }} // This code is contributed by Ajit.
# Python Program to find if string is Prime or not# Function that checks if sum is prime or notdef isPrimeString(str1):    len1 = len(str1)    n = 0    for i in range(len1):        n += ord(str1[i])         # corner cases    if n <= 1:        return False    if n <= 3:        return True         # This is checked so that we can skip    # middle five numbers in below loop    if n % 2 == 0 or n % 3 == 0:        return False    while(i * i <= n):        if n % i == 0 or n % (i + 2) == 0:            return False        i += 6    return True # Driver codestr1 = "geekRam"if(isPrimeString(str1)):    print("Yes")else:    print("No") # This code is contributed by simranjenny84
// C# program to find if string is// a Prime or notusing System; class GFG{ // Function that checks if sum is prime or notpublic static bool isPrimeString(string str){    int len = str.Length, n = 0;    for (int i = 0; i < len; i++)    {        n += (int)str[i];    }     // Corner cases    if (n <= 1)    {        return false;    }    if (n <= 3)    {        return true;    }     // This is checked so that we can skip    // middle five numbers in below loop    if (n % 2 == 0 || n % 3 == 0)    {        return false;    }     for (int i = 5; i * i <= n; i = i + 6)    {        if (n % i == 0 || n % (i + 2) == 0)        {            return false;        }    }     return true;} // Driver codepublic static void Main(string[] args){    string str = "geekRam";     if (isPrimeString(str))    {        Console.WriteLine("Yes");    }    else    {        Console.WriteLine("No");    }}} // This code is contributed by Shrikant13
<?php// PHP program to find if// string is a Prime or not. // Function that checks// if sum is prime or notfunction isPrimeString($str){    $len = strlen($str); $n = 0;    for ($i = 0; $i < $len; $i++)        $n += (int)$str[$i];     // Corner cases    if ($n <= 1)        return false;    if ($n <= 3)        return true;     // This is checked so that    // we can skip middle five    // numbers in below loop    if ($n % 2 == 0 || $n % 3 == 0)        return false;     for ($i = 5; $i * $i <= $n; $i = $i + 6)        if ($n % $i == 0 ||            $n % ($i + 2) == 0)            return false;     return true;} // Driver code$str = "geekRam";if (isPrimeString($str))    echo "Yes" , "\n";else    echo "No" , "\n"; // This code is contributed by aj_36?>
<script> // Javascript program to find if string// is a Prime or not // Function that checks if sum is prime or notfunction isPrimeString(str){    let len = str.length, n = 0;    for(let i = 0; i < len; i++)    {        n += str[i].charCodeAt();    }     // Corner cases    if (n <= 1)    {        return false;    }    if (n <= 3)    {        return true;    }     // This is checked so that we can skip    // middle five numbers in below loop    if (n % 2 == 0 || n % 3 == 0)    {        return false;    }     for(let i = 5; i * i <= n; i = i + 6)    {        if (n % i == 0 || n % (i + 2) == 0)        {            return false;        }    }    return true;} // Driver codelet str = "geekRam"; if (isPrimeString(str)){    document.write("Yes");}else{    document.write("No");} // This code is contributed by decode2207 </script>
Output : 
No
 
jit_t
shrikanth13
simranjenny84
decode2207
ASCII
cpp-string
Prime Number
School Programming
Strings
Technical Scripter
Strings
Prime Number
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Constructors in Java
Exceptions in Java
Data Types
Inline Functions in C++
Pure Virtual Functions and Abstract Classes in C++
Write a program to reverse an array or string
Write a program to print all permutations of a given string
Longest Common Subsequence | DP-4
Check for Balanced Brackets in an expression (well-formedness) using Stack
KMP Algorithm for Pattern Searching