/tech/ - Soyence and Technology

I didn't look up the solution but I had to look up what a linked list was because I've never used one. Here is my answer:
Traverse through the whole list following the pointers and and count each jump
malloc the size of the list based on the number of jumps multiplied by the datatype size
traverse backwards and store each element while optionally freeing each old element

>>31859
>I had to look up what a linked list was
bro… we're so cooked.

>>31860
They sound retarded and a really good way to fragmentate the shit out of your memory