Premium Employer

i

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

Myntra Verified Tick Work with us arrow

Compare button icon Compare button icon Compare

Filter interviews by

Myntra Mern Stack Developer Interview Questions and Answers

Updated 5 Nov 2021

Myntra Mern Stack Developer Interview Experiences

1 interview found

I appeared for an interview in Sep 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    Middle of a Linked List

    You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.

    If there is an odd number of elements, return the ...

  • Ans. 

    Given the head node of a singly linked list, return a pointer to the middle node. If there are an odd number of elements, return the middle element. If there are even elements, return the one farther from the head node.

    • Traverse the linked list using two pointers, one moving one node at a time and the other moving two nodes at a time.

    • When the fast pointer reaches the end of the list, the slow pointer will be at the midd...

  • Answered by AI
  • Q2. 

    Huffman Coding Challenge

    Given an array ARR of integers containing 'N' elements where each element denotes the frequency of a character in a message composed of 'N' alphabets of an alien language, your ta...

  • Ans. 

    The task is to find the Huffman codes for each alphabet in an encoded message based on their frequencies.

    • The Huffman code is a binary string that uniquely represents each character in the message.

    • The total number of bits used to represent the message should be minimized.

    • If there are multiple valid Huffman codes, any of them can be printed.

    • The input consists of multiple test cases, each with an array of frequencies.

    • Impl...

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Ans. 

    The question asks to find the total amount of rainwater that can be trapped in the given elevation map.

    • Iterate through the array and find the maximum height on the left and right of each bar.

    • Calculate the amount of water that can be trapped at each bar by subtracting its height from the minimum of the maximum heights on the left and right.

    • Sum up the amount of water trapped at each bar to get the total amount of rainwat...

  • Answered by AI
  • Q2. 

    Path Reversals Problem Statement

    You are provided with a directed graph and two nodes, 'S' and 'D'. Your objective is to determine the minimum number of edges that need to be reversed to establish a path ...

  • Ans. 

    The task is to find the minimum number of edges that need to be reversed in a directed graph to find the path from a start node to an end node.

    • The problem can be solved using graph traversal algorithms like Breadth First Search (BFS) or Depth First Search (DFS).

    • Start by creating an adjacency list representation of the directed graph.

    • Perform a BFS or DFS from the start node to the end node, keeping track of the number o...

  • Answered by AI
  • Q3. 

    Triplets with Given Sum Problem

    Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.

    Explanation:

    A t...

  • Ans. 

    The task is to find all distinct triplets in an array that add up to a given sum.

    • Iterate through the array and fix the first element of the triplet.

    • Use two pointers approach to find the other two elements that sum up to the remaining target.

    • Handle duplicates by skipping duplicate elements while iterating.

    • Return the list of valid triplets.

  • Answered by AI
Round 3 - HR 

Round duration - 25 Minutes
Round difficulty - Easy

Interview Preparation Tips

Professional and academic backgroundI applied for the job as MERN Stack Developer in GurgaonEligibility criteriaNo criteriaMyntra interview preparation:Topics to prepare for the interview - DSA, OOPS, React Fundamentals, OS, JavascriptTime required to prepare for the interview - 1.5 monthsInterview preparation tips for other job seekers

Tip 1 : Emphasizing on the importance of proficiency in data structures and algorithms for acing the interviews, which is true in any case.
Tip 2 : Do some good projects. (3 projects are more than sufficient)
Tip 3 : Create your resume of only one page.

Application resume tips for other job seekers

Tip 1 : Mention Projects
Tip 2 : Highlight Ranks in Competitive Programming

Final outcome of the interviewSelected

Skills evaluated in this interview

Top trending discussions

