It was a question on the Tree Datastructure. Returning the Maximum Path Length with Arithmetic Progression.
Anonymous
First, I asked a few questions and solved the testcase given by a dry run. Then I told how would I approach the problem and then once he was convinced. I started solving the problem and communicated at each step about what I was doing. At a point when I solved the problem there was some issue because of a misunderstanding (I had asked a clarifying question during the dry run and he said yes to it initially but then he said no to it idk why.) I solved it later with the changes needed.
Check out your Company Bowl for anonymous work chats.