Find It hint explanation not clear

#1

How does the sum array helps us in the finding how many multiples of k are present in the array?

#2

@duttrohan0302 we are just using the sieves algorithm to get the counts of all numbers divisible by every k, sum[k]+=cnt[Multiple of k], so in the end sum[k] array gives us the final count for any k.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.