Practice & Preparation for Interviews

I attended SISO Interview process recently. So I am going to share my experience with the interview process. I undergo the following rounds for the selection process Written round ( Technical) GSAT ( Aptitude test) Technical Interview I  (50-60 mins) Technical Interview II  (10-15 mins) HR Interview  (10-15 mins) CHECKOUT VIDEO of  Samsung R&D interview experience to skip reading SISO came to my college for a written test and an interview was scheduled later for shortlisted candidates in the Bangalore Samsung office.The first round was written technical in which 20 simple C, C++, JAVA, and DS questions were there. From my college, around 35-40 students were shortlisted for Interviews in Bangalore.                   In Bangalore, there were around 150 people from other colleges also. The next round was the Global Samsung aptitude test. The level of ...

A Circular Linked list is a complex data structure. The linked list is circular as the last node of the linked list is pointed to the head making a circular loop. The Insertion of a node can be done at the end of the linked list and any node can be deleted from the circular linked list. I will be writing only the insertion and deletion function instead of the whole program. Code : struct node { int data; node *next; } void insert(node *head,int data) { node *current=head;               // Assign head to the current node node temp; temp=(node*)malloc(sizeof(node)); temp->data=data;                 // insert data into temporary node if(head==NULL)                    // Linked list is Empty { head=temp;                           // make head as temp and temp->next pointed to he...

In Binary Tree the Inorder successor is the next node in Inorder traversal. The inorder successor of the root is the leftmost element in the right subtree. In the Binary Search tree, the Inorder successor of an input node can be defined as the node with the smallest value greater than the value of the input node. Basically, you can say that the next node in the sorted node will be the Inorder successor of the previous node. In this BST the inorder successor of 10 is 11 and 13 is 16. As you can see that it is the next node in the sorted order nodes. Algorithm : 1) The first step is to check whether there is a right subtree of the input node or not. If there is a right subtree then find the minimum value node in that and return that will be the inorder successor of the input node. 2) If there is not then move upwards and start from the root and follow the search technique if the value of the input node is less than the root node then move towards left otherwise right and retur...