J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 1 jour. J'ai passé un entretien chez Flipkart
Entretien
They came to my college for the campus recruitment process. The first round had screening on Interviewstreet consisting of 20 MCQ's and 3 coding questions to be completed in a span of 2 hrs. After getting shortlisted in that, there were 3 rounds of interviews.
Questions d'entretien [4]
Question 1
Finding the smallest path between any two nodes in a tree.
You are in a time when you have a single airstrip on earth. The aeroplanes have a 1 litre capacity which enables them to cover half of the earth's circumference, refueling can be done between planes. Find the minimum number of planes required to cover the full circumference of the earth by starting from and ending at the same airstrip
J'ai postulé en ligne. Le processus a pris 5 jours. J'ai passé un entretien chez Flipkart en mai 2024
Entretien
I was good . There were 2 interviewers and they both were very friendly. I gave online assessment for flipkart and then called for 2 round that was problem solving and data structure round. It was overall a nice experience.
J'ai postulé via la recommandation d'un employé. J'ai passé un entretien chez Flipkart (Bengaluru) en mai 2022
Entretien
Interview was smooth. Whole process was completed in a day Had 3 rounds. 1st Round was LLD. 2nd Round: 4 medium level question DS/Algo questions 3rd Round : Managerial round
Questions d'entretien [1]
Question 1
Had 3 rounds. 1st Round was LLD. 2nd Round: 4 medium level question DS/Algo questions 3rd Round : Managerial round
J'ai postulé via la recommandation d'un employé. Le processus a pris 2 jours. J'ai passé un entretien chez Flipkart
Entretien
Three rounds post coding test. First-round is machine coding. The rest 2 are Data Structures algo. Post that Hiring Manager round. Machine coding round is where you try to design a system, the test is mostly around system understanding and oops concepts.
Questions d'entretien [1]
Question 1
Not to discuss questions but array and trees bases questions