You are viewing a single comment's thread. Return to all comments →
1.No there is no any error. I just want to omit the situation where i=n and j=n. That's all.
2.That is a nice solution. Then u can directly skip the i>=j part. Thanks a lot.
btw, can u explain the part u said "this would not impact the O(n^2) time complexity" please?
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 →
1.No there is no any error. I just want to omit the situation where i=n and j=n. That's all.
2.That is a nice solution. Then u can directly skip the i>=j part. Thanks a lot.
btw, can u explain the part u said "this would not impact the O(n^2) time complexity" please?