Chapter 41 — Symbols, Map & Set: Exercise 3 — Hard

Exercise 3 — Hard

Task:
Ikkita array berilgan. Set yordamida ularning kesishmasi (ikkalasida ham mavjud elementlar)ni toping, filter() va has() metodlaridan foydalaning:

let arr1 = [1, 2, 3, 4, 5];
let arr2 = [3, 4, 5, 6, 7];
// Natija: [3, 4, 5]

Required Concepts:

• Set.has()
• filter() (Chapter 14)
  Hint:
  let set2 = new Set(arr2); let intersection = arr1.filter(x => set2.has(x));