i
Myntra
Filter interviews by
Print only the leaf nodes of a doubly linked tree.
Traverse the tree and check if a node has no children and both left and right pointers are null.
If yes, then it is a leaf node and print it.
If no, then continue traversing the tree.
Use recursion to traverse the tree in a depth-first manner.
LRU page replacement algorithm is used to replace the least recently used page in memory with a new page.
LRU stands for Least Recently Used
It is a cache eviction algorithm
It is used to manage memory in operating systems
It works by keeping track of the pages that are used recently and the ones that are not
When a new page is to be loaded into memory, the algorithm checks which page has not been used for the longest time
Reverse m nodes and leave n nodes in a linked list till the end.
Traverse the linked list till m nodes and reverse them
Traverse n nodes and continue reversing m nodes
Repeat the above step till the end of the linked list
Handle edge cases like m or n being greater than the length of the linked list
Inorder traversal is a way of visiting all nodes in a binary tree by visiting the left subtree, then the root, and then the right subtree.
Start at the root node
Traverse the left subtree recursively
Visit the root node
Traverse the right subtree recursively
Repeat until all nodes have been visited
Inorder traversal of a tree without recursion
Create an empty stack and initialize current node as root
Push the current node to stack and set current = current.left until current is NULL
If current is NULL and stack is not empty, pop the top item from stack, print it and set current = popped_item.right
Repeat step 2 and 3 until stack is empty
Find the triplicate number in an array of duplicates.
Iterate through the array and keep track of the frequency of each number.
Return the number that appears three times.
If no number appears three times, return null.
Explanation of search algorithms with their space and time complexities.
Linear Search - O(n) time complexity, O(1) space complexity
Binary Search - O(log n) time complexity, O(1) space complexity
Jump Search - O(√n) time complexity, O(1) space complexity
Interpolation Search - O(log log n) time complexity, O(1) space complexity
Exponential Search - O(log n) time complexity, O(1) space complexity
Fibonacci Search - O(log n)
Find the most repeated number in an array of length n with numbers 1-n.
Create a dictionary to store the count of each number in the array
Iterate through the array and update the count in the dictionary
Find the key with the highest count in the dictionary
I was interviewed 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 was interviewed 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 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...
I applied via Company Website and was interviewed in Jun 2024. There were 2 interview rounds.
Group discussion, or GD, is used by companies, universities, and other organizations to evaluate a candidate’s soft skills. The GD evaluates a candidate’s skills, such as interaction, time management, authoritativeness, critical thinking, intuition, listening skills, etc.
I am proficient in JavaScript, Python, and Ruby scripting languages.
JavaScript is commonly used for web development and can be used for both client-side and server-side scripting.
Python is known for its simplicity and readability, making it a popular choice for scripting and automation tasks.
Ruby is often used for web development and automation, with a focus on developer productivity.
I have used tools like Slack, Zoom, Trello, and Google Docs to manage a remote team effectively.
Slack for communication and quick updates
Zoom for virtual meetings and video calls
Trello for task management and tracking progress
Google Docs for collaborative document editing
I am proficient in Java, Python, and SQL.
Java
Python
SQL
I applied online through the company's website and was contacted for an interview.
Applied online through company's website
Received a call/email for interview
Submitted resume and cover letter
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 188 interviews
Interview experience
based on 1.9k reviews
Rating in categories
Data Analyst
209
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
207
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Assistant
193
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Officer
184
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Manager
178
salaries
| ₹0 L/yr - ₹0 L/yr |
Flipkart
Amazon
Meesho
LimeRoad