# FAQ: Technical Interview Problems in Python: Lists - Max list sub-sum: Naive

This community-built FAQ covers the “Max list sub-sum: Naive” 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: Naive

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! Just wanted to let you know that the solution described in the Hint for this exercise fails to account for the following edge-case: when the max sub-list sum is a single element that isn’t the first element. (e.g. [-2, 12, -3] should return 12, but the Hint’s solution returns 10.)

This is because the Hint defines i, j, and the test sub-lists such that the smallest sub-list is 2 elements. It defines them as:

``````for i in range(len(my_list)):
for j in range(i + 1, len(my_list)):
my_list[i:j + 1]
``````

The solution that I did (which does look at single-element sub-lists) defines them as:

``````for i in range(len(my_list)):
for j in range(i + 1, len(my_list) + 1):
my_list[i:j]
``````

Might be worth fixing!

1 Like