Monday, June 27, 2022
HomeSoftware DevelopmentFlipkart Interview Expertise for SDE-1

Flipkart Interview Expertise for SDE-1

Flipkart Interview Experience (Flipkart Grid 3.0 for SDE 1 intern+FTE)

Flipkart Interview experience off-campus through Flipkart Grid 3.0. Flipkart Grid 3.0 is a team hackathon contest However Our Team didn’t qualify for the ideation round, but we got a coding round test link.

Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!

Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsft, TCS, Wipro, Google and many more!

Round 1: Coding Round

There were 3 questions

  1. A state consists of n cities. All roads in the city are bidirectional. We have to find the length of the shortest route between two given cities, with a twist that you can eliminate the distance between any “k” connected cities (eliminate a distance means you can make the distance between two connected cities as 0, you can do this “k” times).
  2. Advanced String matching question.
  3. Coin exchange problem (link to the problem)

I solved 2 questions (first and third)

Round 2:  Technical (No. of Interviewer – 1)

  • Given an integer array, find the smallest missing positive integer in the array.  
I gave 3 solutions

Approach 1: Time complexity: O(nlogn) Space complexity: O(1)
Approach 2: Time complexity: O(n) Space complexity: O(n)
Approach 3: Time complexity: O(n) Space complexity: O(1)
  • Given an integer array, that contains Flipkart coupons with discounts, a customer can select coupons from the array but cannot choose 2 consecutive coupons, find max discount. (Link to question)
I gave 2 solutions

Approach 1, Time Complexity O(n), Space Complexity: O(n)
Approach 2, Time Complexity O(n), Space Complexity: O(1)
  • What is a Complete Binary tree?
  • Max number of nodes having 1 child in a Complete binary tree?
  • Max height of a binary tree? How?
  • How to resolve this problem?

In the end, the interviewer told me that he is passing me in this round and gave me open feedback so that I perform better in Round 2. I got the link for Round 2 the same day only with 2 hours gap in between.

Round 3: Technical (No. of Interviewers 2)

  • Create a class with method names as

Shuffle(): which would shuffle an array in random order

reset(): which would return the original array

My Solution:


class array_operations{

   vector<int> arr;

   vector<int> helper;



   array_operations(vector<int> nums){ 

       for(auto x : nums)




    vector<int> shuffle()


         int n = arr.size();


        for(int i =0 ; i< n; i++)


          int r = rand();

          R = r % (n);

          swap(arr[i], arr[r]);




        return arr; 



    vector<int>  reset()


         for(int i = n-1; i>=0; i--)

               swap(arr[i], arr[helper[i]]);

           return arr; 







int main(){


   vector<int> array = {1,2,3,4,5,6,7,8,9};

   Array_operations a(array);

   Array = a.shuffle();

   Array = a.reset();


  • Given a binary tree, tell whether it is foldable or not. Foldable means symmetrical in left and right subtree (values don’t play any role, at Leetcode values do matter)  
  • I got stuck in the first question as the interviewer wanted to shuffle the in random order without using random number generation function, I used many methods like swapping depending on the current time and many other complexes swapping strategies, at last interviewer gave me the permission to use random number generating function.

In the end, they asked about the time complexity of every method and function along with space complexity.

Round 3: HM round (No. of Interviewer – 1)

  • Given an integer array, divide it into 2 subsequences such that the average of both subsequences (taken individually) is equal. (Link to question)

Now normal resume-based, regarding projects and hobbies.

  • Any new feature you want to implement at the Flipkart app or website.
  • Have you played a chain reaction game (app h,main interview mein bahut game game kar chuka tha), how will u design it?
  • What happens in the background when we write “virtual” in parent class, how does it do run time polymorphism?
  • Rest about CGPA, books I read, Video Editing, and FPS Games like Valiant. (I mentioned all these things in the interview and resume)
  • Round 1, Round 2 happened on SmartMeet  (In these rounds they didn’t run my code but in every code asked me to dry run on multiple test cases and asked Time complexity and Space complexity)
  • Round 3 happened on Google Meet (In this round interviewer asked me to share my screen and open any code editor and ran my code on multiple test cases.)

I’m happy to share that I got the offer.


  • Do not take it as an interview, make it a discussion with the interviewer (interviewers are very friendly and supportive)
  • Take as many test cases to validate your approach, it will show your thinking style and approach to solve any problem.
  • Be confident and be vocal in the whole process.



Please enter your comment!
Please enter your name here

Most Popular

Recent Comments