0

I wanted to compare two array and store the element that is present in both array into a new array. So I write this code but it didn't work.

    var sampleArray = [1, 2, 3, 4, 5, 6, 7];
var sampleArray2 = [5, 6, 7, 8, 9, 10 ,11];
var similarElements =[];
for (let i = 0; i < sampleArray.length; i++) {
    for (let j = 0; j < sampleArray2.length; j++) {
        if (sampleArray[i] === sampleArray2[j]) {
            similarElements.push();
        }
    }
    
    
    
}
console.log(similarElements);

3 Answers3

1

let arr1 = [1, 2, 3, 4, 5, 6, 7];
  arr2 = [5, 6, 7, 8, 9, 10 ,11];
  hash = arr1.reduce((h,e)=> (h[e]=1, h), {}), //iterate first array once
  common = arr2.filter(v=>hash[v]); //iterate secod array once
  
  console.log('Cpmmon elements: ', common);
pramod24
  • 1,096
  • 4
  • 17
  • 38
0

It searches for itself in sampleArray2, if it finds itself it'll add the number to similarArray

var sampleArray = [1, 2, 3, 4, 5, 6, 7];
var similarArray = [];

for (const num of sampleArray) {
    if (sampleArray2.indexOf(num) {
        similarArray.push(num);
    }
}
Robyn
  • 161
  • 1
  • 8
0
    var sampleArray = [1, 2, 3, 4, 5, 6, 7];
var sampleArray2 = [5, 6, 7, 8, 9, 10 ,11];
var similarElements =[];
for (let i = 0; i < sampleArray.length; i++) {
    for (let j = 0; j < sampleArray2.length; j++) {
        if (sampleArray[i] === sampleArray2[j]) {
            similarElements.push(sampleArray[i]);
        }
    }
    
    
    
}
console.log(similarElements);
kayuapi_my
  • 498
  • 1
  • 6
  • 9