The Minion Game-HackerRank Solution

 The Minion Game-HackerRank Solution

 Game Rules

Both players are given the same string, .
Both players have to make substrings using the letters of the string .
Stuart has to make words starting with consonants.
Kevin has to make words starting with vowels.
The game ends when both players have made all possible substrings.

Scoring
A player gets +1 point for each occurrence of the substring in the string .

For Example:
String  = BANANA
Kevin's vowel beginning word = ANA
Here, ANA occurs twice in BANANA. Hence, Kevin will get 2 Points.

For better understanding, see the image below:

Input Format

A single line of input containing the string .
Note: The string  will contain only uppercase letters: .

Constraints

Output Format

Print one line: the name of the winner and their score separated by a space.

If the game is a draw, print Draw.

Sample Input

BANANA

Sample Output

Stuart 12

Note :
Vowels are only defined as . In this problem,  is not considered a vowel.

The Minion Game Solution-

def minion_game(string):
    vowels = 'AEIOU'
    kevsc = 0
    stusc = 0
    for i in range(len(s)):
        if s[i] in vowels:
            kevsc += (len(s)-i)     #Stores all permutations count starting with vowel
        else:
            stusc += (len(s)-i)      #Stores all permutations count starting with consonant
    if kevsc > stusc:
        print ("Kevin", kevsc)
    elif kevsc < stusc:
        print ("Stuart", stusc)
    else:
        print ("Draw")
if __name__ == '__main__':
    s = input()
    minion_game(s)