Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Flipkart Team. If you also belong to the team, you can get access from here

Flipkart Verified Tick

Compare button icon Compare button icon Compare

Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards

zig zag pattern zig zag pattern

Filter interviews by

Flipkart Diploma Trainee Engineer Interview Questions and Answers

Updated 9 Apr 2024

Flipkart Diploma Trainee Engineer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
6-8 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Apr 2023. There was 1 interview round.

Round 1 - HR 

(1 Question)

  • Q1. Tell me about yourself.

Interview questions from similar companies

Interview experience
2
Poor
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Approached by Company and was interviewed in Aug 2023. There was 1 interview round.

Round 1 - Telephonic Call 

(2 Questions)

  • Q1. They just asked about basic details , qualifications, professional experience, project domain, and ctc, expected ctc etc
  • Q2. Next round simillar

Interview Preparation Tips

Topics to prepare for PolicyBazaar Senior Engineer interview:
  • master your skill related deta
Interview preparation tips for other job seekers - enquire well then plan to go not much i like
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Walk-in and was interviewed before Jul 2023. There were 2 interview rounds.

Round 1 - Aptitude Test 

RElated to maths solving

Round 2 - Coding Test 

Relaated to java coding

Round 1 - Technical 

(1 Question)

  • Q1. What is actual rule is using to sale more products in this company
  • Ans. 

    The actual rule for selling more products in this company is to focus on customer needs and provide excellent customer service.

    • Focus on customer needs and preferences

    • Provide excellent customer service

    • Offer promotions and discounts

    • Maintain high product quality

    • Stay up-to-date with market trends

    • Build strong relationships with customers

    • Encourage customer feedback and use it to improve

    • Train sales staff to be knowledgeable a

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Nothing is hard work may take bow in life
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed before Jun 2023. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. What is AI ?
  • Ans. 

    AI stands for Artificial Intelligence, which is the simulation of human intelligence processes by machines, especially computer systems.

    • AI involves the development of algorithms that can perform tasks that typically require human intelligence.

    • Examples of AI include speech recognition, image recognition, natural language processing, and autonomous vehicles.

    • AI can be categorized into narrow AI (focused on a specific task...

  • Answered by AI
  • Q2. Tell me about machine learning
  • Ans. 

    Machine learning is a branch of artificial intelligence that involves developing algorithms and models that can learn from and make predictions or decisions based on data.

    • Machine learning uses algorithms to analyze data, learn from it, and make predictions or decisions.

    • It is used in various fields such as healthcare, finance, marketing, and more.

    • Examples of machine learning applications include recommendation systems, ...

  • Answered by AI

Skills evaluated in this interview

I appeared for an interview in Aug 2017.

Interview Questionnaire 

7 Questions

  • Q1. Implement Merge Sort.
  • Ans. 

    Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
  • Ans. 

    Find pairs of integers in a BST whose sum is equal to a given number.

    • Traverse the BST and store the values in a hash set.

    • For each node, check if (X - node.value) exists in the hash set.

    • If yes, add the pair (node.value, X - node.value) to the result.

    • Continue traversal until all nodes are processed.

  • Answered by AI
  • Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
  • Ans. 

    Merge overlapping time intervals into mutually exclusive intervals.

    • Sort the intervals based on their start time.

    • Iterate through the intervals and merge overlapping intervals.

    • Output the mutually exclusive intervals.

    • Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]

  • Answered by AI
  • Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
  • Ans. 

    Different types of hashing and alternative for Linear Chaining

    • Different types of hashing include division, multiplication, and universal hashing

    • Alternative for Linear Chaining is Open Addressing

    • Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing

  • Answered by AI
  • Q5. Implement AVL Tree.
  • Ans. 

    An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.

    • AVL tree is a binary search tree with additional balance factor for each node.

    • The balance factor is the difference between the heights of the left and right subtrees.

    • Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.

    • Rotations are performed ...

  • Answered by AI
  • Q6. Minimum number of squares whose sum equals to given number n.
  • Ans. 

    Find the minimum number of squares whose sum equals to a given number n.

    • Use dynamic programming to solve the problem efficiently.

    • Start with finding the square root of n and check if it is a perfect square.

    • If not, then try to find the minimum number of squares required for the remaining number.

    • Repeat the process until the remaining number becomes 0.

    • Return the minimum number of squares required for the given number n.

  • Answered by AI
  • Q7. Insertion sort for a singly linked list.
  • Ans. 

    Insertion sort for a singly linked list.

    • Traverse the list and compare each node with the previous nodes

    • If the current node is smaller, swap it with the previous node

    • Repeat until the end of the list is reached

    • Time complexity is O(n^2)

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22

Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.

Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.

