Tip 1 : Must do Previously asked Interviews Questions.
Tip 2 : Prepare OS, DBMS, OOPs, and Computer Networks well.
Tip 3 : Prepare well for one project mentioned in the resume, the interviewer may ask any question related to the project, especially about the networking part of the project.
Tip 1 : Have at least 2 good projects mentioned in your resume with a link
Tip 2 : Focus on skills, internships, projects, and experiences.
Tip 3 : Make it simple, crisp, and one page
Tip 4 : Maintain good CGPA above 7
This was an online test held on the hackerrank platform in the evening. There were 25 MCQ questions in the test and one medium-level coding question.



Anagrams are defined as words or names that can be formed by rearranging the letters of another word. Such as "spar" can be formed by rearranging letters of "rasp". Hence, "spar" and "rasp" are anagrams.
'triangle' and 'integral'
'listen' and 'silent'
Since it is a binary problem, there is no partial marking. Marks will only be awarded if you get all the test cases correct.
This was first technical round taken by the software developer from HP. This round was completely based on the problem solving and CS fundamentals
What is a server? What are the components of a server?
What is a kernel? Functions of a kernel.
What are sockets? What are the different sockets used in TCP?
What is virtual memory?
What is TLB?
What are an inode and superblock?
When a program is run, what will be its page offset?
What are the different IPv4 classes? Where is each of it used?
Write a code to check if a linked list has a loop.
Write a code to count the number of occurrences of a word in a text file.



0 <= i,j,k,l < ‘N’
ARR1[i] + ARR2[j] + ARR3[k] + ARR4[l] = 0.
Solution using Java Language
class Solution {
public List> fourSum(int[] nums, int target) {
List> result = new ArrayList();
Arrays.sort(nums); // sort
int n = nums.length;
for (int i = 0; i < n-3; i++) { // first num
if (i > 0 && nums[i-1] == nums[i]) // check for duplicates
continue;
long tar3 = target - nums[i]; // subtract first number from target
for (int j = i+1; j < n-2; j++) { // second number
if (j > i+1 && nums[j] == nums[j-1]) // check for duplicates
continue;
long tar2 = tar3 - nums[j]; // subtract second number from tar3
// two pointer search for tar2
int l = j+1; // third number
int r = n-1; // fourth number
while (l < r) {
long sum = nums[l] + nums[r];
if (sum == tar2) {
// add all four numbers to result as a list
result.add(Arrays.asList(nums[i], nums[j], nums[l], nums[r]));
l++;
r--;
while (l < r && nums[l] == nums[l-1]) l++; // check for duplicates
while (l < r && nums[r] == nums[r+1]) r--; // check for duplicates
}
else if (sum < tar2) {
l++;
}
else {
r--;
}
}
}
}
return result;
}
}
This was 2nd technical round based on the CS fundamentals, troubleshooting and problem solving ability. Interviewer was very friendly, he started with his introduction then asked me for my introduction.
What is Normalization
What is the difference between DNS and DHCP?
What are signals in OS? Give examples.
Explain SDLC.
What are the different software testing types?
What is the OSI reference model? Explain.
Talk about a project from your resume. If you had to add something to it, what would it be and why?
What is the difference between struct and union? Give real-world examples for union
What problems you faced in doing projects technologically wise and managing wise too?
How to improve performance of laptop



Do not allocate extra space for another array. You need to do this by modifying the given input array in place with O(1) extra memory.
'n' = 5, 'arr' = [1 2 2 2 3].
The new array will be [1 2 3].
So our answer is 3.
Solution in C++
class Solution {
public:
int removeDuplicates(vector& nums) {
int i=0;
for(int j=1;j {
if(nums[i]!=nums[j])
{
i++;
nums[i]=nums[j];
}
}
return i+1;
}
};

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is the output of print(type("Python"))?