Course: B.Tech
- Role: Software Engineering Intern
- Eligibility: CSE – 7 CPI and above
- ECE, EE – 8 CPI and above
- Location: Hyderabad
Online Assessment Test
32 questions in 80 minutes
30 MCQs
- 15 MCQs from OOPs, C++, Tree, Graph, OS, DBMS
- 15 MCQs from aptitude topics like Time and Work, Probability, Ratio, and divisibility.
2 coding problems
- https://www.geeksforgeeks.org/finding-sum-of-digits-of-a-number-until-sum-becomes-single-digit/amp/
- https://www.geeksforgeeks.org/find-maximum-path-sum-in-a-binary-tree/amp/
MCQs were easy to medium.
I was able to solve both coding problems and MCQs as well.
The next day 13 students were shortlisted from 159 students including me for interview rounds.
Round 1 (Technical Interview)
The interview was offline.
Difference between how multiple inheritance is achieved in C++ and Java.
Group Anagrams https://www.geeksforgeeks.org/given-a-sequence-of-words-print-all-anagrams-together-set-2/amp/
I started with brute force. Then I came up with a good approach but was not able to provide implementation of the same to satisfy the interviewer.
I had solved this problem earlier but did not get the time to revise topics before the interview.
Search a 2D matrix https://www.geeksforgeeks.org/problems/search-in-a-matrix-1587115621/1
I explained 3 approaches from brute to optimised but misinterpreted the time complexity in the binary search approach.
I did not get the call for round 2.
Rejected.