Ups Logistics Senior Software Engineer 2 Interview Questions and Answers for Experienced

Round duration - 90 minutes
Round difficulty - Medium

This was a Data Structures round. Both questions were answered in optimal time complexity with clean code. Every other question was answered to the best of my knowledge

Q1. 
Rotting Oranges Problem Statement
You are given an undirected and disconnected graph G(V, E) with V vertices numbered from 0 to V-1 and E edges. Your task is to perform a BFS traversal starting from the 0...read more
Ans. 
Perform BFS traversal on an undirected and disconnected graph starting from vertex 0.
• Implement BFS traversal algorithm starting from vertex 0

• Use a queue to keep track of visited nodes and their neighbors

• Print the traversal order in sorted order for each node's connected nodes
Answered by AI
Add your answer
Q2. 
Smallest Integer Not Representable as Subset Sum
Given a non-decreasing sorted array ARR of N positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...read more
Ans. 
Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a non-decreasing sorted array of positive numbers.
• Start with the smallest possible sum that can be represented, which is 1.

• Iterate through the array and update the smallest sum that cannot be represented.

• Return the final smallest sum that cannot be represented.
Answered by AI
Add your answer
Q3. 
BFS Traversal in a Graph
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...read more
Ans. 
BFS traversal of an undirected and disconnected graph starting from vertex 0.
• Implement BFS algorithm to traverse the graph starting from vertex 0.

• Use a queue to keep track of visited nodes and their neighbors.

• Ensure to visit all connected components of the graph.

• Print the BFS traversal sequence for each test case in a separate line.

• Handle cases where not all vertices are reachable from vertex 0.
Answered by AI
View 1 more answer

Round duration - 100 minutes
Round difficulty - Easy

Mostly technical and System Design questions were asked.

Q1. Design an LRU (Least Recently Used) cache.
Ans. 
Design an LRU cache to store least recently used items efficiently.
• Use a combination of a doubly linked list and a hashmap to store and retrieve items in O(1) time complexity.

• When an item is accessed, move it to the front of the linked list to mark it as the most recently used.

• If the cache is full, remove the least recently used item from the end of the linked list and the hashmap.
Answered by AI
Add your answer

Basic algorithms testing

Q1. HLD question on chat application
Add your answer

Q1. How to identify and solve race condition.
Ans. 
Identifying and solving race conditions involves understanding concurrent execution and implementing synchronization mechanisms.
• Understand the critical sections of code where race conditions can occur

• Use synchronization mechanisms like locks, semaphores, or atomic operations to control access to shared resources

• Implement thread-safe data structures or use thread-safe libraries to avoid race conditions

• Use tools like sta...read more
Answered by AI
Add your answer
Q2. Solve an array question on finding the third largest in an unsorted array.
Ans. 
Find the third largest element in an unsorted array of strings.
• Sort the array in descending order.

• Remove duplicates if necessary.

• Return the element at index 2 as the third largest.
Answered by AI
Add your answer

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

It was a aptitude and logical reasoning test

Q1. Coding logic and aptitude was assessed
Add your answer

Q1. Basic questions and salary negotiation was done
Add your answer