# Linkedin Interview Questions (Candidate Experience)

Set-1
Q1. Design question. What interesting and useful feature would you add to LinkedIn website, which is not yet present in the website.
Q2. Convert Roman number string to integers. Convert decimal integers to roman number strings.
Q3. Compute all multiples of a number.
Q4. Paint the houses such that neighbouring houses do not have same color paints. Each paint has an associated cost. Paint all houses such that cost is minimum.
Q5. Compute number of BSTs that can be formed with 1 to n keys.
Q6. Given an array of integers, compute another array which contains product of all elements except ith element from input array, without using division operation.
Q7. Implement hash tables.
Q8. Given a stream of characters (stream is increasing char by char), check if newly formed 10­character word is present in already parsed/scanned stream. Print such repeating streams lexicographic-ally at the end.
Q9. Questions on project, internships.

Set-2

Online Coding Round:
3 coding Questions in 1 hour :
Q1. Given a binary search tree and a key, if found return 1 else -1.
Q2. Given a string find the number of distinct substrings (should optimise time and space complexity)
Q3. Given a string find the number of distinct palindromic substrings(should optimise time complexity)
Round 1:
Firstly, a discussion of projects in resume and a detailed chat on my internship. There was discussion on my project for about 15 mins . Since my project was based on web crawling he asked me Find top 10 urls used by clients and 10 clients accessing the urls for 1 day of data . I answered by using heap ,he asked to me ,how insertion works in a heap .
Q1. Search for an element in a pivoted array. (Only logic and pseudo code )
Q2. Find middle node of a linked list. (Tested a lot by asking questions)
Q3. LCA in binary tree. (Complete code was required).
Q4. A puzzle which I can’t recollect. (Was not common )
Q5. Some OS questions like mutex and paging.
Round 2:
Q1. N -ary tree given ,print the zig zag order traversal?
Q2. Given an sorted array find a pair such that their sum is equla to key value.
Q3. Given a tree check if it is a binary search tree or not constraints: space complexity O(1)
Round 3:
Q1. Convert a binary tree in Double Linked list. He then asked, how will you handle the case when the parent left and right pointers are changed, but children has not been processed yet?
Q2. Swap the even bits and odd bits in the number.
I/P: 01010101 O/P:10101010