Upload Button Icon Add office photos
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

Compare button icon Compare button icon Compare

Filter interviews by

Myntra Mern Stack Developer Interview Questions, Process, and Tips

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

Interview questions from similar companies

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 appeared for an interview before May 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 150 Minutes
Round difficulty - Medium

3 coding questions and 20 mcq's

  • Q1. 

    Maximum Sum of Two Non-Overlapping Subarrays

    Given an integer array ARR and a positive integer K, your task is to determine two non-overlapping subarrays of length K that yield the maximum combined sum.

    ...

  • Ans. 

    The task is to find two non-overlapping subarrays of length K in an array, such that their sum is maximum.

    • Iterate through the array and calculate the sum of each subarray of length K

    • Store the maximum sum obtained from the first subarray

    • Iterate again and calculate the sum of each subarray of length K, excluding the previous subarray

    • Store the maximum sum obtained from the second subarray

    • Return the sum of the two maximum

  • Answered by AI
  • Q2. 

    Distinct Subsequences Problem Statement

    You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.

    Exampl...

  • Ans. 

    The task is to find the count of distinct subsequences in a given string.

    • Use dynamic programming to solve the problem.

    • Create a 2D array to store the count of distinct subsequences for each prefix of the string.

    • Initialize the first row of the array with 1, as there is only one subsequence of an empty string.

    • For each character in the string, calculate the count of distinct subsequences by considering two cases: including...

  • Answered by AI
  • Q3. 

    Array Intersection Problem Statement

    Given two integer arrays/ lists ARR1 and ARR2 of sizes N and M respectively, you are required to determine their intersection. An intersection is defined as the set of...

  • Ans. 

    The task is to find the intersection of two integer arrays/lists.

    • Read the number of test cases

    • For each test case, read the size and elements of the first array/list

    • Read the size and elements of the second array/list

    • Find the intersection of the two arrays/lists

    • Print the intersection elements in the order they appear in the first array/list

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

