After I entered my candidate information on booking career websites, I received a call from an HR person. Initially, there were a few questions about why I wanted to move from Brazil to Amsterdam.

After that, we scheduled a remote technical interview. The first question was to write a program to solve a problem: given 2 arrays of integers (A and B) and find the elements of A that do not belong to B. The second question was to write a function that returns a filename and path. There was also additional discussion about memory stack behavior.

A few days later, I was asked to fly to Amsterdam for a face-to-face interview. This consisted of 3 rounds: HR to explain the relocation process, and 2 technical interviews with 2 engineers per interview. A ten-minute presentation on difficulties I encountered throughout my career was requested at the beginning of each interview. Questions were about mathematics, algorithms, and 'distributed computing'. Solutions were given via written code on paper. The questions are explained below.

A multiset is a set where repetitions are allowed (for example: MS1 = (1,1,2,2,2,3,3,4,4,4,4,4,5,7,7,9...). Problem: write a program that receives two multisets and returns two intersections (element 2 appears three times in MS1 and five times in MS2).

How many 'parts' are on the sides of a magic cube (3x3x3)? What if we change that to 3x3x4?

Given a variety of colors to show an image (each element is a pixel color), for example: (1,1,1,2,2,55,55,55,238,238,238,238,91,91,91,2,2,2,2,1,4,7,7,7,12,127). Write a program that compresses this.