Empresas
Empleos
  • Sobre nosotros
  • Soluciones
    • Publicación de vacantes
      Publica tu vacante y recibe candidatos calificados en 48h.
    • Evaluación de candidatos
      500+ pruebas técnicas y psicológicas, más anti-fraude.
    • Headhunting
      Búsqueda ejecutiva a la medida de principio a fin.
    • Nómina + EOR
      Dispersión de nómina y EOR en más de 15 países de LATAM.
  • Precios
  • Empleos

0

134
Vistas
Find common elements from arrays's which are inside an Object - Javascript

So I have an Object that contains multiple arrays

x = {
    c: ['Full_Name', 'Last_Name', 'Email', 'Organizations', 'MISC', 'UNIQUEID']
    small: ['Title', 'Organizations', 'URL', 'UNIQUEID']
    .
    .
    .}

What is the best and the fastest way to find all the similar elements from all these arrays?

So for example in this case the answer will be ['Organization', 'UNIQUEID']

about 4 years ago · Juan Pablo Isaza
2 Respuestas
Responde la pregunta

0

a possible approach using reduce and Set. for the accumulator I'm initializing it with the first array (x.c). Doesn't matter which one since in the end we are taking intersection anyway. Inside the reduce I'm intersecting the accumulator with the current iteration array

const x = {
  c: ['Full_Name', 'Last_Name', 'Email', 'Organizations', 'MISC', 'UNIQUEID'],
  small: ['Title', 'Organizations', 'URL', 'UNIQUEID'],
  big: ['abc', 'Organizations', 'def', 'UNIQUEID']
}


const res = Object.values(x).reduce((acc, curr) => {
  return new Set(curr.filter(i => acc.has(i)))
}, new Set(x.c))

console.log([...res])

almost similar with a for loop except I'm skipping first element in loop

const x = {
  c: ['Full_Name', 'Last_Name', 'Email', 'Organizations', 'MISC', 'UNIQUEID'],
  small: ['Title', 'Organizations', 'URL', 'UNIQUEID'],
  big: ['abc', 'Organizations', 'def', 'UNIQUEID']
}

const values = Object.values(x)
let acc = new Set(values[0])
for (let i = 1; i < values.length; i++) {
  acc = new Set(values[i].filter(j => acc.has(j)))
}

console.log([...acc])

about 4 years ago · Juan Pablo Isaza Denunciar

0

You're looking for a Set intersection -

function intersection2(a, b) {
  if (a.size > b.size)
    return intersection2(b, a)
  const r = new Set
  for (const v of a)
    if (b.has(v))
      r.add(v)
  return r
}

You can compute the intersection of many sets by combining reduce and intersection2 -

function intersection(s, ...sets) {
  return sets.reduce(intersection2, s)
}

To use it with your code, get all values of x using Object.values and map over them to create an array of sets. Finally call intersection with all of the sets -

const x = {
  c: ['Full_Name', 'Last_Name', 'Email', 'Organizations', 'MISC', 'UNIQUEID'],
  small: ['Title', 'Organizations', 'URL', 'UNIQUEID'],
  big: ['abc', 'Organizations', 'def', 'UNIQUEID']
}

const result =
  intersection(...Object.values(x).map(v => new Set(v)))

console.log(result)
Set [ "Organizations", "UNIQUEID" ]

If you want the result as an array, you can convert it using Array.from -

console.log(Array.from(result))
[ "Organizations", "UNIQUEID" ]
about 4 years ago · Juan Pablo Isaza Denunciar
Responde la pregunta
Encuentra empleos remotos

¡Descubre la nueva forma de encontrar empleo!

Top de empleos
Top categorías de empleo
Empresas
Publicar vacante Precios Comercial
Legal
Términos y condiciones Política de privacidad
© 2026 PeakU Inc. All Rights Reserved.
Andres GPT
Recomiéndame algunas ofertas
Necesito ayuda