title: Remove and reorder list elments
body: <p>Is it possible to solve the following problem <strong>WITHOUT</strong> using C# loop (foreach; for; while; etc) but only C# Linq or lambda expressions?</p>
  
  <p>Problem: 
  Given a list of Task objects and a list of removed TaskIds.  I want that list is updated with only elements that are <strong>NOT</strong> in the list of removed TaskIds, and the remaining Task elements are re-ordered, too.</p>
  
  <h2>Details:</h2>
  
  <pre><code>(1*) Given a list of Task objects:
  
  TaskId  Group   Name    Order
  
  
  281        1    "abc"   1  
  726        1    "dre"   2  // note: will be removed  
  9891       1    "euf"   3  // note: will be removed  
  87         1    "wop"   4  
  932        1    "hjd"   5  
  
  102        2    "fhl"   1  // note: will be removed  
  44         2    "bgg"   2  
  30         2    "qds"   3  
  293        2    "djf"   4  // note: will be removed  
  389        2    "hkd"   5  
  
  12         3    "hjf"   1  
  900        3    "xdf"   2  // note: will be removed  
  
  
  (2*) Given a list of removed TaskIds:  
  TaskId  
  726  
  9891  
  102  
  293  
  900  
  </code></pre>
  
  <p>Now, after removing list (1*) based on list (2*), I want list (1*) looks like (note: the remaining elements' orders are updated, too):  </p>
  
  <p>List (1*) is updated:</p>
  
  <pre><code>TaskId  Group   Name    Order  
  
  281        1    "abc"   1  
  87         1    "wop"   2  // note: new order  
  932        1    "hjd"   3  // note: new order  
  
  44         2    "bgg"   1  // note: new order  
  30         2    "qds"   2  // note: new order  
  389        2    "hkd"   3  // note: new order  
  
  12         3    "hjf"   1  // note: order is kept unchanged.    
  </code></pre>
  
  <p>The Task class is defined like:</p>
  
  <pre><code> public class Task {
        public int TaskId { get;set; }
        public int Group { get; set;}
        public string Name { get; set; }
        public int Order { get; set;}
  
  }
  </code></pre>
  
  <p>Thank you in advance.</p>