Your question is Robot Grid Path Constraints. 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).
A robot is at the origin and has to move to (6, 6) in a 2D plane. It can only move right or up. In how many ways can it reach its destination without the first and last step being the same?