AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
LinkedIn Software Developer Intern Interview Questions and Answers
6 Interview questions
Split the String Problem Statement
You are given a string str consisting of N lowercase alphabets. Your task is to determine if it is possible to divide the string into three non-empty substrings such that...
Given a string, determine if it can be split into three non-empty substrings where one is a substring of the other two.
Check if any substring of the string is a substring of the other two substrings.
Iterate through all possible divisions of the string into three non-empty substrings.
Use two pointers to find all possible substrings efficiently.
Snake and Ladder Problem Statement
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, fi...
Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.
Use Breadth First Search (BFS) to find the shortest path from the starting cell to the last cell.
Maintain a queue to explore all possible moves from each cell.
Consider the effect of snakes and ladders on the movement of the player.
Handle the case where the last cell is unreachable by returning -1.
Optimize the solut...
Check if Two Trees are Mirror
Given two arbitrary binary trees, your task is to determine whether these two trees are mirrors of each other.
Explanation:
Two trees are considered mirror of each other if:
...Check if two binary trees are mirrors of each other based on specific criteria.
Compare the roots of both trees.
Check if the left subtree of the first tree is the mirror of the right subtree of the second tree.
Verify if the right subtree of the first tree is the mirror of the left subtree of the second tree.
Determine Count of Good Triplets
You are given two arrays ARR1 and ARR2, containing N and M elements respectively. There are two types of 'good triplets' that need to be identified in these arrays.
Type 1...
Calculate the total number of 'good triplets' in two arrays based on given conditions.
Iterate through all possible triplets in both arrays and check if they satisfy the conditions
Use nested loops to iterate through all combinations of indices in both arrays
Check the conditions for Type 1 and Type 2 'good triplets' separately
Increment a counter for each valid 'good triplet' found
Return the total count of 'good trip...
Median of Two Sorted Arrays Problem Statement
Given two sorted integer arrays A and B with sizes N and M respectively, find the median of the combined array that results from merging arrays A and B. If the...
Find the median of two sorted arrays after merging them.
Merge the two sorted arrays into one sorted array.
Calculate the median based on the length of the combined array.
Handle cases where the total number of elements is even or odd.
DFS Traversal Problem Statement
Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GRA...
DFS traversal to find connected components in an undirected and disconnected graph.
Use Depth First Search (DFS) to traverse the graph and find connected components
Maintain a visited array to keep track of visited vertices
For each unvisited vertex, perform DFS to explore the connected component it belongs to
Print the vertices of each connected component in ascending order
LinkedIn Software Developer Intern Interview Experiences
3 interviews found
Anonymous
Selected
I applied via Job Fair and was interviewed in Jul 2024. There were 2 interview rounds.
More focus on dp,graphs.
(2 Questions)
- Q1. Focus on backend concepts,routing.
- Q2. Question on flood fill algo,backtracking.
I appeared for an interview in Jan 2021.
(2 Questions)
Round duration - 65 minutes
Round difficulty - Hard
Timing (6pm - 8pm)
Environment was user friendly
As usual the online round had three coding questions and 20 MCQs. This was a pretty easy round and it’s duration was 65 minutes. The round consisted of questions from various domains like Algorithm, Data Structure, Operating System and Aptitude.
- Q1.
Determine Count of Good Triplets
You are given two arrays
ARR1andARR2, containingNandMelements respectively. There are two types of 'good triplets' that need to be identified in these arrays.Type ...
- Ans.
Calculate the total number of 'good triplets' in two arrays based on given conditions.
Iterate through all possible triplets in both arrays and check if they satisfy the conditions
Use nested loops to iterate through all combinations of indices in both arrays
Check the conditions for Type 1 and Type 2 'good triplets' separately
Increment a counter for each valid 'good triplet' found
Return the total count of 'good triplets'...
- Q2.
Split the String Problem Statement
You are given a string
strconsisting ofNlowercase alphabets. Your task is to determine if it is possible to divide the string into three non-empty substrings such tha... - Ans.
Given a string, determine if it can be split into three non-empty substrings where one is a substring of the other two.
Check if any substring of the string is a substring of the other two substrings.
Iterate through all possible divisions of the string into three non-empty substrings.
Use two pointers to find all possible substrings efficiently.
(2 Questions)
Round duration - 40 minutes
Round difficulty - Medium
- Q1.
Check if Two Trees are Mirror
Given two arbitrary binary trees, your task is to determine whether these two trees are mirrors of each other.
Explanation:
Two trees are considered mirror of each other if...
- Ans.
Check if two binary trees are mirrors of each other based on specific criteria.
Compare the roots of both trees.
Check if the left subtree of the first tree is the mirror of the right subtree of the second tree.
Verify if the right subtree of the first tree is the mirror of the left subtree of the second tree.
- Q2.
Snake and Ladder Problem Statement
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...
- Ans.
Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.
Use Breadth First Search (BFS) to find the shortest path from the starting cell to the last cell.
Maintain a queue to explore all possible moves from each cell.
Consider the effect of snakes and ladders on the movement of the player.
Handle the case where the last cell is unreachable by returning -1.
Optimize the solution b...
Interview Preparation Tips
Tip 1 : Must do questions from GFG.
Tip 2 : SDE sheet of striver can be helpful.
Tip 1 : Do at least 3 major web dev project
Tip 2 : should be precise and descriptive
Tip 3 : also add your past experiences in the resume
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
6 students from the campus were selected for this round. The interviews were conducted simultaneously for all on BlueJeans along with a code sharing website. After the initial set up and introduction, a set of 2 questions from DSA were asked from all candidates. The results were announced the same day.
- Q1.
DFS Traversal Problem Statement
Given an undirected and disconnected graph
G(V, E), whereVis the number of vertices andEis the number of edges, the connections between vertices are provided in the 'GR... - Ans.
DFS traversal to find connected components in an undirected and disconnected graph.
Use Depth First Search (DFS) to traverse the graph and find connected components
Maintain a visited array to keep track of visited vertices
For each unvisited vertex, perform DFS to explore the connected component it belongs to
Print the vertices of each connected component in ascending order
- Q2.
Median of Two Sorted Arrays Problem Statement
Given two sorted integer arrays
AandBwith sizesNandMrespectively, find the median of the combined array that results from merging arraysAandB. If th... - Ans.
Find the median of two sorted arrays after merging them.
Merge the two sorted arrays into one sorted array.
Calculate the median based on the length of the combined array.
Handle cases where the total number of elements is even or odd.
Interview Preparation Tips
Tip 1 : Practice an ample amount of questions from online sites like GeeksforGeeks and HackkerRank on all major topics. Once you are done with topicwise preparation, go on and try out some timed tests too.
Tip 2 : Don't forget to revise OOPS, OS, DBMS too.
Tip 3 : Try out mock interviews with friends, that's the best thing you can do for yourself other than practising questions!!
Tip 4 : During the interview, one thing that is asked for sure is the time complexity of your solution, so always know the complexity of your algorithms.
Tip 1 : Have your projects clearly mentioned and well explained
Tip 2 : Make sure that there are no formatting errors
Tip 3 : Mention your LinkedIn profile ;)
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This round was held during university hours and consisted of 2 coding questions.
(1 Question)
Round duration - 120 minutes
Round difficulty - Easy
Make sure you do no cutting and are clear about the approach you'd be following.
- Q1. What is the running median of an input stream?
- Ans.
Running median of an input stream is the median value of the numbers seen so far in a continuous stream of data.
Maintain two heaps - a max heap for the lower half of the numbers and a min heap for the upper half.
Keep the number of elements in the two heaps balanced or differ by at most 1.
If the total number of elements is odd, the median is the root of the max heap. If even, it is the average of the roots of the two he...
Interview Preparation Tips
Prepare for company-wise interview questions according to the company in which you are applying. Try to write the code yourself and if got stuck in between then take help from the internet. I recommend you Codezen of Coding Ninjas for practicing Data Structures and Algorithms based questions.
Application resume tips for other job seekersBe sure 100% of what you write in your resume and prepare for that before the interview what is written on resume.
Final outcome of the interviewSelectedSkills evaluated in this interview
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 55 minutes
Round difficulty - Medium
It was a coding interview that started with introducing myself. Two questions from data structures were asked.
- Q1.
Matrix Median Problem Statement
You are provided with a matrix containing 'N' rows and 'M' columns filled with integers. Each row is sorted in non-decreasing order. Your task is to find the overall median...
- Ans.
Find the overall median of a matrix with sorted rows.
Merge all elements of the matrix into a single sorted array
Calculate the median of the merged array
Handle odd number of elements by directly finding the middle element
- Q2.
Count Triplets in a Sorted Doubly Linked List
You are provided with an integer
Xand a non-decreasing sorted doubly linked list consisting of distinct nodes.Your task is to find and return the count of ...
- Ans.
Count triplets in a sorted doubly linked list that sum up to a given value.
Iterate through the list and for each node, find pairs that sum up to X-nodeValue.
Use two pointers approach to find pairs efficiently.
Keep track of count of triplets found while iterating through the list.
Interview Preparation Tips
Tip 1 : Learn to explain your logic well.
Tip 2 : Learn to dry run your code.
Tip 3 : Solve as many data structures questions as you can.
Tip 1 : They did not shortlist resume .
Tip 2 : They did send link to everyone satisfying eligibility criteria.
Skills evaluated in this interview
Mahesh Agrawal
I applied via Job Portal and was interviewed in Jun 2021. There were 3 interview rounds.
Interview Questionnaire
1 Question
- Q1. Sort an array
- Ans.
Sorts an array of strings in ascending order.
Use a sorting algorithm like bubble sort, selection sort, or merge sort.
Compare adjacent elements and swap them if they are in the wrong order.
Repeat the process until the array is sorted.
Interview Preparation Tips
Skills evaluated in this interview
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Hard
This round was held on Hackerearth and had 2 questions of Medium-Hard difficulty. Both were based on concepts of DP.
The use of offline IDE was prohibited so we were supposed to code it on Hackerearth IDE itself. I was able to code the second problem well with only 3 Test Cases failing but was stuck on the first problem for quite a long time and wasn't able to pass all the major Test Cases .
- Q1.
Binary Tree Cameras Problem Statement
Given a binary tree where each node can carry a camera that monitors its parent, itself, and its immediate children, determine the minimum number of cameras needed to...
- Ans.
The problem involves determining the minimum number of cameras needed to monitor all nodes in a binary tree.
Implement a function to solve the problem efficiently.
Consider the different cases where cameras can be placed to cover all nodes.
Use recursion to traverse the tree and place cameras strategically.
Optimize the solution to minimize the number of cameras needed.
Test the function with different test cases to ensure ...
- Q2.
Longest Palindromic Substring Problem Statement
You are provided with a string
STRof lengthN. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind... - Ans.
Given a string, find the longest palindromic substring with the smallest start index.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found and its starting index
Return the longest palindromic substring with the smallest start index
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Interview Questionnaire
1 Question
- Q1. They asked 3 Coding questions and 5 MCQ all of them were very simple. One was related to fibbonaci. Another one was like there was 2d array and at i,j sum till row i and sum till j was given and all the el...
Interview Preparation Tips
I appeared for an interview before Sep 2020.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
Medium level competitive programming question. Interviewer looked for the approach and working code.
- Q1.
Time to Burn Tree Problem
You are given a binary tree consisting of 'N' unique nodes and a start node where the burning will commence. The task is to calculate the time in minutes required to completely b...
- Ans.
Calculate the time in minutes required to completely burn a binary tree starting from a given node.
Perform a depth-first search (DFS) to calculate the time taken to burn the entire tree.
Track the time taken to burn each node based on its distance from the starting node.
Consider the maximum time taken among all nodes as the total time to burn the entire tree.
Round duration - 40 minutes
Round difficulty - Medium
Timing : Evening
Interviewer was frank. He checked for indepth knowledge of the subject.
Interview Preparation Tips
Tip 1 : Leave a subject to prepare, but never leave a topic.
Tip 2 : Must go through previous years questions / interview experiences.
Tip 3 : Atleast 4 projects in CV
Tip 1 : At least 4 projects (working)
Tip 2 : Never put false things on resume.
Skills evaluated in this interview
I appeared for an interview in Jan 2021.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Easy
4 Questions which were of Easy, Medium, and Hard level.
- Q1.
Lowest Common Ancestor of a Binary Tree III
The structure of a binary tree has been modified so that each node includes a reference to its parent node.
Problem Statement
You are provided with two nodes,...
- Ans.
This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.
Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.
Compare the two lists and find the last common node.
Return the last common node as the lowest common ancestor.
- Q2.
Maximum Subarray Problem Statement
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...
- Ans.
The problem is to find a subarray with the maximum sum in a given array.
Iterate through the array and keep track of the maximum sum and the current sum.
If the current sum becomes negative, reset it to 0.
Update the maximum sum if the current sum is greater.
Also keep track of the start and end indices of the subarray with the maximum sum.
Return the subarray using the start and end indices.
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Easy
- Q1.
Next Greater Element Problem Statement
Given a list of integers of size
N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an elementXis the firs... - Ans.
The task is to find the next greater element for each element in an array.
Iterate through the array from right to left.
Use a stack to keep track of the elements that have a greater element to their right.
For each element, pop elements from the stack until a greater element is found or the stack is empty.
If a greater element is found, it is the next greater element for the current element.
If the stack becomes empty, the...
- Q2.
Trapping Rain Water Problem Statement
You are given a long type array/list
ARRof sizeN, representing an elevation map. The valueARR[i]denotes the elevation of theithbar. Your task is to determine th... - Ans.
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
Iterate through the array and find the maximum height on the left and right side of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.
Sum up the amount of water trapped at each bar to get the total amo...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality round, asked basic questions like relocation and joining date etc
Interview Preparation Tips
Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well
Tip 3 : focus on basics
Tip 1 : Try to make a single-page resume.
Tip 2 : Don't write unnecessary details like hobbies, family, etc.
Skills evaluated in this interview
LinkedIn Interview FAQs
Tell us how to improve this page.
LinkedIn Interviews By Designations
- LinkedIn Software Developer Interview Questions
- LinkedIn Software Engineer Interview Questions
- LinkedIn Software Developer Intern Interview Questions
- LinkedIn Trust and Safety Specialist Interview Questions
- LinkedIn Softwaretest Engineer Interview Questions
- LinkedIn Senior Software Developer Interview Questions
- LinkedIn Senior Business Analyst Interview Questions
- LinkedIn Senior Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Software Engineer Interview Questions
- Java Developer Interview Questions
- Front end Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Show more
Overall Interview Experience Rating
based on 1 interview experience
Difficulty level
Duration
Software Developer Intern Interview Questions from Similar Companies
LinkedIn Software Developer Intern Reviews and Ratings
based on 2 reviews
Rating in categories
|
Software Engineer
102
salaries
|  ₹29.8 L/yr - ₹50 L/yr |
|
Senior Software Engineer
96
salaries
| ₹38.4 L/yr - ₹67.3 L/yr |
|
Trust and Safety Specialist
75
salaries
| ₹5.5 L/yr - ₹10.1 L/yr |
|
Software Developer
64
salaries
| ₹21.4 L/yr - ₹33.5 L/yr |
|
Account Director
30
salaries
| ₹18.3 L/yr - ₹33.5 L/yr |
Amazon
Flipkart
Udaan
BigBasket
- Home >
- Interviews >
- LinkedIn Interview Questions
