Tip 1 : You should have good understanding in DSA and theoretical topics especially computer networks.
Tip 2 : You should be well versed with the projects and their related technologies.
Tip 3 : For ds & algo, you should practice medium level problems for online coding test.
Tip 1 : Put minimum 2 projects with their features.
Tip 2 : Put some info about your coding profiles and some info about your extra curricular activities.
Coding round was online on Xobin platform.
Round was scheduled in the morning at around 10AM.
All the activity was being monitored and camera was also on.



1. ‘N’ contains only digits ‘0’ to ‘9’ and English letters ‘A’ to ‘F’.
2. Decimal equivalent of 0 is 0, 1 is 1, . . .9 is 9, A is 10, B is 11, . . . F is 15.
This problem was new for me, but I was able to solve it.
1. Convert the given numbers in decimal form i.e. in base 10.
2. Calculated their product as it can be directly done using '*' operator.
3. Converted the answer in to the base c.
The interview was on zoom in the morning at around 9.30 AM.
The interviewer was friendly with me.
Explain the concept of semaphores.
What are the different disk scheduling algorithms?
What is a deadlock?
Tip 1 : Questions on OS were basic and from common topics.
Tip 2 : So revise the crucial topics from OS with some examples.
Explain OSI Reference Model ?
Difference between IPv4 and IPv6 addresses and MAC address ?
Tip 1 : Computer Networks was important for this interview, for the first question interviewer asked me to explain in depth and also asked some follow u8p questions as well.
Tip 2 : College notes would help for preparing for theoretical subjects.



We cannot use the element at a given index twice.
Try to do this problem in O(N) time complexity.
I first explained the brute first approach which was using 2 nested for loop. Interviewer told me to optimize the approach and then start coding it.
I started with the sorting approach first.
In this, sort the array and then use the two pointers approach to find the pair.
And after that I explained him the map approach, where simply store the elements value in a map with their frequency and find the pair using the map.
I gave both the approaches, one time optimized and another space optimized.
The interview was on zoom in the morning at around 10.30 AM.
The interviewer was friendly with me but he was a foreigner, so I had some difficulty with his accent, but he was fine with repeating the questions.
What is an ER model ?
What are the different types of relationships between tables ?
How does SQL stores data and process queries?
What is normalization, explain with example.
Tip 1 : The interviewer was expecting in depth answers, so study DBMS very well.
Tip 2 : You should know about how a SQL works internally.



The order in which the groups and members of the groups are printed does not matter.
inputStr = {"eat","tea","tan","ate","nat","bat"}
Here {“tea”, “ate”,” eat”} and {“nat”, “tan”} are grouped as anagrams. Since there is no such string in “inputStr” which can be an anagram of “bat”, thus, “bat” will be the only member in its group.
This was a medium problem.
First explained him my approach, I used a map of string to vector of string.
- Started Traversing the array of string and for each string, make a copy of it.
- Sort the copied string and make it the key of the map and and add the original string to the map.
- This will store all the anagrams in a separate array of string.
- After that traverse the map and store the value which is an array of string in the 2d array of strings.

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