# longest_increasing_subsequence[prev] + array[i] if the length is longer.

/// subsequence which appeared first will be returned (see `test_example_1`). /// Inspired by [this LeetCode problem](https://leetcode.com/problems/longest-increasing ...