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.
The space complexity can be reduced to O(min(n,k)) if a hashtable is used instead of an array. So space complexity and time complexity both scale linearly.
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 →
The space complexity can be reduced to O(min(n,k)) if a hashtable is used instead of an array. So space complexity and time complexity both scale linearly.