First, I had a quick talk (approximately 15 minutes) with an HR representative to ensure the position matched my skills and that I was still interested in the offer.

Afterwards, we planned a technical phone screen, which was an hour long and fairly easy (Hackerrank easy exercises).

After passing the technical phone screen, I had my three final interviews planned: one focused on backend coding, another on data structures and algorithms, and the last one was an interview with a manager.

The backend coding interview was quite easy. However, I failed it because I didn't fully understand the questions initially, and they seemed vague. The audio quality also didn't help.

The data structures and algorithms interview was, in my opinion, much harder. Luckily, I had encountered a similar problem before, which I mentioned to the interviewer. This interview went okay, although I ran short on time since we discussed my background longer than usual at the beginning. I wasn't really expecting that coding problem for an internship interview.

The interview with the manager went well. He was very nice and seemed interested in my background. He was also very willing to provide accurate answers to my questions about the company.

In the end, I didn't get the internship because I failed the backend interview. However, overall, the interview process was very positive. The HR person who was in touch with me was very nice and provided me with a lot of details about the interview process, as well as resources for preparation.

I also received quick responses after the interviews. I got the email stating that I passed the technical phone screen only one hour after the interview ended, and a phone call only three days after the final interview.

Finally, they always provided feedback after each interview, explaining what I could have improved and why I was rejected, which was very considerate of them.

Overall, a very good experience.

TPS:

• Given two arrays of ints, return an array of ints that contains only the numbers that are not duplicates.
• Given an array of ints and a value, return true if two ints from the array add up to the given value, otherwise return false.
• Write a function that takes a 3x3 int array and checks if a player has won in a game of Tic Tac Toe.

Backend:

Implement a rate limiter for incoming connections.

DS & Algorithms:

Count Island problem.