Upload Button Icon Add office photos

LinkedIn

Compare button icon Compare button icon Compare

Filter interviews by

LinkedIn Interview Questions, Process, and Tips

Updated 21 Jan 2025

Top LinkedIn Interview Questions and Answers

View all 72 questions

LinkedIn Interview Experiences

Popular Designations

65 interviews found

I was interviewed before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Hard

3 DSA based questions were given to be solved within 60 minutes.

  • Q1. 

    Optimal BST Problem Statement

    You are given a sorted array representing keys of a BST and an array of frequency counts showing how often each key is searched. Your task is to construct a binary search tre...

  • Ans. 

    Construct a BST with minimum search cost based on keys and frequencies.

    • Create a recursive function to construct the BST by considering all possible root nodes.

    • Calculate the cost for each possible BST and return the minimum total cost.

    • Optimize the solution by using dynamic programming to store intermediate results.

    • Ensure that the keys are sorted and frequencies are provided for each key.

    • Example: For keys [1, 3, 5] and f...

  • Answered by AI
  • Q2. 

    Number of Distinct Substrings Problem Statement

    Given a string WORD containing lowercase English alphabets and having length N, determine the number of distinct substrings in WORD.

    Input:

    The first line...
  • Ans. 

    Count the number of distinct substrings in a given string.

    • Iterate through all possible substrings and store them in a set to avoid duplicates.

    • Use nested loops to generate all substrings efficiently.

    • Consider using a hash set to store unique substrings.

    • Example: For input 'abcd', generate substrings 'a', 'ab', 'abc', 'abcd', 'b', 'bc', 'bcd', 'c', 'cd', 'd'.

  • Answered by AI
  • Q3. 

    Find Distinct Palindromic Substrings

    Given a string 'S', identify and print all distinct palindromic substrings within it. A palindrome reads the same forwards and backwards. For example, 'bccb' is a pali...

  • Ans. 

    Find and print all distinct palindromic substrings in a given string.

    • Iterate through all possible substrings of the input string.

    • Check if each substring is a palindrome.

    • Store distinct palindromic substrings in a set to avoid duplicates.

    • Sort the set of palindromic substrings and print them space-separated.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round where the interviewer asked 2 DSA problems.

  • Q1. 

    Distance Between Two Nodes in a Binary Tree

    Given a binary tree and the values of two distinct nodes, determine the distance between these two nodes in the tree. The distance is defined as the minimum num...

  • Ans. 

    Calculate the distance between two nodes in a binary tree.

    • Traverse the tree to find the paths from the root to each node

    • Find the lowest common ancestor of the two nodes

    • Calculate the distance by adding the distances from each node to the common ancestor

  • Answered by AI
  • Q2. 

    Decode Ways Problem Statement

    Given a string strNum that represents a number, the task is to determine the number of ways to decode it using the following encoding: 'A' - 1, 'B' - 2, ..., 'Z' - 26.

    Input...

  • Ans. 

    The task is to determine the number of ways to decode a given number string using a specific encoding.

    • Use dynamic programming to solve the problem efficiently.

    • Consider different cases like single digit decoding, double digit decoding, and invalid cases.

    • Handle edge cases like leading zeros and empty string inputs.

    • Implement a recursive function with memoization to avoid redundant calculations.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical interview round where I was given 2 DSA problems to solve.

  • Q1. 

    Validate Binary Search Tree (BST)

    You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).

    BST Definition:

    A Binary Search Tr...

  • Ans. 

    Validate if a given binary tree is a Binary Search Tree (BST) or not.

    • Check if the left subtree of a node contains only nodes with data less than the node's data.

    • Check if the right subtree of a node contains only nodes with data greater than the node's data.

    • Recursively check if both the left and right subtrees are also binary search trees.

  • Answered by AI
  • Q2. 

    Number of Islands Problem Statement

    You are given a non-empty grid that consists of only 0s and 1s. Your task is to determine the number of islands in this grid.

    An island is defined as a group of 1s (re...

  • Ans. 

    Count the number of islands in a grid of 0s and 1s connected horizontally, vertically, or diagonally.

    • Iterate through the grid and perform depth-first search (DFS) to mark visited land cells as water.

    • Increment the island count each time a new island is encountered during DFS.

    • Consider all adjacent cells (horizontally, vertically, and diagonally) while exploring the island.

    • Ensure to handle boundary conditions and check fo...

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round where he asked questions on my resume and challenges faced in my project.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPALinkedIn interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Top LinkedIn Software Developer Interview Questions and Answers

Q1. Optimal BST Problem Statement You are given a sorted array representing keys of a BST and an array of frequency counts showing how often each key is searched. Your task is to construct a binary search tree (BST) to minimize the total cost o... read more
View answer (1)

Software Developer Interview Questions asked at other Companies

Q1. Maximum Subarray Sum Problem Statement Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array. Example: Input: array = [34, -50, 42, 14, -5, 86] Output: 137 Explanation: The maximum sum is... read more
View answer (42)

Interview Questionnaire 

4 Questions

  • Q1. You are given a large array of n bits. Each bit is initially 0. You perform several operations of the type
  • Ans. 

    Solution to performing operations on a large array of bits.

    • Use bitwise operators to perform operations on individual bits

    • Use a loop to iterate through the array and perform the operations

    • Ensure that the array is large enough to accommodate all the bits

    • Consider using a data structure like a bitset for efficient bit manipulation

  • Answered by AI
  • Q2. Questions on Network programming
  • Q3. Questions on array,heap and binary trees
  • Q4. Round was both HR+Technical

Interview Preparation Tips

Round: Test
Experience: Questions can be found here:

-----/
Tips: Try to solve all 3.
Duration: 60 minutes
Total Questions: 3

Round: Technical Interview
Experience: First discuss the solution and then paper-code it.
Tips: Try to code without mistakes.

Round: Technical Interview
Experience: First, I was asked to discuss my project based on networking and then I was given a question on network programming
Tips: Pay attention on discussion

Round: Technical Interview
Experience: Provide the optimised solution and code it without any mistakes.

Round: HR Interview
Experience: Why linkedin?
What changes will you make in 6 months?
Internship project: Discussion and lot of common questions on that.
Basic Questions of C++ and Java

Skills: Data Structure, Core courses understanding, Algorithms
College Name: IIT GUWHATI

Skills evaluated in this interview

Software Engineer Interview Questions asked at other Companies

Q1. Bridge and torch problem : Four people come to a river in the night. There is a narrow bridge, but it can only hold two people at a time. They have one torch and, because it's night, the torch has to be used when crossing the bridge. Person... read more
View answer (197)
LinkedIn Interview Questions and Answers for Freshers
illustration image

Interview Questions & Answers

user image Anonymous

posted on 21 May 2015

Interview Preparation Tips

Round: Test
Experience: 3 coding Questions in 1 hour : 

1. We have to implement int getIntComplement(int N) function , that will give complement (bitwise complement. ) of b a given integer . Start unsetting from the left most set bit of the number. 0 <= N <= 50000

Example:

Input: 10 (1010)

Output: 5 (0101)2. There are "n" ticket windows in the railway station. ith window has ai tickets available. Price of a ticket is equal to the number of tickets remaining in that window at that time. When "m" tickets have been sold, what's the maximum amount of money the railway station can earn?

exa. n=2, m=4

in 2 window available tickets are : 2 , 5

2nd window sold 4 tickets so 5+4+3+2=14.3. There is a particular sequence only uses the numbers 1, 2, 3, 4 and no two adjacent numbers are the same.

Write a program that given n1 1s, n2 2s, n3 3s, n4 4s will output the number of such sequences using all these numbers.

Output your answer modulo 1000000007 (10^9 + 7).

Round: DESIGN ROUND
Experience: 1. Design a work flow model of the entire work done in your internship.2. Design a workflow model of any one of the projects you did. Grilling session.3. A design problem of the sorts : You need to present a ppt to say N users who are viewing it live in their browsers. What you have is a web page where the ppt is opened and has say two buttons : next and previous. You need to design basically what will happen / how will pressing of the buttons reflect a change across all the users.( He wanted something as to how the DNS on processing the next request would change the URL and convey it to all connected users)4. A map based design for implementing a code to check for isomorphic words in a file. Efficient approach.5. -----/

Round: TECHNICAL INTERVIEW
Experience: 1. Discussion of the BTP project (especially asked)

2. -----/

3. -----/

4. Given a word , you need to check if any permutation of the word would be a palindrome. eg) BALL : false , HANNA : true

