We can assign a value to each character in a word based on their position in the alphabet (a = 1, b = 2, : 1, b = 2, ..., z = 26). A balanced word is one where the sum of the values on the left side of the word equals the sum of the values on the right side. For odd-length words, the middle character (balance point) is ignored. Write a function that returns true if the word is balanced and false if it is not. Examples balance("zips") → true // "zips" = "zilps" = 26+9 16+19 = 35 35 = true balanced ("brake") → false // "brake" = "br|ke" = 2+18 | 11+5 = 20 16 = false

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
We can assign a value to each character in a word based on their
position in the alphabet (a = 1, b = 2, ..., z = 26). A balanced word
is one where the sum of the values on the left side of the word equals
the sum of the values on the right side. For odd-length words, the
middle character (balance point) is ignored.
Write a function that returns true if the word is balanced and false if
it is not.
Examples
balance("zips") → true
// "zips" = "zi|ps"
"zips" = 26+9 | 16+19
= 35 35 = true
balanced ("brake") → false
// "brake" = "br|ke" = 2+18 11+5 = 2016 = false
li
Transcribed Image Text:We can assign a value to each character in a word based on their position in the alphabet (a = 1, b = 2, ..., z = 26). A balanced word is one where the sum of the values on the left side of the word equals the sum of the values on the right side. For odd-length words, the middle character (balance point) is ignored. Write a function that returns true if the word is balanced and false if it is not. Examples balance("zips") → true // "zips" = "zi|ps" "zips" = 26+9 | 16+19 = 35 35 = true balanced ("brake") → false // "brake" = "br|ke" = 2+18 11+5 = 2016 = false li
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