Online video call based round, Timing was 10-11 AM
Interview started with basic greetings, post that i explained by projects in brief and then we jumped right into dsa questoins.

  • Q1. 

    Number of Islands Problem Statement

    You are given a non-empty grid that consists of only 0s and 1s. Your task is to determine the number of islands in this grid.

    An island is defined as a group of 1s (re...

  • Ans. 

    The task is to find the number of islands in a grid consisting of 0s and 1s.

    • An island is a group of 1s connected horizontally, vertically, or diagonally

    • The grid is surrounded by 0s on all four edges

    • Use a depth-first search (DFS) or breadth-first search (BFS) algorithm to traverse the grid and count the number of islands

    • Initialize a visited array to keep track of visited cells

    • For each unvisited cell with a value of 1, p...

  • Answered by AI
  • Q2. 

    Arrangement Problem Statement

    Determine the number of permutations of list A = [1, 2, ..., N] such that for every index i, either A[i] is divisible by i or i is divisible by A[i].

    Input:

    The input start...
  • Ans. 

    The goal is to find the number of permutations of a list satisfying certain conditions.

    • Iterate through all permutations of the list

    • Check if each permutation satisfies the given conditions

    • Count the number of permutations that satisfy the conditions

    • Return the count for each test case

  • Answered by AI
  • Q3. 

    Idempotent Matrix Verification

    Determine if a given N * N matrix is an idempotent matrix. A matrix is considered idempotent if it satisfies the following condition:

    M * M = M

    Input:

    The first line cont...
  • Ans. 

    An idempotent matrix is a square matrix that remains unchanged when multiplied by itself.

    • Check if the given matrix satisfies the property M*M = M

    • Iterate through each element of the matrix and perform the matrix multiplication

    • Compare the result with the original matrix

    • If they are equal, return true; otherwise, return false

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 120 Minutes
Round difficulty - Easy

This was EM round, started with me explaining my projects in deep and facing some counter questions on that, proceeded to os, dbms basic questions and some low level designing and lastly a puzzle to end interview.

  • Q1. Can you design an attendance management system?
  • Ans. 

    Design attendance management system

    • Create a database to store employee information

    • Implement a user interface for employees to mark their attendance

    • Develop a system to track and record attendance data

    • Generate reports and analytics based on attendance data

  • Answered by AI
Round 4 - HR 

Round duration - 20 Minutes
Round difficulty - Easy

This was formality round, HR came and explained what meesho does and told my joining dates and compensation details.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteriaMeesho interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, DBMS, Dynamic Programming, Low level designTime required to prepare for the interview - 5 MonthsInterview preparation tips for other job seekers

Tip 1 : Do medium level queustions
Tip 2 : Learn basic system design for startup interviews.

Application resume tips for other job seekers

Tip 1 : Put things on your resume that you know by your heart, otherwise will have a lot of difficulty in the HM round.
Tip 2 : Do not mention co-curricular activities on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.

Round 1 - Coding Test 

3 Moderate questions were asked. I managed to solve 2 completely and 1 partially.

Round 2 - Technical 

(2 Questions)

  • Q1. Question related to system design were asked.
  • Q2. He asked me to design some functions of facebook.
Round 3 - HR 

(1 Question)

  • Q1. Introduction type questions were asked. In this it will prefer only CS students
Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

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

Round 1 - Coding Test 

Basic coding only not to worry much

Round 2 - One-on-one 

(2 Questions)

  • Q1. Tell me about ur self
  • Ans. 

    I am a passionate software developer with experience in Java, Python, and web development.

    • Experienced in Java, Python, and web development technologies

    • Strong problem-solving skills

    • Excellent team player with good communication skills

  • Answered by AI
  • Q2. What is ur projects
  • Ans. 

    I have worked on various projects including a web-based inventory management system and a mobile app for tracking fitness goals.

    • Developed a web-based inventory management system using React and Node.js

    • Created a mobile app for tracking fitness goals using Flutter

    • Implemented RESTful APIs for communication between frontend and backend systems

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - all the best do well!
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
Not Selected
Round 1 - Technical 

(2 Questions)

  • Q1. LRU Cache - how to tackle
  • Ans. 

    LRU Cache is a data structure that maintains a list of items in order of most recently used to least recently used.

    • Implement using a doubly linked list and a hashmap for efficient operations

    • When an item is accessed, move it to the front of the list

    • When the cache is full, remove the least recently used item from the end of the list

  • Answered by AI
  • Q2. LRU Cache implementation based on a real time system. How would the main work which will be called etc etc
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Sorting of an array and aptitude

Round 2 - Technical 

(1 Question)

  • Q1. BFS graph traversal
Round 3 - Technical 

(1 Question)

  • Q1. Binary tree question
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Majorily on SQL and Databases

Round 2 - Technical 

(2 Questions)

  • Q1. Align two images in a page with same width and same height
  • Ans. 

    Use CSS to align two images with same width and height on a page

    • Set both images to have the same width and height using CSS

    • Use flexbox or grid layout to align the images horizontally or vertically

    • Adjust margins or padding to fine-tune the alignment

  • Answered by AI
  • Q2. Array related question
Round 3 - HR 

(2 Questions)

  • Q1. Situation based question
  • Q2. Majorily focused on project

Skills evaluated in this interview

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

I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Thread,oops,sql,find character count
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I applied via Referral and was interviewed in Mar 2024. There were 3 interview rounds.

Round 1 - Coding Test 

There were 2 questions.
1. Knapsack
2. Median in an array

Round 2 - One-on-one 

(1 Question)

  • Q1. LLD(machine coding) of Google meet
Round 3 - One-on-one 

(1 Question)

  • Q1. In depth discussion on my projects and resume

Tell us how to improve this page.

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
Flipkart Interview Questions
4.0
 • 1.3k Interviews
Swiggy Interview Questions
3.8
 • 428 Interviews
Udaan Interview Questions
4.0
 • 334 Interviews
Meesho Interview Questions
3.7
 • 328 Interviews
Blinkit Interview Questions
3.7
 • 182 Interviews
BlackBuck Interview Questions
3.8
 • 178 Interviews
FirstCry Interview Questions
3.6
 • 170 Interviews
Spinny Interview Questions
3.7
 • 170 Interviews
Tata 1mg Interview Questions
3.6
 • 146 Interviews
View all
Data Analyst
257 salaries
unlock blur

₹6 L/yr - ₹18.4 L/yr

Manager
203 salaries
unlock blur

₹6.5 L/yr - ₹24 L/yr

Senior Officer
187 salaries
unlock blur

₹3 L/yr - ₹8 L/yr

Senior Assistant
184 salaries
unlock blur

₹1.5 L/yr - ₹5 L/yr

Senior Manager
181 salaries
unlock blur

₹13.7 L/yr - ₹33 L/yr

Explore more salaries
Compare Myntra with

Flipkart

3.9
Compare

Amazon

4.1
Compare

Meesho

3.7
Compare

LimeRoad

2.6
Compare
Did you find this page helpful?
Yes No
write
Share an Interview