Myntra Interview Questions, Process, and Tips

OA test 3 Dsa questions 2 medium 1 hard you have to solve 1.5 questions in 120 minutes

Q1. DSA Round Astreoid collision leetcode
Add your answer
Q2. Dp question based on exclusion and inclusion
Add your answer

DSA 2 question
1 -> Find Lca and traverse a tree path available on GFG
2 -> LinkedList pallindrome check (you have to solve that in 0(1) space complexity)

I was hiring drive. First round was coding test with medium to advanced SQL, data modelling and python questions

Q1. Data model e commerce application
Add your answer
Q2. Higest nth rank and lowest rank if no of employees less than 2
Ans. 
If number of employees is less than 2, highest and lowest rank will be the same.
• If there are less than 2 employees, both highest and lowest rank will be the same.

• For example, if there is only 1 employee, their rank will be 1 which is both the highest and lowest rank.
Answered by AI
Add your answer
Q3. Event session data modeling
Add your answer

Q1. Sql-self join, non equi join, window funtion, consecutive seats, data modeling, stock market maximum profit sql question
Add your answer

Q1. This was hiring manager round. Detailed discussions on project and previous experience
Add your answer

Q1. Strength, weakness and why myntra
Add your answer

Q1. About Sop of Garment Manufacturing to Inspection
Add your answer
Q2. Fabric Checking Process 4 Points & Testing Related
Add your answer

Simple DSA ques. and some mcqs. were easy if you are a cp guy

Q1. Given a string of paranthesis tell longest valid parantheisis
Ans. 
Use stack to keep track of indices of opening parentheses, update max length when closing parentheses found
• Use a stack to keep track of indices of opening parentheses

• When a closing parentheses is found, update max length by calculating the difference between current index and top of stack

• Handle edge cases like extra closing parentheses or unmatched opening parentheses

• Example: Input: "(()()", Output: 4 (for "()()")
Answered by AI
Add your answer
Q2. Leetcode 1443. This was exact ques
Add your answer

Q1. Given a string find longest palindromeic substring
Ans. 
Find the longest palindromic substring in a given string.
• Use dynamic programming to check for palindromes within the string.

• Start by checking for palindromes of length 1 and 2, then expand to longer substrings.

• Keep track of the longest palindrome found so far.
Answered by AI
Add your answer
Q2. Simple take not take dp ques But my interviewer was an idiot she didn't understand shit She was reading editorial on the fly. As i told her approch she was like its wrong then read editorial and was fine. ...read more
Add your answer

Q1. How do you manage sell-through rates and Open-to-Buy (OTB) plans? Explain the process
Ans. 
Effective management of sell-through rates and OTB plans ensures optimal inventory levels and maximizes sales potential.
• Analyze historical sales data to forecast demand and set realistic sell-through targets.

• Regularly review inventory levels and sales performance to adjust OTB plans accordingly.

• Implement a collaborative approach with merchandising and marketing teams to align on promotions that drive sell-through.

• Utili...read more
Answered by AI
Add your answer
Q2. What are the Key Responsibility Areas (KRAs) in Inventory Management?
Ans. 
KRAs in Inventory Management focus on optimizing stock levels, reducing costs, and ensuring product availability.
• Stock Control: Monitor inventory levels to prevent overstocking or stockouts. For example, using just-in-time (JIT) inventory systems.

• Demand Forecasting: Analyze sales data to predict future inventory needs, ensuring adequate stock during peak seasons.

• Supplier Management: Establish strong relationships with ...read more
Answered by AI
Add your answer

Online coding test on hacker rank

Q1. Normal DSA question related to array & strings
Add your answer

Q1. Medium Level DSA questions form Linked list & Aarrays
Add your answer

Coding round has two questions ranging in medium -hard level leetcode questions

Q1. Doubly Linked List
Add your answer
Q2. Graph - topological sort
Add your answer
Q3. Operating system, database management system
Add your answer

Q1. Longest Common Subsequence
Ans. 
Longest Common Subsequence is the longest sequence of characters that appear in the same order in both strings.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the lengths of longest common subsequences.

• Iterate through the strings to fill the array and find the longest common subsequence.
Answered by AI
Add your answer
Q2. Largest area in histogram
Ans. 
The largest area in a histogram refers to the rectangle with the maximum area that can be formed within the histogram bars.
• Identify the largest rectangle that can be formed by considering each bar as a potential height and calculating the area based on the width of the rectangle.

• Use a stack data structure to efficiently find the largest area in a histogram by keeping track of the indices of the bars in non-decreasing o...read more
Answered by AI
Add your answer