Given a string, write a recursive function named count_eq_substr(str) that counts the number of substrings that begin and end with the same letter. For example "aba" has 4 of such substrings, namely "a", "b", "a" and "aba". Note that the first substring "a" and the third substring "a" are different strings. Note: think carefully about base cases and recursion cases for this. #testing your function count ("aba") count ("abcba") count("abca") # The function should return 4 # The function should return 7, where the fitting substrings are "a", # "b", "c", "b", "a", "bcb", and "abcba" # The function should return 5, #where the fitting substrings are "a", # "b", "c", "a", and "abca"

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

Python

Given a string, write a recursive function named count_eq_substr(str) that
counts the number of substrings that begin and end with the same letter. For
example "aba" has 4 of such substrings, namely "a", "b", "a" and "aba". Note that the
first substring "a" and the third substring "a" are different strings.
Note: think carefully about base cases and recursion cases for this.
#testing your function
count ("aba")
count ("abcba")
count("abca")
# The function should return 4
# The function should return 7,
#where the fitting substrings are "a",
# "b", "c", "b", "a", "bcb", and "abcba"
# The function should return 5,
#where the fitting substrings are "a",
# "b", "c", "a", and "abca"
Transcribed Image Text:Given a string, write a recursive function named count_eq_substr(str) that counts the number of substrings that begin and end with the same letter. For example "aba" has 4 of such substrings, namely "a", "b", "a" and "aba". Note that the first substring "a" and the third substring "a" are different strings. Note: think carefully about base cases and recursion cases for this. #testing your function count ("aba") count ("abcba") count("abca") # The function should return 4 # The function should return 7, #where the fitting substrings are "a", # "b", "c", "b", "a", "bcb", and "abcba" # The function should return 5, #where the fitting substrings are "a", # "b", "c", "a", and "abca"
Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Computational Systems
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.
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