Round: TEST
Experience: 1. -----/

2. -----/

(Algorithm + mathematical aspects related to eqqual probability )

3. -----Rolling_hash —> Had used this in my algorithm project and was hence asked

 Large set of questions pertaining to DBMS.

College Name: NA

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

In first round they asked me 2 coding questions where he asked me to code as close as possible to the actual one.

  • Q1. 

    Ninja and Sorted Array Merging Problem

    Ninja is tasked with merging two given sorted integer arrays ARR1 and ARR2 of sizes 'M' and 'N', respectively, such that the merged result is a single sorted array w...

  • Ans. 

    Merge two sorted arrays into one sorted array in place.

    • Use two pointers to compare elements from both arrays and place them in the correct position in ARR1.

    • Start from the end of ARR1 and compare elements from both arrays, placing the larger element at the end of ARR1.

    • Continue this process until all elements from ARR2 are merged into ARR1.

  • Answered by AI
  • Q2. 

    Word Distance Calculation

    Given a document represented as an array/list ARR of words with length N, find the smallest distance between two given words for multiple queries. The distance is defined as the ...

  • Ans. 

    Find the smallest distance between two words in a document for multiple queries.

    • Iterate through the document array to find the indices of the two words in each query.

    • Calculate the absolute difference between the indices to get the distance.

    • If a word from the query is not present in the document, return the length of the document array.

    • Repeat the process for each query and output the smallest distance for each.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Then in the second round they asked a little about tree and told me to code 2 codes.

  • Q1. 

    Level Order Traversal Problem Statement

    Given a binary tree of integers, return the level order traversal of the binary tree.

    Input:

    The first line contains an integer 'T', representing the number of te...
  • Ans. 

    The problem requires implementing a function to return the level order traversal of a binary tree.

    • Implement a function that takes the root of the binary tree as input and returns the level order traversal of the tree.

    • Use a queue data structure to perform level order traversal.

    • Process each level of the tree one by one, starting from the root node.

    • Print the node values at each level in the order they appear from left to ...

  • Answered by AI
  • Q2. 

    Combination Sum Problem Statement

    Given an array of distinct positive integers ARR and a non-negative integer 'B', find all unique combinations in the array where the sum is equal to 'B'. Numbers can be c...

  • Ans. 

    Find all unique combinations in an array where the sum is equal to a given target sum, with elements in non-decreasing order.

    • Use backtracking to generate all possible combinations.

    • Sort the array to ensure elements are in non-decreasing order.

    • Track the current combination and sum while backtracking.

    • Terminate recursion when the sum equals the target sum.

    • Avoid duplicates by skipping elements that have been used in previou

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPALinkedIn interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Top LinkedIn Software Developer Interview Questions and Answers

