Databases
StackOverflow2013
Postsdbo
POInterview question: remove duplicates from an unsorted linked list
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POInterview question: remove duplicates from an unsorted linked list
    primarykey
    data
    text
    <p>I'm reading <a href="http://rads.stackoverflow.com/amzn/click/145157827X" rel="nofollow">Cracking the Coding Interview, Fourth Edition: 150 Programming Interview Questions and Solutions</a> and I'm trying to solve the following question:</p> <blockquote> <p>2.1 Write code to remove duplicates from an unsorted linked list. FOLLOW UP: How would you solve this problem if a temporary buffer is not allowed?</p> </blockquote> <p>I'm solving it in C#, so I made my own <code>Node</code> class:</p> <pre><code>public class Node&lt;T&gt; where T : class { public Node&lt;T&gt; Next { get; set; } public T Value { get; set; } public Node(T value) { Next = null; Value = value; } } </code></pre> <p>My solution is to iterate through the list, then for each node to iterated through the remainder of the list and remove any duplicates (note that I haven't actually compiled or tested this, as instructed by the book):</p> <pre><code>public void RemoveDuplicates(Node&lt;T&gt; head) { // Iterate through the list Node&lt;T&gt; iter = head; while(iter != null) { // Iterate to the remaining nodes in the list Node&lt;T&gt; current = iter; while(current!= null &amp;&amp; current.Next != null) { if(iter.Value == current.Next.Value) { current.Next = current.Next.Next; } current = current.Next; } iter = iter.Next; } } </code></pre> <p>Here is the solution from the book (the author wrote it in java):</p> <blockquote> <p>Without a buffer, we can iterate with two pointers: “current” does a normal iteration, while “runner” iterates through all prior nodes to check for dups. Runner will only see one dup per node, because if there were multiple duplicates they would have been removed already.</p> </blockquote> <pre><code>public static void deleteDups2(LinkedListNode head) { if (head == null) return; LinkedListNode previous = head; LinkedListNode current = previous.next; while (current != null) { LinkedListNode runner = head; while (runner != current) { // Check for earlier dups if (runner.data == current.data) { LinkedListNode tmp = current.next; // remove current previous.next = tmp; current = tmp; // update current to next node break; // all other dups have already been removed } runner = runner.next; } if (runner == current) { // current not updated - update now previous = current; current = current.next; } } } </code></pre> <p>So my solution always looks for duplicates for the current node to the end, while their solution looks for duplicates from the head to the current node. I feel like both solutions would suffer performance issues depending on how many duplicates there are in the list and how they're distributed (density and position). But in general: is my answer nearly as good as the one in the book or is it significantly worse?</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USWill
    1. USKiril
    plurals
    1. This table or related slice is empty.
    1. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POInterview question: remove duplicates from an unsorted linked list
      1. USfastcodejava
      1. VTFavorite
    2. VO
      singulars
      1. POInterview question: remove duplicates from an unsorted linked list
      1. USennuikiller
      1. VTFavorite
    3. VO
      singulars
      1. POInterview question: remove duplicates from an unsorted linked list
      1. This table or related slice is empty.
      1. VTUpMod
    1. COList isn't an array, so you don't need a temporary buffer anyway :)
      singulars
      1. POInterview question: remove duplicates from an unsorted linked list
      1. USruslik
    2. COI think it will turn out to a better interview question to find a bug in the solution posted by the author.
      singulars
      1. POInterview question: remove duplicates from an unsorted linked list
      1. USJ.W.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload