Skip to content

Latest commit

 

History

History
22 lines (15 loc) · 360 Bytes

File metadata and controls

22 lines (15 loc) · 360 Bytes

Find Elements Which Are Present In First Array And Not In Second

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)