Fareportal visited our campus (VIT University) for the Software Engineer/Software Testing Engineer position on 26 August 2021. Only CS/IT branches were eligible followed by a cutoff of 60%. Around 2300 students were shortlisted for the online test.
Round 1: Online Test
- The online test was of 1.5 hours, composed of 5 programming questions mainly focused on programming basics. It was stunning for the first 5-10 minutes as the questions seemed extremely easy and it was doubtful if there was some catch missing.
- But the point behind the test was to check if candidates were able to assess the situation and make quick decisions. Candidates who finished the test in under 20 minutes and had good CGPA were selected.
Round 2:Technical Interview
- The next day, they shortlisted around 50 students for further interviews. This round was based on resume, problem-solving, system design, and Core CS concepts in real-time applications. The interview started with introductions, followed by questions on system design concepts such as vertical-horizontal scaling, load balancing, etc.
- https://www.geeksforgeeks.org/system-design-horizontal-and-vertical-scaling/amp/
- https://www.geeksforgeeks.org/load-balancer-system-design-interview-question/amp/
- There were questions made on applications of caching web pages and implementation of LRU and LFU caching.
- https://www.geeksforgeeks.org/least-frequently-used-lfu-cache-implementation/amp/
- https://www.geeksforgeeks.org/lru-cache-implementation/amp/
- Then the interview proceeded to projects and skills mentioned on the resume. We discussed a project in-depth and questions were made on how 3D modeling can contribute to travel applications for which we discussed VR and 3D user interface for websites.
- https://www.geeksforgeeks.org/introduction-of-3d-internet/amp/
- Then the interview proceeded to data structures and algorithms. The question was to help a user plan an international trip with multiple cities in the wish list followed by budget and priority on which cities to visit. The solution was a variation of the Dijkstra algorithm where you use additional comparators.
- www.geeksforgeeks.org/dijkstras-shortest-path-algorithm-in-java-using-priorityqueue/
- There were follow-up questions to use Binary Tree as data structure and different types of traversals in it.
- https://www.geeksforgeeks.org/tree-traversals-inorder-preorder-and-postorder/amp/
- Then a few applications on OOPS concepts were discussed and the interview ended on a positive note.
Round 3: HR Interview
- After few days, there was a surprise telephonic interview scheduled and I, fortunately, took the call. The duration of this round was around 10-15 minutes. After the introduction, the interviewer asked me how my “past three days” were followed by my low points, how I overcame them, and my leanings in those three days.
- Then we discussed the work culture, target users, and technologies being used in the organization. The call ended on a positive note.