A recruiter reached out on LinkedIn, stating they are expanding in SF and want to hire multiple engineers for a promising project that impacts the whole company.

I realized it was a good opportunity. After a call with the recruiter, I was explained the interview process:

• A timed hackathon test
• Followed by a standard 1-hour technical phone interview
• Followed by an onsite at the SF office

I did not make it to the onsite but will share the questions I faced for the phone interview.

/* Problem Name is &&& Second Smallest &&& PLEASE DO NOT REMOVE THIS LINE. */

/**

• Instructions to candidate.
• 1. Run this code in the REPL to observe its behaviour. The execution entry point is main().
• 1. Consider adding some additional tests in doTestsPass().
• 1. Implement secondSmallest() correctly.
• 1. If time permits, explore some possible follow-ups. */

/**

• Returns the second smallest element in the array x.
• Returns 0 if the array has fewer than 2 elements. */

// [1, 0 ,2]

function secondSmallest(x) { // todo: implement this function

var smallest = Infinity, smallestDiff = Infinity, diffArray = [];

for (var i = 0; i < x.length; i++) { if (x[i] <= smallest) { smallest = x[i]; } }

for (var j = 0; j < x.length; j++) { if (x[j] !== smallest) { diffArray.push(x[j] - smallest); } }

for (var k = 0; k < diffArray.length; k++) { // smallest diff if (diffArray[k] <= smallestDiff) { smallestDiff = diffArray[k]; } } return smallest + smallestDiff; }