Intuit 2021 | Subsequences & DP Optimization | On-campus

Question 1: Divisible Subsequence Problem Statement Given an array of size N, check if there exists a subsequence of the given array whose sum is completely divisible by K. Input Format The first line of input contains T - the number of test cases. It's followed by 2T lines. The first line contains 2 space-separated integers - N and K. The second line contains the elements of the array. Output Format For each test case, print "Yes" if there is ...