Q1. Optimal BST Problem Statement You are given a sorted array representing keys of a BST and an array of frequency counts showing how often each key is searched. Your task is to construct a binary search tree (BST) to minimize the total cost o... read more
View answer (1)

Software Developer Interview Questions asked at other Companies

Q1. Maximum Subarray Sum Problem Statement Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array. Example: Input: array = [34, -50, 42, 14, -5, 86] Output: 137 Explanation: The maximum sum is... read more
View answer (42)

LinkedIn interview questions for popular designations

 Software Developer

 (10)

 Software Engineer

 (6)

 Software Developer Intern

 (3)

 Softwaretest Engineer

 (2)

 Senior Software Developer

 (2)

 Senior Business Analyst

 (2)

 Senior Engineer

 (1)

 Sales

 (1)

I was interviewed before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a online test round where I was given 3 DSA questions to be solved in 60 minutes.

  • Q1. 

    Count Ways to Reach the N-th Stair Problem Statement

    You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...

  • Ans. 

    The problem involves finding the number of distinct ways to climb to the Nth stair by taking one or two steps at a time.

    • Use dynamic programming to solve the problem efficiently.

    • The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.

    • Handle base cases for N=0 and N=1 separately.

    • Consider using modulo 10^9+7 to avoid overflow in calculations.

  • Answered by AI
  • Q2. 

    Optimal Strategy for a Coin Game

    You are playing a coin game with your friend Ninjax. There are N coins placed in a straight line.

    Here are the rules of the game:

    1. Each coin has a value associated wit...
  • Ans. 

    The problem involves finding the optimal strategy to accumulate the maximum amount in a coin game with specific rules.

    • Start by understanding the rules of the game and how players take turns to choose coins.

    • Consider the scenario where both players play optimally to maximize winnings.

    • Iterate through different strategies to determine the best approach for selecting coins.

    • Keep track of the total winnings accumulated by eac...

  • Answered by AI
  • Q3. 

    Generate All Parentheses Combinations

    Given an integer N, your task is to create all possible valid parentheses configurations that are well-formed using N pairs. A sequence of parentheses is considered w...

  • Ans. 

    Generate all possible valid parentheses configurations using N pairs.

    • Use backtracking to generate all possible combinations of parentheses.

    • Keep track of the number of open and close parentheses used.

    • Add '(' if there are remaining open parentheses, and add ')' if there are remaining close parentheses.

    • Base case: when the length of the generated string is 2*N, add it to the result array.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPALinkedIn interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewRejected

