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.
Time complexity O(n + m), space compexity O(max(n, m)):
int[] barr = new int [10000];
for (int i : brr) {
barr[i]++;
}
for (int i : arr) {
barr[i]--;
}
List<Integer> res = new ArrayList<>();
for (int i = 0; i < 10000; i++) {
if (barr[i] != 0) {
res.add(i);
}
}
return res;
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Missing Numbers
You are viewing a single comment's thread. Return to all comments →
Time complexity O(n + m), space compexity O(max(n, m)):