Define a function named hide_middle_of_words (words_list) which takes a list of words as a parameter and returns a new list of words where each word is made up of the first letter of the parameter word followed by a series of hyphens, followed by the last letter of the word. The number of hyphens will be 2 less than the length of the word. Note: You can assume that the parameter list is not empty and each word always contains at least 2 characters. For example: Test Result ['A-a', 'A-n', 'A----a'] hidden_words = hide_middle_of_words ( ["Adriana", "Ann", "Angela"]) print (hidden_words) ['a---e', 'b----a', 'o---e', 'g----s'] hidden_words = hide_middle_of_words ( ["apple", "banana', 'orange', 'grapes']) print (hidden_words)

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Python code please help, indentation would be greatly appreciated 

Define a function named hide_middle_of_words (words_list) which takes a list of words as a parameter and returns a new list of words
where each word is made up of the first letter of the parameter word followed by a series of hyphens, followed by the last letter of the word. The
number of hyphens will be 2 less than the length of the word.
Note: You can assume that the parameter list is not empty and each word always contains at least 2 characters.
For example:
Test
Result
['A-----a', 'A-n', 'A----a']
hidden_words = hide_middle_of_words ( ["Adriana", "Ann", "Angela"])
print (hidden_words)
['a---e',
'b----a', I 0----e',
g----s']
hidden_words = hide_middle_of_words ( ["apple", 'banana', 'orange', 'grapes'])
print (hidden_words)
Transcribed Image Text:Define a function named hide_middle_of_words (words_list) which takes a list of words as a parameter and returns a new list of words where each word is made up of the first letter of the parameter word followed by a series of hyphens, followed by the last letter of the word. The number of hyphens will be 2 less than the length of the word. Note: You can assume that the parameter list is not empty and each word always contains at least 2 characters. For example: Test Result ['A-----a', 'A-n', 'A----a'] hidden_words = hide_middle_of_words ( ["Adriana", "Ann", "Angela"]) print (hidden_words) ['a---e', 'b----a', I 0----e', g----s'] hidden_words = hide_middle_of_words ( ["apple", 'banana', 'orange', 'grapes']) print (hidden_words)
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY