Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Flipkart Team. If you also belong to the team, you can get access from here

Flipkart Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Flipkart Software Developer Intern Interview Questions, Process, and Tips

Updated 18 Jun 2024

Top Flipkart Software Developer Intern Interview Questions and Answers

  • Q1. Longest Decreasing Subsequence Problem Statement Given an array/list of integers ARR consisting of N integers, your task is to determine the length of the longest decrea ...read more
  • Q2. Binary Tree Cameras Problem Statement Given a binary tree where each node can carry a camera that monitors its parent, itself, and its immediate children, determine the ...read more
  • Q3. Longest Palindromic Substring Problem Statement You are provided with a string STR of length N . The goal is to identify the longest palindromic substring within this st ...read more
View all 10 questions

Flipkart Software Developer Intern Interview Experiences

6 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Design parking lot app
  • Ans. 

    A parking lot app to help users find available parking spots and pay for parking.

    • Include a map feature to show available parking spots in real-time

    • Allow users to reserve parking spots in advance

    • Integrate payment options for users to pay for parking

    • Provide notifications for parking expiration or availability of nearby spots

  • Answered by AI
  • Q2. Design parking lot app for blind people
  • Ans. 

    A parking lot app designed for blind people to easily navigate and find available parking spots.

    • Include voice-guided navigation to direct users to available parking spots

    • Use sensors to detect empty parking spaces and relay information to the app

    • Provide audio alerts for obstacles or other vehicles in the parking lot

    • Include a feature for users to easily locate their parked vehicle when returning

  • Answered by AI

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Unstop and was interviewed in Dec 2023. There were 2 interview rounds.

Round 1 - DSA 

(2 Questions)

  • Q1. Valid BT or not
  • Q2. Make complete row and column zero in a matrix for each element that is already 0
  • Ans. 

    Use a two-pass approach to mark rows and columns with zeros based on existing zeros in the matrix.

    • Iterate through the matrix to mark rows and columns with zeros based on existing zeros

    • Use two arrays to keep track of which rows and columns need to be zeroed out

    • Perform a second pass to update the matrix based on the marked rows and columns

  • Answered by AI
Round 2 - Coding Test 

Similar to Round 1 but more hard questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep your preparation well.
Focus more on explaining than solving.

Skills evaluated in this interview

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Coding Test 

3 coding questions were asked of moderate difficulty level

Round 3 - Interview 

(2 Questions)

  • Q1. Dynamic programming question similar to regex
  • Q2. Dynamic programming a little twisted from previous ques

Interview Preparation Tips

Interview preparation tips for other job seekers - Have a strong grasp on problem solving. I was asked problems based on dynamic programming in interview

I was interviewed in Oct 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 75 minutes
Round difficulty - Hard

Round was scheduled in the evening within a window of two hours.

  • Q1. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, return the head of the reversed linked list.

    Example:

    Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
    Reversed link...
  • Ans. 

    Reverse a singly linked list of integers and return the head of the reversed linked list.

    • Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

    • Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

    • Update the head of the reversed linked list as the last node encountered during the reversal process.

  • Answered by AI
  • Q2. 

    Minimum Steps for a Knight to Reach Target

    Given a square chessboard of size 'N x N', determine the minimum number of moves a Knight requires to reach a specified target position from its initial position...

  • Ans. 

    Calculate minimum steps for a Knight to reach target position on a chessboard.

    • Use BFS algorithm to find shortest path from Knight's starting position to target position.

    • Consider all possible moves of the Knight on the chessboard.

    • Keep track of visited positions to avoid revisiting them.

    • Return the minimum number of moves required to reach the target position.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in BangaloreEligibility criteriaabove 7.5 cgpa, all branchesFlipkart interview preparation:Topics to prepare for the interview - DBMS, OS, SQL, graphs, binary search, pointers, linked list, avl trees, queues and stacks, etcTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : Your basics should be very clear about data structures and algorithms. 
Tip 2 : Try to solve questions in a specific time frame. Also dry run your code with custom test cases, try to find the edge cases.
Apart from this try analyzing the time and space complexity of your solution.
Tip 3 : Take a look at editorials after solving the questions as it can give you a better approach to the problem.
Tip 4 : Don't neglect subjects like OOP's, DBMS and OS. Interviews ask few questions from here as well.

