Given two arrays, the task is that we find numbers which are present in first array, but not present in the second array.
Input:
a[] = {1, 2, 3, 4, 5, 10};
b[] = {2, 3, 1, 0, 5};Output:
Output: 4, 10 Time Complexity:
O(n^2)| Name | Name | Last commit date | ||
|---|---|---|---|---|