Question: 5 11 11 11 9 # Problem 3a 6 7 def findAlphabeticallyLastword(text): 8 Given a string |text|, return the word in text that comes last

5 11 11 11 9 # Problem 3a 6 7 def findAlphabeticallyLastword(text): 8 Given a string |text|, return the word in text that comes last 10 alphabetically (that is, the word that would appear last in a dictionary). 11 A word is defined by a maximal sequence of characters without whitespaces. 12 You might find max() and list comprehensions handy here. 13 14 # BEGIN_YOUR_CODE (our solution is 1 line of code, but don't worry if you deviate from this) 15 raise Exception ("Not implemented yet") 16 # END_YOUR_CODE 17 II | |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