College Name: The LNM Institute Of Information Technology, Jaipur

Skills evaluated in this interview

I applied via Campus Placement

Interview Preparation Tips

Round: Resume Shortlist
Experience: They selected 10 students from our college from CS and IT .They are looking for guys with extra projects done during college .App development will be a bonus ,contribution to open source and competitive programming will help for shortlisting.
Some of my friends had research papers published and they too got selected.

Round: Test
Experience: Have to write code snippet for 4 questions in 45 minutes
1.Difference between hour hand and minute hand
2.longest palindromic sub string.
3.Product Array puzzle
4.Some question related to matrix

Tips: All question were from geeksforgeeks
So practice it well ..u will make through it

Round: Test
Experience: Long Discussion on projects
They will scan each and every line of your Resume ,so dont write bullshits..
I wrote about interest in AI and got screwed..Discussion on college projects and final year project.
Then asked me to design a snake and ladder game OOPS concepts
Told me to find sum of all elements of sub matrix..(hint pre-processing the matrix)
Asked me about sessions and cookies
Gave a query to write on database indexing (dont remember exactly)
Asked me the code of the difference between hour hand and minute hand and extended it wid the second hand
Asked me as how to implement a dictionary
asked about TRIES ,CODE SNIPPET ON THE SHARED DOCS
One of my friend was asked to implement (set) of STL
Tips: The interviewer was cool guy..helped me a lot always made me comfortable.Interact with them as much as possible

Round: Test
Experience: Wid the CTO of the company .
Started wid the projects again .ACID properties,Database transactions,Concurrency Control
Optimization in database.
Then he asked me to code a function
Given a hash function applied on letters of English words ,un-hash it.Took me 45 minutes to reach the solution ,he helped me a lot.
Asked me to write the code for diameter of a binary tree
Asked me write the code for Boolean Matrix
One of my friend was asked to a question in which there was a bug in a m*n matrix and we have to find the bug(hint dfs or bfs)
Tips: keep calm ,,just keep talking ad he will help u a lot...

Round: HR
Experience: This was the toughest round for me...I had cleared all the rounds but they rejected me in the HR round ,,,dont know where I screwed..Learn every thing of Zomato..
They offered me an internship and thereafter they would look to give a PPO ...!!!lets see what happens

Skills: Coding Skills And Knowledge On Data Structures
Duration: 3
College Name: NIT Srinagar

Interview Questionnaire 

