LinkedIn Senior Engineer Interview Questions and Answers

Test contains 26 questions for me 13 are java based 13 are c++ based

Q1. Indexing in dbms
Ans. 
Indexing in DBMS is a technique to improve the performance of queries by creating a data structure that allows for faster retrieval of data.
• Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.

• Types of indexes include clustered, non-clustered, unique, and composite indexes.

• Examples of indexing techniques include B-tree, hash, and bitmap indexes.

• Indexing can...read more
Answered by AI
Add your answer
Q2. Find whether two strings are or not anagrams
Ans. 
Check if two strings are anagrams by comparing the sorted characters in each string.
• Sort the characters in both strings and compare if they are equal.

• Ignore spaces and punctuation when comparing the strings.

• Example: 'listen' and 'silent' are anagrams.

• Example: 'hello' and 'world' are not anagrams.
Answered by AI
View 1 more answer

Q1. Inorder traversal without recursion
Ans. 
Use a stack to simulate the recursive inorder traversal process
• Create an empty stack to store nodes

• Start with the root node and push it onto the stack

• While the stack is not empty, keep traversing left and pushing nodes onto the stack

• Once you reach a leaf node, pop it from the stack, print its value, and move to its right child

• Repeat the process until all nodes have been visited
Answered by AI
Add your answer
Q2. How to make a class final
Ans. 
To make a class final, use the 'final' keyword in the class declaration.
• Use the 'final' keyword before the 'class' keyword in the class declaration

• A final class cannot be subclassed or extended

• Final classes are often used for utility classes or classes that should not be modified
Answered by AI
Add your answer

Q1. Print the nodes of a n-ary tree in an arc wise manner as seen from the outside.
Ans. 
Print nodes of n-ary tree in arc wise manner from outside
• Traverse the tree level by level from outside to inside

• Use a queue to keep track of nodes at each level

• Print the nodes at each level in a clockwise or anticlockwise manner
Answered by AI
Add your answer

Q1. Data structure and algorithm
Add your answer
Q2. Some tricky logical question
Add your answer
Q3. Stack and queue
Add your answer
Q4. Some basic question about system Design
Add your answer

Hackerrank Coding Test, Leetcode medium questions

HLD test, was asked to design an online coding platform like leetcode

Q1. Most interesting project you have worked on
Add your answer
Q2. How do you handle conflict at workplace
Add your answer

Q1. Tell me about yourself
Add your answer

Q1. Given array of integer create subarray with sum = 0
Ans. 
Create subarrays with sum = 0 from given array of integers.
• Iterate through the array and keep track of the running sum.

• Store the running sum in a hashmap and check if the current sum - any previous sum equals 0.

• If yes, then the subarray between those two indices has a sum of 0.
Answered by AI
Add your answer
Q2. Left view of binary tree
Ans. 
The left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.
• Traverse the tree in a level order manner and keep track of the first node at each level.

• Use a queue to store nodes at each level and update the left view nodes accordingly.

• Example: For a binary tree with root node 1, left child 2, and right child 3, the left view would be [1, 2].
Answered by AI
Add your answer

Q1. Introduction about yourself and expectation
Add your answer

Q1. IOS questions and architecture question about modularisation. From resume.
Add your answer
Q2. Question Asked about memory management
Add your answer
Q3. Question about modularisation and interface design
Add your answer

Implement an iterator to flatten 2D vector

Q1. Find shortest path to get all keys
Ans. 
Use Dijkstra's algorithm to find the shortest path to get all keys
• Implement Dijkstra's algorithm to find the shortest path in a graph

• Consider the keys as nodes in the graph and the paths between keys as edges

• Keep track of the keys collected and update the shortest path accordingly
Answered by AI
Add your answer