Tip 1: Practice DSA consistently and focus on understanding patterns instead of memorizing solutions.
Tip 2: Have in-depth knowledge of your projects and be ready to explain every component clearly.
Tip 1: Only include projects and skills that you can confidently explain in depth.
Tip 2: Keep your resume concise, well-structured, and tailored to the role you are applying for.
The online test was conducted during the daytime on a proctored platform. The environment was well-structured, and clear instructions were provided before the start of the test.
The overall experience was smooth, with no major technical issues. The platform was user-friendly, and there were proper guidelines regarding time limits and submission. The atmosphere felt slightly pressurized due to the time constraint, but it was manageable with good preparation.



You do not need to print anything, just return the head of the reversed linked list.
To reverse a linked list, we use three pointers: prev, curr, and next. Initially, prev is set to NULL and curr points to the head of the list. We iterate through the list, and for each node, we first store the next node in next, then reverse the current node’s pointer by making curr->next = prev. After that, we move prev to curr and curr to next. This process continues until curr becomes NULL, and finally, prev will point to the new head of the reversed linked list.
The interview was conducted online during the daytime in a well-organized and professional environment. The overall process was smooth, and I did not face any technical issues during the interview.
The atmosphere was comfortable yet slightly pressurized, which helped me stay focused. The interviewer was friendly and approachable, encouraging me to explain my thought process clearly. They were patient, provided hints when needed, and made the conversation interactive.
Overall, it was a positive experience and gave me good exposure to a real-time technical interview setting.



You may assume that given ‘X’ and ‘Y’ definitely exist in the given binary tree.
For the given binary tree

LCA of ‘X’ and ‘Y’ is highlighted in yellow colour.
• Start from the root node
• If the current node is NULL, return NULL
• If the current node matches either of the given nodes (p or q), return the current node
• Recursively search in the left subtree → store result in left
• Recursively search in the right subtree → store result in right
• If both left and right are not NULL → current node is the LCA
• If only one of them is not NULL → return the non-NULL value

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which traversal uses a queue as its primary data structure?