Welcome to the Treehouse Community
Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! While you're at it, check out some resources Treehouse students have shared here.
Looking to learn something new?
Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.
Start your free trialBenjamin Harris
8,872 PointsWith [1, 2, 3, 4, 5] as the input, the function would return [5, 3, 1].
I have tested this is work spaces and returned 5, 3, 1. What am I doing wrong? : (
def reverse_evens(your_list):
new_list = your_list[::-2]
return (new_list)
def odds(your_list):
new_list = your_list[1::2]
return (new_list)
def first_4(your_list):
new_list = your_list[:4]
return (new_list)
def first_and_last_4(your_list):
new_list = your_list[:4] + your_list[-4:]
return (new_list)
2 Answers
Benjamin Harris
8,872 PointsI fixed my code.
I first made a new_list simply stepping through on even indexes then changed that new list to a reverse of itself inside the same function.
eg: new_list = your_list[::2] new_list2 = new_list[::-1] return (new_list2)
I don't really understand why I needed to do that but it worked. let's get stuck on the next question now. : )
Steven Parker
231,236 PointsThe different logic is necessary because otherwise for some lengths it would return reverse evens, but for others it would return reverse odds. There's two strategies to always return reverse evens:
- compute the starting position based on the list size
- extract the even index values first, then reverse them (as you did)
FYI: it's possible to make your solution more compact by eliminating the intermediate variables:
return your_list[::2][::-1]