LinkedIn Interview Questions and Answers for Freshers

It consisted of good questions

Coding questions- sorting,binary tree, arrays, strings

Coding questions- sorting, binary tree, arrays, strings

General mathematics

Q1. Salary negotiation how much
Add your answer
Q2. What is salary expectations
Add your answer

Q1. Maximum sum subarray
Ans. 
The maximum sum subarray problem finds the contiguous subarray with the highest sum in a given array.
• Use Kadane's Algorithm for an efficient O(n) solution.

• Initialize two variables: max_so_far and max_ending_here.

• Iterate through the array, updating max_ending_here by adding the current element.

• If max_ending_here exceeds max_so_far, update max_so_far.

• Reset max_ending_here to 0 if it becomes negative.

• Example: For array [-...read more
Answered by AI
Add your answer
Q2. Machine Learning Concepts
Add your answer

I am pavani thank u for wonderful opportunity i prove my talent in ur company

Q1. Computer base questions
Add your answer

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 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 ...read more
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'...read more
Answered by AI
Add your answer
Q2. 
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 tha...read more
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.
Answered by AI
Add your answer

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...read more
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.
Answered by AI
Add your answer
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...read more
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...read more
Answered by AI
Add your answer

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), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...read more
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
Answered by AI
Add your answer
Q2. 
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 th...read more
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.
Answered by AI
Add your answer