i
Myntra
Work with us
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
Top trending discussions
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
You are given a matrix MAT
of size 'N' * 'M', where 'N' is the number of rows and 'M' is the number of columns, along with a positive integer 'K'. Your task is to rotate the ma...
Rotate a matrix to the right 'K' times by shifting each column to the right 'K' times.
Iterate 'K' times to perform right rotation on the matrix
Shift each column to the right by one position in each rotation
Handle wrapping around the matrix when shifting columns
Return the matrix elements row-wise after 'K' rotations
Given a two-dimensional grid of size N x M
consisting of upper case characters and a string 'WORD', determine how many times the 'WORD' appears in the grid.
The 'WORD' can b...
Count how many times a given word appears in a 2D grid by moving in any of the eight possible directions.
Iterate through each cell in the grid and check if the word can be formed starting from that cell in any of the eight directions.
Use recursion to explore all possible paths from a starting cell to form the word.
Keep track of visited cells to avoid revisiting the same cell in the same path.
Return the count of how man...
Round duration - 75 minutes
Round difficulty - Medium
Interview started with an introduction and walk through the resume for first 5 minutes. After that, interview asked few coding questions.
You are provided with a non-empty grid consisting of only 0s and 1s. Your task is to determine the maximum area of an island within the given grid.
An island consists of a...
Find the maximum area of an island in a grid of 0s and 1s.
Iterate through the grid and perform depth-first search (DFS) to find connected 1s.
Keep track of the area of each island found and return the maximum area.
Consider all four directions (horizontal, vertical, and diagonal) while exploring the island.
Handle edge cases like grid boundaries and already visited cells during DFS.
If no island is present, return 0 as the...
Determine if there exists a Pythagorean triplet within a given array of integers. A Pythagorean triplet consists of three numbers, x, y, and z, such that x^2 + y^2 = z^2.
Check if there exists a Pythagorean triplet in a given array of integers.
Iterate through all possible triplets in the array and check if they form a Pythagorean triplet.
Use a nested loop to generate all possible combinations of three numbers from the array.
Check if the sum of squares of two numbers is equal to the square of the third number.
Given a Binary Tree of integers, you are tasked with finding the top view of the binary tree. The top view is the set of nodes visible when the tree is viewed fro...
Find the top view of a Binary Tree by returning a list of visible nodes when viewed from the top.
Traverse the Binary Tree in level order and keep track of the horizontal distance of each node from the root.
Use a map to store the nodes at each horizontal distance, and only keep the topmost node for each horizontal distance.
Return the values of the topmost nodes in the map as the top view of the Binary Tree.
Round duration - 90 minutes
Round difficulty - Medium
This round was focused on DSA along with short discussion on computer science fundamentals. For coding problems, I was asked to code the first problem only. For others, had to discuss the approach only. For computer science fundamentals, discussion on OOPS. Differences between process and threads were discussed.
Given a Binary Search Tree (BST) where two nodes have been swapped by mistake, your task is to restore or fix the BST without changing its structure.
The first...
Restore a Binary Search Tree by fixing two swapped nodes without changing its structure.
Identify the two nodes that are swapped by mistake in the BST.
Swap the values of the two identified nodes to restore the BST.
Perform an in-order traversal of the BST to verify the correct restoration.
Ensure no extra space other than the recursion stack is used for the solution.
Your task is to implement a Stack data structure using a Singly Linked List.
Create a class named Stack
which supports the following operations, each in O(1...
Implement a Stack data structure using a Singly Linked List with operations like getSize, isEmpty, push, pop, and getTop in O(1) time.
Create a class named Stack with methods for getSize, isEmpty, push, pop, and getTop.
Use a Singly Linked List to store the elements of the stack.
Ensure that each operation runs in constant time O(1).
Handle edge cases like empty stack appropriately.
Test the implementation with sample queri...
Tip 1 : Focus on DSA as you will be judged mostly on that for entry-level software engineer profiles.
Tip 2 : Don't mug up the solution as you might not be able to recall the approach or you might face new question that you haven't seen earlier.
Tip 3 : Practice as much as possible from platforms like InterviewBit, LeetCode.
Tip 1 : Try not to mention those things about which you are not comfortable.
Tip 2 : Having one or two good projects in resume helps.
Tip 3 : Mention good competitive programming ranks (if any)
Tip 4 : Use overleaf.com for making a resume using Latex.
I appeared for an interview before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Easy
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
ARR = [2,...
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
I applied via Naukri.com and was interviewed before Mar 2021. There were 3 interview rounds.
Online aptitude test with general aptitude questions.
Deadlock is a situation in computing where two or more processes cannot proceed because each is waiting for the other to release resources.
Occurs in multi-threaded environments when processes hold resources and wait for others.
Example: Process A holds Resource 1 and waits for Resource 2, while Process B holds Resource 2 and waits for Resource 1.
Can lead to system inefficiency and unresponsiveness.
Deadlock detection and...
A Red-Black Tree is a balanced binary search tree with specific properties to ensure efficient operations.
Each node is colored either red or black.
The root node is always black.
Red nodes cannot have red children (no two reds in a row).
Every path from a node to its descendant leaves must have the same number of black nodes.
This structure ensures O(log n) time complexity for insertion, deletion, and search operations.
Exa...
Local minima in a 2-D array are elements smaller than their neighbors. We can find them using various algorithms.
A local minimum is defined as an element that is less than its adjacent elements.
For example, in the array [[9, 8, 7], [6, 5, 4], [3, 2, 1]], the element 1 is a local minimum.
To find local minima, iterate through each element and compare it with its neighbors (up, down, left, right).
Consider edge cases where...
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 applied via Naukri.com and was interviewed in Apr 2022. There were 2 interview rounds.
Simple Question Based On Time And Work, Trains Etc Easy To Crack.
The exam duration is one and a half hours.
The total exam time is one and a half hours.
It encompasses all topics related to full stack development.
In two years, I see myself as a senior software developer leading a team on innovative projects.
Advancing to a senior software developer role
Leading a team on new and innovative projects
Continuing to enhance my technical skills through ongoing learning and training
I applied via Naukri.com and was interviewed in Oct 2024. There were 4 interview rounds.
Easy level to Medium level
2 Easy questions of DSA
I applied via Campus Placement and was interviewed before Dec 2023. There were 2 interview rounds.
Duration 1Hr
2 coding questions
Data Analyst
282
salaries
| ₹4.2 L/yr - ₹17 L/yr |
Senior Manager
213
salaries
| ₹13.2 L/yr - ₹40 L/yr |
Manager
210
salaries
| ₹6.9 L/yr - ₹23.3 L/yr |
Associate
207
salaries
| ₹3 L/yr - ₹12.4 L/yr |
Senior Assistant
206
salaries
| ₹1.4 L/yr - ₹5.3 L/yr |
Flipkart
Amazon
Meesho
LimeRoad