title: How do you check if one array is a subsequence of another?
body: <p>I'm looking to explore different algorithms, both recursive and dynamic programming, that checks if one arrayA is a subsequence of arrayB. For example,</p>
  
  <pre><code>arrayA = [1, 2, 3] 
  arrayB = [5, 6, 1, 7, 2, 9, 3]
  
  thus, arrayA is indeed a subsequence of arrayB. 
  </code></pre>
  
  <p>I've tried a few different searches, but all I can seem to find is algorithms to compute the longest increasing subsequence. </p>