The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. An example:
For the following array:
$\{3, 10, 2, 1, 20\}$
Longest increasing sequence is:
$\{3, 10, 20\}$
For more information on this problem please see <ahref="https://en.wikipedia.org/wiki/Longest increasing subsequence"target="_blank">Wikipedia</a>.
</section>
## Instructions
<sectionid='instructions'>
Write a function that takes an array of numbers as a parameter and returns the longest increasing subsequence.
It is guaranteed that every array will have a longest increasing subsequence.
</section>
## Tests
<sectionid='tests'>
``` yml
tests:
- text: <code>findSequence</code> should be a function.