Myntra pvt ltd interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Myntra pvt ltd
2 rounds | 4 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 6 months
Topics: Data Structures, Algorithms, Object Oriented Programming, Time Complexity, Programming Language Implementation.
Tip 1 : Practice DSA questions, interview questions as much as you can.(400 leetcode questions) + (1000+ geeksforgeeks score) is good approximation of your preparation.
Tip 2 : You should have a good internship experience or 1 or 2 good projects on Android/web-d or Machine Learning.You should be through with your projects and be able to tell further improvements for the future.
Tip 3 : Be CONFIDENT with what you say. Don't murmur or speak in the mouth.The interviewer wants to know your thought process.
Application process
Where: Campus
Eligibility: Above 7 CGPA
Tip 1 : Resume is the first impression of you. So it must be very eye-catching. Write some decent (maybe 1 or 2 is enough) projects on your resume.
Tip 2 : You should be through with every point you have written on your resume. People usually write 10- 15 skills on their resumes while confident in only 5. Please don't do it.
Interview rounds
01
Round
Easy
Video Call
Duration45 minutes
Interview date5 Aug 2021
Coding problem2
1. Check If One String Is A Rotation Of Another String
Moderate
15m average time
85% success
0/80
Asked in companies
You are given two Strings 'P' and 'Q' of equal length.
Your task is to return 1 if String 'P' can be converted into String 'Q' by cyclically rotating it to the right any number of times ( Possibly Zero ), else return 0.
A cyclic rotation to the right on String 'A' consists of taking String 'A' and moving the rightmost character to the leftmost position. For example, if 'A' = "pqrst", then it will be "tpqrs" after one cyclic rotation on 'A'.
For example:
Consider the two strings 'P' = "abfyg" and 'Q' = "gabfy"
If we cyclically rotate String 'P' to the right once. The resulting string P becomes "gabfy" which is equal to String 'Q'.
Therefore it is possible to convert String 'P' to String 'Q'.
Problem approach
You are given two Strings 'P' and 'Q' of equal length. Your task is to check whether String 'P' can be converted into String 'Q' by cyclically rotating it to the right any number of times ( Possibly Zero ).
2. Minimum Parentheses
Easy
10m average time
90% success
0/40
Asked in companies
Given a string "pattern", which contains only two types of characters ‘(’, ‘)’.
Your task is to find the minimum number of parentheses either ‘(’, ‘)’ we must add the parentheses in string ‘pattern’ and the resulted string is valid.
Condition for valid string-
Every opening parenthesis ‘(’ must have a correct closing parenthesis ‘)’.
Example - ‘(()(()))’, ‘()()()’, ‘((()))’ are valid string, and ‘(((’, ‘(()’, ‘)(())’ are invalid string.
Note:
1. You are not required to print the output explicitly, it has already been taken care of. Just implement the function and return the minimum number of parentheses required to make a string valid.
Problem approach
Given a string "pattern", which contains only two types of characters ‘(’, ‘)’.
Your task is to find the minimum number of parentheses either ‘(’, ‘)’ we must add the parentheses in string ‘pattern’ and the resulted string is valid.
Condition for valid string-
Every opening parenthesis ‘(’ must have a correct closing parenthesis ‘)’.
Example - ‘(()(()))’, ‘()()()’, ‘((()))’ are valid string, and ‘(((’, ‘(()’, ‘)(())’ are invalid string.
02
Round
Easy
Video Call
Duration45 minutes
Interview date5 Aug 2021
Coding problem2
1. Delete a Node In A Linked List
Moderate
40m average time
67% success
0/80
Asked in companies
You have been given a linked list of integers. Your task is to write a function that deletes a node from a given position, 'POS'.
Note :
Assume that the Indexing for the linked list always starts from 0.
If the position is greater than or equal to the length of the linked list, you should return the same linked list without any change.
Illustration :
The following images depict how the deletion has been performed.
Image-I :
Image-II :
Problem approach
You are given a Singly Linked List of integers and a reference to the node to be deleted. Every node of the Linked List has a unique value written on it. Your task is to delete that node from the linked list.
2. Minimum Number of Platform Needed
Easy
23m average time
85% success
0/40
Asked in companies
You are given the arrival and departure times of N trains at a railway station in a day. You need to find the minimum of platforms required for the railway station such that no train waits i.e No train should wait for the platform to be clear or free.
Problem approach
You are given the arrival and departure times of N trains at a railway station in a day. You need to find the minimum of platforms required for the railway station such that no train waits i.e No train should wait for the platform to be clear or free.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
4 rounds | 11 problems
Interviewed by Myntra pvt ltd
Rejected
1974 views
0 comments
0 upvotes
SDE - 1
2 rounds | 3 problems
Interviewed by Myntra pvt ltd
Rejected
4990 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Myntra pvt ltd
Selected 2319 views
0 comments
0 upvotes
SDE - 1
3 rounds | 3 problems
Interviewed by Myntra pvt ltd
Selected 2729 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 115097 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 58238 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 35147 views
7 comments
0 upvotes