Envié una solicitud electrónica. El proceso duró 4 semanas. Acudí a una entrevista en Disney+ Hotstar (Mumbai) en jun 2019
Entrevista
I was flown from Bangalore to Mumbai for interviews and all the rounds took place over Zoom (online video calling) from Bangalore! This could easily have been avoided, and added unnecessary burden of me of traveling on the same day as the interview. They made me fly to and fro on the same day - 5am to 11:30am!
Despite the fact that my interviews all went very well, I did not get any feedback from them - at all. Even on mailing them, calling the HRs there was no response - they stopped picking my calls. After much pursuing (I had to call on a landline number I found online just to get in touch wiith anyone), I got connected to an HR, who said that their roles aren't defined yet and they need approvals from higher ranks which they would only get after 3 or 4 months. Since then they haven't gotten back.
Highly unprofessional and taxing experience. I would not recommend anyone to join this company.
Preguntas de entrevista [1]
Pregunta 1
The interview rounds were standard - exploratory call followed up with in-person interviews (which weren't in-person, but over video call) and HR discussion.
Envié una solicitud electrónica. El proceso duró 6 días. Acudí a una entrevista en Disney+ Hotstar (Gurgaon, Haryana) en jun 2019
Entrevista
Interview process was very smooth and fast. It started with HR interaction related to the interview process. There were total 5 rounds of interview.
First discussion was on telephone around my current work and framework related question.
On successful qualification you will be invited for phase to phase round which includes(1st Round Design, 2nd Round Coding and Data Structure Algorithms, 3rd HR Round, 4th Bar Raiser Round).
Preguntas de entrevista [3]
Pregunta 1
Design: Design a multiplayer game in distributed environment.
DS & Algo: Given a dictionary of words, start word and end word. Assume at least one word will be at a distant of 1 unit from another set of word. You need to find the total number of minimum unit required to traverse from start word to end word
