For each part you must write a single line of python code to get full credit. You can write both of your responses in the box below. (1) Given a list of strings v, v-['apple', bat','door', I', am', 'tables', 'hi'] Create a new string with last two letters of all words that have more than 2 characters seperated by a character. For example the output should be: le-at-or-es' (2) Given a dictionary di with keys as tuples of integers and values as lowercase strings, write code that outputs the strings in a list ordered by the number of characters each string has. So, as an example, if: 41={(10,2):"books', (3): 'airplane', (4,6,9): zoo',1 (2,2,2,2): city} then the output should be [' zoo', 'city', 'books', 'airplane']).
For each part you must write a single line of python code to get full credit. You can write both of your responses in the box below. (1) Given a list of strings v, v-['apple', bat','door', I', am', 'tables', 'hi'] Create a new string with last two letters of all words that have more than 2 characters seperated by a character. For example the output should be: le-at-or-es' (2) Given a dictionary di with keys as tuples of integers and values as lowercase strings, write code that outputs the strings in a list ordered by the number of characters each string has. So, as an example, if: 41={(10,2):"books', (3): 'airplane', (4,6,9): zoo',1 (2,2,2,2): city} then the output should be [' zoo', 'city', 'books', 'airplane']).
Chapter7: Characters, Strings, And The Stringbuilder
Section: Chapter Questions
Problem 12RQ
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning