1. Given an array nums which consists of non-negative integers and an integer k, you need to divide this array into k non-empty continuous subarrays. Design an algorithm to minimize the largest sum among these k subarrays.
2. Given two unsorted arrays, find the pair of values (one value from each array) that has the smallest (non-negative) difference. Return this difference.
3. Explain Word2vec.
4. Write an SQL query to find the employee with the highest salary.
5. Describe a time you had to work with a difficult client or teammate.