Candidatei-me por indicação de um funcionário. O processo levou 6 dias. Fui entrevistado pela Myntra em jan. de 2015
Entrevista
Applied through a employee referral and got a call in just 2 days. The HR was in a hurry and fixed the first skype interview the next day only. Did not shared any details about the recruitment procedure.
Interview Questions were
Lot of DS questions and 1 mysql query question.
Perguntas de entrevista [1]
Pergunta 1
Question 1: Change Binary tree so that parent node is the sum of root nodes.
Question 2: Print a pattern for a given N
eg for N = 4
4444444
4333334
4322234
4321234
4322234
4333334
4444444
Question 3: MySQL -> find hole in auto-increment values
1-2 more questions that I don't remember.
Hope this helps.
Candidatei-me online. O processo levou 1 dia. Fiz uma entrevista na empresa Myntra (Bengaluru).
Entrevista
Interview Process was good, All rounds ended on the same day.
First Round: Data Structures and Algorithms
Second Round: Tough Question on Problem solving
Third Round: Projects Discussion
Fourth Round: Hiring Manager
Last Round: HR
But the real challenge came after clearing all the rounds. These guys kept on holding the offer letter from day of interview to 2 months. HR management was not sure what they should tell since i cleared all the rounds. One of the worst HR Management and talent acquisition team i have seen. Please consider twice while giving interview for this company. Their office location is also in outskirts of Banaglore in some remote village.
Candidatei-me por indicação de um funcionário. O processo levou 1 semana. Fui entrevistado pela Myntra (Bengaluru) em jan. de 2015
Entrevista
2 Telephonic rounds, 1 online test
Questions on Datastructures and Algorithms. Mainly focused on Hashing, priority queues and Heaps. I got rejected after the online test.
Questions were
1. How to find the kth smallest element in a stream of numbers.
2. Given a large input containing age of employees, whats the best way to sort them, etc
Perguntas de entrevista [1]
Pergunta 1
Given a stream of integers, find the kth smallest element , delete it and again find the kth smallest element.
