Tip 1 : Practice Data structure and Algorithms consistently
Tip 2 : Learn full stack development. Like MERN, MEAN
Tip 3 : Learn any language like python or java or c++ with data structures
Tip 1 : Have some projects on full stack development
Tip 2 : Keep the content which you have really done
Interview was started around morning 10am. Interview panel members were so nice and helpful during the interview. There were 2 Interviewers in meet. One Interviewer was asked questions on problem solving and other was asked on Tech development. I remember only 1 DSA Question.



A 'deep copy' of a linked list means we do not copy the references of the nodes of the original linked list, rather for each node in the original linked list, a new node is created.
step 1: I first applied hashmap to store the next and random pointers. And iterated over a original and cloned the linked list with next and random pointers which are stored.
step 2: Then i gave approach without space. But We need to iterate over original linked list over linked list 3 times. TC -> 3*O(N)
It was completely an HR round. Office was cool with well infrastructure. Interviewer was Founder of company.
where do you want to see yourself in 5 years.
Tip 1 : Just give in technical aspect.

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?