Open In App

Flipkart Interview Experience for SDE 1 | On-Campus 2020

Last Updated : 10 Sep, 2021
Like Article

Flipkart recently visited my college. There was a total of 4 rounds conducted.

Round 1 (Online Test):  The online round was conducted which comprises 3 DS Algo coding questions, the time given was 90 Minutes. The first question was based on the implementation part, the second question used concepts of the priority queue and DP, the third question was based on graph backtracking.

Round 2 (Technical Interview): In this round, only 3 ds algo coding questions were asked in the span of 45-50 minutes.

  1. Find the row having a maximum number of 1s in a binary matrix where each row is sorted. 

    • Expected Time Complexity: O(n)
    • Expected Space Complexity: O(1)
  2. Clone a stack without using extra space. 

    • Expected Time Complexity: O(n) or O(n^2)   (Both would work)
    • Expected Space Complexity: O(1)
  3. Word Ladder (Length of shortest chain to reach a target word)[]=BFS&page=1&query=category[]BFSpage1

Round 3 (Technical Interview): In this round, only 2 DSA coding questions were asked in the span of 30-35 minutes.

  1. The question was similar to Rotten Oranges(only the language was changed a bit, everything else was the same)

    • Expected Time Complexity: O(n*m)
    • Expected Space Complexity: O(n*m)
  2. Find next greater number with same set of digits

    • Expected Time Complexity: O(n)
    • Expected Space Complexity: O(1)

Round 4 (Manager Round): This round mainly focussed on the work I have done during my internship, He used to give me conditions on how would I have handled that problem if it occurs. Also, he asked some general questions about life and myself. At the end he asked a puzzle regarding an android game and how would I proceed further with the interface and what are the different validation checks I have to use, Also how would I be able to ensure security, and how to make it more efficient at the same time. This was a 25-30 minute round.

Tips: Focus mainly on data structures and algorithms. Handling Corner cases is a necessity.

Previous Article
Next Article

Similar Reads

Flipkart Interview Experience for SDE Summer Internship | Virtual On-campus 2020
Flipkart visited our campus(virtually :) ) in September for the Campus Hiring Program (the SDE intern class of 2021). The process continued over the period of a week, with the Coding Round scheduled on Monday and Interviews on Saturday, eventually declaring the results on Sunday. Round 1 (Machine Coding Assessment 90 mins): There were 3 programming
9 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 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 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-1(Off-Campus) 6+ Months Experienced
I applied through Employee Referral. The whole process was completed in a single day(Saturday). There were 4 openings and 20 students were shortlisted for the same. I received a call (on Wednesday, after 15 days of applying) from HR to check my availability on Saturday. She was very polite and explained to me the whole hiring process in detail. The
4 min read
Flipkart Interview Experience for SDE-1 (Off-Campus)
Flipkart has a fixed format for interviews. First round Online assessment (OA). Next 2 rounds DSA interview. The last round is hiring a manager. 1. OA - It had 3 questions. I think 2 were greedy and 3rd was based on DFS/BFS. 2.1st DSA round: First asked me to introduce myself. In total, he asked 2 DSA questions, which I solved. The questions are :
2 min read
Flipkart Interview Experience for SDE Internship (Off-Campus)
In late March 2023, during the final week, I enrolled in the Flipkart Runway Season 3 designed exclusively for women in the 2025 batch. Approximately 16,990 women from across the country registered for this program. Subsequently, on the 18th of March, an online quiz lasting 30 minutes was administered, consisting of 20 questions. The quiz encompass
2 min read
Flipkart Interview Experience for SDE-1 (On-Campus 2019)
Round 1: Online Round - 3 Questions on hackerrank. Finding all triplets in an array where a[i]<a[j]<a[k] and i<j<k. n=1e4.Given an array and a vector of pair of indexes, print the lexicographically maximum array after swapping some elements from the set of index pairs.You can swap any number of times provided the two indexes used for a
2 min read
Practice Tags :