Westin Senior Associate Interview Questions and Answers

Q1. What did you learn in your internship
View 3 more answers
Q2. What's happening in the world , India or whats in the news
Add your answer
Q3. Share a situation when you handled guest
Add your answer
Q4. Tell us about the hotel where you trained
Add your answer
Q5. What do you know about the Oberoi
Add your answer

Q1. Technical Questions department specific
Add your answer

3 data structure problem with medium to hard level leetcode type.

Q1. 1st question was on vertical order traversal in a tree. it was from gfg he also told me to optimise it
Add your answer
Q2. 2nd question was from leetcode ie meeting rooms ll , medium question
Add your answer

Coding Rond consisted of 3 questions

Q1. 1. Data structures and algorithms
Add your answer
Q2. 2. Computer fundamentals
Add your answer
Q3. Revise all cs fundamentals
Add your answer

Dsa -> questions on trees, linked list, stack, dynamic programming

Leetcode medium to hard

Q1. Rain water trapping
Add your answer
Q2. Bricks and ladder
Add your answer

Polyfills,html,css basics,js intermediate level

Q1. How will you handle veg nonveg concern ?
Add your answer
Q2. How to handle angary customer?
Ans. 
Handling an angry customer requires active listening, empathy, and a willingness to find a solution.
• Listen actively to the customer's concerns without interrupting them

• Empathize with the customer's frustration and acknowledge their feelings

• Apologize for any inconvenience caused and take responsibility for finding a solution

• Offer a solution that meets the customer's needs and expectations

• Follow up with the customer to e
Answered by AI
Add your answer

It was 1 hour long and was asked to pass all the test cases.

Q1. System Design with basic of OOP and OS
Add your answer

There were 3 coding questions totally based on dsa- hard

Q1. Vertical Traversal
Add your answer
Q2. Find the node with shortest distance
Ans. 
Use Dijkstra's algorithm to find the node with the shortest distance in a graph.
• Implement Dijkstra's algorithm to calculate the shortest distance from a starting node to all other nodes in the graph.

• Select the node with the smallest distance that has not been visited yet as the current node.

• Update the distances of neighboring nodes from the current node if the new distance is smaller than the previously recorded distan...read more
Answered by AI
Add your answer

Q1. Question based on oops
Add your answer
Q2. Question based on OS
Add your answer