The interview process was quite long, but it was a great experience overall.

I initially applied online and was then invited to an on-campus interview. I had a single interviewer, and he was very pleasant. The interview lasted 30 minutes and included basic Data Structures and Algorithms (DSA) and Object-Oriented Programming (OOP) questions, as well as a simple problem solvable with a hash table.

A week later, I was invited to a second on-campus interview, this time lasting 1 hour with three interviewers. It was slightly more competency-based, but most of the time was spent writing code for a given problem. Although I made some mistakes, the interviewers were very helpful, and I managed to correct every error.

After another week, I received an email about my third on-campus interview, which was scheduled for 1.5 hours. This assessment was 1:1 with a London-based manager. He was a really cool guy, and I truly enjoyed talking to him. Half of the interview was technical, featuring slightly more challenging questions than in the previous interviews, and the other half was competency-based (e.g., "which area are you most interested in?" and "what do you want to get out of this internship?"). We ended up joking about some programming-related topics, so I believe I performed very well in this part.

The following week, I had a 1-hour HR telephone interview. Right at the end, the interviewer informed me that both he and the manager really liked me, so they made me an offer on the spot. Unsurprisingly, I signed all the paperwork the next day.

My suggestions are to practice on LeetCode with common questions and to carefully review all data structures. Beyond that, be yourself, maintain a friendly and relaxed attitude, and don't be afraid to admit when you don't know something. You could suggest a potential answer while stating that you are not entirely sure of its validity.

Write a function that checks whether two words are anagrams of each other.

Write a function that sums up two numbers represented as linked lists (e.g., 147 = 1->4->7).

Write a function that makes a deep copy of a linked list that, besides having a pointer to the next node, also has a pointer to a random node in the list.