Sabre Senior Software Engineer Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Medium

Timing was fine - It was in the afternoon
Interviewer was friendly and helpful

Q1. 
Find Duplicates in an Array
Given an array ARR of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...read more
Ans. 
Find duplicates in an array of integers within a specified range.
• Iterate through the array and keep track of the count of each element using a hashmap.

• Return elements with count greater than 1 as duplicates.

• Handle edge cases like empty array or no duplicates found.

• Example: For input [0, 3, 1, 2, 3], output should be [3].
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

- Timing was fine - Afternoon
- Interviewer was friendly

Q1. How would you design a caching library?
Ans. 
Designing a caching library involves considering data storage, retrieval, expiration policies, and cache invalidation strategies.
• Define the caching requirements such as data size, access patterns, and expiration policies.

• Choose a suitable data structure for caching like LRU, LFU, or a simple key-value store.

• Implement cache eviction policies to handle memory constraints and optimize performance.

• Consider thread safety an...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

- Timing was fine - Afternoon
- Interviewer was friendly

Q1. What is the number of edges in a 10x10 cube?
Ans. 
A 10x10 cube has 600 edges.
• A cube has 12 edges, so a 10x10 cube would have 12 edges on each of its 6 faces.

• 12 edges x 6 faces = 72 edges for the entire cube.

• However, each edge is shared by two faces, so we need to divide by 2 to get the total number of unique edges.

• 72 edges / 2 = 36 unique edges on the outer surface of the cube.

• Since the cube has 10x10x10 = 1000 unit cubes, each with 12 edges, we need to subtract the e...read more
Answered by AI
Add your answer

Q1. Basics of android and java
Add your answer

Ds related questions

Q1. All Android (Java and kotlin)
Add your answer

Q1. Past projects,android,kotlin
Add your answer

Q1. About Salary discussion
Add your answer

Q1. What are distributed systems? How does the security can be maintained?
Ans. 
Distributed systems are a network of independent computers that work together to achieve a common goal. Security can be maintained through encryption, authentication, access control, and monitoring.
• Distributed systems consist of multiple computers that communicate and coordinate actions to achieve a common goal.

• Security in distributed systems can be maintained through encryption of data in transit and at rest.

• Authentic...read more
Answered by AI
Add your answer
Q2. Importance of container orchestration tools in large complex systems?
Ans. 
Container orchestration tools are crucial for managing the deployment, scaling, and monitoring of large complex systems.
• Container orchestration tools help automate the deployment and scaling of containerized applications, making it easier to manage large complex systems.

• They provide features like service discovery, load balancing, health checks, and auto-scaling, which are essential for ensuring high availability and p...read more
Answered by AI
Add your answer

Q1. Basic oops consept questions?
Add your answer
Q2. How map and un_ordered map works?
Ans. 
Map and unordered_map are associative containers that store elements in key-value pairs.
• Map is implemented as a balanced binary tree while unordered_map is implemented as a hash table.

• Map stores elements in sorted order based on the key while unordered_map does not guarantee any specific order.

• Map has a slower insertion and deletion time complexity than unordered_map.

• Map is useful when we need to maintain elements in a...read more
Answered by AI
Add your answer
Q3. Frequency of digits in an array and store elements in new array in a sorted order such a way that more frequent one comes first and least frequent one at the end.
Ans. 
Sort array of strings based on frequency of digits in each element.
• Create a dictionary to store frequency of digits in each element.

• Sort the array based on the frequency of digits using the dictionary.

• Handle ties by sorting based on the original order of elements.
Answered by AI
View 1 more answer

Q1. Typical manager question
Add your answer

Q1. Internal Working Of Hashmap, Java 8 features and two DSA questions one was based on the array and the second one was based on LinkedList. The first interview round was very excellent that's why they conduc...read more
Add your answer
Q2. Detect loop in a LinkedList,
Ans. 
Detect loop in a LinkedList
• Use two pointers, one moving at twice the speed of the other

• If there is a loop, the faster pointer will eventually catch up to the slower one

• If there is no loop, the faster pointer will reach the end of the list
Answered by AI
Add your answer

Q1. System Design HLD and LLD round which was the final round.
Add your answer
Q2. HLD and LLD Designing round: Desing Architecture for ChatBot and Company Employee Data Management System.
Add your answer

Q1. Basic js question closure, async defer and all
Add your answer
Q2. Create autosuggest debounce, pollyfill
Ans. 
Autosuggest debounce is a feature that delays the search suggestions until the user stops typing, and a polyfill is a piece of code that provides functionality that is not natively supported by the browser.
• Implement a debounce function to delay the autosuggest feature until the user stops typing.

• Use a polyfill to provide support for the autosuggest feature in browsers that do not natively support it.

• Example: Implement ...read more
Answered by AI
Add your answer

Q1. A programming question
Add your answer
Q2. React-native architecture and flatlist
Add your answer
Q3. Kadanes algorithm
Ans. 
Kadane's algorithm is used to find the maximum subarray sum in an array of integers.
• Iterate through the array and keep track of the maximum sum ending at each index.

• At each index, choose between extending the previous subarray or starting a new subarray.

• Example: For array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the maximum subarray sum is 6 (from index 3 to 6).
Answered by AI
Add your answer
Q4. Scalablity, performance
Add your answer