To type hello in your phone, you would have pressed the keys in the following order: 44-33-555-555- 666. To denote the pauses you have to take between entering each series of numbers, we will be using space characters. So, the string '44 33 555 555 666' would be translated into 'hello'. To represent the mapping between a sequence of digits and the letter that it represents we will be using a dictionary. The dictionary will be mapping integers between 0 and 9 to lists of strings. The position of the string in the letter denotes how many times the integer should be repeated for it to represent such string. So, for instance the dictionary {2 : ['a', 'b', 'c'1, 7: ['p', 'q', 'r', 's'1} tells us that to represent the string 'a' we need the integer 2 repeated once (because 'a' is the first string in the list to which the key 2 maps). On the other hand, to represent the string 'r' we need to use the integer 7 repeated three times, since 'r' is the third string in the list to which 7 maps. Write a function (including docstring) called same_chars that takes a string as input and returns true if the string contains at least one character and all the characters within the strings are equal. For example: » same_chars('555') True >>> same_chars('aaaaa') True >>> same_chars('COMP') False >>> same_chars('aaAa') False

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
To type hello in your phone, you would have pressed the keys in the following order: 44-33-555-555-
666. To denote the pauses you have to take between entering each series of numbers, we will be using
space characters. So, the string '44 33 555 555 666' would be translated into 'hello'. To represent
the mapping between a sequence of digits and the letter that it represents we will be using a dictionary.
The dictionary will be mapping integers between 0 and 9 to lists of strings. The position of the string
in the letter denotes how many times the integer should be repeated for it to represent such string. So,
for instance the dictionary {2 : ['a', 'b', 'c'], 7 : ['p', 'q', 'r', 's']} tells us that to represent
the string 'a' we need the integer 2 repeated once (because 'a' is the first string in the list to which the
key 2 maps). On the other hand, to represent the string 'r' we need to use the integer 7 repeated three
times, since 'r' is the third string in the list to which 7 maps.
Write a function (including docstring) called same_chars that takes a string as input and returns true if
the string contains at least one character and all the characters within the strings are equal.
For example:
> same_chars('555')
True
>>> same_chars('aaaaa')
True
>>> same_chars('COMP')
False
>>> same_chars('aaAa')
False
Transcribed Image Text:To type hello in your phone, you would have pressed the keys in the following order: 44-33-555-555- 666. To denote the pauses you have to take between entering each series of numbers, we will be using space characters. So, the string '44 33 555 555 666' would be translated into 'hello'. To represent the mapping between a sequence of digits and the letter that it represents we will be using a dictionary. The dictionary will be mapping integers between 0 and 9 to lists of strings. The position of the string in the letter denotes how many times the integer should be repeated for it to represent such string. So, for instance the dictionary {2 : ['a', 'b', 'c'], 7 : ['p', 'q', 'r', 's']} tells us that to represent the string 'a' we need the integer 2 repeated once (because 'a' is the first string in the list to which the key 2 maps). On the other hand, to represent the string 'r' we need to use the integer 7 repeated three times, since 'r' is the third string in the list to which 7 maps. Write a function (including docstring) called same_chars that takes a string as input and returns true if the string contains at least one character and all the characters within the strings are equal. For example: > same_chars('555') True >>> same_chars('aaaaa') True >>> same_chars('COMP') False >>> same_chars('aaAa') False
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Hash Table
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.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education