Round two is the Technical Interviews is a face-to-face interview. This round is of about 50 mins. Some questions asked to some of the interviewees are as follows:
- Do you have any OT experience?
- How did you do in your class?
- Reverse the word of a string but keep the special characters’ relative positions the same.
- How does the map work?
- What is the difference between mapping and hashing?
There were a total of six people chosen for the Group Activity round.
One another response from the other interviewee was as follows:
This round focuses primarily on problem-solving abilities.
Given an array of people ids and a date, which represents people who are signing in for a specific website at that time.
We must now respond to the following questions.
a) Find the total number of unique users who have logged in to the website so far.
b) Find the total number of persons who have logged in more than five times.
c) Find the day with the most users logged in so far; and so on.
In this question, they were asked to explain the AVL tree’s operation as well as the code. (First Set|Second Set)
Binary search in a linked list has a lot of problems about the time complexity, and we also must return the index in the linked list where the element is present.
A few of questions about my projects
A few operating system concepts, such as context switching and paging, as well as a few files management questions
Some C++ concepts surrounding virtual functions and how the compiler implements them.