Booking.com | New Grad | Interview Experience

booking.com logo
booking.com
New GradManchester, UKOffer
May 17, 20222 reads

Summary

I had a smooth interview process with Booking.com for a New Grad position, which involved an online assessment, a phone interview, and two final rounds focusing on behavioral and technical project discussions. I successfully received an offer for the Manchester, UK office.

Full Experience

I applied online for a New Grad role at Booking.com, and the entire process took about 4 weeks. It started with an online HackerRank test, followed by a 20-minute behavioral phone interview. The final stage consisted of two separate 30-45 minute rounds, one with a Senior Software Engineer and another with an Engineering Manager, both focusing on behavioral questions and a deep dive into my past technical projects and internships.

I found the recruitment process to be very smooth, and my recruiter was incredibly helpful, providing prompt updates after each round. She consistently reached out one to two days after each round to check in on my experience, and the results from each round were delivered within 3-5 days.

I initially applied for an Amsterdam-based role but accepted a switch to Manchester, UK due to exciting developments happening there at the moment.

Interview Questions (2)

Q1
Award Top K Hotels
Data Structures & AlgorithmsMedium

Given a list of hotels, a list of reviews for these hotels, and a list of keywords. You need to award the top K hotels. A hotel is awarded if it has any of the keywords present in its reviews. Each hotel has a unique ID. Reviews are strings containing words separated by spaces. Keywords are also strings. The score of a hotel is the number of reviews that contain at least one keyword. If two hotels have the same score, the hotel with the smaller ID is preferred. Return the IDs of the top K hotels, sorted by score in descending order, and then by ID in ascending order.

Q2
Minimum Sum with K Operations
Data Structures & AlgorithmsMedium

Given an array nums and an integer k. We have to perform k operations on the array. In one operation, we can take any element x from nums, divide it by 2 (floor division), and put it back into the array. We have to find the minimum possible sum of the array after k operations.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!