Question

APPLE | OA | SDE1 | Coding Questions and Solutions | 2022 | Set-2

Answer 1

2. The size of the longest incresing subsequence

Given an array like {1,1,3,2,6,4,1,7}, find the longest increasing subsequence. In this case it is 4, {1, 3, 6, 7}.

If there is no increasing subsequence, return 1. E.g. arr = {5,3,1}, return 1.