Pergunta de entrevista da empresa Mindstix Software Labs
Given 2 integer array arr1 and arr2, find smallest number in arr1 which is not present in arr2 in one loop
Resposta da entrevista
Sigiloso
17 de fev. de 2020
let arr1 = [3, 4, 8, 5, 2]; let arr2 = [3, 4, 9, 8, 2]; let small = arr1[0]; for (let i = 0, k = 0; i arr1[i + 1] ? arr1[i + 1] : small; if (arr1[i] === arr2[k]) { small = arr1[i + 1]; i++; k = 0; } else if (arr2[k++]) { k++; } }
12