Flipkart limited interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Flipkart limited
upvote
share-icon
3 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 5 months
Topics: Data Structures and algorithms, Operating systems, OOPS, System Design, Dynamic Programming and GraphsEx - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1 : Do Leetcode/Code studio
Tip 2 : Prepare your resume well and composed
Tip 3 : Practice your aptitude and HR questions beforehand

Application process
Where: Campus
Eligibility: Above 8.5 cgpa
Resume Tip
Resume tip

Tip 1 : Shouldn't exceed 2 pages
Tip 2 : Make sure that you don't include too many certifications or skills

Interview rounds

01
Round
Easy
Online Coding Test
Duration120 minutes
Interview date14 Feb 2022
Coding problem1

Two batches of 10 students each were formed. One batch had their MC round from 10:00 AM to 11:45 AM and the second batch from 10:30 AM to 12:15 PM. I was in the second batch. Google meet link was shared. It was common for all the members of a particular batch. There were 10 candidates, Coordinators, HR, and Technical Team members. One coding question along with some other technical questions was asked.

1. Rotting Oranges

Moderate
20m average time
78% success
0/80
Asked in companies
Samsung R&D InstituteSalesforceSamsung

You have been given a grid containing some oranges. Each cell of this grid has one of the three integers values:

  • Value 0 - representing an empty cell.
  • Value 1 - representing a fresh orange.
  • Value 2 - representing a rotten orange.
  • Every second, any fresh orange that is adjacent(4-directionally) to a rotten orange becomes rotten.

    Your task is to find out the minimum time after which no cell has a fresh orange. If it's impossible to rot all the fresh oranges then print -1.

    Note:
    1. The grid has 0-based indexing.
    2. A rotten orange can affect the adjacent oranges 4 directionally i.e. Up, Down, Left, Right.
    
    Try solving now
    02
    Round
    Medium
    Online Coding Interview
    Duration60 minutes
    Interview date15 Feb 2022
    Coding problem2

    In this round, two questions are asked. In all the questions I have to write the code (Not executed). In all the questions they asked Time and space complexity.

    1. Path In A Tree

    Moderate
    0/80
    Asked in companies
    AmazonMicrosoftFacebook

    You are given a binary tree with ‘N’ number of nodes and a node ‘X’. Your task is to print the path from the root node to the given node ‘X’.

    A binary tree is a hierarchical data structure in which each node has at most two children.

    Example:
    Here, for ‘X ’= 7, the output will be 1 3 7.
    
    Problem approach

    The idea is to find paths from root nodes to the two nodes and store them in two separate vectors or arrays say path1 and path2.
    Now, there arises two different cases: 

    Case 1 : If the two nodes are in different subtrees of root nodes. That is one in the left subtree and the other in the right subtree. In this case it is clear that root node will lie in between the path from node1 to node2. So, print path1 in reverse order and then path 2.
    Case 2 : If the nodes are in the same subtree. That is either in the left subtree or in the right subtree. In this case you need to observe that path from root to the two nodes will have an intersection point before which the path is common for the two nodes from the root node. Find that intersection point and print nodes from that point in a similar fashion of the above case.

    Try solving now

    2. Minimum Fountains

    Easy
    10m average time
    80% success
    0/40
    Asked in companies
    BNY MellonUberAdobe

    There is a one-dimensional garden of length 'N'. On each of the positions from 0 to 'N', there is a fountain, and this fountain’s water can reach up to a certain range as explained further. In other words, there are 'N' + 1 fountains located at positions 0, 1, 2, 3, …. 'N' which can be activated in the garden.

    You are given an integer 'N' and an array/list 'ARR' of length 'N' + 1, where each index of the array denotes the coverage limit of a particular fountain.

    A fountain at index 'i' can water the area ranging from the position 'i' - 'ARR'['i'] to 'i' + 'ARR'['i'].

    Your task is to find the minimum number of fountains that have to be activated such that the whole garden from position 0 to 'N' has access to the water from at least some fountain.

    Note:

    1. 0-based indexing is used in the array.
    2. We only care about the garden from 0 to 'N' only. So if i - 'ARR'['i'] < 0 or i + 'ARR'['i'] > 'N', you may ignore the exceeding area.
    3. If some fountain covers the garden from position 'A' to position 'B', it means that the water from this fountain will spread to the whole line segment with endpoints 'A' and 'B'.
    
    Try solving now
    03
    Round
    Easy
    HR Round
    Duration30 minutes
    Interview date16 Feb 2022
    Coding problem3

    It is a Resume round, that was taken by a manager.

    1. Basic HR Question

    Why do you want to change company?

    2. Basic HR Question

    What will your colleagues say when asked why you have changed?

    3. Basic HR Question

    Can expect questions on previous experience, projects.

    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 - 1
    3 rounds | 10 problems
    Interviewed by Flipkart limited
    2634 views
    0 comments
    0 upvotes
    SDE - 1
    3 rounds | 7 problems
    Interviewed by Flipkart limited
    1189 views
    0 comments
    0 upvotes
    SDE - 1
    3 rounds | 3 problems
    Interviewed by Flipkart limited
    1719 views
    0 comments
    0 upvotes
    SDE - 1
    3 rounds | 4 problems
    Interviewed by Flipkart limited
    2198 views
    0 comments
    0 upvotes
    Companies with similar interview experiences
    company logo
    SDE - 1
    5 rounds | 12 problems
    Interviewed by Amazon
    115097 views
    24 comments
    0 upvotes
    company logo
    SDE - 1
    4 rounds | 5 problems
    Interviewed by Microsoft
    58238 views
    5 comments
    0 upvotes
    company logo
    SDE - 1
    3 rounds | 7 problems
    Interviewed by Amazon
    35147 views
    7 comments
    0 upvotes