Linkedin SDE Interview |Onsite Coding Rounds | Bangalore

Round 1

Questions:

1. Find the Celebrity
2. Lowest Common Ancestor of a Binary Tree III

The interviewer asked to write the most optimized code for both questions. The candidate completed both questions and finished the interview 10 minutes early.

Round 2

Questions:

1. Max Consecutive Ones II
   • Follow-up: If the array is cyclic, how will the solution change?
2. All O`one Data Structure

The candidate completed the coding of the first question with the most optimized solution. They completed coding all methods for the second question except the decrement function but provided a solution that runs in O(1) time complexity.