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

Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards

zig zag pattern zig zag pattern

Filter interviews by

Flipkart Mern Full Stack Developer Interview Questions and Answers

Updated 30 May 2024

Flipkart Mern Full Stack Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
-
Process Duration
Less than 2 weeks
Result
-

I applied via Naukri.com and was interviewed in Apr 2024. There were 2 interview rounds.

Round 1 - Technical 

(5 Questions)

  • Q1. Which type Technical interive qustion
  • Q2. What is OOPS Conceps ?
  • Ans. 

    OOPS (Object-Oriented Programming) concepts are the principles that define the foundation of object-oriented programming languages.

    • Encapsulation: Bundling data and methods that operate on the data into a single unit (object).

    • Inheritance: Allowing a class (subclass) to inherit properties and behavior from another class (superclass).

    • Polymorphism: The ability of different classes to be treated as instances of a common sup...

  • Answered by AI
  • Q3. DSA and java base
  • Q4. Codding and other of the
  • Q5. Why higher you .
Round 2 - Coding Test 

Java DSA , HTML , CSS , JS , MERN

Interview Preparation Tips

Topics to prepare for Flipkart Mern Full Stack Developer interview:
  • Java
  • HTML
  • Networking
  • Operating Systems
Interview preparation tips for other job seekers - To work with best my abilities and skill in order to benefit my origination also
to be batter other in this competitive time and influential possession in the organization.

Interview questions from similar companies

I appeared for an interview in Aug 2017.

Interview Questionnaire 

7 Questions

  • Q1. Implement Merge Sort.
  • Ans. 

    Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
  • Ans. 

    Find pairs of integers in a BST whose sum is equal to a given number.

    • Traverse the BST and store the values in a hash set.

    • For each node, check if (X - node.value) exists in the hash set.

    • If yes, add the pair (node.value, X - node.value) to the result.

    • Continue traversal until all nodes are processed.

  • Answered by AI
  • Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
  • Ans. 

    Merge overlapping time intervals into mutually exclusive intervals.

    • Sort the intervals based on their start time.

    • Iterate through the intervals and merge overlapping intervals.

    • Output the mutually exclusive intervals.

    • Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]

  • Answered by AI
  • Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
  • Ans. 

    Different types of hashing and alternative for Linear Chaining

    • Different types of hashing include division, multiplication, and universal hashing

    • Alternative for Linear Chaining is Open Addressing

    • Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing

  • Answered by AI
  • Q5. Implement AVL Tree.
  • Ans. 

    An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.

    • AVL tree is a binary search tree with additional balance factor for each node.

    • The balance factor is the difference between the heights of the left and right subtrees.

    • Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.

    • Rotations are performed ...

  • Answered by AI
  • Q6. Minimum number of squares whose sum equals to given number n.
  • Ans. 

    Find the minimum number of squares whose sum equals to a given number n.

    • Use dynamic programming to solve the problem efficiently.

    • Start with finding the square root of n and check if it is a perfect square.

    • If not, then try to find the minimum number of squares required for the remaining number.

    • Repeat the process until the remaining number becomes 0.

    • Return the minimum number of squares required for the given number n.

  • Answered by AI
  • Q7. Insertion sort for a singly linked list.
  • Ans. 

    Insertion sort for a singly linked list.

    • Traverse the list and compare each node with the previous nodes

    • If the current node is smaller, swap it with the previous node

    • Repeat until the end of the list is reached

    • Time complexity is O(n^2)

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22

Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.

Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.

College Name: The LNM Institute Of Information Technology, Jaipur

Skills evaluated in this interview

I appeared for an interview before May 2021.

Round 1 - Coding Test 

Round duration - 90 minutes
Round difficulty - Medium

 Around 65-70 people sat for the test. 15 people were shortlisted. It consisted of the following to be done in 90 minutes.

- 28 MCQs based on core CS 

