InfyTQ Advantage Round Python Coding Questions & Answer 2022 Special LIS Problem statement-: Given an array of N integers. Find the length of the longest increasing subsequence such that the difference between adjacent elements of the longest increasing subsequence is also increasing. Note: It’s not required that the sequence should have strictly increasing numbers and the differences are also not required to be strictly increasing. Ex: [1,2,3,4,5]. The longest increasing subsequence will be [1,2,4,5] but the difference array in this case is [1,2,1] which is not increasing. If we consider [1,2,4] or [1,2,5] then the numbers as well as the differences are in increasing order. Function Description: Complete the specialLIS function in the editor below. It has the following parameter(s): Parameters: Name Type Type size Integer size of array arr ...