An HR recruiter found me via LinkedIn and submitted me as a candidate. I passed the first coding exam on HackerRank but failed the phone call code interview. The technical recruiter was a great person, and the whole experience was good.

They didn't ask me to run my solution in the code interview; they just wanted to see how I thought. I was previously scared because I had already worked on some solutions in Codepair and on the same platform they sent, which was supposed to store the code. However, they told me not to worry about that. After about three hints, I believe I was judged as a weak developer. I kept talking about what I was doing, and they seemed satisfied with that, considering I have good communication skills.

The questions in the first code test were from the easy group on HackerRank, but the questions weren't from the website; they were prepared by Booking.com. The major problem in the HackerRank code test was the time limit, and one should be well-prepared for handling inputs and outputs (stdin, stdout).

I checked the reviews here and saw that a majority of people who passed the first code tests then failed the on-site test in Amsterdam. Therefore, I wasn't very optimistic about going there, even if I had passed the phone call interview.

1. (Coding test at HackerRank) Specify the types of polygons (square, rectangle, polygon). The number of lines was not provided. Negative numbers should be considered polygons, and squares should not be considered rectangles.

2. (Coding test at HackerRank) You have a list of words and a list of hotel reviews. Sort the hotels based on the number of words from the first list that exist in each review. If a hotel has a maximum of four such words, it should be ranked highest.

3. (Coding test at HackerRank) You are given timestamps (represented as integers) for the beginning and end of phone calls to Booking.com's call center. Find the number of overlapping calls, which suggests a need for more call center agents.

• (Phone call coding interview) You have two lists. The first contains larger words. Write a method to find if an anagram from a word in the second list exists within a word from the first list.

• (Phone call coding interview) Calculate the time complexity of the previous function. You were given hints, but your answer was later considered weak.