The interview process began. He asked me to introduce myself and then gave me my first question: check if the binary representation of a number is a palindrome, considering all 32 bits. So, 5 would not be a palindrome by this logic.

He asked me to write and run the code on my own IDE. My screen was shared, and the platform was MS Teams.

After this, we moved to the next question: mirror trees. He asked me to code it, and then again, another question on trees: given the parent pointer of every node, find the leftmost right cousin of a given node.

I couldn't run the code because we were running out of time. I did a dry run, and it worked for some sample cases, but after the interview, I found out that it didn't work for some others.

While I was writing the code, he said he was going for tea and returned in about 5 minutes. After that, he simply said the process was over and I could leave. He asked me to cut and paste all the code into the chat window.

Check if the binary representation of a number is a palindrome, considering all 32 bits. So, 5 would not be a palindrome by this logic.

Convert a given binary tree to a mirror tree. Then, another question on trees: given the parent pointer of every node, find the leftmost right cousin of a given node.