Given a string , return the substring with the largest sum (as calculated by sum_string()) that exists within . If there are multiple substrings with equally large sums, return the first one that occurs. The substring could just be the whole string itself, or it could be empty. To calculate the sum of the substring, please use the function sum_string() which you have implemented above as a helper.
def substring_with_largest_sum(string: str) -> str:
"""
Given a string <string>, return the substring with the largest sum (as
calculated by sum_string()) that exists within <string>. If there are
multiple substrings with equally large sums, return the first one that
occurs. The substring could just be the whole string itself, or it could
be empty.
To calculate the sum of the substring, please use the function sum_string()
which you have implemented above as a helper.
For example, given the string "321", there are 7 possible substrings:
"", "3", "2", "1", "32", "21", "321". For each one of them, their sum can
be calculated as per the sum_string() function which you have already
implemented. By using your understanding of loops, implement this function
to return the substring with the largest sum by checking all of the
substrings of the input string. So, "32" evaluates to 1, "21" also
evaluates to 1, "321" evaluates to 2, resulting in "3" being the largest
possible substring as it evaluates to 3.
>>> substring_with_largest_sum("2020202020")
'202020202'
"""
" do this in python and don't use any imports, lists, or while loops and don't use any break or continue statements."
Step by step
Solved in 2 steps with 1 images
