Phone interview with HR to see if you fit the profile in terms of work experience and characteristics.

After that, they sent me a Codility test with 3 questions in 2 hours.

1. Given an array of N natural integers, return the largest number K (K>0) only if K and -K exist in the array. If there's no such number, return 0. For example, if arr=[4, -4, 3, -3, 2], it should return 4. If arr=[-2, 0, 0, -3], it should return 0. The algorithm should solve this in O(N).

2. Given a string S of N letters, return the alphabetically largest letter that occurs in both lowercase and uppercase in S, or decide that there's no such letter. For example, S="aaBabcDaA" should return "B". Otherwise, return "NO". For example, S="Codility" should return "NO".

3. A very long question about Jafar & Aladdin's pawn game. Find the maximum pawns owned by Aladdin that Jafar can beat in his turn (given a board N x N). Sorry.