Welcome to your interview.
The question is on your right: Longest Increasing Subsequence. Take a moment with it first.
Talk your thinking through with me if you like - when you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes). Discussion and graded submissions share your five interviewer interactions, so spend them well.
Write a program to find the length of the longest increasing subsequence in an array, and be prepared to explain both the quadratic and optimal log-linear approaches.