Tip 1 : Focus on the concept, not on the number of questions
Tip 2 : Must do Development even a simple HTML, CSS, and javascript project can work.
Tip 3 : Must do the most asked and most liked questions.
Tip 4 : First Solve the question by yourself, then jump for other's solutions
Tip 1 : Must know everything in the resume(don't put false things)
Tip 2 : Not more than 1 page
Tip 3 : Highlight your job-related achievement and experience.
Timing was around 2 PM
I was alone in the room
Interviewer was very supportive and humble



• The reference to the head of the linked list is not given.
• The node to be deleted is not a tail node.
• The value of each node in the Linked List is unique.
• It is guaranteed that the node to be deleted is present in the linked list.

Copy data of the next node to the current node
It's clear that The task question is wrong. You cannot delete the node.
Basically, instead of ONLY deleting the provided node we are not just doing it but CORRUPT the next node. It's a bad question wording (without clarification about options) and a bad solution. In my opinion, the correct answer for the interview is: "You CANNOT do this by having the node reference only. BUT we can make very similar operation by corrupting the next node. Although it's possible I don't recommend this solution for production applications.



The given linked lists may or may not be null.
If the first list is: 1 -> 4 -> 5 -> NULL and the second list is: 2 -> 3 -> 5 -> NULL
The final list would be: 1 -> 2 -> 3 -> 4 -> 5 -> 5 -> NULL
Timing was around 2 PM
I was alone in the room
Interviewer was very supportive and humble



X = 11
The sum of nodes 7, 3, 1 is 11. So we will return True.
First of all we will try by the naive approach,
Create a set of vector triplet to make sure all three triplets are unique.
Run 3 loops of i, j, k to iterate over the array.
The triplet is valid if the values add upto 0.
Insert the valid triplet in the set.



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.
Firstly he asked me to introduce myself then he started asking about my hobbies, background, curricular activities and also he focused on my situation based skill.
Introduce yourself
What are your hobbies?
Tell me some extra curricular activities that you have done in your graduation?
Why should we hire you?
Tip 1 : Always show them you are only focused on learning.
Tip 2 : Also make them feel that you will stay longer in their company

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