Application resume tips for other job seekers

Tip 1 : not too short or too long
Tip 2 : scale up the basic technologies in resume

Final outcome of the interviewRejected

Skills evaluated in this interview

Flipkart interview questions for designations

 Software Developer

 (35)

 Software Developer II

 (3)

 Senior Software Developer

 (1)

 Software Development Engineer Intern

 (1)

 Intern

 (5)

 Software Engineer

 (9)

 Summer Intern

 (2)

 UI Developer

 (4)

I was interviewed in Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 65 minutes
Round difficulty - Medium

This online assessment comprised of 12 questions with 2 coding questions and 10 MCQs.
Coding Questions:
It was one of the most common Dynamic Programming problems: Longest decreasing sub-sequence.
It was an easy question that needed us to find out the mean, median and mode in an array.

  • Q1. 

    Longest Decreasing Subsequence Problem Statement

    Given an array/list of integers ARR consisting of N integers, your task is to determine the length of the longest decreasing subsequence.

    Explanation:

    A ...

  • Ans. 

    Find the length of the longest decreasing subsequence in an array of integers.

    • Use dynamic programming to keep track of the length of the longest decreasing subsequence ending at each index.

    • Initialize an array to store the length of the longest decreasing subsequence for each element.

    • Iterate through the array and update the length of the longest decreasing subsequence for each element based on previous elements.

    • Return t...

  • Answered by AI
  • Q2. 

    Remove All The Palindromes Problem Statement

    Given a string STR consisting only of lowercase letters, your task is to modify the string by replacing the minimum characters such that the string doesn’t con...

  • Ans. 

    The task is to modify a string by replacing minimum characters to remove all palindromic substrings.

    • Identify palindromic substrings in the given string

    • Replace characters in the substrings to break the palindrome

    • Count the minimum number of characters replaced to remove all palindromic substrings

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 45 minutes
Round difficulty - Medium