9 Questions

  • Q1. Write a regex for email validation?
  • Ans. 

    Regex for email validation

    • Start with a string of characters followed by @ symbol

    • Followed by a string of characters and a period

    • End with a string of characters with a length of 2-6 characters

    • Allow for optional subdomains separated by periods

    • Disallow special characters except for . and _ in username

  • Answered by AI
  • Q2. Parse the XML? and store the output in JSON. Discussed different approaches?
  • Q3. Print prime numbers in a given range and optimize the solution?
  • Ans. 

    Print prime numbers in a given range and optimize the solution.

    • Use Sieve of Eratosthenes algorithm to generate prime numbers efficiently

    • Start with a boolean array of size n+1, mark all as true

    • Loop through the array and mark all multiples of each prime as false

    • Print all the indexes that are still marked as true

  • Answered by AI
  • Q4. Puzzle – 25 horses – 5 lanes, find fastest 3 horses?
  • Q5. Web related questions on Sessions and cookies?
  • Q6. A lot of discussion on my resume, experience etc
  • Q7. Find angle between hour hand and minute hand in clock if time is given? Write a program or pseudo code?
  • Ans. 

    Find angle between hour and minute hand in a clock given the time.

    • Calculate the angle made by the hour hand with respect to 12 o'clock position

    • Calculate the angle made by the minute hand with respect to 12 o'clock position

    • Find the difference between the two angles and take the absolute value

    • If the angle is greater than 180 degrees, subtract it from 360 degrees to get the smaller angle

  • Answered by AI
  • Q8. A hash function was written to convert a string into a hash. Write a un-hash function to revert it(from hash to string)?
  • Ans. 

    To un-hash a string, use a reverse algorithm to convert the hash back to the original string.

    • Create a reverse algorithm that takes the hash as input and outputs the original string

    • Use the same logic as the hash function but in reverse order

    • If the hash function used a specific algorithm, use the inverse of that algorithm to un-hash the string

  • Answered by AI
  • Q9. He discussed about expectations and role. Asked me if I have any questions. He said to me “yaha aana hai to marwani padegi. tyar ho”? I smiled and asked what are the work timings? He said 9-9 and I was kin...

Interview Preparation Tips

General Tips: I applied through a recruiter. Then I got a call from Zomato HR. It was for LAMP developer profile. She asked me about my profile and also shared some expectations from the role. She asked me to come for F2F rounds to take the process further
Skills: Web development, JSON, Algorithm
College Name: na
Motivation: Overall process was not very tough. But they have start up culture. People work their for 11-12 hours a day. Sometimes on Saturday as well. So people who are geeks or have nothing in life to do except their job can go and join

Skills evaluated in this interview

I appeared for an interview before Feb 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Questions on aptitude, English, logical reasoning, C/C++ and 5 coding ques. (only pseudo code).

  • Q1. 

    Minimum Jumps Problem Statement

    Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...

  • Ans. 

    Find the minimum number of trampoline jumps Bob needs to make to reach the final shop, or return -1 if it's impossible.

    • Use Breadth First Search (BFS) algorithm to find the minimum number of jumps required.

    • Keep track of the visited shops to avoid revisiting them.

    • If a shop has an Arr value of 0, it is impossible to reach the final shop.

    • Return -1 if the final shop cannot be reached.

  • Answered by AI
  • Q2. 

    Smallest Window Problem Statement

    Given two strings, S and X, your task is to find the smallest substring in S that contains all the characters present in X.

    Example:

    Input:
    S = "abdd", X = "bd"
    Outpu...
  • Ans. 

    Find the smallest substring in S that contains all characters in X.

    • Use a sliding window approach to find the smallest window in S containing all characters of X.

    • Maintain a hashmap to keep track of characters in X and their frequencies in the current window.

    • Slide the window to the right, updating the hashmap and shrinking the window until all characters in X are present.

    • Return the smallest window found.

    • Example: S = 'abd

  • Answered by AI
  • Q3. 

    Rat in a Maze Problem Statement

    You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...

  • Ans. 

    Find all possible paths for a rat in a maze from start to destination.

    • Use backtracking to explore all possible paths in the maze.

    • Keep track of visited cells to avoid revisiting them.

    • Return paths in alphabetical order as a list of strings.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Questions based on OOPS were asked in this round.

  • Q1. What is a virtual function?
  • Ans. 

    A virtual function is a function in a base class that is declared using the keyword 'virtual' and can be overridden by a function with the same signature in a derived class.

    • Virtual functions allow for dynamic polymorphism in C++

    • They are used in inheritance to achieve runtime polymorphism

    • Virtual functions are declared in a base class and can be overridden in derived classes

    • They are called based on the type of object bei...

  • Answered by AI
  • Q2. What are the types of polymorphism in Object-Oriented Programming?
  • Ans. 

    Types of polymorphism in OOP include compile-time (method overloading) and runtime (method overriding) polymorphism.

    • Compile-time polymorphism is achieved through method overloading, where multiple methods have the same name but different parameters.

    • Runtime polymorphism is achieved through method overriding, where a subclass provides a specific implementation of a method that is already defined in its superclass.

    • Polymor...

  • Answered by AI
  • Q3. What is the difference between deep copy and shallow copy?
  • Ans. 

    Deep copy creates a new object and recursively copies all nested objects, while shallow copy creates a new object and copies only the references to nested objects.

    • Deep copy creates a new object and copies all nested objects, while shallow copy creates a new object and copies only the references to nested objects.

    • In deep copy, changes made to the original object do not affect the copied object, while in shallow copy, ch...

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMakeMyTrip interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2016.

