Divisible Subarray Problem

#1

I tried with the approach mention in the hint video, could you please tell me which test case i;m missing…?

#2

at line no 48
correct statement is
Map[(sum%n+n)%n] += 1;

this is because sum can be negative also
so to make mod positive we have to do this

i hope this helps
if yes hit a like and don’t forgot to mark doubt as resolved :grinning:
if you have more doubts regarding this feel free to ask