i
Myntra
Filter interviews by
Change binary tree so that parent node is the sum of root nodes
Traverse the tree in post-order
Update the parent node with the sum of its children
Recursively update the parent nodes of the updated node
Rearrange an array of positive and negative numbers with positive numbers on the left and negative numbers on the right.
Create two empty arrays, one for positive numbers and one for negative numbers
Iterate through the original array and add positive numbers to the positive array and negative numbers to the negative array
Concatenate the positive and negative arrays to create the rearranged array
Reverse a linkedlist
Iterate through the linkedlist and change the direction of the pointers
Use three pointers to keep track of the current, previous and next nodes
Recursively reverse the linkedlist by calling the function on the next node and changing the direction of the pointers
Process vs Thread differences and synchronization, deadlock examples
Process is an instance of a program while thread is a subset of a process
Processes are independent while threads share the same memory space
Synchronization is used to coordinate access to shared resources
Deadlock occurs when two or more threads are blocked waiting for each other to release resources
Examples of synchronization include mutex, semaphore, ...
String pool is a cache of string literals in memory. Garbage collection frees up memory by removing unused objects.
String pool is a part of heap memory where string literals are stored.
Strings in the pool are shared among multiple objects to save memory.
Garbage collection identifies and removes objects that are no longer in use.
String pool can be accessed using the intern() method.
String objects created using new keywo
I appeared for an interview in Dec 2024.
Aptitude test is a way for employers to assess a candidate's abilities through a variety of different testing formats. Aptitude tests will test your ability to perform tasks and react to situations at work. This includes: problem-solving. prioritisation.5 May 2023
Group discussion (GD) is a structured conversation where a group of people discuss a specific topic. GDs are often used in job interviews, academic settings, and business meetings.
Reporter disappeared while on (an) assignment in the war zone.
I applied via Approached by Company and was interviewed in Nov 2024. There were 4 interview rounds.
In my previous organization, I was responsible for managing ad operations, optimizing campaigns, troubleshooting technical issues, and ensuring delivery of digital advertising campaigns.
Managed ad operations for various digital advertising campaigns
Optimized campaigns to improve performance and ROI
Troubleshooted technical issues related to ad serving and tracking
Ensured timely and accurate delivery of digital advertisi...
Myntra interview questions for popular designations
I applied via Job Fair and was interviewed in Dec 2024. There were 3 interview rounds.
OA test 3 Dsa questions 2 medium 1 hard you have to solve 1.5 questions in 120 minutes
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)
Get interview-ready with Top Myntra Interview Questions
I applied via Approached by Company and was interviewed in Aug 2024. There were 5 interview rounds.
I was hiring drive. First round was coding test with medium to advanced SQL, data modelling and python questions
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.
I appeared for an interview in Dec 2024.
I applied via Campus Placement and was interviewed in Aug 2024. There were 3 interview rounds.
Simple DSA ques. and some mcqs. were easy if you are a cp guy
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 "()()")
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.
I appeared for an interview in Sep 2024, where I was asked the following questions.
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...
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 ...
I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.
Online coding test on hacker rank
Coding round has two questions ranging in medium -hard level leetcode questions
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.
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...
Some of the top questions asked at the Myntra interview -
The duration of Myntra interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 190 interviews
Interview experience
7-10 Yrs
₹ 28-45 LPA
Data Analyst
257
salaries
| ₹6 L/yr - ₹18.4 L/yr |
Manager
203
salaries
| ₹6.5 L/yr - ₹24 L/yr |
Senior Officer
187
salaries
| ₹3 L/yr - ₹8 L/yr |
Senior Assistant
184
salaries
| ₹1.5 L/yr - ₹5 L/yr |
Senior Manager
182
salaries
| ₹13.7 L/yr - ₹33 L/yr |
Flipkart
Amazon
Meesho
LimeRoad