Skills evaluated in this interview

Top LinkedIn Software Developer Interview Questions and Answers

Q1. Optimal BST Problem Statement You are given a sorted array representing keys of a BST and an array of frequency counts showing how often each key is searched. Your task is to construct a binary search tree (BST) to minimize the total cost o... read more
View answer (1)

Software Developer Interview Questions asked at other Companies

Q1. Maximum Subarray Sum Problem Statement Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array. Example: Input: array = [34, -50, 42, 14, -5, 86] Output: 137 Explanation: The maximum sum is... read more
View answer (42)

Get interview-ready with Top LinkedIn Interview Questions

Contribute & help others!
anonymous
You can choose to be anonymous

LinkedIn Interview FAQs

How many rounds are there in LinkedIn interview?
LinkedIn interview process usually has 2-3 rounds. The most common rounds in the LinkedIn interview process are Technical, One-on-one Round and Coding Test.
What are the top questions asked in LinkedIn interview?

Some of the top questions asked at the LinkedIn interview -

  1. Difference between TOP and PS commands? why TOP is called T...read more
  2. One liner command to kill all process in the system which were using JA...read more
  3. Explain XSS attacks and how to prevent it? and the same for sqli? Any experienc...read more
How long is the LinkedIn interview process?

The duration of LinkedIn interview process can vary, but typically it takes about less than 2 weeks to complete.

Recently Viewed

LIST OF COMPANIES

Asian Aerosol

Overview

LIST OF COMPANIES

People's Forum

Overview

SALARIES

People's Forum

INTERVIEWS

Verzeo Edutech

No Interviews

INTERVIEWS

Unique Coatings

No Interviews

INTERVIEWS

S J Developers

No Interviews

SALARIES

GlobusSoft

SALARIES

GlobusSoft

Tell us how to improve this page.

LinkedIn Interview Process

based on 40 interviews

Interview experience

4.3
  
Good
View more

Interview Questions from Similar Companies

Accenture Interview Questions
3.8
 • 8.1k Interviews
Infosys Interview Questions
3.6
 • 7.5k Interviews
Amazon Interview Questions
4.1
 • 5k Interviews
IBM Interview Questions
4.0
 • 2.3k Interviews
Oracle Interview Questions
3.7
 • 847 Interviews
Google Interview Questions
4.4
 • 824 Interviews
Adobe Interview Questions
3.9
 • 234 Interviews
Salesforce Interview Questions
4.0
 • 222 Interviews
Facebook Interview Questions
4.3
 • 52 Interviews
View all

LinkedIn Reviews and Ratings

based on 183 reviews

4.3/5

Rating in categories

4.0

Skill development

4.3

Work-life balance

4.1

Salary

3.4

Job security

4.3

Company culture

3.6

Promotions

4.1

Work satisfaction

Explore 183 Reviews and Ratings
Trust and Safety Specialist
73 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
65 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
59 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Content Reviewer
37 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Account Director
31 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare LinkedIn with

Facebook

4.3
Compare

Google

4.4
Compare

Microsoft Corporation

4.0
Compare

Amazon

4.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview