I applied through an internal referral and received an interview call within two days. Since the position was for a senior role, I had high expectations for the interview process. I arrived at the venue on time, but the interview commenced only after a 45-minute delay. Once the interview started, I was asked to write C programs for linked list operations. For all three questions, I provided the correct logic and wrote programs for two. For the third question, I was unable to complete the program, although I was aware of the logic. My interview lasted for hardly 30 minutes.

How to find the middle node in a linked list.

There is a linked list like a0->a1->a2......->an->b0->b1->b2.......->bn. Need to form a linked list like a0->b0->a1->b1->a2->b2->...........an->bn.

If you are given a pointer to a node of a linked list, and you don't have the head/start node pointer, and you need to delete the node for which the pointer is given. How will you achieve this?