Walmart 2025 January | Array Combinatorics & Math Hacks | On-campus

Question 1: Non-Decreasing Subarrays Problem Statement Given an array of integers of size N, count the total number of subarrays of the given array which are non-decreasing. Input Format First line of input contains T - number of test cases. Its followed by 2T lines, the first line contains N - size of the array and the second line contains the elements of the array. Output Format For each test case, print the count of the number of subarrays which ...