Atlassian SDE OA 2026-January | Dynamic Programming & Sweepline | On-campus

Question 1: Non Decreasing Subsequences Problem Statement You are given an array of integers of size N. Find the total number of non-decreasing subsequences present in the array. Input Format The first line of input contains T - the number of test cases. It is followed by 2T lines, the first line contains N - the size of the array. The second line contains the elements of the array. Output Format Print the total number of non-decreasing subsequences present in ...