Frage im Vorstellungsgespräch bei S&P Global
algorithm to reverse a singly linkedlist. (most efficient way)
Antwort im Vorstellungsgespräch
Anonym
18. Feb. 2010
running in O(n). using iterator to rearrange the nodes.
algorithm to reverse a singly linkedlist. (most efficient way)
Anonym
running in O(n). using iterator to rearrange the nodes.