Sollicitatievraag bij S&P Global
algorithm to reverse a singly linkedlist. (most efficient way)
Antwoord op sollicitatievraag
Anoniem
18 feb 2010
running in O(n). using iterator to rearrange the nodes.
algorithm to reverse a singly linkedlist. (most efficient way)
Anoniem
running in O(n). using iterator to rearrange the nodes.