Video chat over Teams. 1.5h of algorithmization (2 practical, including code, 1 was only theoretical) and theory questions (in English). Got some hints, but I was mainly expected to come up with a solution, critique said solution and propose (and implement) improvements. 1h of code review and previous experience discussion (in Czech).

1. Find common items between 2 lists.

2. Given a string, remove all same-letter pairs, incl. those that get created by removing another pair.

3. Given a stream of numbers, create method that return oldest unique number.