Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
def is palindrome_string(string: str) -> bool: Given a string , return whether this string is a palindrome string. For the purposes of this function, a palindrome string is any string that forms a palindrome if you piece together the first letter of every word in the string. We define a word here to be ANY CONTINUOUS SEGMENT OF ALPHABETICAL CHARACTERS. That means that "abc; def", has two words: "abc" and "def". The separating character does not have to be whitespace, and there could be more than one separating character between two words. Since you will be using your is_palindrome function from last week, the definition of a palindrome will remain the same as the definition from last week (ignore capitalization and whitespace). A simple example: given the string "test string test", there are three words, "test", "string", and "test". The first letters of each word come together to form the string "tst". And since "tst" is a palindrome, this function should return True for the input "test string test". Precondition: will contain at least one word. Restrictions: you must use your "is-palindrome" function from lab 3 as a helper for this function, in addition to the lab restrictions defined at the start of this file. You are allowed and are encouraged to fix any issues with your previous submission for this function. pass

def is palindrome_string(string: str) -> bool: Given a string , return whether this string is a palindrome string. For the purposes of this function, a palindrome string is any string that forms a palindrome if you piece together the first letter of every word in the string. We define a word here to be ANY CONTINUOUS SEGMENT OF ALPHABETICAL CHARACTERS. That means that "abc; def", has two words: "abc" and "def". The separating character does not have to be whitespace, and there could be more than one separating character between two words. Since you will be using your is_palindrome function from last week, the definition of a palindrome will remain the same as the definition from last week (ignore capitalization and whitespace). A simple example: given the string "test string test", there are three words, "test", "string", and "test". The first letters of each word come together to form the string "tst". And since "tst" is a palindrome, this function should return True for the input "test string test". Precondition: will contain at least one word. Restrictions: you must use your "is-palindrome" function from lab 3 as a helper for this function, in addition to the lab restrictions defined at the start of this file. You are allowed and are encouraged to fix any issues with your previous submission for this function. pass

Database System Concepts
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
See similar textbooks
icon
Related questions
Question
Restrictions: do not use imports, except for the ones given (if any). You may not use any lists or list methods, please do not use try-except statements. I included my is_palindrome function
36 edef is palindrome_string(string: str) -> bool: 37 38 Given a string <string>, return whether this string is a palindrome string. 39 40 For the purposes of this function, a palindrome string is any string that forms a palindrome if you piece together the first letter of every word in the string. We define a word here to be ANY CONTINUOUS SEGMENT OF 41 42 43 ALPHABETICAL CHARACTERS. That means that "abc;def", has twO words: "abc" 44 and "def". The separating character does not have to be whitespace, and 45 there could be more than one separating character between two words. 46 47 Since you will be using your is_palindrome function from last week, the 48 definition of a palindrome will remain the same as the definition from 49 last week (ignore capitalization and whitespace). 50 51 A simple example: given the string "test string test", there are three 52 words, "test", "string", and "test". The first letters of each word come 53 together to form the string "tst". And since "tst" is a palindrome, this 54 function should return True for the input "test string test". 55 56 Precondition: <string> will contain at least one word. 57 58 Restrictions: you must use your "is_palindrome" function from lab 3 as a helper for this function, in addition to the lab restrictions defined at the start of this file. You are allowed and are encouraged to fix any issues with your previous submission for this function. 59 60 61 62 63 64 pass 65 台1台|
Transcribed Image Text:36 edef is palindrome_string(string: str) -> bool: 37 38 Given a string <string>, return whether this string is a palindrome string. 39 40 For the purposes of this function, a palindrome string is any string that forms a palindrome if you piece together the first letter of every word in the string. We define a word here to be ANY CONTINUOUS SEGMENT OF 41 42 43 ALPHABETICAL CHARACTERS. That means that "abc;def", has twO words: "abc" 44 and "def". The separating character does not have to be whitespace, and 45 there could be more than one separating character between two words. 46 47 Since you will be using your is_palindrome function from last week, the 48 definition of a palindrome will remain the same as the definition from 49 last week (ignore capitalization and whitespace). 50 51 A simple example: given the string "test string test", there are three 52 words, "test", "string", and "test". The first letters of each word come 53 together to form the string "tst". And since "tst" is a palindrome, this 54 function should return True for the input "test string test". 55 56 Precondition: <string> will contain at least one word. 57 58 Restrictions: you must use your "is_palindrome" function from lab 3 as a helper for this function, in addition to the lab restrictions defined at the start of this file. You are allowed and are encouraged to fix any issues with your previous submission for this function. 59 60 61 62 63 64 pass 65 台1台|
Edef is palindrome (string: str) -> bool: Your "is_palindrome" implementation from last week (Lab 3), which you may use as is or with modifications if you didn't get it right last time. low = string.Lower().replace (" ", "") %3D return low == low[::-1]
Transcribed Image Text:Edef is palindrome (string: str) -> bool: Your "is_palindrome" implementation from last week (Lab 3), which you may use as is or with modifications if you didn't get it right last time. low = string.Lower().replace (" ", "") %3D return low == low[::-1]
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
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
SEE MORE TEXTBOOKS