Welcome to another fantastic Monday!
Today's challenge is to print out the data of a linked list in reverse order. So if the list looked like 1->2->3. The program would print out 3,2,1. Can you solve this in linear time?
Welcome to another fantastic Monday!
Today's challenge is to print out the data of a linked list in reverse order. So if the list looked like 1->2->3. The program would print out 3,2,1. Can you solve this in linear time?
Permalink: http://problemotd.com/problem/linked-list-reverse/
Content curated by @MaxBurstein
Comments:
Anonymous - 9 years, 3 months ago
Here is my attempt in rust.
https://gist.github.com/Antsiscool/a1ff61b325c1741728dc
reply permalink