Open In App

Flipkart Interview Experience for SDE

Last Updated : 11 Sep, 2021
Like Article

Today Flipkart came for On-Campus full-time software development hiring. 

Round 1(Online Test): The test was on AMCAT consisting of 3 questions that have to be solved within 1:30hrs. 

  1. The first question was of graph type in which n cities were there, all were connected using roads of bidirectional, we had to find the minimum distance between two given cities.
  2. The second one was of BODMAS type, in which a string of expression evaluations was given.
  3. The 3rd one was the coin exchange problem.

Previous Article
Next Article

Similar Reads

Flipkart Interview Experience(1.10 years experience SDE 1)
Round 1: Machine Coding Round Design a stock exchange system. There is a list of stocks given with following attributes - order_id time stock name type(BUY/SELL) quantity price You need to output list of stocks in the following format sell_id, buy_id, quantity, price which will get executed. There were some rules given to match the stocks. There we
2 min read
Flipkart Interview Experience | Set 44 (On-campus for SDE-1)
Round 1: Coding Round - 90 minutes - Hackerrank Problem 1 : Given an array of N integers. Find number of sub-arrays with M number of odd integers. Problem 2 : N gears were given each with their own cost ci and radius ri. One extra gear was also given with radius r1. A distance d was given and we had to find the gear with minimum cost following the
4 min read
Flipkart SDE Interview Experience | Set 45 (On Campus)
Round 1: Online coding test (90 mins) 3 questions, 90 mins on Hackerrank platform. Questions 1 :  Find the number of connected components in a graph represented by matrix of 0s ans 1s. Question 2 : In a given string, find the substring which occurs maximum number of times with atmost K unique characters and length of substring should be in between
3 min read
Flipkart Interview Experience | Set 46 (On-Campus for SDE-1)
Round 1: Coding Round There were 3 questions to be solved on hackerrank in 90 minutes. Questions were: Given an array of length n and an integer m, find number of contiguous subarrays in the array which contain exactly m odd numbers.Given an array of long numbers, find number of distinct sum that can be made using any number of elements from the ar
3 min read
Flipkart Interview Experience | Set 48 (For SDE-1)
Round 1: Telephonic Round (90 minutes) It was a telephonic round. The interviewer started with brief discussion about my projects and technologies I know. Then he asked me following questions: Given an unsorted array - arr find a pair arr[i] & arr[j] such that  arr[i]<arr[j] & i<j and (arr[i] + arr[j]) is maximum.  Expected time compl
2 min read
Flipkart Interview Experience | Set 51 (Off Campus SDE-1)
The off campus drive was done in Delhi recently. Round 1: HackerRank Test Online Q1. Given 2 coordinates as an excel sheet cell number like (2, AA), return true or false whether the line formed between the two points will pass through the origin. e.g. 1, AA 2, AB False Explanation : 1, AA => 1, 27 and 2, AB => 2, 28 . The line between (1, 27)
3 min read
Flipkart Interview Experience | SDE-1 (Experienced)
Round 1: Machine Coding Round (1.5 hrs) I was  given  the following problem statement and asked to  implement it with any choice of programming language.  They expected the code to be production-level, modular and bug free. After this, there was an evaluation round for the code. They tested the code with all corner cases and asked me to modify the
4 min read
Flipkart Interview Experience for SDE-1
Role: SDE-1 (2021) Total-Experience: 1.7 years Location: Bengaluru Total number of Rounds: 3 Mode: virtual I applied for the SDE position at Flipkart through its official website and received an email two weeks later. in preparation for the interviews, An interviewer called to inform me about the interviews and the next steps. There are three round
2 min read
Flipkart Interview Experience for SDE-1 (On-Campus 2019)
Eligibility: 5 CPI and above 207 students were eligible for coding round Coding Round (HackerRank): 90 minutes; 3 questions sorted difficulty wise Question 1 : basic implementation of Hashing given 2 strings Question 2 : sliding window technique There is a meeting scheduled in an office that lasts for time t and starts at time 0. In between the mee
5 min read
Flipkart Interview Experience for SDE-2
Round 1: 1. Matrix which  has value to move in all directions .  Can we reach the destination from the starting point. 2. Keep track of K largest files  files in the  file system all the time. Whats the complexity of deleting the largest file.There was lot of emphasis/discussion on the complexities of the solution and each action in the solution an
2 min read