Your question is Memory-Efficient Set Operations. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
Given two arrays containing numbers between 1 and 127, how would you find the union and intersection of these arrays while consuming the absolute minimum amount of memory?