def loopy_madness(string1: str, string2: str) -> str: Given two strings and , return a new string that contains letters from these two strings "interwoven" together, starting with the first character of . If the two strings are not of equal Zength, then start looping "backwards-and-forwards" in the shorter string until you come to the end of the longer string. "interwoven" (or "interweaving") means constructing a new string by taking the first letter from the first string, adding the first letter of the second string, adding the second letter of the first string, adding the second letter of the second string, and so on. "backwards-and-forwards" is a custom looping term. First the loop starts at position 1 (index 0) and goes until position n (i.e., the end). Once the loop reaches position n, it goes backwards, starting at position n - 1 and goes to position 1 (index 0). This repeats until the two strings are interwoven. For example, the backwards-and-forwards operations of "abc" WOuld be "abcbabcba...

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

How to solve? Please you can't use lists, list methods, or while loops and also means that you can't use string methods that work with lists. You can't use try/except and break/continue statements.

def loopy_madness(string1: str, string2: str) -> str:
II I| ||
Given two strings <string1> and <string2>, return a new string that
contains letters from these two strings "interwoven" together, starting with
the first character of <string1>. If the two strings are not of equal
length, then start looping "backwards- and-forwards" in the shorter string
until you come to the end of the longer string.
"interwoven" (or "interweaving") means constructing a new string by taking
the first letter from the first string, adding the first letter of the
second string, adding the second letter of the first string,
adding the second letter of the second string, and so on.
"backwards-and-forwards" is a custom looping term. First the loop starts
at position 1 (index 0) and goes until position n (i.e., the end). Once the
loop reaches position n, it goes backwards, starting at position n - 1 and
goes to position 1 (index 0). This repeats until the two strings are
interwoven. For example, the backwards-and-forwards operations of "abc"
Would be "abcbabcba..."
Transcribed Image Text:def loopy_madness(string1: str, string2: str) -> str: II I| || Given two strings <string1> and <string2>, return a new string that contains letters from these two strings "interwoven" together, starting with the first character of <string1>. If the two strings are not of equal length, then start looping "backwards- and-forwards" in the shorter string until you come to the end of the longer string. "interwoven" (or "interweaving") means constructing a new string by taking the first letter from the first string, adding the first letter of the second string, adding the second letter of the first string, adding the second letter of the second string, and so on. "backwards-and-forwards" is a custom looping term. First the loop starts at position 1 (index 0) and goes until position n (i.e., the end). Once the loop reaches position n, it goes backwards, starting at position n - 1 and goes to position 1 (index 0). This repeats until the two strings are interwoven. For example, the backwards-and-forwards operations of "abc" Would be "abcbabcba..."
Examples:
If you are given "abc" and "123", then the output string is "alb2c3".
This is after taking "a" from the first string, adding "1" from the
second string, adding "b" from the first string, and so on.
Things get more interesting when you are given two strings that differ
in length. For example, if you are given "abcde" and "12", then the
AAAAAAAAaaa.
output would be "alb2c1d2e1". Notice how the shorter string loops
around when it runs out of characters, and continues looping until the
Longer string is exhausted.
Another example of the "backwards-and-forwards" implementation given
two strings of differing length: "abcdfe" and "123", then the output
AAAAAAAAAchaAA
would be "a1b2c3d2f1e2".
Note that the first string could be shorter too, for example, given
"ab" and "123", the output would be "alb2q3".
Precondition: both input strings will NOT be empty.
Hint: a good sanity check is to ensure that your output string is exactly
twice the length of the longer input string :)
IL II |
Transcribed Image Text:Examples: If you are given "abc" and "123", then the output string is "alb2c3". This is after taking "a" from the first string, adding "1" from the second string, adding "b" from the first string, and so on. Things get more interesting when you are given two strings that differ in length. For example, if you are given "abcde" and "12", then the AAAAAAAAaaa. output would be "alb2c1d2e1". Notice how the shorter string loops around when it runs out of characters, and continues looping until the Longer string is exhausted. Another example of the "backwards-and-forwards" implementation given two strings of differing length: "abcdfe" and "123", then the output AAAAAAAAAchaAA would be "a1b2c3d2f1e2". Note that the first string could be shorter too, for example, given "ab" and "123", the output would be "alb2q3". Precondition: both input strings will NOT be empty. Hint: a good sanity check is to ensure that your output string is exactly twice the length of the longer input string :) IL II |
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Similar questions
  • SEE MORE 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