We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Python
  3. Strings
  4. The Minion Game
  5. Discussions

The Minion Game

Sort by

recency

|

1260 Discussions

|

  • Amudala
     + 0 comments

    Instead of generating all possible substrings and storing them in a dictionary, you can take advantage of the fact that you don't need the actual substrings. You just need to count the number of substrings that start with a vowel or consonant.

    To make it efficient:

    If you consider a character at position i in the string, the number of substrings that start at i is equal to n - i, where n is the length of the string. Based on this, if the character is a vowel, Kevin will get n - i points for that character. Similarly, if it is a consonant, Stuart will get n - i points for that character. This approach avoids explicitly generating substrings and directly calculates the scores.

    def minion_game(string):
    vowels = 'AEIOU'
    str_len = len(string)
    
    kevin_score = 0
    stuart_score = 0

    for i in range(str_len):
        if string[i] in vowels:
            kevin_score += str_len - i
        else:
            stuart_score += str_len - i

    if kevin_score > stuart_score:
        print(f'Kevin {kevin_score}')
    elif stuart_score > kevin_score:
        print(f'Stuart {stuart_score}')
    else:
        print('Draw')

  • draykom
     + 0 comments

    Something a little bit different, the total possible score can be caluclated using the arithmetic series formula (total = (n * (n+1) ) // 2). This allows Stuart's score to be caluclated as every point that Kevin didn't get.

    Code:

    def minion_game(string):
    VOWELS = ['A','E','I','O','U']
    n = len(string)
    total = (n * (n+1) ) // 2
    
    kevin = 0
    for i, char in enumerate(string):
        if char in VOWELS:
            kevin += n - i
    stuart = total - kevin
    
    if stuart > kevin:
        print(f"Stuart {stuart}")
    elif stuart == kevin:
        print("Draw")
    elif stuart < kevin:
        print(f"Kevin {kevin}")

  • hgafaromotoba
     + 0 comments
    def minion_game(string):
    # your code goes here
    vowel = ['A', 'E', 'I', 'O', 'U']
    
    vowel_pt = 0
    consonant_pt = 0
  
    
 
    for i in range(len(string)):
        if string[i] in vowel:
          vowel_pt += (len(string) - i)
        
        else:
            consonant_pt +=(len(string) - i)
                
    if vowel_pt > consonant_pt:
        print("Kevin", vowel_pt)
    
    elif consonant_pt > vowel_pt:
        print("Stuart", consonant_pt)
    else:
        print("Draw")
            
    # print(score["Stuart"])
        

if __name__ == '__main__':
    s = input()
    minion_game(s)

  • DanielleGarmon4
     + 0 comments

    The rules give each player a distinct focus—consonants for Stuart and vowels for Kevin—adding a strategic layer that makes things more interesting. Betbook250 login

  • quit_rez_dez
     + 0 comments

    This problem is kind a triky process AND YOU NEED TO REFRES THE CONCEPT OF COMBINATION the solution is in the for loop:

    for i in range(length):
    if string[i] in vowels:
        kevin += length - i
    else:
        stuart += length - i

    and understand this : posible combination of substrIng in a string that is the cycle do, so : 'B,A,N,A,N,A' 0 (get 6 substring): * 'B' , 'BA' , 'BAN' , 'BANA' , 'BANAN' , 'BANANA'* 1 (get 5 substring):** 'A' , 'AN' , 'ANA' , 'ANAN' , 'ANANA** 2 (get 4 substring): * 'N' , 'NA' , 'NAN' , 'NANA'* 3 (get 3 substring):** 'A' , 'AN' , 'ANA'** 4 (get 2 substring): * 'N' , 'NA' * 5 (get 1 substring): ** 'A'**

    NOW AS you can see they start in vowey or not vowel so if you sum you get result ,