Tip 1: Study databases in detail.
Tip 2: Maintain at least a 7 CGPA in your graduation degree.
Tip 3: Gain extensive knowledge of networking.
Tip 1: Mention networking and database skills in your resume.
Tip 2: It is better to include networking projects or certifications in your resume.
This round was conducted online on the Hackerrank platform. There were three coding questions that can be attempted in any coding language.



Step 1: Remove all negative numbers and zeros from the array since they are not considered for finding the missing positive integer. .
Step 2: Iterate through the array and place each positive integer in its correct position by swapping it with the element at the corresponding index (i.e., place the number 1 at index 0, number 2 at index 1, and so on).
Step 3: After placing all positive integers in their correct positions, iterate through the modified array again to find the first index where the value does not match its corresponding index. This index represents the lowest missing positive integer.
Step 4: If all positive integers are present from 1 to n (where n is the size of the modified array), the missing positive integer is n + 1.

Given:- ‘X’ = 5 and ‘N’ = 2.
‘POS’[] = 3, 4
The output will be 3 and 3.
Initially, there are no lights, and we install a light at position three; therefore, there is a segment between the 3 and 6.
Then we install a light at position four; therefore, the largest gap becomes between 0 to 3.
Step 1: Create an array spray of size n, initialized with 0s. This array will represent the coverage of fountains on the road.
Step 2: Iterate through the locations array. For each fountain at index i, calculate its leftmost and rightmost coverage limits.
Step 3: Update the spray array to mark the coverage of each fountain. For each fountain at index i, mark the range from left to right as 1 in the spray array.
Step 4: Initialize end to 0 and farthest to 0. These variables represent the current fountain's rightmost coverage and the farthest coverage reachable by currently turned on fountains, respectively.
Step 5: Initialize fountains to 0. This variable will count the minimum number of fountains needed to cover the road.
Step 6: Iterate through the spray array from index 0 to n - 1. For each index i:
Step 7: Update farthest to max(farthest, spray[i]) to keep track of the farthest coverage reachable by currently turned on fountains.
Step 8: If end is equal to i, it means the current fountain's coverage has ended. Increment fountains by 1 and update end to farthest since a new fountain needs to be turned on to cover the next range.
Step 9: Return the value of fountains, which represents the minimum number of fountains needed to cover the road.



You need to modify the given tree only. You are not allowed to create a new tree.
For the given binary search tree

11 will be replaced by {15 + 29 + 35 + 40}, i.e. 119.
2 will be replaced by {7 + 11 + 15 + 29 + 35 + 40}, i.e. 137.
29 will be replaced by {35 + 40}, i.e. 75.
1 will be replaced by {2 + 7 + 11 + 15 + 29 + 35 + 40}, i.e. 139.
7 will be replaced by {11 + 15 + 29 + 35 + 40}, i.e. 130.
15 will be replaced by {15 + 29 + 35 + 40}, i.e. 104.
40 will be replaced by 0 {as there is no node with a value greater than 40}.
35 will be replaced by {40}, i.e. 40.
This round was conducted in the afternoon. The interviewer was good. It mostly consisted of questions about networking and databases. Only 14 students were shortlisted after this round.
Tip 1 : Study networking in detail.
Tip 2 : Hear the question carefully.
This round was conducted in the morning. It had a mixture of problem-solving and HR questions. Only 8 students got selected after this round.
Tip 1 : Keep pen and paper by your side.
Tip 2 : Practice aptitude questions in advance.
Tip 3 : Don't take much time in telling an answer.
Introduce yourself.
Are you ready to relocate?
What are your strengths and weakness?
Tip 1 : Keep pen and paper by your side.
Tip 2 : Practice aptitude questions in advance.
Tip 3 : Don't take too much time in giving an answer.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?