Please tell me how to remove all array that duplicates. Example
let arr1=['a', 'b', 'c', 'd']
let arr2=['a', 'e', 'd', 'f', 'p']
I want result like that
let arr3=['b', 'c', 'f', 'p']
please script in javascript or aggregate MongoDB
Please tell me how to remove all array that duplicates. Example
let arr1=['a', 'b', 'c', 'd']
let arr2=['a', 'e', 'd', 'f', 'p']
I want result like that
let arr3=['b', 'c', 'f', 'p']
please script in javascript or aggregate MongoDB
You can achieve it in this simple way
let arr1=['a', 'b', 'c', 'd'];
let arr2=['a', 'e', 'd', 'f', 'p'];
var getInA_Not_InB = (a, b) => { return a.filter(v => b.indexOf(v) == -1)};
var result = getInA_Not_InB(arr1, arr2)
.concat(getInA_Not_InB(arr2, arr1));
console.log(result);
You can try:
let arr1 = ['a', 'b', 'c', 'd'];
let arr2 = ['a', 'e', 'd', 'f', 'p'];
let arr3 = [...findDifference(arr1, arr2), ...findDifference(arr2, arr1)];
console.log(arr3);
/* Find all elements in array1 that are not in array2 */
function findDifference(array1, array2) {
return array1.filter(element => !array2.includes(element));
}
Another way is to merge 2 array and count frequency and filter the elements with frequency 1 , you dont need to worry about finding difference between 2 array separately and concatenate them
const arr1=['a', 'b', 'c', 'd']
const arr2=['a', 'e', 'd', 'f', 'p']
let merged=[...arr1,...arr2]
const mapped = [...new Set(merged)].filter(a => merged.filter(a1 => a1 === a).length ===1 );
console.log(mapped);