I applied through college or university. I interviewed at LinkedIn
Interview
I spoke to the team at the Career Fair at my university. My first round was scheduled two weeks after that, it was about my previous job and the projects I had worked on(Not sure if it counts as a round). The second round was a one hour technical interview with a couple of coding questions.
Interview questions [2]
Question 1
Print a tree in level order (Newline after each level)
I applied through a recruiter. The process took 3 weeks. I interviewed at LinkedIn
Interview
I had three interviews.
The first interview was a screening, he asked simple questions like what do you look for in an internship? What are your goals? What type of person are you? And he gave me two different teams to choose from, "money team" that works on the products that people will pay for. "Consumer team" a team that constantly gets feedback and works to satisfy users and consumers.
I had a good interview process but was not offered a position unfortunately. They were heavily focused on error handling (maybe because they are such a big company that errors are thrown to other teams or other members).
Interview questions [2]
Question 1
Find a triangle in a list of random numbers (a triangle is three numbers such that no one number is larger than the other two numbers added up)
I applied online. The process took 2 weeks. I interviewed at LinkedIn in Dec 2014
Interview
It was a great experience! It was a three round interview. The first round was just a simple phone screening. The second and third round were technical interviews. All interviewers were friendly, welcoming, and the questions were fair but challenging.
Interview questions [1]
Question 1
1. Write an algorithm that determines whether or not two binary trees are equivalent.
2. Given two (dictionary) words as Strings, determine if they are isomorphic. Two words are called isomorphic if the letters in one word can be remapped to get the second word. Example: Given "foo", "app"; returns true we can map 'f' -> 'a' and 'o' -> 'p' Given "bar", "foo"; returns false we can't map both 'a' and 'r' to 'o' Given "turtle", "tletur";