I applied online. I interviewed at LinkedIn in Dec 2024
Interview
I got a call from recruiter for technical phone screen round. She mentioned I would be expected to solve two DSA questions.
First round two DSA questions were asked. One was of linkedlist and other was of binary search.
Interview questions [1]
Question 1
Question 1. Rotate a linked list by k times
Question 2. Search in rotated sorted array
Question 3: given n students, n lockers, each student toggles the locker to their multiple times, find all the lockers which are open at the end
I applied online. The process took 6 weeks. I interviewed at LinkedIn in Dec 2024
Interview
[Coding round 1]
2 questions. 1 Easy and 1 DP
DP question was unnecessarily hard, required 2D DP with bit masking. Interviewer was fairly new, had ~3y experience and was dead set on the optimal solution for the hard DP problem. If you're interviewing with Linkedin make sure to blindly memorize leetcode solutions in case you get a junior interviewer.
Interview questions [1]
Question 1
1 - Given a boolean matrix, find the influencer. Influencer is a person who does not follow anyone, but is followed by everyone else. a[i][j] -> i follows j , a[i][i] - is guaranteed to be false
2 - Given an array of random integers return if this array can be divided into k subsets where sum of each subset is equal.
I applied through a recruiter. The process took 2 weeks. I interviewed at LinkedIn in Nov 2024
Interview
I got a call from recruiter for technical phone screen round. She mentioned I would be expected to solve two DSA questions.
I was asked 1 dsa question , Find leaves of binary tree leetcode question. I was able to give optimal approach in 15 min. Interviewer didn’t understand it and went on to ask about 1NF, diff between unqiue key and primary key and indexing.
He also asked another coding question in last 10 min. I was able to give answer to the first part.
Interview questions [1]
Question 1
Find leaves of binary tree ( https://leetcode.com/problems/find-leaves-of-binary-tree/ )
Given n balls of unequal weight and a weighing scale with two pans. Minimum comparisons are needed to find heaviest ball. ( ans - n -1)
Min comparisons needed for m heaviest ball?
Maintaining a max heap will give min comparison.