- 2 Coding questions – everyone had different and random questions. Most questions were custom logic based (easy level) including some standard questions – LCS, LIS, topological sort.

Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Interviewer was very friendly. It started with the standard – tell me about yourself / introduce yourself type of question. Then he proceeded and asked two coding questions

  • Q1. 

    Remove Duplicates from a Sorted Linked List

    Your friend has homework to complete. Help him by removing duplicates from a sorted linked list.

    You are given the 'Head' of a sorted linked list. Modify the l...

  • Ans. 

    Remove duplicates from a sorted linked list without adjacent duplicates.

    • Traverse the linked list while comparing current and next nodes.

    • If they are equal, skip the next node by updating the current node's next pointer.

    • Repeat until the end of the list is reached.

  • Answered by AI
  • Q2. 

    Course Schedule Problem Statement

    You are enrolled as a student and must complete N courses, numbered from 1 to N, to earn your degree.

    Some courses have prerequisites, which means that to take course i,...

  • Ans. 

    Check if it is feasible to complete all courses with prerequisites.

    • Create a graph representing the prerequisites with courses as nodes and edges as prerequisites.

    • Perform a topological sort on the graph to check if there is a cycle (if there is, then it's not feasible to complete all courses).

    • If there is no cycle, then it is feasible to complete all courses.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

This round had only 1 question. The interviewer introduced himself. And he advised me to clearly understand the problem before proceeding.

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree of distinct integers, along with two nodes, ‘X’ and ‘Y’. Your task is to determine the Lowest Common Ancestor (LCA) of ‘X’ and ‘Y’.

    The LC...

  • Ans. 

    Find the Lowest Common Ancestor of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the Lowest Common Ancestor.

    • Implement a recursive function to efficiently find the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

  • Answered by AI
Round 4 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Pretty Good Round. Fast Paced. We covered a lot of ground.

  • Q1. 

    Binary Search Tree Iterator Problem Statement

    Design and implement a class BSTIterator to perform an in-order traversal over a Binary Search Tree (BST). Your implementation should include the following me...

  • Ans. 

    Design and implement a class BSTIterator to perform in-order traversal over a Binary Search Tree (BST).

    • Implement a parameterized constructor to initialize the iterator with the root of the BST.

    • Implement a method 'next()' to return the next smallest element in in-order traversal.

    • Implement a method 'hasNext()' to check if there exists a next smallest element in traversal.

    • Ensure the output is the in-order traversal of the

  • Answered by AI
  • Q2. 

    Maximum Consecutive Ones Problem Statement

    Given a binary array 'ARR' of size 'N', your task is to determine the maximum length of a sequence consisting solely of 1’s that can be obtained by converting at...

  • Ans. 

    Find the maximum length of a sequence of 1's by converting at most K zeroes into ones in a binary array.

    • Iterate through the array and keep track of the current window of 1's and zeroes.

    • Use a sliding window approach to find the maximum length of consecutive 1's by flipping at most K zeroes.

    • Update the window based on the number of zeroes flipped and keep track of the maximum length found so far.

    • Return the maximum length ...

  • Answered by AI
  • Q3. 

    BFS in Graph Problem Statement

    You are given an undirected and disconnected graph G(V, E) having V vertices numbered from 0 to V-1 and E edges. Your task is to print its BFS traversal starting from the 0t...

  • Ans. 

    BFS traversal of an undirected and disconnected graph starting from vertex 0.

    • Start BFS traversal from vertex 0 and visit all connected nodes in sorted order.

    • Use a queue to keep track of nodes to visit next.

    • Keep a visited array to avoid revisiting nodes.

    • Print the BFS traversal path as the nodes are visited.

    • Example: For input V=5, E=4 and edges 0-1, 0-2, 1-3, 2-4, the BFS traversal will be [0, 1, 2, 3, 4].

  • Answered by AI
  • Q4. 

    Dijkstra's Shortest Path Problem Statement

    Given an undirected graph with V vertices (labeled 0, 1, ..., V-1) and E edges, each edge connects two nodes X and Y with a specified weight representing the dis...

  • Ans. 

    Dijkstra's algorithm is used to find the shortest path distance from a source node to all other nodes in an undirected graph.

    • Implement Dijkstra's algorithm to find the shortest path distance from node 0 to all other nodes in the graph.

    • Use a priority queue to efficiently select the next node with the shortest distance.

    • Initialize distances to all nodes as infinity, except for the source node which is 0.

    • Update distances t...

  • Answered by AI
Round 5 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Hard

Bar Raised Round. Definitely felt the difficulty.

  • Q1. 

    First Non-Repeating Character Problem Statement

    You are given a string consisting of English alphabet characters. Your task is to identify and return the first character in the string that does not repeat...

  • Ans. 

    Identify and return the first non-repeating character in a string, or the first character if all characters repeat.

    • Iterate through the string to count the frequency of each character

    • Iterate through the string again to find the first character with frequency 1

    • If no such character is found, return the first character of the string

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteriaAmazon interview preparation:Topics to prepare for the interview - Linked Lists, Trees, BFS, DFS, Backtracking, Graphs.Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Practice at least 250 Questions, Give yourself enough time for preparation. Cramming won't take you very far. In books, I really liked Elements of Programming Interviews. 
Tip 2 : Make sure to brush up your basics - coding style, OOPs, Language features. They help in making an impression.
Tip 3 : Don't worry about solving the question in the interview. Learn to tackle any random problem with the best of your ability. More often than not, that'd be enough.

Application resume tips for other job seekers

Tip 1 : Keep your resume clean - no graphics, no multiple fonts. Keep it one page.
Tip 2 : Don't go over board in mentioning skills, only mention the things you are truly confident about.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

Round duration - 60 minutes
Round difficulty - Easy

Round 2 - Face to Face 

Round duration - 50 minutes
Round difficulty - Easy

Round 3 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.

Round 4 - Face to Face 

Round duration - 40 minutes
Round difficulty - Easy

 

The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.

Round 5 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me some Com­puter Sci­ence‍ fundamentals in this round as well as some behavioural questions.

  • Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
  • Ans. 

    Implement a Trie data structure with insert and search functions.

    • Create a TrieNode class with children and isEndOfWord attributes.

    • Implement insert function to add words by iterating through characters.

    • Implement search function to check if a word exists by traversing the Trie.

    • Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteria 7 CGPA Amazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Operating System, Database Management System, Object-Oriented Programming SystemTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Do lot of hard work and practice of  Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.

Application resume tips for other job seekers

Make your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2016.

Interview Questionnaire 

5 Questions

  • Q1. Search an element in sorted rotated array.
  • Ans. 

    Search an element in sorted rotated array.

    • Use binary search to find the pivot point where the array is rotated.

    • Divide the array into two subarrays and perform binary search on the appropriate subarray.

    • Handle the cases where the target element is at the pivot point or not present in the array.

  • Answered by AI
  • Q2. Kth largest element in an array.
  • Ans. 

    Find the Kth largest element in an array.

    • Sort the array in descending order and return the element at index K-1.

    • Use a max heap to find the Kth largest element efficiently.

    • Implement a quickselect algorithm to find the Kth largest element in linear time.

  • Answered by AI
  • Q3. Reverse a linked list in group of n element.
  • Ans. 

    Reverse a linked list in groups of n elements.

    • Divide the linked list into groups of n elements.

    • Reverse each group individually.

    • Connect the reversed groups to form the final linked list.

    • Handle cases where the number of elements is not a multiple of n.

    • Example: 1->2->3->4->5->6->7->8, n=3 -> 3->2->1->6->5->4->8->7

  • Answered by AI
  • Q4. Median of two sorted array.
  • Ans. 

    Find the median of two sorted arrays.

    • Merge the two arrays into one sorted array and find the median.

    • Use binary search to find the median in O(log(min(m, n))) time complexity.

    • Handle edge cases like empty arrays or arrays of different lengths.

  • Answered by AI
  • Q5. It was a DP question. In a matrix, I have to count number of paths from (0, 0) to (m, n) while crossing through some indexes were not allowed.
  • Ans. 

    Count number of paths from (0, 0) to (m, n) in a matrix while crossing through some indexes were not allowed.

    • Use dynamic programming to solve the problem

    • Create a 2D array to store the number of paths

    • Traverse the matrix and update the array based on the allowed paths

    • Return the value at the last index of the array

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: Interviewer was mainly focused on problem solving skill.

College Name: KIIT University

Skills evaluated in this interview

I appeared for an interview in Aug 2017.

Interview Preparation Tips

Round: Test
Experience: Platform: Hackerearth
20 MCQs with negative marking, topics included OS, DS-Algo, Networking.
2 Programming Problems.
Duration: 1 hour 30 minutes
Total Questions: 22

Round: Technical Interview
Experience: 3 DS-Algo problems were asked. Made to written codes on paper.

Round: Technical Interview
Experience: 2 DS-Algo problems were asked. Made to written codes on paper.
Few OS questions were also asked.

Skills: Data Structures and Algorithms, Operating Systems
College Name: IIT (BHU)

Interview Questionnaire 

6 Questions

  • Q1. Given a Linked list , print yes if it is palindrome else print no
  • Q2. Print the level order traversal of the binary tree in the spiral form
  • Ans. 

    Print the level order traversal of binary tree in spiral form

    • Perform level order traversal of the binary tree

    • Alternate the direction of traversal for each level

    • Use a stack to reverse the order of nodes in each level

    • Print the nodes in the order of traversal

  • Answered by AI
  • Q3. Maximum of all subarrays of size k(Expected Time Complexity O(N). Input : arr[] = {1, 2, 3, 1, 4, 5, 2, 3, 6} k = 3 Output : 3 3 4 5 5 5 6
  • Ans. 

    Find the maximum element in each subarray of size k in a given array.

    • Iterate through the array from index 0 to n-k.

    • For each subarray of size k, find the maximum element.

    • Store the maximum elements in a separate array.

    • Return the array of maximum elements.

  • Answered by AI
  • Q4. Given Two sorted array of size size n each. Find the Kth largest element in these two array (Expected Time Complexity Log(n))
  • Ans. 

    To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.

    • Merge the two arrays into a single sorted array using a modified merge sort algorithm.

    • Return the Kth element from the merged array.

  • Answered by AI
  • Q5. Website having several web-pages. And also there are lot many user who are accessing the web-site. say user 1 has access pattern : x->y->z->a->b->c->d->e->f user 2 has access pattern : z->a->b->c->d user 3...
  • Q6. Given two array , one of size m+n and contains m element and other position are empty , 2nd array is of size n and contains n element. both array are sorted , now merge the second array to first one such t...
  • Ans. 

    Merge two sorted arrays into one sorted array with expected time complexity of (m+n).

    • Use a two-pointer approach to compare elements from both arrays and merge them into the first array.

    • Start comparing elements from the end of both arrays and place the larger element at the end of the first array.

    • Continue this process until all elements from the second array are merged into the first array.

  • Answered by AI

Interview Preparation Tips

Round: Test
Duration: 90 minutes

Skills: Algorithm , OS, DBMS, data structure
College Name: NIT BHOPAL

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: Coding questions were comparatively easy. There were three questions.1. Given a string map each character of which to the corresponding digit in a 10 digit mobile phone keypad.2. Don't remember, will add when it comes to my mind.3. Don't remember, will add when it comes to my mind.

Skills: Coding ability, Complete knowledge of working of internet.,
College Name: IIT Bombay

Interview Preparation Tips

Round: Test
Experience: Just 1 online test



Round - I (90 mins)



Online Test conducted @ HackerRank



a. M.C.Qs (Operating System + Aptitude + C Programming Language + Object Oriented Programming)



b. Programming (2 coding questions)The Online Exam started off after a brief Presentation on Amazon.





The MCQs were largely based on Operating System, Data structures and Algorithms, OOP concepts, C language and Aptitude.



Coding Questions



1. Determine whether a Linked List is a palindrome or not.



2. Given few sets of intervals print out the the entire intervals without overlapping , if they overlap then combine them into one.



Eg: Input : (5,7) (1 , 6) (2 ,4) (10 ,14) (8,9)



Output : (1,7) (8,9) (10,14)



Advice: Must solve at least 1 coding question to have a good chance for selection into the next round
Tips: CGPA holds importance because it is basic eligibility criteria for written test and then secondly it increases odds in your favor of your selection more than those with lower CGPA with same interview performance. Prepare a good resume



1. Prioritize your content



2. Put the most important information first (Academic Projects + Internship)



3. Proofread it twice



Advice : Do your best and leave the rest to god

Round: Test
Experience: Round II

2 Coding questions

1. Classic 2-sum problem

2. Given numbers a, b as the seeds for the Fibonacci sequence determine if a third number 'k' is a part of that sequence or not. (Tricky)
Total Questions: 2

Round: Other Interview
Experience: Round III
1. Tell me about yourself
2. Project + Internship Discussion
3. Compress a given string "aabbbccc" to "a2b3c3"
constraint: inplace compression, no extra space to be used
assumption : output size will not exceed input size

Round: Technical Interview
Experience: Round IV
1. Internship Project Discussion (30 mins)
2. Find the largest count of 0s in a row in a matrix of 0s and 1s sorted in an ascending order row-wise.
3. Replicate a tree with random pointers inplace

Round: Other Interview
Experience: Round V
1. Question related to graphs involving concepts of Depth and Height of a tree. (Took a lot of time in solving it ! but finally recognized the pattern)
2. Maximum size square sub-matrix with all 1s
3. Find the median of an infinite series of integers
4. Find the most popular Google searches. (solved it using Trie and Max-Heaps)
2 more questions but can't remember them.Finally after waiting for more than 9 hours the results were announced and I was selected
Tips: Be cool and always ask the interviewer questions at the end of the interview. Explain the interviewer your progress while solving the question so that you both are on the same page + its easier for him to understand. Behavioral and H.R.
Tips
1. Speak clearly and with confidence
2. Always prepare yourself beforehand for some common questions like:
a. Tell me about yourself.
b. Why should I hire you?
c. What are your strengths and weaknesses? (give examples)
d. What is your Dream Company?

General Tips: They judge you purely on the basis of your knowledge and performance during the face to face interviews. The extra curricular activities are not given much consideration as Amazon focuses its recruitment procedure purely on the basis of your Technical Knowledge. Prepare a good resume
1. Prioritize your content
2. Put the most important information first (Academic Projects + Internship)
3. Proofread it twice
College Name: NIT JAIPUR

Interview Questionnaire 

8 Questions

  • Q1. Given a n-ary tree. Devise an algo which determines the position at which the 3rd B is present from the given index in constant time complexity
  • Ans. 

    The algorithm finds the position of the 3rd occurrence of 'B' in an n-ary tree from a given index in constant time complexity.

    • Traverse the n-ary tree using a depth-first search (DFS) algorithm

    • Keep track of the count of 'B' occurrences

    • When the count reaches 3, return the current position

    • If the end of the tree is reached before the 3rd 'B', return -1

  • Answered by AI
  • Q2. Given a dictionary with limited words. Check if the string given to you is a composite of two words which are already present in the dictionary
  • Ans. 

    Check if a given string is a composite of two words from a limited dictionary.

    • Create a hash set of all the words in the dictionary.

    • Iterate through all possible pairs of substrings in the given string.

    • Check if both substrings are present in the hash set.

    • If yes, return true. Else, return false.

  • Answered by AI
  • Q3. Given a single linked list of certain nodes. Switch adjacent nodes. Eg. 1 2 3 4 will be 2 1 4 3
  • Ans. 

    Switch adjacent nodes in a single linked list.

    • Traverse the linked list and swap adjacent nodes.

    • Keep track of previous node to update its next pointer.

    • Handle edge cases for first two nodes and last node.

    • Example: 1->2->3->4 becomes 2->1->4->3.

  • Answered by AI
  • Q4. Given a binary search tree. Traverse only the left sub-tree
  • Ans. 

    Traverse only the left sub-tree of a binary search tree.

    • Start at the root node

    • If the left child exists, visit it and repeat the process

    • If the left child does not exist, return to the parent node

    • Continue until all nodes in the left sub-tree have been visited

  • Answered by AI
  • Q5. Implementation of AVL tree. I told solution in nlogn. He asked me optimize further
  • Q6. Write a program to test whether a string and all strings that can be made using the characters of that string are palindrome or not Input Output mmo True yakak True travel False
  • Q7. Next, I was asked to design an efficient data structure for two lifts in a building of n floors
  • Ans. 

    Design an efficient data structure for two lifts in a building of n floors.

    • Use a priority queue to keep track of the floors each lift is heading to

    • Implement a scheduling algorithm to determine which lift to assign to a new request

    • Consider adding a weight limit to each lift to prevent overloading

    • Use a hash table to keep track of the current location of each lift

  • Answered by AI
  • Q8. Given a Integer, find the maximum number that can be formed from the digits. Input : 8754365 output : 8765543
  • Ans. 

    To find the maximum number that can be formed from the digits of an integer.

    • Convert the integer to a string

    • Sort the characters in descending order

    • Join the sorted characters to form the maximum number

  • Answered by AI

Interview Preparation Tips

Skill Tips: They were looking for really cool coders. High expectation on accurate answers. looking for deep understanding of algorithms and data structures.
Skills: Algorithms, Data structures
College Name: PSIT

Skills evaluated in this interview

Flipkart Interview FAQs

How many rounds are there in Flipkart Mern Full Stack Developer interview?
Flipkart interview process usually has 2 rounds. The most common rounds in the Flipkart interview process are Technical and Coding Test.
What are the top questions asked in Flipkart Mern Full Stack Developer interview?

Some of the top questions asked at the Flipkart Mern Full Stack Developer interview -

  1. what is OOPS Concep...read more
  2. which type Technical interive qust...read more
  3. codding and other of ...read more

Tell us how to improve this page.

Flipkart Mern Full Stack Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
BigBasket Interview Questions
3.9
 • 359 Interviews
PolicyBazaar Interview Questions
3.6
 • 359 Interviews
JustDial Interview Questions
3.5
 • 329 Interviews
Info Edge Interview Questions
3.9
 • 317 Interviews
Zomato Interview Questions
3.8
 • 312 Interviews
Myntra Interview Questions
4.0
 • 215 Interviews
Naukri Interview Questions
4.0
 • 185 Interviews
Uber Interview Questions
4.2
 • 150 Interviews
View all
Flipkart Mern Full Stack Developer Salary
based on 4 salaries
₹4.6 L/yr - ₹7.5 L/yr
14% less than the average Mern Full Stack Developer Salary in India
View more details

Flipkart Mern Full Stack Developer Reviews and Ratings

based on 1 review

5.0/5

Rating in categories

5.0

Skill development

5.0

Work-life balance

5.0

Salary

5.0

Job security

5.0

Company culture

5.0

Promotions

5.0

Work satisfaction

Explore 1 Review and Rating
Senior Executive
2.9k salaries
unlock blur

₹1.8 L/yr - ₹9 L/yr

Team Lead
1.8k salaries
unlock blur

₹1.2 L/yr - ₹10 L/yr

Operations Executive
1.8k salaries
unlock blur

₹1.2 L/yr - ₹6.3 L/yr

Assistant Manager
1.6k salaries
unlock blur

₹6 L/yr - ₹21 L/yr

Executive
1.3k salaries
unlock blur

₹1.2 L/yr - ₹7 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