I encountered this as a sub problem few months back while doing some problems.

Given 2 arrays constituting the permutation of numbers from 1 to N. We need to find the longest common subsequence of these 2 arrays.

1 <= N <= 500000

I think it will be a good question to fit at position 3. What do you guys think?