Linkedin | Senior Software Engineer | Banglore | December 2024 [Reject]

linkedin logo
linkedin
sde-3 backend engineerbangaloreRejected
February 3, 202532 reads

Summary

I interviewed with LinkedIn for an SDE-3 backend role in Bangalore in December 2024. Despite successfully solving both coding problems in the first round, my application was unexpectedly rejected without any specific feedback.

Full Experience

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

I was presented with two coding challenges. I managed to solve both problems within an hour, though I did require a small hint for the second one. I was quite hopeful for the subsequent rounds after this performance, but unfortunately, I was unexpectedly rejected without receiving any specific feedback on my interview.

Interview Questions (2)

Q1
Theater Seat Arrangement
Data Structures & Algorithms

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.

Q2
Second Minimum in Tournament Tree
Data Structures & Algorithms

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.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!