Join Regular Classroom : Visit ClassroomTech

Coding Questions

Coding Questions | Longest Increasing Subsequence | Codewindow.in

Given an integer array ‘A’, find the length of its longest increasing subsequence (LIS). LIS is a sub-array of the given integer array where the elements are sorted in a monotonic/strict increasing order. Input Format:Input 1: Integer input ‘n'(1<=input1<=1000)Input 2: Integer array ‘A’ input, containing ‘n’ integers. Output Format:Return the length of its LIS. Example

Coding Questions | Longest Increasing Subsequence | Codewindow.in Read More »