Navan Backend Engineer interview questions

Recruiter call, 1st technical then onsite The question in the first technical was the bunny hop lol question. Basically given a coordinate plane (matrix) start at 0,0 and find how many ways you can get to n,n. Dfs from 0,0 to n,n by only going up and to the right. It was intimidating but the answer is pretty simple when you understand it. But I will say the interviewer seemed very interested and nice which was nice to see because in my exp a lot of them seem not to care