Flipkart limited interview experience Real time questions & tips from candidates to crack your interview
UI Developer 2
Flipkart limited
2 rounds | 2 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 Months
Topics: OOPS, Data structures, Design Patterns, System Design, REST, RPC, SQL
Tip 1 : OOPs concept is a must have/ design patterns is a plus.
Tip 2 : Prepare Graphs and DP well, this will outshine you from crowd.
Tip 3 : If experienced, prepare your project well and be ready to manage surprises(deep knowledge is a must have)
Application process
Where: Linkedin
Eligibility: No
Tip 1 : Mention your achievements.(after all you need to sell your skills )
Tip 2 : In case not having relevant experience, start developing from free resources, preferably using spring boot.
Interview rounds
01
Round
Easy
Online Coding Test
Duration60 Minutes
Interview date10 Jan 2018
Coding problem1
Was a medium level online Hackerrank assessment test. Only 60 minute was allowed time and there was no time to search online. Camera was not there but full screen access was taken. Was given a 3 days to attempt the test.
1. Longest sub-array with positive product
Easy
15m average time
85% success
0/40
Asked in companies
You are given an array ‘ARR’ of ‘N’ integers, you need to find the maximum length of the sub-array such that the product of elements of the sub-array is positive.
For Example:
Let us say we have array 'ARR' =[-1,3,5,-2,4,-9]. The longest sub-array with the positive product is [3,5,-2,4,-9].
Problem approach
It was a DP problem. The idea here is to maintain the count of positive elements and negative elements such that their product is positive. Was a hard problem. The algorithm used is taken from GFG.
Initialize the variable, say res, to store the length of the longest subarray with the positive product.
Initialize two variables, Pos and Neg, to store the length of the current subarray with the positive and negative products respectively.
Iterate over the array.
If arr[i] = 0: Reset the value of Pos and Neg.
If arr[i] > 0: Increment Pos by 1. If at least one element is present in the subarray with the negative product, then increment Neg by 1.
If arr[i] < 0: Swap Pos and Neg and increment the Neg by 1. If at least one element is present in the subarray with the positive product, then increment Pos also.
Update res=max(res, Pos).
02
Round
Easy
Video Call
Duration45 minutes
Interview date18 Jan 2018
Coding problem1
I was told to give my brief intro. Then they asked my find the maximum path sum between two leaves of a binary tree question.
Was asked about time and space complexity in detail. Then interviewer asked about my work experience in previous organization. Then few questions were asked related to java (Garbage Collector).
1. Maximum Path Sum Between Two Leaves
Hard
50m average time
35% success
0/120
Asked in companies
You are given a non-empty binary tree where each node has a non-negative integer value. Return the maximum possible sum of path between any two leaves of the given tree.
The path is also inclusive of the leaf nodes and the maximum path sum may or may not go through the root of the given tree.
If there is only one leaf node in the tree, then return -1.
Problem approach
1) Find the maximum sum from leaf to root in the left subtree of X.
2) Find the maximum sum from leaf to root in the right subtree of X.
3) Add the above two calculated values and X->data and compare the sum with the maximum value obtained so far and update the maximum value.
4) Return the maximum value.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 2
4 rounds | 6 problems
Interviewed by Flipkart limited
Selected 
3774 views
0 comments
0 upvotes
SDE - 1
3 rounds | 3 problems
Interviewed by Flipkart limited
Selected 1906 views
0 comments
0 upvotes
SDE - 1
3 rounds | 3 problems
Interviewed by Flipkart limited
Selected 1718 views
0 comments
0 upvotes
SDE - 1
3 rounds | 4 problems
Interviewed by Flipkart limited
Selected 2197 views
0 comments
0 upvotes