Pergunta de entrevista da empresa Snapwiz
Online : 1) Nearest to zero element in an array 2) Longest prefix program 3) single loop reversal of string online questions require you to fill the logic only , not to write the entire program Pen paper : input =['acr', 'bat','car','atb','rca','rac','xyz'] desired output: [ ['acr','car','rca','rac'], ['bat','atb'],['xyz']] i.e grouping of psuedonyms .
Resposta da entrevista
Sigiloso
let arr = ["acr", "bat", "car", "atb", "rca", "rac", "xyz"]; let flag = 0; let result = []; let pos = 0; for (let i = 0; i < arr.length; i++) { if (!result.flat().includes(arr[i])) { result.push([arr[i]]); pos += 1; for (let j = i + 1; j < arr.length; j++) { if (arr[i].length === arr[j].length) { for (let k = 0; k < arr[i].length; k++) { if (arr[j].includes(arr[i][k])) { flag += 1; } } if (flag == arr[i].length) { result[pos - 1].push(arr[j]); } flag = 0; } } } } console.log(result);