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 trialJinman Kim
5,586 PointsDoes anyone have an answer to this question?
I figured out that I can't go from negative index to positive index or vice versa. Okay, so that's fine, I will combine the two lists (first 4 and last 4). Although that gives me a right answer from the workspace REPL, it gives me an error from the quiz. Can anyone please tell me why?
def first_4(word):
return word[:4]
def first_and_last_4(word):
return word[0:4] + word[-1:-5:-1]
1 Answer
Steven Parker
231,269 PointsThis code is returning the last four items in reverse order, but reversing the order is not part of the challenge instructions. To pass the challenge, your function should return the first and last four items in their original order.
Jinman Kim
5,586 PointsJinman Kim
5,586 PointsIf I try to put the last four items in their original orders, I can potentially do word[-4:-1] and insert/append the word[-1] but I thought that was not a clean way to write the code (It seems that I can't slice from [-4,0]) Wondering if there is a better way to do this.
Jinman Kim
5,586 PointsJinman Kim
5,586 PointsI have it figured out now! To get the last four I did, word[-4:]