There was only one interviewer, I was asked one coding question followed by one puzzle.

  • Q1. 

    Ways To Make Coin Change

    Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...

  • Ans. 

    The task is to find the total number of ways to make change for a specified value using given denominations.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 2D array to store the number of ways to make change for each value up to the specified value.

    • Iterate through each denomination and update the array accordingly.

    • The final answer will be stored in the last cell of the array.

    • Example: For N=3, D=[1, 2...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in HyderabadEligibility criteriaAll students and branches were allowedFlipkart interview preparation:Topics to prepare for the interview - DSA, bit manipulation, codeforces coding practiceTime required to prepare for the interview - 12 months regularlyInterview preparation tips for other job seekers

Tip 1 : Regular practice
Tip 2 : Good command over DSA
Tip 3 : Good communication skills are also important

Application resume tips for other job seekers

Tip 1 : Should be short and descriptive
Tip 2 : Team projects are helpful

Final outcome of the interviewSelected

Skills evaluated in this interview

Get interview-ready with Top Flipkart Interview Questions

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Hard

This round was held on Hackerearth and had 2 questions of Medium-Hard difficulty. Both were based on concepts of DP.
The use of offline IDE was prohibited so we were supposed to code it on Hackerearth IDE itself. I was able to code the second problem well with only 3 Test Cases failing but was stuck on the first problem for quite a long time and wasn't able to pass all the major Test Cases .

  • Q1. 

    Binary Tree Cameras Problem Statement

    Given a binary tree where each node can carry a camera that monitors its parent, itself, and its immediate children, determine the minimum number of cameras needed to...

  • Ans. 

    The problem involves determining the minimum number of cameras needed to monitor all nodes in a binary tree.

    • Implement a function to solve the problem efficiently.

    • Consider the different cases where cameras can be placed to cover all nodes.

    • Use recursion to traverse the tree and place cameras strategically.

    • Optimize the solution to minimize the number of cameras needed.

    • Test the function with different test cases to ensure

  • Answered by AI
  • Q2. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...

  • Ans. 

    Given a string, find the longest palindromic substring with the smallest start index.

    • Iterate through the string and expand around each character to find palindromes

    • Keep track of the longest palindrome found and its starting index

    • Return the longest palindromic substring with the smallest start index

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview questions from similar companies

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 180 minutes
Round difficulty - Medium

The online test consisted of 2 coding questions, 30 aptitude MCQs, 30 behavioral MCQs and 10 code snippets to debug. The coding questions were of medium level, aptitude MCQs were easy and the code snippets to debug was also of easy level. Each section had a time constraint.

  • Q1. 

    Merge Two Sorted Linked Lists Problem Statement

    You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.

    ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list without using additional space beyond constant space complexity.

    • Create a dummy node to start the merged list

    • Iterate through both linked lists and compare nodes to merge them in sorted order

    • Update the next pointers accordingly

    • Handle cases where one list is empty or both lists are empty

    • Return the head of the merged linked list

  • Answered by AI
  • Q2. 

    Minimum Path Sum Problem Statement

    Consider a 2-dimensional grid 'GRID' with 'N' rows and 'M' columns in Ninjaland. Each cell in the grid has an associated cost. The goal is to determine the minimum path ...

  • Ans. 

    The Minimum Path Sum Problem involves finding the minimum sum of costs along a path from the top-left to the bottom-right of a grid.

    • Use dynamic programming to calculate the minimum path sum by considering the costs of moving down or right at each cell.

    • Initialize a 2D array to store the minimum path sum values for each cell in the grid.

    • Iterate through the grid to calculate the minimum path sum for each cell based on the...

  • Answered by AI
Round 2 - Video Call 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

My interview was at 9:00 am. The interview was conducted on Amazon Chime and my webcam was on. The interviewer also asked me to write the code on a document which can be edited by both me and the interviewer. The difficulty of the questions was of medium level. I was asked 3 coding questions along with 2 questions related to OOPS at the end. The interview ended with the discussion of one of my projects. The interviewer was good and also gave me hints wherever required.

  • Q1. 

    Palindrome Partitioning Problem Statement

    You are given a string S. Your task is to partition S such that every substring of the partition is a palindrome. Your objective is to return all possible palindr...

  • Ans. 

    Given a string, partition it into palindromes and return all possible configurations.

    • Use backtracking to generate all possible palindrome partitions

    • Check if each substring is a palindrome before adding it to the partition

    • Return all valid partitions as an array of strings

  • Answered by AI
  • Q2. 

    Longest Increasing Subsequence Problem Statement

    Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...

  • Ans. 

    Find the length of the longest strictly increasing subsequence in an array of integers.

    • Use dynamic programming to solve this problem efficiently.

    • Initialize an array to store the length of the longest increasing subsequence ending at each index.

    • Iterate through the array and update the length of the longest increasing subsequence for each element.

    • Return the maximum value in the array as the result.

  • Answered by AI
  • Q3. 

    Find Missing Number In String Problem Statement

    You have a sequence of consecutive nonnegative integers. By appending all integers end-to-end, you formed a string S without any separators. During this pro...

  • Ans. 

    Find the missing number in a string of consecutive nonnegative integers.

    • Iterate through the string and check for missing numbers by comparing adjacent integers

    • If a missing number is found, return it as the output

    • Handle cases where there are multiple missing numbers or the string is invalid by returning -1

  • Answered by AI
  • Q4. What are the ACID properties in DBMS?
  • Ans. 

    ACID properties in DBMS ensure data integrity and consistency.

    • Atomicity: All operations in a transaction are treated as a single unit of work, either all succeed or all fail.

    • Consistency: Database remains in a consistent state before and after the transaction.

    • Isolation: Transactions are isolated from each other until they are completed.

    • Durability: Once a transaction is committed, the changes made by it are permanent and...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Punjab Engineering College(Deemed To be University). Eligibility criteriaCandidate must be femaleAmazon interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Graphs, Dynamic Programming, OOPS, Operating System, Database Management, C++,Computer Networks.Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : You must have a grip over Data Structures and algorithms. Your concepts must be crystal clear. Pick one coding platform and try to practice at least 7-10 coding questions everyday. I completed around 200+ questions on Leetcode, 200+ questions on Geek For Geeks and around 30-40 questions on InterviewBit. 
Tip 2 : After attempting any coding problem, analyze its time and space complexity. See, if you can further optimize your solution. You can always check the editorials and compare your solution with it.
Tip 3 : Apart from coding questions keep studying concepts of Operating Systems, databases and object oriented programming. You can always refer to Geeks For Geeks articles for it. Also, Coding Ninja's Data Structures and algorithms course in C++ helped me a lot in improving my OOPS concepts specifically.

Application resume tips for other job seekers

Tip 1 : You do not need to have a long list of projects on your resume. One good project with proper knowledge of it will do good. Similarly, do not list down several number of skills. Few skills but roper knowledge of them are enough.
Tip 2 : Do not fake anything on your resume. The interviewer gets to know about it by asking questions. If you aren't able to answer, it leaves a negative impact.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

  • Q1. How can you check if two strings are anagrams of each other?
  • Ans. 

    Check if two strings are anagrams by comparing the sorted versions of the strings.

    • Sort both strings and compare if they are equal.

    • Use a hashmap to store the frequency of characters in each string and compare the maps.

    • Ignore spaces and punctuation when comparing the strings.

  • Answered by AI
Round 2 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round 3 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from National Institute Of Technology, Silchar, Assam. I applied for the job as SDE - 1 in SiddharthnagarEligibility criteria6 CGPAAmazon interview preparation:Topics to prepare for the interview - Basic Computer Science backgroundTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.

Application resume tips for other job seekers

Add projects and Internships if you have done any and add only those things which you really know.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.

  • Q1. 

    Detect Cycle in a Directed Graph

    You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...

  • Ans. 

    Detect cycle in a directed graph using depth-first search (DFS) algorithm.

    • Use DFS to traverse the graph and detect back edges indicating a cycle.

    • Maintain a visited array to keep track of visited nodes during traversal.

    • If a node is visited again during traversal and it is not the parent node, then a cycle exists.

    • Return true if a cycle is detected, false otherwise.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview

  • Q1. 

    Next Smallest Palindrome Problem Statement

    Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.

    Explanation:

    You are given a number in string format, a...

  • Ans. 

    Find the next smallest palindrome greater than a given number represented as a string.

    • Convert the string to an integer, find the next greater palindrome, and convert it back to a string.

    • Handle cases where the number is a palindrome or has all digits as '9'.

    • Consider both odd and even length numbers when finding the next palindrome.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 11:00 am. Interview went well.

  • Q1. 

    Boundary Traversal of a Binary Tree

    Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.

    Input:

    The first line ...
  • Ans. 

    Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.

    • Traverse the left boundary nodes in a top-down manner

    • Traverse the leaf nodes from left to right

    • Traverse the right boundary nodes in a bottom-up manner

    • Handle cases where duplicates occur in the boundary nodes

    • Implement the function without printing as printing is already managed

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaGood knowledge of Data Structures, Some great projects which are used by the usersAmazon interview preparation:Topics to prepare for the interview - Data Structures, Web development, System Design, Algorithms, Dynamic Programming, Database, OS, Networking, OOPS, DevOpsTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart. 
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.

Application resume tips for other job seekers

Tip 1 : Always try to make it a single page 
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Oct 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

Evening test around 5
Platform :- SHL
Environment was amazing

  • Q1. 

    Subtree of Another Tree Problem Statement

    Given two binary trees, T and S, determine whether S is a subtree of T. The tree S should have the same structure and node values as a subtree of T.

    Explanation:

    ...
  • Ans. 

    Given two binary trees T and S, determine if S is a subtree of T with the same structure and node values.

    • Check if the second tree is a subtree of the first tree by comparing their structures and node values.

    • Use a recursive approach to traverse both trees and check for equality.

    • Handle cases where one tree is null or the values do not match.

    • Return true if S is a subtree of T, false otherwise.

  • Answered by AI
  • Q2. 

    Search in a Row-wise and Column-wise Sorted Matrix Problem Statement

    You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...

  • Ans. 

    Given a sorted N*N matrix, find the position of a target integer X.

    • Iterate over each row and column to find the target integer X

    • Utilize the sorted nature of the matrix to optimize the search process

    • Return the position of X if found, else return -1 -1

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

1 Hour 
Afternoon

  • Q1. 

    Intersection of Linked List Problem

    You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.

    Your task is to determine t...

  • Ans. 

    Find the node where two linked lists merge, return -1 if no merging occurs.

    • Traverse both lists to find their lengths and the difference in lengths

    • Move the pointer of the longer list by the difference in lengths

    • Traverse both lists simultaneously until they meet at the merging point

  • Answered by AI
  • Q2. 

    Problem: Pair Sum in a Binary Search Tree

    Given a Binary Search Tree (BST) and an integer 'S', your task is to find all pairs of nodes within the BST that total to 'S' and return these pairs. If no such p...

  • Ans. 

    Find pairs of nodes in a BST that sum up to a given value 'S'.

    • Traverse the BST in-order to get a sorted list of nodes.

    • Use two pointers approach to find pairs with sum 'S'.

    • Keep track of visited nodes to avoid using the same node twice in a pair.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Online Round held on Chime

  • Q1. 

    Is Binary Heap Tree Problem Statement

    You are given a binary tree of integers. Your task is to determine if it is a binary heap tree or not.

    Input:

    The first line of input contains an integer ‘T’ denoti...
  • Ans. 

    Determine if a given binary tree is a binary heap tree or not based on certain properties.

    • Check if the binary tree is a complete binary tree where every level, except the last level, is completely filled and the last level is as far left as possible.

    • Ensure that every parent node is greater than all its children nodes, forming a max-heap.

    • If any node does not have a left or right child, it should be represented as -1 in

  • Answered by AI
  • Q2. 

    Edit Distance Problem Statement

    Given two strings S and T with lengths N and M respectively, your task is to find the "Edit Distance" between these strings.

    The Edit Distance is defined as the minimum nu...

  • Ans. 

    The task is to find the minimum number of operations required to convert one string into another using delete, replace, and insert operations.

    • Use dynamic programming to solve the problem efficiently.

    • Create a 2D array to store the edit distances between substrings of the two input strings.

    • Fill up the array based on the minimum of three possible operations: insert, delete, or replace.

    • The final answer will be the value at...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo backlogsAmazon interview preparation:Topics to prepare for the interview - Data Structures, OOPS, OS, DBMS, Dynamic Programming, Trees/Graph, Tries, Hashing, Algorithms, HadoopTime required to prepare for the interview - 4.5 monthsInterview preparation tips for other job seekers

Tip 1 : 1 Programming Language
Tip 2 : Practice Data Structures with atleast 300 ques.
Tip 3 : CS Fundamental

Application resume tips for other job seekers

Tip 1 : 1 Pager
Tip 2 : Add top 3 projects in Resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Flipkart Interview FAQs

How many rounds are there in Flipkart Software Developer Intern interview?
Flipkart interview process usually has 2 rounds. The most common rounds in the Flipkart interview process are Coding Test, Technical and Resume Shortlist.
What are the top questions asked in Flipkart Software Developer Intern interview?

Some of the top questions asked at the Flipkart Software Developer Intern interview -

  1. Make complete row and column zero in a matrix for each element that is alread...read more
  2. Design parking lot app for blind peo...read more
  3. Design parking lot ...read more

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

SALARIES

Broadridge Financial Solutions

LIST OF COMPANIES

Broadridge Financial Solutions

Overview

SALARIES

Dalmia Bharat Cement

INTERVIEWS

Genpact

No Interviews

INTERVIEWS

CNH Industrial

No Interviews

JOBS

Dalmia Bharat Cement

No Jobs

LIST OF COMPANIES

Dalmia Bharat Cement

Overview

INTERVIEWS

Xperi

No Interviews

Tell us how to improve this page.

Flipkart Software Developer Intern Interview Process

based on 4 interviews

1 Interview rounds

  • Coding Test Round
View more
Flipkart Software Developer Intern Salary
based on 6 salaries
₹18 L/yr - ₹38 L/yr
335% more than the average Software Developer Intern Salary in India
View more details

Flipkart Software Developer Intern Reviews and Ratings

based on 2 reviews

4.6/5

Rating in categories

2.7

Skill development

4.6

Work-life balance

3.3

Salary

3.3

Job security

4.0

Company culture

3.0

Promotions

3.7

Work satisfaction

Explore 2 Reviews and Ratings
Senior Executive
2.7k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Operations Executive
1.8k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Team Lead
1.8k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
1.5k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Executive
1.3k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Flipkart with

Amazon

4.1
Compare

Myntra

4.0
Compare

Snapdeal

3.8
Compare

Meesho

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent