Question

I need help for this assignment. Thank you!!

# 5555555555555555555555555555555555555555555555555 # Returns the longest word (which has six or more # characters and contains the letter, e) from # the parameter list - 4 marks Os Define the get_longest_e_word() function which is passed a list of strings as a parameter. The function returns the word in the list which has the most characters (i.e., the longest word) BUT only words which have 6 or more characters and contain the letter 'e' (or 'E') are considered. If two or more words in the list have the same number of characters as the longest word and both contain the letter 'e' (or 'E, the function should return the last word from the start of the list which has the most characters. If the parameter list is empty or if there are no 6 letter or longer words in the list which contain the letter 'e (or 'Ethe function should return the empty string. For example, the following code: print("1.", get_longest_e_word(l "Melissa", "Jessie", "Kath", "Amity", print("2.", get_longest_e_word(I "Jo","Jessie", "Penelope", "Jin", "Raeann print("3.", get_longest_e_word(l"Alan", "Melita", "Amity", "Rosalia". print("4. ", "*", get_longest_e_word(I Jo", "Jai", "Jen", "Jing", "Joey", Raeann" ])) "Pamelita" ])) "Rositta" "LeeAnne" ]) ) "Jess" ])," sep") print("5. ", "x**"., get_longest_e_word([])sep) print("6.", "***" + get_longest_e_word([" "]) + *" prints: 1. Melissa 2. Pamelita 3. Rosetta def get_longest_e_word (word_list): return"" # 6666666666666666666666666666666666666666666666666 # Remove triplets made up of three sequential # identical elements - 5 marks Define the remove_triplets() function which is passed a list of integers as a parameter. The function removes all triplets from the list (i.e., removes any three elements in the list which are exactly the same and are in sequence). For example, the following code: a_list- [6, 6, 6, 7, 6, 6, 6, 3, 3, 3, 8, 8, 8, 3] remove_triplets (a_list) print("1.", a_list) a_list [6, 6, 6, 7, 6, 6, 6, 6, 6] remove_triplets(a_list) print("2.", a_list) a_list [6, 6, 6, 7, 6, 6, 4, 3, 3, 3, 8, 8, 8, 3] remove_triplets(a_list) print ("3"", a-list) a-list= [1, 1, 1, 4, 4, remove_triplets(a_list) print("4.", a_list) 4, 1, 1, 1] remove_triplets (a_list) print("5."a list) prints: 1. 17, 3 2. 17, 6, 61 3. 17, 6, 6, 4, 3 4. def remove_triplets (a_list): pass # score a hand of random dice throws - 4 marks 01 In a dice rolling game a player's hand is made up of any number of random dice throws and is, valued in the following way: .In this game a run is a sequence of dice values s 123, 12345, 1234, 1. ch is part of a run of dice starting from a 1 has a value which is equivalent to the dice number. The value of any dice which is part of a run is added to the hand score. If there is no 1 in a hand of dice, the score for the whole hand is o. A hand of dice can contain more than one run. tudy the following five example hands of dice and their corresponding valuation. 15, 3, 2, 5, 4, 5, 6, 4, 3] has value 0 [1] and a second run with just [1]) Make sure you understand how the hands are valued: 31 1 4 61 has value 2 (contains one run with just the dice 5, 3, 2, 2, 6, 4, 5, 1, 4] has value 21 (contains one run with the dice [1, 2, 3, 4, 5, 6]) 12, 1, 1, 1, 2, 3, 3, 1, 3, 2] has value 19 (contains three separate runs with the dice 23 and a second run with the dice 13, 4, 1, dice [1, 2, 3, 4, 5, 61, a second run with [1, 2, 3, 4, 5] and a third run with the dice [1]). 5, 2, 1, 5, 1, 2, 3, 4, 61 has value 37 (contains one run with the Complete the get_dice_score() function which is passed a list of dice thr eturns the value of the hand according to the rules described above. def get_dice_score(list_of_dice): return 0

Answer 1

I am attaching the screenshot of code for indentation

Q5.
def get_longest_e_word(word_list):
if len(word_list)==0:
return ""
to_return=""
for elem in word_list:
if len(elem)>=6 and "e" in elem:
if len(elem)>=len(to_return):
to_return=elem
return to_return

def get longest e word (word list): if len(word list)--0: return"" to return- for elem in word 1ist: if len(elem)>-6 and "e" in elem: if len(elem)>-len (to_return): to return-elem return to return

Q6.
def remove_triplets(arg_list):
index_list=[]
idx=0
while idx < len(arg_list)-2:
if arg_list[idx]==arg_list[idx+1] and arg_list[idx+1]==arg_list[idx+2]:
index_list.extend([idx,idx+1,idx+2])
idx+=2
idx=idx+1
index_list.reverse()
for i in index_list:
arg_list.pop(i)

Q7.
def get_dice_score(list_of_dice):
if 1 not in list_of_dice:
return 0
count=[]
for i in [1,2,3,4,5,6]:
count.append(list_of_dice.count(i))
for i in range(len(count)):
for j in range(i+1,len(count)):
if count[j]>count[i]:
count[j]=count[i]
score=0
for i in range(len(count)):
score=score+count[i]*(i+1)
return score

def get_dice_score(list_of_dice): if 1 not in list_of_dice: count-[ for i in [1,2,3,4,5,6]: for i in range(len (count)): return 8 count.append(list_of_dice.count(4)) for j in range (i+1,1en(count)): if count[j]count[i]: count[j]-count[i] score-0 for i in range(len(count)): return score score-score+count[i]*(1+1)