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.
Note this is sorting a and b (which takes O(n log n)) solely for the sake of getting the max and min in contant time. This can be improved by linearly searching for the max/min in O(n)
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Between Two Sets
You are viewing a single comment's thread. Return to all comments →
Note this is sorting a and b (which takes O(n log n)) solely for the sake of getting the max and min in contant time. This can be improved by linearly searching for the max/min in O(n)