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

Round 1

Questions:

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.