It was an on-campus opportunity where first round was an online assessment. In online assesment there were 2 questions based on DSA in which both questions were easy to medium level and they were standard problems.
- Also there were few questions on computer science fundamentals in MCQ format from DBMS, CN, Cybersecurity and OS.
- After selecting in online assessment there were 3 technical interviews and 1 HR round.
First Technical Interview: In the first technical round interviewer asked about my introduction and go through my resume. She asked me to explain my projects and asked what technologies I used and why.
- Then she asked some questions on DSA which were very easy.
- The first question was sort 0,1and 2 arrays.
- The second question was to left rotate the array.
- Then she asked some DBMS queries and and conceptual questions on normalization etc.
- It was 45 minutes round then after few hours , I was shortlisted for second round.
Technical Interview 2: He asked for my introduction and then he go through my resume.
- Since I used react in projects he asked me questions on react like what is redux , virtual DOM etc.
- Then he asked questions about DSA.
- The first question gets the mirror image of a tree.
- In the second question given an array to get the four elements whose sum is minimum.
- I told him brutforce approach by sorting and getting initial 4 elements, then he asked me to optimize it.
- I told him about priorityqueue solution, then he was satisfied but he said you can not use inbuilt priorityqueue.
- He asked me to implement the priorityqueue from scratch.
- Then I wrote code for priorityQueue from scracth then he asked to run for the some test cases to check my confidence then my code was fine and he was satisfied.
It took nearly 1 hour. After 15 minutes I came to know that I was shortlisted for 3rd round.
Third round: It was completely puzzled based round where he asked me about two standard puzzles which you can find easily on any websites. Since I did not prepare for any puzzle so it took time.
- The first puzzle was you have to write the table of any number till a maximum number but you can’t use any loop, can’t use any global variable and can’t change the function signature. After 25 minutes I was able to solve it.
- The second puzzle was that we have to determine top 3 strongest teams among 10 teams where you can organize matches between only two teams. You have to return the minimum number of matches to get the answer but I was not able to get it. then he finally told me to write the brutforce way and he was satisfied with that.
Fourth round: It was kind of formal as he asked me why I want to join and basic HR questions. It was 5 minutes online round. All 3 technical interviews were offline and I wrote the code on paper.
Verdict: selected