LinkedIn interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
LinkedIn
2 rounds | 6 Coding
problems
Selected Interview preparation journey
Journey
I started doing DSA problems in my 2nd semester. Most of the questions I practiced were from Leetcode . At the very beginning i solved hackerrank and leetcode easy questions and then shifted to leetcode medium hard and codeforces.
Solving questions TopicWise and understanding the pattern of questions helped me a lot. Every new question is a variation of standard question and finding patterns are most important. I practised more and saw others solution too as that thought me better approaches to solve same question.
Application story
I was a part of the LinkedIn CoachIn Program in which I was selected among the top 60 girls in India.After completion of this mentorship program, i got a chance to sit for an interview for SDE intern .
Why selected/rejected for the role?
I was selected for a summer internship at LinkedIn as an SDE intern. On the basis of our performance in 4 month mentorship and our mentor's review and positive feedback from interviewers, I got this offer. I believe that if one keeps their goal clear and starts preparing on time.
Preparation
Duration: Simultaneously with college studies
Topics: Data Structures, DBMS, Pointers, OOPS, Algorithms, Dynamic Programming
Tip 1 : Make your resume attractive by adding good projects and achievements
Tip 2 : Start your preparation early and Apply for all opportunities .
Tip 3 : Solve DSA problems on regular basis
Application process
Where: Campus
Eligibility: Only for girls selected after linkedIn CoachIn
Tip 1 : Add good projects
Tip 2 : Don't lie in your resume
Interview rounds
01
Round
Hard
Video Call
Duration45 minutes
Interview date11 Aug 2022
Coding problem2
It was a medium level interview round for me conducted on hackerrank
1. Common Digit Longest Subsequence
Moderate
31m average time
0/80
Asked in companies
You have been given an array of 'N' Integers. Find the length of the longest subsequence such that each adjacent element of the subsequence has at least one digit in common.
Note :
A sequence 'A' is a subsequence of a sequence 'B' if 'A' can be obtained from 'B' by deletion of several (possibly, zero) elements. For example, [3,1] is a subsequence of [3,2,1] and [4,3,1], but not a subsequence of [1,3,3,7] and [3,10,4].
2. DSA Questions
What is the time complexity of finding an element in a binary search tree with n elements?
What is the time complexity to find an element in a linked list of length n?
Problem approach
Tip 1:For data structures and algorithm part you should have a good knowledge of time complexity and space complexity
Tip 2:Dont answer the questions you don't know, tell them that you will revise this point
Tip 3:
02
Round
Medium
Video Call
Duration45 minutes
Interview date12 Aug 2022
Coding problem4
It was easier that first round for me and interviewer also asked some oops concepts after coding question
1. Minimum Path Sum
Moderate
15m average time
85% success
0/80
Asked in companies
Ninjaland is a country in the shape of a 2-Dimensional grid 'GRID', with 'N' rows and 'M' columns. Each point in the grid has some cost associated with it.
Find a path from top left i.e. (0, 0) to the bottom right i.e. ('N' - 1, 'M' - 1) which minimizes the sum of the cost of all the numbers along the path. You need to tell the minimum sum of that path.
Note:
You can only move down or right at any point in time.
Problem approach
We will have f[i][j] = minimum sum we can get in the i x j grid, so we can see that to because we can just move either down or right at any point in time, therefore we can calculate f[i][j] = grid[i][j] + min(f[i-1][j],f[i][j-1]). By observation we can see that f[i][j] is only dependent on i-1 (previous row) and j-1 (previous column) so we do not need to create a f[i][j] array, to save space we just need to have a f[j] array to store each row and calculate at the same time.
2. OS Question
What is difference between micro kernel and macro kernel?
Problem approach
Tip 1: Just keep notes of core subjects and keep revising it
Tip 2: for DBMS revise SQL queries.
Tip 3:
3. DBMS Questions
Give an example of DCL commands
Why MySql is better than excel
Problem approach
Tip 1:Just have a clear knowledge of any core subjects
Tip 2:Even if these subjects are not taught in your semester or branch just keep a note of these topics
4. OS Question
What is a long term scheduler & short term schedulers?
Problem approach
Tip 1:
Tip 2:
Tip 3:
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
SDE - Intern
2 rounds | 2 problems
Interviewed by LinkedIn
Selected 
1656 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 4 problems
Interviewed by LinkedIn
Selected 3200 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 5 problems
Interviewed by LinkedIn
Selected 0 views
1 comments
0 upvotes
SDE - Intern
2 rounds | 4 problems
Interviewed by LinkedIn
Rejected
1006 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - Intern
2 rounds | 4 problems
Interviewed by Arcesium
Selected 3688 views
0 comments
0 upvotes
SDE - Intern
3 rounds | 5 problems
Interviewed by Arcesium
Selected 2650 views
0 comments
0 upvotes
SDE - Intern
3 rounds | 5 problems
Interviewed by BNY Mellon
Selected 2324 views
0 comments
0 upvotes