Thomas Cook Senior Software Engineer Interview Questions and Answers

Q1. Prefer not to due to NDA
Add your answer

Brush up on DS and Algorithms

Q1. Hiring manager round
Add your answer
Q2. Questions on previous projects
Add your answer

Q1. Longest subsequence with sum zero
Ans. 
Find the longest subsequence in an array with sum zero.
• Iterate through the array and keep track of the running sum.

• Store the running sum in a hashmap along with the index.

• If the same sum is encountered again, the subsequence between the two indices has a sum of zero.
Answered by AI
Add your answer
Q2. Find diameter of tree
Ans. 
The diameter of a tree is the longest path between two leaf nodes in the tree.
• Calculate the longest path between two leaf nodes in the tree

• This can be done by finding the height of the left and right subtrees and adding them together

• The diameter of the tree is the maximum of either the diameter of the left subtree, the diameter of the right subtree, or the sum of the heights of the left and right subtrees
Answered by AI
Add your answer

Q1. System design: Hotel booking system
Ans. 
Design a hotel booking system for managing reservations and availability.
• Use a database to store hotel information, room availability, and reservations.

• Implement user authentication and authorization for booking.

• Include a search feature for users to find available rooms based on their criteria.

• Allow users to make reservations, modify or cancel them.

• Send confirmation emails to users after successful bookings.
Answered by AI
Add your answer

Divide one big integer by another

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

Solve sudoku, row and columns should have 1-9 numbers and the numbers shouldnt repeat

Q1. What is the toughest problem you solved and once I answered they started digging in to it
Add your answer

Q1. System Design - Design a parking lot
Ans. 
Design a parking lot system with features like parking, retrieving, and tracking available spots.
• Create a ParkingLot class with attributes like total number of spots, available spots, and a list of parked vehicles.

• Implement methods for parking a vehicle, retrieving a vehicle, and tracking available spots.

• Use data structures like arrays or lists to manage parked vehicles and available spots.

• Consider implementing feature...read more
Answered by AI
Add your answer

Q1. Several questions related to behavioral and troubleshooting
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. Based on core concepts of JavaScript and React fundamentals.
Add your answer

Q1. Advance topics of React and JavaScript and easy and medium level of DS algo
Add your answer

Q1. More like technical discussion on services that helps them to manage their product and problem solving if discussion not go long.
Add your answer

Q1. Compensation and others formalities
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