Longest Strictly Increasing Subsequence

Problem Statement

Longest Strictly Increasing Subsequence Problem Description A subsequence is obtained by deleting zero or more elements from a sequence while keeping the remaining elements in their original order. The deleted elements need not be adjacent, so a subsequence does not have to be a contiguous block. A sequence is strictly increasing if every element is greater than the element before it. Equal values therefore cannot both appear in a strictly increasing subsequence. Given a sequence of integers, determine the length of its longest strictly increasing subsequence. For example, with arr = [1, 2, 2, 3, 1, 6] , some strictly increasing subsequences are [1, 2, 3] and [1, 3, 6] . The longest one is [1, 2, 3, 6] , so the answer is 4 . Function Signature Complete the function findLIS in the editor below. findLIS has the following parameter: arr : the sequence of n integers Returns: int : the length of the longest strictly increasing subsequence of arr Input Format The input is read for you by the