Company: Buyhatke_30march
Difficulty: medium
Tan and Test Cases Problem Description Tan is creating test cases for an array-based problem. He has to generate an integer array, successfully created those arrays and send them to his reviewer Taru for acceptance. We all know the nature of Taru, she always changes test cases. This time she will pick a range [l, r] (both inclusive) and add a value k in those array elements. After doing this, the 2nd reviewer Shubhanshu will now also change some value in the array formed. First he will reverse the array formed, and then he will pick a range [l, r] (both inclusive) and subtract k from all the values in that range. Since we are now ready with the test cases, here comes the question. You have to find the length of all non-decreasing subarray. If two subarray has the same length we will merge it that subarray in sorted order and again repeat the above process until we cannot merge any two subarrays. You have to print the least number of subarray we can have and follow by the size of all th