Divisible Subarray

#1

Link: https://ide.codingblocks.com/s/380856
2/5 test cases are passing. Thanks in advance for your help.

#2

Hello @himanshugupta8 have you seen the prateek sir’s video for this ?

1 Like
#3

yes i did. Something is wrong in the code. Can you please look at the code for once?

#4

P.S I tried changing all int to long long

#5

I got the problem just help me out further.
The problem is I hadn’t considered negative cases. I don’t know the concept of negative mod n
Can you please tell me that

#6

the negative concept is handled by making your (sum +n)%n . in this way you can handle for negative cases as well.

1 Like
#7

if you have any other doubt please let me know.
Happy Learning !!

1 Like
#8

it is still giving wrong answer.
sharing test case so you may able to analyze it easily
t=1,n=5
a[i] = -1 -3 -2 -6 -4 (1 indexed)
sum[i] = 0 -1 -4 -6 -12 -16
mod[i] = 0 0 2 0 4 0
mod[i] expected = 0 -1 -4 -1 -2 -1
My code is giving wrong mod[i] and i am using (sum+n)%n. Can you please help?

#9

hey @himanshugupta8 please share your updated code i will try to correct it.

1 Like
#10
#11

@himanshugupta8 no you are just complicating the code.

#12

ok i’ll try again from start

#13

@himanshugupta8 try this:


if you dint understand anything in this then you can ask here.
Happy Learning !!

#14

shouldn’t last loop goes upto 10^5

#15

shouldn’t last loop goes upto 10^5
because prefixSum can be greater than n

#16

hey @himanshugupta8 the last loop should run for equal to n times as we are taking modulo with n.
so sum cannot be greater then n thats why we are running loop for n times.
because the sum can be between 0 to n only.

#17

Thanks @tusharaggarwal272 for your patience. You have resolved my doubt.

#18

hey @himanshugupta8 if you feel that your doubt is cleared please markt this doubt as resolved.
Happy Learning !!

1 Like
#19

I tried multiple times but it isn’t marked as resolved.

#20

Please drop the mail regarding this issue at [email protected]