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 trialChaltu Oli
4,915 PointsI can't get the last one to work?
I can't get to work?
def first_4(item1):
return item1[:4]
def first_and_last_4(single):
return first_4(single) + single[-4:]
def odds(index):
return index[1::2]
def reverse_evens(sing):
return sing[-1::-2]
2 Answers
Steven Parker
231,275 PointsYour method will work half of the time, based on the number of items. But in the other cases 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.
Chaltu Oli
4,915 PointsThank you
Grigorij Schleifer
10,365 PointsHey Ulfina, check this stack overflow link. It's quite good.
Grigorij Schleifer
10,365 PointsGrigorij Schleifer
10,365 PointsHi Steven, this is a great way to explain it!!!!!