SDE - Intern

Step 1: Traverse the elements in the array one by one.
Step 2: For each element, check if the element is less than 0. If it is, then increment the count of negative elements.
Step 3: For each element, check if the element is greater than 0. If it is, then increment the count of positive elements.
Step 4: Print the count of negative and positive elements.

Step 1: Use Binary search to get the index of the first occurrence of x in arr[]. Let the index of the first occurrence be i. 
Step 2: Use Binary search to get the index of the last occurrence of x in arr[]. Let the index of the last occurrence be j. 
Step 3: Return (j – i + 1);

1. Declare a queue to store a pointer to tree nodes;
2. Declare store=0 which will print the rightmost node;
3. Declare temp to store DeQueued element from queue ;
4. Declare count=0 which will help to print the leftmost node;
5. Print the root->data first
6. IF (root->left)
EnQueue (q,root->left);
IF (root->right)
EnQueue (q,root->right);
EnQueue (q, NULL); //to indicate end of first level (root only)
7. While(q is not empty){
temp=DeQueue(q);
Increment count;
//temp is not NULL && temp is pointer to the first node (leftmost)
IF(temp && count==1) 
Print temp->data;
ELSE IF(temp) //for other nodes rather than the leftmost one
store=temp->data; //update store each time with latest node value
END IF-ELSE
IF (temp==NULL) //end of previous level
IF (q is not empty)
EnQueue(q,NULL);
END IF
count=0; //re-define countas 0 for next level
Print store; //store consist of rightmost of last level node value
ELSE
IF(temp->left is not NULL)
EnQueue(q, temp->left);
IF(temp->right is not NULL)
EnQueue(q, temp->right);
END IF-ELSE
END WHILE
END FUNCTION

1) Divide the list into two parts - the first node and the rest of the linked list.
2) Call reverse for the rest of the linked list.
3) Link rest to first.
4) Fix head pointer

Tip 1: For Operating System, I have used Love Babbar CheatSheet, InterviewBit, and Gate Smashers OS Playlist. You can also refer Sanchit Jain Playlist 
Tip 2: Try to answer exactly and with some example

Tip 1: For DBMS, I have used Love Babbar CheatSheet, Tutorialspoint, and Javatpoint. 
Tip 2: You can also use Hackerrank for SQL query practice.

First I gave him a definition and then I gave him an example explaining the difference between operator overloading and overriding.

I only know three types of recursion and he was satisfied with them.

Tip 1 : Try to add all the summaries of your resume in 2-3 lines.
Tip 2 : Tell something different than your resume.

Tip 1 : So first I started with my primary school life and told her about all the achievements I have made during my schooling year, then I moved to my high school life and told her how I prepare for JEE and MHT CET.
Tip 2 : Try to prepare for such questions beforehand.

Tip 1 : Do good research about the company and recruiters. Research the company you are interviewing for thoroughly.
Tip 2 : Also, if you know your interviewer beforehand, follow on LinkedIn to know more about their work.