I applied online. The process took 3 weeks. I interviewed at LinkedIn (San Jose, CA) in Mar 2019
Interview
Applied online and got an email from a recruiter in 2 weeks. Did the phone interview in a week. The interviewer was nice. He asked a LC medium question. It was not hard.
Interview questions [1]
Question 1
Questions you can solve with data structures. + domain-specific questions in the resume.
I applied through a recruiter. The process took 2 months. I interviewed at LinkedIn (San Francisco, CA) in Jun 2019
Interview
Interviewing for frontend position. 1 phone screen, then on-site. Was a pretty pleasant experience, just didn't bring my A game. Phone screen was pretty easy. Then onsite was 3 technical rounds, one was a little annoying with how the interviewer pushed me towards a solution that wasn't my own, but apparently, I had good feedback from that round. 1 system design, 1 behavioral/system design, and 1 behavioral. I flopped on the system design question and I was encouraged to reapply in a year. Disappointed with how I performed, but it was a good experience.
I applied online. I interviewed at LinkedIn (San Francisco, CA) in Jun 2019
Interview
Phone screen interview. It was as I expected it to be with minimal to no interaction with the interviewer during the coding questions. You would have to be really good figuring out optimal solution in given time or solved the question before hand. I was given a problem that required using a modified version of binary search. I was able to explain my approach but got caught up in the implementation part. The 2nd problem was easier since its on leetcode. Altho it was optimal and the code format was easy to follow, the feedback on the formatting was not good. I thought that's unfair. Another problem I had was I gave explanations to approaches for my solutions before and after coding. The feedback said I didn't communicate while coding. Not sure what the standard was for commination. It felt like I could say the same about the interviewer's communication.
Interview questions [1]
Question 1
1) given list is sorted characters and given input character, get the character if present and if not get the closest character in the array that appears before it alphabetically.
2) shortest word distance 2 in leetcode.