Tip 1: Start with the basics.
Tip 2: Practice coding; hands-on experience is a must.
Tip 3: You must have full knowledge of the projects that you have added to your resume.
Tip 1: Keep your resume up to date with your current skill set.
Tip 2: Prepare by framing your own questions based on the resume.
It was self-paced assessment; the link was valid for 24 hours. I took the test at night around 9 p.m.



I solved it using arithmetic operators.
It was afternoon, and it was scheduled over Microsoft Teams. The interviewer had 8 years of experience. He started with his own introduction and then asked about mine. Most of the questions were from my resume. Then he gave a few basic programming questions.



We have a linked list 1->2->3->4->5->6->7 and so on. You are supposed to swap pairs of a linked list like swap (1,2), (3,4), (5,6), and so on.
1. You may not modify the data in the list’s nodes; only nodes themselves may be changed. Because imagine a case where a node contains many fields, so there will be too much unnecessary swap.
2. If a pair of a node does not exist, then leave the node as it is.
Naive Approach:
The idea is to first search for x and y in the given linked list. If either of them is not present, then return. While searching for x and y, keep track of the current and previous pointers. First, change the next of the previous pointers, and then change the next of the current pointers.
They reviewed my skills based on my current role and asked if I am open to learning new technologies. They were convinced by my answer.
Retrieve unique values from two tables.
SELECT
T1.columnName, T2.columnName
FROM
(SELECT DISTINCT columnName FROM Table1) T1
FULL OUTER JOIN
(SELECT DISTINCT columnName FROM Table2) T2
ON T1.Code = T2.Code
HR called me and informed me that I have cleared all rounds of the interview and that they are going to offer me a role there. They asked about my willingness to relocate.
Discussion regarding the notice period and salary negotiation.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?