Problem: You are given a linked list, you just need to reverse its order without changing any pointer, ie print the tail first and head last.
Input: Input contains elements of linked list separated by space and terminated by -1
Output: Print reversed linked list.
Constraints: 0≤element of list≤100
Sample Input: 1 2 3 4 -1
Sample Output:
4 3 2 1
print(' '.join(input().split()[-2::-1]))Resources
How do you rate this article?
1
20240228 Arrived in the UK for about 2 week. All my fears persist. Some are even getting worse. https://github.com/locharp/asylum_diary/
Sharing entry level codes. My snippets on GitHub https://github.com/locharp/code-snippets
Reward the author with $0.01 in crypto, and earn yourself as you read!
% to author / 80% to me.
2 hours ago
1 minute read
9 Oct 2026
2 minute read
8 hours ago
1 minute read
Page not displaying correctly?
