Flipkart Selection Process
Flipkart conducts recruitment in a series of 4-5 rounds. The campus recruitment process starts with an online written test, and the qualified candidates are called for 2-3 rounds of interview. In some cases, group discussion or group exercise also forms a part of process. For direct applicants, an online coding round or telephonic interview is conducted before face-to-face interviews. Generally, the selection process consists of following interviews:
Flipkart Interview Rounds
- Technical Interviews
- HR Interview
Given below are some of the experiences and prospective interview questions for aspiring candidates:
Flipkart Interview: Experience 1
Candidate background: Final year student of B.Tech
Job Profile: Software Development Engineer
The first round was an online test of 50 minutes. The test comprised of aptitude, technical and coding questions. The candidate qualified the online round and was called for the technical rounds.
Technical Interview 1
The interview panel started with a few introductory questions and then, moved on to technical questions. Following set of questions were asked in the interview:
- Given a BST, find the number of ways in which we can insert numbers that will give same the same BST. For example; if a BST is 2 1(L) 3(R), then arrays that will give the same BST are 2 1 3 and 2 3 1.
- Given n activities of unit time each and each activity has a profit and a deadline. Write an algorithm to schedule the activities to maximize the profit.
The candidate was given 30 minutes to solve the questions. Then, the interviewers asked a few questions related to the solutions of above questions. Those who solved both the questions were selected for the second technical round.
Technical Interview 2
After an exchange of greetings, the panel asked a few questions regarding the fundamentals of data structures. The interviewers put the following questions to the candidate:
- How do you code Producer-Consumer problem?
- There is a requirement in Flipkart to show minimum price in the last 30 days. Here, which data structure should be used?
- Given two binary search trees with n and n-1 nodes respectively with all elements same except one, find the odd node.
- Given an array where each element signifies the number of cells which can be skipped, find the minimum number of steps taken to reach the last cell of the array. One has to start at index 0 and always move forward either by skipping cells by number given or by one.
The interview lasted from 50-60 minutes.
HR Interview
The candidate was called to appear for the final round of selection. The panel included a hiring manager and an HR. The following questions were asked in this interview:
- What makes you interested in this job?
- What is the motivating factor for you at work?
- What qualities would you look for, if you were recruiting someone for this position?
- Do you like to work in a team or on your own?
- Tell us about your best project.
The interviewer asked some more questions based on the candidate’s resume. The duration of the interview was 30-40 minutes.
Flipkart Interview: Experience 2
Candidate background: B.Tech, Fresher
Job Profile: Software Development Engineer
(After an online coding round and a telephonic interview, candidate attended the given onsite interviews.)
Technical Interview Questions
- Tell us the difference between embedded systems and the system in which RTOS runs?
- Why can’t arrays be passed by values to functions?
- What Is A Memory Leak? What Is A Segmentation Fault?
- Can we have inline virtual functions in a class?
- Given two numbers p and q, find kth digit from right of p^q.
- Given 1 GB memory space; write a pseudo code to print the maximum occurring string at any point of time where the size of the list of string can be of 10 GB and are updated dynamically.
HR Interview Questions
- Introduce yourself.
- Why do you want to join Flipkart?
- What do you know about us?
- What do you think on which type of data, we use ML in Flipkart?
- Can you perform under pressure?
- Elaborate on your favourite project.
