title: using linked lists to determine subsets
body: <p>I'm trying to determine if a list (P) is a proper subset of another list (Q). These are sorted in ascending order.</p>
  
  <p>Considering a few cases such as P={2,3} and Q={2,3,5} and P={2,4} and Q={1,2,3,4} I'm trying t develop my algorithm..</p>
  
  <p>Thus far I know that I will be traversing through the linked list while p!=nullptr, and I know that if p->value==q->value that I will move to the next node. </p>
  
  <p>But after that I'm kinda stuck..I think p->value > q->value might also be a condition as well..</p>
  
  <p>Can you provide me with any hints moving forward?</p>