Join Regular Classroom : Visit ClassroomTech

interview experience

Coding Questions | The Closest Pair | Codewindow.in

Given an integer array with ‘N’ (2<=N<=1000) points. Find the distance between the closest pair of points. Input Format:Input 1: N, the number of points in an arrayInput 2: Array of numbers Output Format:Return the distance between the closest pair of points. Example 1:Input 1: 3Input 2: {-10,0,11} Output:10 Explanation:In the above example, the distance

Coding Questions | The Closest Pair | Codewindow.in Read More »

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 »