Interview Questionnaire 

5 Questions

  • Q1. Search an element in sorted rotated array.
  • Ans. 

    Search an element in sorted rotated array.

    • Use binary search to find the pivot point where the array is rotated.

    • Divide the array into two subarrays and perform binary search on the appropriate subarray.

    • Handle the cases where the target element is at the pivot point or not present in the array.

  • Answered by AI
  • Q2. Kth largest element in an array.
  • Ans. 

    Find the Kth largest element in an array.

    • Sort the array in descending order and return the element at index K-1.

    • Use a max heap to find the Kth largest element efficiently.

    • Implement a quickselect algorithm to find the Kth largest element in linear time.

  • Answered by AI
  • Q3. Reverse a linked list in group of n element.
  • Ans. 

    Reverse a linked list in groups of n elements.

    • Divide the linked list into groups of n elements.

    • Reverse each group individually.

    • Connect the reversed groups to form the final linked list.

    • Handle cases where the number of elements is not a multiple of n.

    • Example: 1->2->3->4->5->6->7->8, n=3 -> 3->2->1->6->5->4->8->7

  • Answered by AI
  • Q4. Median of two sorted array.
  • Ans. 

    Find the median of two sorted arrays.

    • Merge the two arrays into one sorted array and find the median.

    • Use binary search to find the median in O(log(min(m, n))) time complexity.

    • Handle edge cases like empty arrays or arrays of different lengths.

  • Answered by AI
  • Q5. It was a DP question. In a matrix, I have to count number of paths from (0, 0) to (m, n) while crossing through some indexes were not allowed.
  • Ans. 

    Count number of paths from (0, 0) to (m, n) in a matrix while crossing through some indexes were not allowed.

    • Use dynamic programming to solve the problem

    • Create a 2D array to store the number of paths

    • Traverse the matrix and update the array based on the allowed paths

    • Return the value at the last index of the array

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: Interviewer was mainly focused on problem solving skill.

College Name: KIIT University

Skills evaluated in this interview

Flipkart Interview FAQs

How many rounds are there in Flipkart Diploma Trainee Engineer interview?
Flipkart interview process usually has 1 rounds. The most common rounds in the Flipkart interview process are HR.

Tell us how to improve this page.

Flipkart Diploma Trainee Engineer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
PolicyBazaar Interview Questions
3.6
 • 366 Interviews
BigBasket Interview Questions
3.9
 • 359 Interviews
JustDial Interview Questions
3.5
 • 330 Interviews
Info Edge Interview Questions
3.9
 • 318 Interviews
Zomato Interview Questions
3.8
 • 312 Interviews
Naukri Interview Questions
4.0
 • 185 Interviews
Uber Interview Questions
4.2
 • 150 Interviews
MakeMyTrip Interview Questions
3.7
 • 122 Interviews
View all
Senior Executive
2.7k salaries
unlock blur

₹1.8 L/yr - ₹9 L/yr

Team Lead
1.8k salaries
unlock blur

₹1.2 L/yr - ₹10 L/yr

Operations Executive
1.8k salaries
unlock blur

₹1.2 L/yr - ₹6.3 L/yr

Assistant Manager
1.6k salaries
unlock blur

₹6 L/yr - ₹22 L/yr

Executive
1.3k salaries
unlock blur

₹1.2 L/yr - ₹7 L/yr

Explore more salaries
Compare Flipkart with

Amazon

4.1
Compare

Myntra

4.0
Compare

Snapdeal

3.8
Compare

Meesho

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview