i
Myntra
Filter interviews by
I appeared for an interview in Sep 2021.
Round duration - 60 Minutes
Round difficulty - Easy
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 ...
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...
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...
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...
Round duration - 60 Minutes
Round difficulty - Medium
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...
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
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 ...
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...
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
.
A t...
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.
Round duration - 25 Minutes
Round difficulty - Easy
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.
Tip 1 : Mention Projects
Tip 2 : Highlight Ranks in Competitive Programming
I appeared for an interview in May 2022.
Round duration - 120 minutes
Round difficulty - Medium
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.
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...
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.
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
Tip 1 : Have clear web dev fundamentals
Tip 2 : Have at least 1 good non-trivial project
Tip 3 : Practice basic DSA questions.
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.
I appeared for an interview before May 2021.
Round duration - 150 Minutes
Round difficulty - Medium
3 coding questions and 20 mcq's
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.
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
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.
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...
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...
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
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.
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...
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...
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]
.
The input start...
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
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
The first line cont...
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
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.
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
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.
Tip 1 : Do medium level queustions
Tip 2 : Learn basic system design for startup interviews.
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.
I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.
3 Moderate questions were asked. I managed to solve 2 completely and 1 partially.
I applied via Campus Placement and was interviewed before Sep 2023. There were 2 interview rounds.
Basic coding only not to worry much
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
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
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
Sorting of an array and aptitude
Majorily on SQL and Databases
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
I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.
I applied via Referral and was interviewed in Mar 2024. There were 3 interview rounds.
There were 2 questions.
1. Knapsack
2. Median in an array
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
181
salaries
| ₹13.7 L/yr - ₹33 L/yr |
Flipkart
Amazon
Meesho
LimeRoad