Tip 1: Practice a lot of programming problems and participate in competitive programming contests.
Tip 2: Make sure your computer science fundamentals are very clear and maintain a decent CGPA.
Tip 3: Do a couple of real problem-solving projects.
Tip 1: Maintain a precise, self-explanatory one-page resume.
Tip 2: Avoid including non-technical achievements (e.g., first position in dancing or singing competitions, etc.).
This was the only technical round held for the shortlisted students. Students were divided into multiple batches, and each batch was interviewed by a panel consisting of one Technical and one HR interviewer. This round was scheduled on Samsung's internal video conferencing platform, which was accessible only through Windows machines. The round focused on questions related to data structures, algorithms, and computer science subjects. My interview was scheduled for 2:00 PM. The interviewers were very friendly, and the overall environment was positive.



Assume that the Indexing for the linked list always starts from 0.
If the position is greater than or equal to the length of the linked list, you should return the same linked list without any change.
The following images depict how the deletion has been performed.


Simple linked list traversal is performed one by one to find the previous node of the target node.



For given 2D array :
[ [ 1, 2, 3 ],
[ 4, 5, 6 ],
[ 7, 8, 9 ] ]
After 90 degree rotation in anti clockwise direction, it will become:
[ [ 3, 6, 9 ],
[ 2, 5, 8 ],
[ 1, 4, 7 ] ]
Solve by 2-D matrix concepts.
Tip 1: Answer honestly and show your passion for joining the organization.
Tip 2: Read briefly about Samsung Research Institute, Noida.
Tip 3: Tell them what you actually have in mind.

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