LinkedIn Softwaretest Engineer Interview Questions and Answers

DSA Based questions were asked

Q1. About Relocation
Add your answer

Q1. What your opinion about job
Add your answer
Q2. What you do if you get the job
Add your answer
Q3. What are your qualification
Add your answer
Q4. How much interest you pay in job
Add your answer
Q5. What is the first thing you do after you get the job
Add your answer

On leetcode based prblm there are questions asked

Q1. What are trees and binary search
Ans. 
Trees are hierarchical data structures with nodes connected by edges. Binary search is a search algorithm that finds the position of a target value within a sorted array.
• Trees are made up of nodes connected by edges, with a root node at the top and leaf nodes at the bottom.

• Binary search is a divide and conquer algorithm that compares the target value to the middle element of a sorted array.

• Binary search is efficient fo...read more
Answered by AI
Add your answer
Q2. What are graphs
Ans. 
Graphs are data structures that consist of nodes (vertices) connected by edges (links).
• Graphs can be directed or undirected.

• Nodes can have attributes or properties.

• Edges can have weights or labels.

• Examples of graphs include social networks, road networks, and organizational hierarchies.
Answered by AI
Add your answer

Projects and dsa based round is this

Q1. This is very tough rounf
Add your answer

Q1. This is also very tough
Add your answer

Q1. Dp questions - longest increasing subsequence
Ans. 
Find the longest increasing subsequence in an array.
• Use dynamic programming to solve this problem.

• Iterate through the array and keep track of the longest increasing subsequence ending at each index.

• Return the maximum length found.
Answered by AI
Add your answer
Q2. Grapg question - detect a cycle
Ans. 
Detecting a cycle in a graph using depth-first search or Floyd's cycle detection algorithm.
• Use depth-first search to detect a cycle in a graph by keeping track of visited nodes and checking for back edges.

• Alternatively, use Floyd's cycle detection algorithm for detecting a cycle in a linked list or graph.

• Example: For a graph with nodes A, B, C, D and edges (A->B, B->C, C->D, D->A), a cycle is detected when visiting nod...read more
Answered by AI
Add your answer

Q1. Describe binary tree
Ans. 
A binary tree is a hierarchical data structure in which each node has at most two children.
• Consists of nodes connected by edges

• Each node can have at most two children, referred to as left child and right child

• The left child is smaller than the parent node, while the right child is greater

• Used for efficient searching, sorting, and organizing data
Answered by AI
View 1 more answer
Q2. How to validate ip addres?
Ans. 
To validate an IP address, check if it consists of four numbers separated by periods, each number being between 0 and 255.
• Split the IP address string by periods to get an array of four numbers

• Check if the array length is 4

• Loop through each number in the array and check if it is between 0 and 255

• If any number is outside the valid range, the IP address is invalid
Answered by AI
View 1 more answer

Q1. DSA algorithms, trees, tries, linked list
Add your answer
Q2. Questions on graphs
Add your answer
Q3. Question on dynamic programming
Add your answer

Data structures and algorithms. Leet code hard level

Q1. Write a program to mirror the pixel in a screen matrix of 24 bit pixels
Ans. 
Program to mirror the pixel in a screen matrix of 24 bit pixels
• Create a 2D array to represent the screen matrix of pixels

• Iterate through each row and swap the pixels from left to right

• Ensure to handle the 24 bit pixels properly for mirroring

• Example: [[255, 0, 0], [0, 255, 0], [0, 0, 255]] -> [[0, 0, 255], [0, 255, 0], [255, 0, 0]]
Answered by AI
Add your answer

3 rounds of coding problems in c++ from various disciplines some relatively easy and some hard