An input string can be completed if additional letters can be added and no letters need to be taken away to match the word. Furthermore, the order of the letters in the input string must be the same as the order of letters in the final word. Create a function that, given an input string, determines if the word can be completed. Examples canComplete("butl", "beautiful") → true // We can add "ea" between "b" and "u", and "ifu" between "t" and "1". canComplete("butlz", "beautiful") false // "z" does not exist in the word beautiful. canComplete("tulb", "beautiful") → false - // Although "t", "u", "1" and "b" all exist in "beautiful", they are incorrectly canComplete("bbutl", "beautiful") false // Too many "b"s, beautiful has only 1.

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
An input string can be completed if additional letters can be added and no letters need to be
taken away to match the word. Furthermore, the order of the letters in the input string must
be the same as the order of letters in the final word.
Create a function that, given an input string, determines if the word can be completed.
Examples
canComplete("butl",
"beautiful") → true
// We can add "ea" between "b" and "u", and "ifu" between "t" and "1".
canComplete("butlz", "beautiful") false
// "z" does not exist in the word beautiful.
canComplete("tulb", "beautiful") - false
// Although "t", "u", "1" and "b" all exist in "beautiful", they are incorrectly
canComplete("bbutl", "beautiful")
- false
// Too many "b"s, beautiful has only 1.
Transcribed Image Text:An input string can be completed if additional letters can be added and no letters need to be taken away to match the word. Furthermore, the order of the letters in the input string must be the same as the order of letters in the final word. Create a function that, given an input string, determines if the word can be completed. Examples canComplete("butl", "beautiful") → true // We can add "ea" between "b" and "u", and "ifu" between "t" and "1". canComplete("butlz", "beautiful") false // "z" does not exist in the word beautiful. canComplete("tulb", "beautiful") - false // Although "t", "u", "1" and "b" all exist in "beautiful", they are incorrectly canComplete("bbutl", "beautiful") - false // Too many "b"s, beautiful has only 1.
Expert Solution
trending now

Trending now

This is a popular 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