Open In App
Related Articles

Linkedin Internship Interview Experience

Improve Article
Save Article
Like Article

Round 1: 

First round was online coding round.  It was hosted on hackerrank platform. 4 questions were there. 

6 people were selected for next round. 

Round 2: 

Second round was telephonic interview.  We have to write our code on a real-time collaborative code editor on skype. 

Firstly interviewer asks me about myself. Then 2 coding questions were asked. 

  • Find total number of visible nodes in a binary tree. A node is visible, if it has highest value in the path from root to node. It was done in O(n).
  • Find leftmost unique element in the array. eg. 2 5 2 3 5 6 8 . Answer is 3 for given example. I have done with the help of the hashmap in O(n) time complexity.

Coding style was given more importance than solution. 

Finally 4 persons were selected. I was one of 2 who was not selected.

Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out - check it out now!

Last Updated : 08 Sep, 2021
Like Article
Save Article
Similar Reads