Tip 1: Practice coding consistently and track your progress.
Tip 2: Build at least one real project and explain it well.
Tip 3: Revise fundamentals before the interview.
Tip 1: Include at least one development project that you can explain confidently.
Tip 2: Keep your resume clean and avoid adding skills you can’t defend.
The test was conducted online during the daytime with proctoring enabled. The environment was stable, with no connection or portal issues. No interviewer was present in this round, as it was a purely online evaluation. The test was automatically submitted at the end.



Input: ‘N’ = 5, ‘TARGET’ = 5
‘BOOK’ = [4, 1, 2, 3, 1]
Output: YES
Explanation:
Sam can buy 4 pages book and 1 page book.
Step 1: Initially, I considered a brute-force approach, where I checked all pairs using two nested loops.
Step 2: Then, I shifted to a more efficient hashing approach using a set to store visited numbers.
Step 3: For each element, I checked if target - element was already in the set; if yes, the answer is YES.
Step 4: If no such pair was found after scanning the entire array, I printed NO.
Step 5: This improved the time complexity from O(N²) to O(N).
The interview took place during the daytime in one of the college halls arranged for interviews. The environment was calm and organized, with coordinators managing the flow of students. The interviewer was polite and asked both conceptual and situational questions, focusing more on understanding rather than grilling. They also assessed how confidently and clearly I could explain my projects and code logic. There was no overnight waiting or late timings—everything was completed within the scheduled slot.



The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Can you solve this problem in O(N) time and O(1) space complexity?
Step 1: I first explained the brute recursive idea.
Step 2: Then I explained the iterative method using prev, curr, and next pointers.
Step 3: I discussed time complexity O(N) and space complexity O(1).
Step 4: Interviewer was satisfied with clarity and pointer movement explanation.

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