You are given an array 'A' of size 'N' and an integer 'K'. You need to print the length of the longest subarray of array 'A' whose sum = 'K'.

// Approach: At every instance one side either right or left is ALWAYS Sorted // Condition to check left side is sorted is arr[start] <= arr[mid] { equals is imp since sometime key present at start == ...