View All
Salary Discussions, Hike & Promotions
2w
a senior executive
GF salary Vs. My salary
Me and my gf have been dating for 5 years. Back in 2020, I started my career with a package of ₹5 LPA. Over the years, I’ve reached ₹22 LPA in 2025. She started her journey with ₹3 LPA(2020) and is now earning ₹8 LPA(2025). We’ve been in a live-in relationship for around 2 years, and the idea was to share expenses equally. But, equal sharing never really happened. If we go to a café she likes, especially with friends, I will pay the entire bill. We only split the house rent and grocery bills. I told her lots of time to cut down these costly cafe expenses or earn more money, increase your package, study and work hard, but.....she is now in her comfort zone. Being from a tech background, I have seen people upgrade their skills and package for a good life in metro cities. I am ready to support her in her studies, but she is like I am earning enough for myself.... No, you are not. I love her, but I don't know how to overcome this issue between us. Please suggest!
Got a question about Myntra?
Ask anonymously on communities.

Interview questions from similar companies

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

  • Q1. 

    Rotate Matrix Right K Times

    You are given a matrix MAT of size 'N' * 'M', where 'N' is the number of rows and 'M' is the number of columns, along with a positive integer 'K'. Your task is to rotate the ma...

  • Ans. 

    Rotate a matrix to the right 'K' times by shifting each column to the right 'K' times.

    • Iterate 'K' times to perform right rotation on the matrix

    • Shift each column to the right by one position in each rotation

    • Handle wrapping around the matrix when shifting columns

    • Return the matrix elements row-wise after 'K' rotations

  • Answered by AI
  • Q2. 

    Word Search Problem Statement

    Given a two-dimensional grid of size N x M consisting of upper case characters and a string 'WORD', determine how many times the 'WORD' appears in the grid.

    The 'WORD' can b...

  • Ans. 

    Count how many times a given word appears in a 2D grid by moving in any of the eight possible directions.

    • Iterate through each cell in the grid and check if the word can be formed starting from that cell in any of the eight directions.

    • Use recursion to explore all possible paths from a starting cell to form the word.

    • Keep track of visited cells to avoid revisiting the same cell in the same path.

    • Return the count of how man...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 75 minutes
Round difficulty - Medium

