Myntra Software Engineer Interview Questions, Process, and Tips

Q1. Find the missing smallest positive integer
Ans. 
Find the missing smallest positive integer in an array of integers
• Sort the array to easily identify missing integers

• Iterate through the sorted array to find the smallest missing positive integer

• Return the missing integer
Answered by AI
Add your answer
Q2. Given an array of 0,1,2, Sort the array
Ans. 
Sort an array of strings containing only 0, 1, and 2.
• Use a three-way partitioning algorithm like Dutch National Flag algorithm to sort the array in a single pass.

• Keep track of three pointers - low, mid, and high to partition the array into three sections.

• Swap elements based on their values to achieve the sorted array.
Answered by AI
Add your answer

I was asked questions about a doubly linked list, specifically regarding how to add songs to a playlist and play them from the start, end, or a specified ID. Additionally, I was required to delete a song and report on the total number of times each song was played overall and by each individual.

Q1. Rotate array leetcode question
Add your answer
Q2. Longest palindormic substring
Ans. 
A palindrome is a word, phrase, number, or other sequence of characters that reads the same forward and backward.
• Use dynamic programming to solve this problem efficiently.

• Iterate through the string and expand around each character to find the longest palindrome.

• Consider both odd and even length palindromes.

• Example: Input 'babad', Output 'aba' or 'bab'.
Answered by AI
Add your answer

Q1. Print all the subsequences of a string
Ans. 
Generate all possible subsequences of a given string.
• Use recursion to generate all possible combinations of characters in the string.

• At each step, include or exclude the current character to form subsequences.

• Store each subsequence in an array of strings.
Answered by AI
Add your answer
Q2. Print longest substring with k unique values
Ans. 
Find and print the longest substring with k unique characters in an array of strings.
• Iterate through the array of strings and keep track of the longest substring with k unique characters.

• Use a sliding window approach to efficiently find the longest substring.

• Keep a hashmap to store the frequency of characters in the current window.

• Update the window boundaries based on the number of unique characters.

• Return the longest
Answered by AI
Add your answer

Q1. Behaviour quesions
Add your answer

Two medium to hard-level questions and one hard question.

3 medium level problems

Two challenging problems were presented.

Q1. Parking lot design
Add your answer

Q1. About previous role and experience
Add your answer