Question

PYTHON

--create a program that accepts a list of words and returns the longest word inside that list

can only use --- append, len, str, float, range, strip, split, int

--create a program that accepts a list of words and a specific length. function will returns a new list that contains the words found with the specific length, and return an empty list if none are found

can only use --- append, len, str, float, range, strip, split, int

Answer 1

In this Python program,

- We have defined 2 functions namely LongestWord and WordsList.
- The function LongestWord will accept a list of words and returns the longest word inside that list.
- The function WordsList will accept a list of words and a specific length. the function will return a new list that contains the words found with the specific length, and return an empty list if none are found.
- We have added the validation cases for both the functions to check the functionality and printing the output onto the console.

(I believe that I made the code simple and understandable. If you still have any query, Feel free to drop me a comment)

Code-1:

#This function will accepts a list of words and returns the longest word inside that list
def LongestWord(words):
  
maximum=0 #To store the index of the longest word
  
#Iterating through all the words in the list
for i in range(0,len(words)):
#Compare the length of that index with the current word, update the maximum if so
if(len(words[i])>len(words[maximum])):
maximum=i
  
#Now maximum holds the LongestWord index so return the word using that index
return words[maximum]
  
  
#Validation Part
print( LongestWord(["A","BB","CCC","DDDD","EEEEE"]) )
print( LongestWord(["123456789","1234","12","1","123"]) )

Code-2:

#This function accepts a list of words and a specific length. function will
#returns a new list that contains the words found with the specific length, and
#return an empty list if none are found
def WordsList(words,length):
  
result=[] #To store the resultant words
  
#Itearate over the words in the list
for i in words:
#Compare the length if it is equal then add it to the new list
if(len(i)==length):
result.append(i)
  
#Return the result
return result

print( WordsList(["A","BB","CCC","DDDD","EEEEE","ABC"],3) )
print( WordsList(["1234","12","1","123","123456789","A"],1) )
print( WordsList(["1234","12","1","123","123456789","A"],10) )

Please check the compiled program and its output for your reference:

Code-1:

main.py 1 #This function will accepts a list of words and returns the Longest word inside that list 2. def LongestWord(words): 3 4 maximum=0 #To store the index of the longest word 6 7- Co o #Iterating through all the words in the list for i in range(0, len(words)): #Compare the length of that index with the current word, update the maximum if so if(len(words[i])>len(words[maximum])): maximum=i 9 11 12 13 #Now maximum holds the Longestword index so return the word using that index return words[maximum] 14 15 16 #Validation Part 17 print LongestWord( ["A", "BB", "CCC", "DDDD", "EEEEE"])) 18 print LongestWord( ["123456789","1234","12", "1","123"]))|

Output:

input EEEEE 123456789 ...Program finished with exit code 0 Press ENTER to exit console.

Code-2:

main.py 1 #This function accepts a list of words and a specific Length. function will 2 #returns a new list that contains the words found with the specific Length, and 3 #return an empty list if none are found 4 def WordsList(words, length): 5 6 result=[] #To store the resultant words 7 8 #Itearate over the words in the list 9 for i in words: 10 #Compare the length if it is equal then add it to the new List 11 if(len(i)=-length): 12 result.append(i) 13 14 #Return the result 15 return result 16 17 18 print 19 printa 20 print WordsList(["A", "BB","CCC", "DDDD", "EEEEE", "ABC"],3)) WordsList(["1234", "12","1","123", "123456789", "A"],1)) WordsList(["1234","12", "1","123","123456789", "A"],10))

Output:

input ['CCC', 'ABC'] ['1', 'A'] [ ... Program finished with exit code o Press ENTER to exit console.

Hope this Helps!!!
Please upvote as well, If you got the answer?
If not please comment, I will Help you with that...