Hey everyone, hope you're doing well!
I currently work as an SDE-2 at Amazon and recently had the opportunity to interview with LinkedIn for an SDE-3 backend role. The recruiter reached out to me by email, and we had an initial call discussing my current roles and responsibilities, as well as the details of the position they were hiring for.
They were particularly interested in whether I had dealt with concurrency issues in the past, so it's good to be prepared with specific instances

Round 1:
Question 1:
You're an usher at a theater, responsible for seating guests.

Given a row of seats represented as an array, where 1 indicates an occupied seat and 0 indicates an empty seat, determine whether you can seat a given number of people under the condition that no one wants to sit next to another person.

Implement a function that takes the seat arrangement and the number of people to be seated and returns whether it's possible to accommodate them.

Question 2:
A tournament tree is a binary tree where each parent node holds the minimum value of its two children.

Given such a tree, find the second minimum value.

Constraints:

• Each node has either two children or none.
• Leaf nodes have distinct and unique values.

Implement a function to determine the second smallest value in the tree.

Verdict: No Hire
I solved both problems within an hour, taking a small hint for the second one. I was quite hopeful for the next rounds but was unexpectedly rejected without any specific feedback.

Microsoft Interview Experience
Flipkart Interview Experience
Groupon Interview Experience
Allen Interview Experience
super.money Interview Experience