We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
It says when i > j in the question but you get 8 test cases wrong by excluding pairs where i == j. Make it clearer in the description what you're actually looking for.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Divisible Sum Pairs
You are viewing a single comment's thread. Return to all comments →
It says when i > j in the question but you get 8 test cases wrong by excluding pairs where i == j. Make it clearer in the description what you're actually looking for.