It was a Codility-based test. You can practice such questions on LeetCode.com.

The interviewee was nice, explained the questions in detail, and answered all my questions politely.

You need to be prepared for solving algorithms to pass this test.

Given an array of integers nums and an integer target, return the indices of the two numbers such that they add up to target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

You can return the answer in any order.

Given two arrays: arr1[0..m-1] and arr2[0..n-1]. Find whether arr2[] is a subset of arr1[] or not.

Both arrays are not in sorted order. It may be assumed that elements in both arrays are distinct.