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 trial
Odane Williams
6,692 PointsI am pretty sure that is the correct code for the challenge. Why is it not passing?
The reverse_evens function should return all the items in the list in reverse order by even indexes. When ran in another program it returns the correct values.
def first_4(item):
return item[:4]
def first_and_last_4(item):
return item[:4] + item[-4:]
def odds(item):
return item[1::2]
def reverse_evens(item):
return item[-1::-2]
1 Answer
Steven Parker
231,269 PointsWell, it would work half of the time, when the list has an odd number of items. But when the list has an even number of items, it will return reverse odds instead.
To always return reverse evens, there's two basic strategies:
- compute the starting position based on the list size
- extract the even index values first, then reverse them
Either one will pass the challenge when implemented correctly.