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!
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
Jair Anguiano3,225 Points
I tested my code of the evens in reverse and it worked, but it didn't when press recheck
def reverse_evens(foo): reverse = foo[::-1] evens =  for idx, val in enumerate(reverse): if (idx % 2) == 0: evens.append(val) else: pass return evens
def first_4(foo): return foo[:4] def first_and_last_4(foo): first = foo[:4] last = foo[-4:] return first + last def odds(foo): odds= for idx, val in enumerate(foo): if (idx % 2) == 0: pass else: odds.append(foo[idx]) return odds def reverse_evens(foo): reverse = foo[::-1] evens =  for idx, val in enumerate(reverse): if (idx % 2) == 0: evens.append(val) else: pass return evens
Steven Parker227,114 Points
The "even indexes" they are asking for are the ones that are even in the original list. Once you reverse the list, the ones you want could be even or odd depending on the length of the list. So you might do either one of two things:
- use the list length to determine which ones to take
- get the even indexed items first and then reverse the order
Either way, this can be done without a loop by using slicing.