Initial On-Campus Interview and Test:

• Format: Started with an on-campus interview followed by a comprehensive test.
• Test Content: Included multiple-choice questions focusing on Data Structures and Algorithms (DSA) and three coding questions covering arrays (easy), linked lists (medium), and trees.
• Outcome: Successfully cleared the test and advanced to the next stage.

Online Interview:

• Format: Conducted an online interview session.

Introduction Interview:

• Preferred Language: Inquired about the candidate’s preferred programming language.

Technical Discussion:

Linked List Analysis:

• Approach: Discussed determining if a linked list is a palindrome.
• Traverse the linked list and store its values in an array.
• Utilize a pointer-based approach to compare elements from both ends of the array.
• Conclude that the linked list is a palindrome if all elements match.

Palindrome Number Algorithm:

• Asked to describe and code an approach to identify palindrome numbers using linked lists.

Matrix Rotation in C++:

• Provided an explanation and code snippet to rotate a matrix anticlockwise in C++ using transpose and row reversal techniques.

Structure and Union Discussion:

• The differences between structure and union data types.