Free food, not much else.
No work-life balance, no cabs.
Round-1 (Hackerrank Test): 4 coding questions: * Implement HashMap using LinkedList. In this HashMap, on addition, the old value should not get replaced with the new one for a particular key. * On inputting any number (98267), print "number". On inpu
1. First Round Interview (1hr 15 mins) a) My project handling. b) Technical language (C++ / C) questions. After the first round, I was called by the recruitment team. I said that I already had an offer and didn't want to attend further interview
The technical interview was conducted by a less experienced developer. The interview was not very practical, and there was no goal to assess the candidate's experience. It was rather just used as a vague filtering mechanism.
Round-1 (Hackerrank Test): 4 coding questions: * Implement HashMap using LinkedList. In this HashMap, on addition, the old value should not get replaced with the new one for a particular key. * On inputting any number (98267), print "number". On inpu
1. First Round Interview (1hr 15 mins) a) My project handling. b) Technical language (C++ / C) questions. After the first round, I was called by the recruitment team. I said that I already had an offer and didn't want to attend further interview
The technical interview was conducted by a less experienced developer. The interview was not very practical, and there was no goal to assess the candidate's experience. It was rather just used as a vague filtering mechanism.