Divisible subarray

#1

Not able to pass testcase

#2

I didn’t understand the complexity part
we have given n <=10^5 means the n take max upto 1lakh elements if we generate all the subarrays then two loops are required means the complexity is O(n^2) then how become 10^10 in video

#3

test case doesn’t pass ?