Myntra Software Developer Interview Questions, Process, and Tips

Q1. Right view of a Tree
Ans. 
The right view of a tree shows the nodes that are visible when looking at the tree from the right side.
• The right view of a tree can be obtained by performing a level order traversal and keeping track of the rightmost node at each level.

• Example: For a tree with nodes 1, 2, 3, 4, 5, the right view would be 1, 3, 5.
Answered by AI
Add your answer

Q1. 3 sum Trapping rain water
Ans. 
3 sum and trapping rain water are common coding interview questions that test problem-solving skills.
• 3 sum problem involves finding three numbers in an array that add up to a target sum.

• Trapping rain water problem involves calculating the amount of water that can be trapped between bars in an elevation map.

• Both problems require efficient algorithms to solve.
Answered by AI
Add your answer

Q1. Linked List in a binary tree
Ans. 
A linked list can be implemented in a binary tree by using the left child as the next node and the right child as the previous node.
• Each node in the binary tree will have a left child pointer and a right child pointer.

• Traversal of the linked list can be done by following the left child pointers.

• Example: In a binary tree, the left child of a node can point to the next node in the linked list.
Answered by AI
Add your answer

Q1. Implement LRU cache
Ans. 
LRU cache is a data structure that stores the most recently used items, discarding the least recently used items when full.
• Use a combination of a doubly linked list and a hashmap to efficiently implement LRU cache.

• When an item is accessed, move it to the front of the linked list to mark it as the most recently used.

• When adding a new item, check if the cache is full. If so, remove the least recently used item from the e...read more
Answered by AI
Add your answer

Q1. Mostly behavioural questions
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a online coding interview where I was asked coding questions.

Q1. 
Preorder Traversal of a BST Problem Statement
Given an array PREORDER representing the preorder traversal of a Binary Search Tree (BST) with N nodes, construct the original BST.
Each element in the given...read more
Ans. 
Given preorder traversal of a BST, construct the BST and return its inorder traversal.
• Create a binary search tree from the preorder traversal array

• Return the inorder traversal of the constructed BST

• Ensure each element in the array is distinct
Answered by AI
Add your answer
Q2. 
Convert Sorted Array to BST Problem Statement
Given a sorted array of length N, your task is to construct a balanced binary search tree (BST) from the array. If multiple balanced BSTs are possible, you ca...read more
Ans. 
Construct a balanced binary search tree from a sorted array.
• Create a function that recursively constructs a balanced BST from a sorted array.

• Ensure that the left and right subtrees of each node differ in height by no more than 1.

• Check if the constructed tree is a valid BST by verifying the properties of a BST.

• Return 1 if the constructed tree is correct, otherwise return 0.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round. Programming based questions and oops/dbms based were asked. 
Some questions were :
1. How many types of trigger?
Ans. In SQL, there are 3 types of triggers :
DML (data manipulation language) triggers – Eg.– INSERT, UPDATE, and DELETE
DDL (data definition language) triggers Eg.– CREATE, ALTER, and DROP
Logon triggers –This type reacts to LOGON events
2. Can trigger be used with select statement?
Ans. No, triggers cannot be used with select statements. They can only be used with Insert, update or delete statements. 
3. Indexing in mysql? How many types of indexing in mysql?
Ans. Indexes are used to find rows with specific column values quickly. It helps to determine the position to seek to in the middle of the data file without having to look at all the data. It performs much faster than reading every row sequentially.
4. Engines in mysql?
Ans. So, in mysql, storage engine is a software module that a database management system uses to create, read, update data from a database. There are two types of storage engines: transactional and non-transactional.
5. Singleton pattern?
Ans. Singleton is a creational design pattern that ensured that a class has only one instance, while providing a global access point to this instance.

Q1. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. 
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
• Iterate through the array and use a hashmap to store the difference between the target sum and each element.

• Check if the difference exists in the hashmap, if so, add the pair to the result list.

• Sort the result list based on the criteria mentioned in the problem statement.
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Easy

This was a 2 hour round consisting of 5 mcqs and 2 codes. The mcqs were pretty much simple based on DS, DBMS, OS, OOP, and C language.

Q1. 
Binary Tree to Doubly Linked List
Transform a given Binary Tree into a Doubly Linked List.
Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.
Input:
The fi...read more
Ans. 
Convert a Binary Tree into a Doubly Linked List following Inorder Traversal.
• Perform Inorder Traversal of the Binary Tree to get the nodes in order.

• Create a Doubly Linked List by connecting the nodes in the order obtained from Inorder Traversal.

• Return the head of the Doubly Linked List.
Answered by AI
Add your answer
Q2. 
Validate BST Problem Statement
Given a binary tree with N nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true; otherwise, return false.
A binary search tree (BST)...read more
Ans. 
Validate if a given binary tree is a Binary Search Tree (BST) or not.
• Check if the left subtree of a node contains only nodes with data less than the node's data.

• Check if the right subtree of a node contains only nodes with data greater than the node's data.

• Ensure that both the left and right subtrees are also binary search trees.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

