can any one give me code of this problem , with proper comments mentioned
Difficulty to code Divisible subset
hi @mehul.narendra.dubey do you need help understanding the concept used? Please dont directly ask for a code instead try writing one on your first, if you are facing errors share that code and I’ll be happy to help in debugging it 
hi @Ishitagambhir , in explanation video , we have checked weather there exist any subarray, we are not worried about the subset , also when it is a subset it means it will not be contigous , so i am confused how to manage such case
@mehul.narendra.dubey all the subarrays, are also subsets. So if we give answer for subarray, it is also valid (we have to report only one valid subset). Pigeonhole principle ensures that there will be at least one valid subarray. So you can apply the logic for divisible subarrays now, and print any valid subarray.
ok, i will try this , thank you