# FAQ: Technical Interview Problems in Python: Lists - Max List Sub-Sum: Optimized

This community-built FAQ covers the “Max List Sub-Sum: Optimized” exercise from the lesson “Technical Interview Problems in Python: Lists”.

Paths and Courses
This exercise can be found in the following Codecademy content:

## FAQs on the exercise Max List Sub-Sum: Optimized

There are currently no frequently asked questions associated with this exercise – that’s where you come in! You can contribute to this section by offering your own questions, answers, or clarifications on this exercise. Ask or answer a question by clicking reply () below.

If you’ve had an “aha” moment about the concepts, formatting, syntax, or anything else with this exercise, consider sharing those insights! Teaching others and answering their questions is one of the best ways to learn and stay sharp.

## Join the Discussion. Help a fellow learner on their journey.

Agree with a comment or answer? Like () to up-vote the contribution!

Found a bug? Report it!

Have a question about your account or billing? Reach out to our customer support team!

None of the above? Find out where to ask other questions here!

Hello,
Though the suggested solution is correct the following incorrect code will pass the tests too.

def maximum_sub_sum(my_list):
max_sum = running_total = my_list[0]
for i in range(1, len(my_list)):
running_total += my_list[i]
if running_total > max_sum:
max_sum = running_total
if running_total < max_sum:
running_total = 0
return max_sum

Suggested array to test on - [1, -7, 2, 15, -11, 2, 16]