Interview started with an introduction and walk through the resume for first 5 minutes. After that, interview asked few coding questions.

  • Q1. 

    Problem Statement: Largest Island

    You are provided with a non-empty grid consisting of only 0s and 1s. Your task is to determine the maximum area of an island within the given grid.

    An island consists of a...

  • Ans. 

    Find the maximum area of an island in a grid of 0s and 1s.

    • Iterate through the grid and perform depth-first search (DFS) to find connected 1s.

    • Keep track of the area of each island found and return the maximum area.

    • Consider all four directions (horizontal, vertical, and diagonal) while exploring the island.

    • Handle edge cases like grid boundaries and already visited cells during DFS.

    • If no island is present, return 0 as the...

  • Answered by AI
  • Q2. 

    Pythagorean Triplet Problem

    Determine if there exists a Pythagorean triplet within a given array of integers. A Pythagorean triplet consists of three numbers, x, y, and z, such that x^2 + y^2 = z^2.

    Expl...

  • Ans. 

    Check if there exists a Pythagorean triplet in a given array of integers.

    • Iterate through all possible triplets in the array and check if they form a Pythagorean triplet.

    • Use a nested loop to generate all possible combinations of three numbers from the array.

    • Check if the sum of squares of two numbers is equal to the square of the third number.

  • Answered by AI
  • Q3. 

    Top View of Binary Tree Problem Statement

    Given a Binary Tree of integers, you are tasked with finding the top view of the binary tree. The top view is the set of nodes visible when the tree is viewed fro...

  • Ans. 

    Find the top view of a Binary Tree by returning a list of visible nodes when viewed from the top.

    • Traverse the Binary Tree in level order and keep track of the horizontal distance of each node from the root.

    • Use a map to store the nodes at each horizontal distance, and only keep the topmost node for each horizontal distance.

    • Return the values of the topmost nodes in the map as the top view of the Binary Tree.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This round was focused on DSA along with short discussion on computer science fundamentals. For coding problems, I was asked to code the first problem only. For others, had to discuss the approach only. For computer science fundamentals, discussion on OOPS. Differences between process and threads were discussed.

  • Q1. 

    Fixing a Swapped Binary Search Tree

    Given a Binary Search Tree (BST) where two nodes have been swapped by mistake, your task is to restore or fix the BST without changing its structure.

    Input:

    The first...
  • Ans. 

    Restore a Binary Search Tree by fixing two swapped nodes without changing its structure.

    • Identify the two nodes that are swapped by mistake in the BST.

    • Swap the values of the two identified nodes to restore the BST.

    • Perform an in-order traversal of the BST to verify the correct restoration.

    • Ensure no extra space other than the recursion stack is used for the solution.

  • Answered by AI
  • Q2. 

    Implement Stack with Linked List

    Your task is to implement a Stack data structure using a Singly Linked List.

    Explanation:

    Create a class named Stack which supports the following operations, each in O(1...

  • Ans. 

    Implement a Stack data structure using a Singly Linked List with operations like getSize, isEmpty, push, pop, and getTop in O(1) time.

    • Create a class named Stack with methods for getSize, isEmpty, push, pop, and getTop.

    • Use a Singly Linked List to store the elements of the stack.

    • Ensure that each operation runs in constant time O(1).

    • Handle edge cases like empty stack appropriately.

    • Test the implementation with sample queri...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Software Engineering from TIET - Thapar Institute of Engineering And Technology. I applied for the job as SDE - 1 in GurgaonEligibility criteria7 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, OS, DBMSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Focus on DSA as you will be judged mostly on that for entry-level software engineer profiles.
Tip 2 : Don't mug up the solution as you might not be able to recall the approach or you might face new question that you haven't seen earlier.
Tip 3 : Practice as much as possible from platforms like InterviewBit, LeetCode.

Application resume tips for other job seekers

Tip 1 : Try not to mention those things about which you are not comfortable. 
Tip 2 : Having one or two good projects in resume helps.
Tip 3 : Mention good competitive programming ranks (if any)
Tip 4 : Use overleaf.com for making a resume using Latex.

Final outcome of the interviewSelected

Skills evaluated in this interview

Mern Stack Developer Interview Questions Asked at Other Companies

asked in Myntra
Q1. Middle of a Linked List You are given the head node of a singly l ... read more
asked in Myntra
Q2. Huffman Coding Challenge Given an array ARR of integers containin ... read more
asked in Myntra
Q3. Path Reversals Problem Statement You are provided with a directed ... read more
asked in Myntra
Q4. Triplets with Given Sum Problem Given an array or list ARR consis ... read more
asked in Borderfree
Q5. Move Zeroes to End Given an unsorted array of integers, rearrange ... read more

I appeared for an interview before Sep 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    0/1 Knapsack Problem Statement

    A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...

  • Ans. 

    Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).

    • Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.

    • Iterate through each item and update the array based on whether including the item would increase the total value.

    • The final value in the array at index W will be the maximum value that can be stolen.

  • Answered by AI
  • Q2. 

    Find the Second Largest Element

    Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.

    If a second largest element does not exist, return -1.

    Example:

    Input:
    ARR = [2,...
  • Ans. 

    Find the second largest element in an array of integers.

    • Iterate through the array to find the largest and second largest elements.

    • Handle cases where all elements are identical.

    • Return -1 if a second largest element does not exist.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

System Design Round

  • Q1. Design a system for Twitter, discussing its architecture, key components, and scalability considerations.
  • Ans. 

    Design a scalable system for Twitter with key components and architecture.

    • Use microservices architecture for scalability and fault isolation.

    • Key components include user service, tweet service, timeline service, and notification service.

    • Use a distributed database like Cassandra for storing tweets and user data.

    • Implement a message queue like Kafka for handling real-time updates and notifications.

    • Use a caching layer like ...

  • Answered by AI
Round 3 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaResume shortlistingSwiggy interview preparation:Topics to prepare for the interview - OOPS, Data Structures, Core Java, Algorithms, DBMS, SQL,Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.

Application resume tips for other job seekers

Tip 1 : Mention what you know 
Tip 2 : Good previous work to showcase

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Naukri.com and was interviewed before Mar 2021. There were 3 interview rounds.

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 tips
Round 2 - Aptitude Test 

Online aptitude test with general aptitude questions.

Round 3 - One-on-one 

(1 Question)

  • Q1. Basic js, ES6 features, Angular Questions, Node.js Lifecycle, event loop, mongodb questions, some HR questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare what you are going to appear for, means technologies!
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(4 Questions)

  • Q1. Explain Deadlock?
  • Ans. 

    Deadlock is a situation in computing where two or more processes cannot proceed because each is waiting for the other to release resources.

    • Occurs in multi-threaded environments when processes hold resources and wait for others.

    • Example: Process A holds Resource 1 and waits for Resource 2, while Process B holds Resource 2 and waits for Resource 1.

    • Can lead to system inefficiency and unresponsiveness.

    • Deadlock detection and...

  • Answered by AI
  • Q2. Explain Red Black Tree?
  • Ans. 

    A Red-Black Tree is a balanced binary search tree with specific properties to ensure efficient operations.

    • Each node is colored either red or black.

    • The root node is always black.

    • Red nodes cannot have red children (no two reds in a row).

    • Every path from a node to its descendant leaves must have the same number of black nodes.

    • This structure ensures O(log n) time complexity for insertion, deletion, and search operations.

    • Exa...

  • Answered by AI
  • Q3. Find local minima in a 1-D array?
  • Q4. Find local minima in 2-D array?
  • Ans. 

    Local minima in a 2-D array are elements smaller than their neighbors. We can find them using various algorithms.

    • A local minimum is defined as an element that is less than its adjacent elements.

    • For example, in the array [[9, 8, 7], [6, 5, 4], [3, 2, 1]], the element 1 is a local minimum.

    • To find local minima, iterate through each element and compare it with its neighbors (up, down, left, right).

    • Consider edge cases where...

  • Answered by AI

Skills evaluated in this interview

I appeared for an interview in May 2022.

Round 1 - Assignment 

Round duration - 120 minutes
Round difficulty - Medium

Round 2 - Video Call 

(1 Question)

Round duration - 120 minutes
Round difficulty - Medium

- Discussion on the first round's assignment
- Was asked about adding unit tests in the assignment
- Fundamental questions on the approach used for the assignment.

  • Q1. What are some things that could have been done better in the system design problem given in the first round?
  • Ans. 

    Some improvements in the system design problem could include better scalability planning, more efficient data storage solutions, and improved error handling.

    • Implementing a more robust caching mechanism to improve performance under heavy load.

    • Optimizing the database schema for better query performance and scalability.

    • Introducing load balancing and horizontal scaling to handle increased traffic.

    • Enhancing error handling t...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

Round was with tech lead. Was briefly asked about the problem I solved in the first round. Then I was asked to solve 1 medium level DSA based question. Some discussion on culture fit was also done.

  • Q1. Given the frequency of traffic lights' states, can you determine if there will ever be an invalid state for the traffic signal, and what are the conditions that lead to an invalid state?
  • Ans. 

    Yes, an invalid state can occur if the traffic lights are in conflicting states simultaneously.

    • An invalid state occurs when multiple traffic lights are showing conflicting signals, such as both red and green at the same time.

    • This can happen due to a malfunction in the traffic light system or human error in programming the lights.

    • For example, if a traffic light is stuck showing both red and green signals, it would be co...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteriaNo criteriaBlinkit interview preparation:Topics to prepare for the interview - Data structures, Algorithms, Web development, OOP, LLDTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Have clear web dev fundamentals
Tip 2 : Have at least 1 good non-trivial project
Tip 3 : Practice basic DSA questions.

Application resume tips for other job seekers

Tip 1 : For past experience (internship/full time), explain the impact you created instead of only mentioning what you did.
Tip 2 : Don't exceed 1 page.
Tip 3 : Get it cross-checked for mistakes through multiple sources.
Tip 4 : Only put in stuff that you are confident in being able to explain.

Final outcome of the interviewSelected

Skills evaluated in this interview

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

Round 1 - Aptitude Test 

Simple Question Based On Time And Work, Trains Etc Easy To Crack.

Round 2 - Technical 

(1 Question)

  • Q1. Technical Round Basically Based On Your Resume And Your Experience.

Interview Preparation Tips

Interview preparation tips for other job seekers - Simple Question Asked And Go With Your Resume And Technical Staff Based On Your Experience.
Are these interview questions helpful?
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

The exam duration is one and a half hours.

Round 2 - Coding Test 

The total exam time is one and a half hours.

Round 3 - Group Discussion 

It encompasses all topics related to full stack development.

Round 4 - Technical 

(2 Questions)

  • Q1. Asks questions on SQL
  • Q2. Asks question in typical topics
Round 5 - HR 

(1 Question)

  • Q1. Where do you see yourself in two years?
  • Ans. 

    In two years, I see myself as a senior software developer leading a team on innovative projects.

    • Advancing to a senior software developer role

    • Leading a team on new and innovative projects

    • Continuing to enhance my technical skills through ongoing learning and training

  • Answered by AI
Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
No response

I applied via Naukri.com and was interviewed in Oct 2024. There were 4 interview rounds.

Round 1 - Aptitude Test 

Easy level to Medium level

Round 2 - Coding Test 

2 Easy questions of DSA

Round 3 - One-on-one 

(2 Questions)

  • Q1. One DSA question
  • Q2. Normal discussion about tech stack
Round 4 - HR 

(2 Questions)

  • Q1. Tell about yourself
  • Q2. Why do you want to join digit?

Interview Preparation Tips

Interview preparation tips for other job seekers - Go easy.. Nothing is hard in digit hiring
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Dec 2023. There were 2 interview rounds.

Round 1 - Aptitude Test 

Duration 1Hr
2 coding questions

Round 2 - Technical 

(2 Questions)

  • Q1. Don't remember the questions
  • Q2. Don't remember the questions.

Interview Preparation Tips

Interview preparation tips for other job seekers - easy interview. anyone can crack easily if you are clear with basic concepts.

Tell us how to improve this page.

Join Myntra Be The Trend. Be Myntra.

Interview Questions from Similar Companies

Swiggy Interview Questions
3.8
 • 473 Interviews
Meesho Interview Questions
3.7
 • 367 Interviews
Udaan Interview Questions
3.9
 • 346 Interviews
Blinkit Interview Questions
3.7
 • 237 Interviews
Oyo Rooms Interview Questions
3.2
 • 228 Interviews
BlackBuck Interview Questions
3.7
 • 193 Interviews
FirstCry Interview Questions
3.6
 • 187 Interviews
Tata 1mg Interview Questions
3.6
 • 186 Interviews
Spinny Interview Questions
3.7
 • 183 Interviews
Digit Insurance Interview Questions
3.8
 • 158 Interviews
View all
Data Analyst
282 salaries
unlock blur

₹4.2 L/yr - ₹17 L/yr

Senior Manager
213 salaries
unlock blur

₹13.2 L/yr - ₹40 L/yr

Manager
210 salaries
unlock blur

₹6.9 L/yr - ₹23.3 L/yr

Associate
207 salaries
unlock blur

₹3 L/yr - ₹12.4 L/yr

Senior Assistant
206 salaries
unlock blur

₹1.4 L/yr - ₹5.3 L/yr

Explore more salaries
Compare Myntra with

Flipkart

3.9
Compare

Amazon

4.0
Compare

Meesho

3.7
Compare

LimeRoad

2.5
Compare
write
Share an Interview