Daily Archives: May 30, 2008

Linked List – Cyclic or Acyclic?

Posted on May 30, 2008 by nolfonzo

Another problem in the Programming Interviews Exposed book (see previous post) is to determine whether a Linked List is cyclic or not. The most obvious way to do this is to iterate over the list, checking whether the next element … Continue reading →

Posted in programming | Tagged , , | 3 Comments

More on Linked Lists – flattening and unflattening

Posted on May 30, 2008 by nolfonzo

More from the Programming Interviews Exposed book (see last post). In this problem you take a double linked list (where each node knows its previous and next nodes) with child elements, and flatten it. Then unflatten it back to its … Continue reading →

Posted in programming | Tagged , , , | Leave a comment