const friendsList={

a: ['b', 'c'],
b: ['d', 'g'],
d: ['p', 'q'],
l: ['x', 'y'],
}
function findMutualFriend(friendsList, person){
// person a
// output: ['b', 'c', 'd', 'g', 'p', 'q']
}

case: l => [x, y]

const friendsList={
a: ['b', 'c'],
b: ['d', 'g'],
d: ['p', 'q'],
l: ['x', 'y'],
}
function findMutualFriend(friendsList, person){
// a: [b]
// person a
// output: ['b', 'c', 'd', 'g', 'p', 'q']
let firstList = friendsList[person];
let resultList = [];

function rec(inputArr) {
for (let friend of inputArr) {
resultList.push(friend);
if (friendsList[friend]) {
rec(friendsList[friend])
}
}
}

for (let friend in friendsList) {

console.log(friend, 'TEST')
if (friendsList[friend].includes(person)) {
resultList = [...resultList, ...friendsList[friend]]
}
}

rec(firstList);

console.log("Check", resultList);
}

findMutualFriend(friendsList, "b");

question: 2
------------------------------
let obj = {
a : {
b : (a,b,c)=>a+b+c,
c : (a,b,c) => a+b-c,
},
d : (a,b,c) => a-b-c
};
Create a function
Fn(obj)(1,1,1);
output
{
a : {
b : 3,
c : 1
}
d: -1
},

input:
let obj = {
a : {
b : (a,b,c) => a+b+c,
c : (a,b,c) => a+b-c,
},
d : (a,b,c) => a-b-c,
e : '',
f: [1, 2,3],
g: null,
};
function operation(obj) {
return function (...args) {
function rec(obj) {
for (let key in obj) {
if (typeof obj[key] === "function") {
obj[key] = obj[key](...args);
} else if (typeof obj[key] === "object") {
rec(obj[key]);
}
}
}
rec(obj);

return obj;
};
}

console.log("ANS", operation(obj)(1, 1, 1), obj["a"].b);