3 coding questions were asked in this round.

Q1. 
Sort an Array in Wave Form
You are given an unsorted array ARR. Your task is to sort it so that it forms a wave-like array.
Input:
The first line contains an integer 'T', the number of test cases.
For ea...read more
Ans. 
Sort an array in a wave-like pattern where each element is greater than or equal to its neighbors.
• Iterate through the array and swap elements to form the wave pattern.

• Start by sorting the array in non-decreasing order.

• Then, swap adjacent elements to form the wave pattern.

• Return the modified array as the output.
Answered by AI
Add your answer
Q2. 
Problem: Search In Rotated Sorted Array
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...read more
Ans. 
Search for integers in a rotated sorted array efficiently.
• Given a rotated sorted array, perform binary search for each query integer.

• Maintain left and right pointers to search efficiently.

• Return the index of the integer if found, else return -1.
Answered by AI
Add your answer
Q3. 
Running Median Problem
Given a stream of integers, calculate and print the median after each new integer is added to the stream.
Output only the integer part of the median.
Example:
Input:
N = 5  
Stre...read more
Ans. 
Calculate and print the median after each new integer is added to the stream of integers.
• Use a min heap to store the larger half of the numbers and a max heap to store the smaller half.

• Keep the sizes of the two heaps balanced to efficiently calculate the median.

• When a new integer is added, adjust the heaps accordingly and calculate the median.

• Output only the integer part of the median after each new integer is added.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was a 60 minute online coding interview where programming questions were discussed.

Q1. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Ans. 
Reverse a singly linked list of integers and return the head of the reversed linked list.
• Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

• Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

• Update the head of the reversed linked list as the last node encountered during the reversal process.
Answered by AI
Add your answer
Q2. 
Rearrange Array: Move Negative Numbers to the Beginning
Given an array ARR consisting of N integers, rearrange the elements such that all negative numbers are located before all positive numbers. The orde...read more
Ans. 
Yes, this can be achieved by using a two-pointer approach to rearrange the array in-place with O(1) auxiliary space.
• Use two pointers, one starting from the beginning and one from the end of the array.

• Move the left pointer to the right until it encounters a positive number, and the right pointer to the left until it encounters a negative number.

• Swap the elements at the left and right pointers, and continue this process ...read more
Answered by AI
View 1 more answer

Round duration - 60 minutes
Round difficulty - Easy

Questions based on data structures , OOPS , Java and operating systems were discussed.

Q1. 
Convert a Binary Tree to its Sum Tree
Given a binary tree of integers, convert it to a sum tree where each node is replaced by the sum of the values of its left and right subtrees. Set leaf nodes to zero.
...read more
Ans. 
Convert a binary tree to a sum tree by replacing each node with the sum of its left and right subtrees, setting leaf nodes to zero.
• Traverse the tree in postorder fashion to calculate the sum of left and right subtrees for each node.

• Set leaf nodes to zero and update the value of each node to the sum of its children.

• Return the level order traversal of the modified tree.
Answered by AI
Add your answer
Q2. Can you explain the concept of the String pool in Java and how garbage collection functionality works?
Ans. 
String pool in Java is a special memory area where String literals are stored to optimize memory usage. Garbage collection in Java is a process of reclaiming memory occupied by objects that are no longer in use.
• String pool is a special area in Java heap memory where String literals are stored to avoid duplicate objects.

• When a new String is created using double quotes, Java first checks the String pool to see if an iden...read more
Answered by AI
Add your answer
Q3. How can you synchronize a HashMap in Java?
Ans. 
You can synchronize a HashMap in Java using the synchronizedMap() method from the Collections class.
• Use synchronizedMap() method to create a synchronized HashMap: Map<String, String> syncMap = Collections.synchronizedMap(new HashMap<>());

• Alternatively, you can use ConcurrentHashMap which is thread-safe and does not require external synchronization.

• Ensure proper synchronization to avoid concurrent modificati
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

This was CTO round, if you make this round…you are doing pretty good. 
He asked a lot on what I worked on and asked questions relevant to that. Process thread, stacks heaps. A minor system design on component in their system. How they are shared between and trade-off. We discussed about scalability and challenge.

Q1. Can you explain the differences between one-to-one mapping and one-to-many mapping in database design, along with some basic related questions?
Ans. 
One-to-one mapping involves a single relationship between two entities, while one-to-many mapping involves a single entity being related to multiple entities.
• One-to-one mapping: each record in one table is related to only one record in another table.

• One-to-many mapping: each record in one table can be related to multiple records in another table.

• In one-to-one mapping, a foreign key is used to establish the relationship...read more
Answered by AI
Add your answer
Q2. What is the difference between a process and a thread?
Ans. 
A process is an independent entity that contains its own memory space and resources, while a thread is a subset of a process that shares the same memory space and resources.
• A process has its own memory space, while threads within a process share the same memory space.

• Processes are independent entities, while threads are subsets of processes.

• Processes have their own resources like file descriptors and sockets, while thr...read more
Answered by AI
Add your answer