Divisible sum pairs on HackerRank solved!

can you please Explain it in O(N).

bro Make more videos

upload in hd ..

Here the time complexity is O(N^2) we can do it in O(N).

Awesome!! (not that I understood much) but it's cool! 😂😂😊😊

Good explanation. Keep it coming!