I would like to share my solution to this Challenge, it is not posted among the solutions and I would like to know what you think about it.

```
function diffArray(arr1, arr2) {
var newArr = arr1.concat(arr2).sort();
var a, i =0;
while (i<newArr.length)
{
a = newArr[i];
if (newArr.indexOf(a) != newArr.lastIndexOf(a))
{
newArr.splice(newArr.indexOf(a),newArr.lastIndexOf(a) - newArr.indexOf(a) + 1);
}
else
{
++i;
}
}
return newArr;
}
diffArray([1, "calf", 3, "piglet"], [1, "calf", 3, 4]);
```

the Advanced Solution there is very elegant and nice to read, but what about its Complexity? in my Code I put emphasis on Complexity and it’s ‘only’ O(n+m)Log(n+m) (due to sort()), while n,m are lengths of each array.

Tell me please what you think, and what is preferred at workplaces.

Itay.