Xpo Logistics Associate Specialist Interview Questions and Answers

Q1. Basic string related coding questions
Add your answer
Q2. Core java questions
Add your answer

Q1. Behavioural and Experience based questions
Add your answer
Q2. Tell be about a time sort of stuff
Add your answer

Q1. Have you used multithreading?
Ans. 
Yes, I have used multithreading in software development.
• Multithreading is the ability of a central processing unit (CPU) to execute multiple threads concurrently.

• It allows for parallel execution of tasks, improving performance and responsiveness in applications.

• Multithreading can be used to perform tasks in the background while the main thread handles user interactions.

• Examples of multithreading in software development...read more
Answered by AI
View 1 more answer

Q1. Involved coding based on the skill set
Add your answer
Q2. Questions based on scenario, basic concepts.
Add your answer
Q3. Questions to test the depth of understanding of any technology
Add your answer

Q1. Architecture of current project
Ans. 
The current project follows a microservices architecture.
• The project is divided into multiple small services that communicate with each other through APIs.

• Each service is responsible for a specific functionality.

• The services are deployed independently and can be scaled as per the demand.

• The project uses Docker containers for easy deployment and management.

• The communication between services is secured using HTTPS protoc...read more
Answered by AI
Add your answer

Q1. Salary discussion based on the role
Add your answer

Q1. Deep dive into the technical areas. Some questions were challenging but overall it was great.
Add your answer

Q1. Few technical questions were asked. Rest of the questions were mainly based on work experience, responsibilities, project management etc.
Add your answer

Q1. Standard HR questions, company policies
Add your answer

Round duration - 95 minutes
Round difficulty - Medium

The 1st round was online coding + MCQ round. It had 3 sections in total to be solved in 95 mins.
Next comes the technical interview. 
The technical interview lasted for about 45 minutes. It started with a basic introduction. Then, she framed some questions from my resume and projects which I have mentioned. Questions were mainly from Data structure, OS, DBMS, SQL. She told me to rate my data structure skill on a scale of 1 to 5.
My interview was at 10:30 am and the interviewer was really nice. She was helping me wherever I was getting stuck.

Q1. 
Fourth Largest Element in the Array
Given an array consisting of integers, your task is to determine the fourth largest element in the array. If the array does not contain at least four distinct elements,...read more
Ans. 
Find the fourth largest element in an array, return -2147483648 if not enough distinct elements.
• Sort the array in descending order

• Return the fourth element if it exists, else return -2147483648
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

The technical interview lasted for about 45 minutes. It started with a basic introduction. Then, she framed some questions from my resume and projects which I have mentioned. Questions were mainly from Data structure, OS, DBMS, SQL. She told me to rate my data structure skill on a scale of 1 to 5.

Q1. 
Sort 0s, 1s, and 2s Problem Statement
You are provided with an integer array/list ARR of size 'N' which consists solely of 0s, 1s, and 2s. Your task is to write a solution to sort this array/list.
Input:
...read more
Ans. 
Sort an array of 0s, 1s, and 2s in linear time with a single scan approach.
• Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.

• Iterate through the array once and swap elements based on their values and the pointers.

• After the single scan, the array will be sorted in place with 0s, 1s, and 2s in order.
Answered by AI
View 1 more answer
Q2. 
Remove Duplicates Problem Statement
You are given an array of integers. The task is to remove all duplicate elements and return the array while maintaining the order in which the elements were provided.
...read more
Ans. 
Remove duplicates from an array while maintaining order.
• Use a set to keep track of unique elements.

• Iterate through the array and add elements to the set if not already present.

• Convert the set back to an array to maintain order.
Answered by AI
Add your answer
Q3. Can you describe all the joins in SQL and illustrate them with a Venn diagram?
Ans. 
SQL joins are used to combine rows from two or more tables based on a related column between them.
• Inner Join: Returns rows when there is at least one match in both tables.

• Left Join: Returns all rows from the left table and the matched rows from the right table.

• Right Join: Returns all rows from the right table and the matched rows from the left table.

• Full Outer Join: Returns rows when there is a match in one of the tabl...read more
Answered by AI
Add your answer
Q4. 
Binary Tree Node Presence Problem
Determine if a node with a given integer value X exists in a specified binary tree.
Input:
The first line of each test case contains the binary tree nodes in level orde...read more
Ans. 
Check if a node with a given value exists in a binary tree.
• Traverse the binary tree using depth-first search (DFS) or breadth-first search (BFS) to search for the node with the given value.

• Use a recursive or iterative approach to implement the search algorithm.

• Return 'true' if the node with the given value is found, otherwise return 'false'.
Answered by AI
Add your answer
Q5. 
Shortest Path in an Unweighted Graph
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...read more
Ans. 
Find the shortest path in an unweighted graph from house 'S' to house 'T'.
• Use Breadth First Search (BFS) algorithm to find the shortest path in an unweighted graph.

• Create a queue to store the current house and its neighbors, and a visited set to keep track of visited houses.

• Start BFS from house 'S' and stop when reaching house 'T'.

• Return the path from 'S' to 'T' once 'T' is reached.

• If multiple shortest paths exist, ret
Answered by AI
Add your answer