Myntra Software Engineer Interview Questions and Answers

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.

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

The rain water problem involves calculating the amount of rainwater that can be trapped between buildings or structures.

• Calculate the maximum height of water that can be trapped at each position

• Subtract the height of the building at each position to get the water level

• Sum up the water levels at each position to get the total amount of trapped rainwater

The 2 Sum problem involves finding two numbers in an array that add up to a specific target sum.

• Given an array, e.g., [2, 7, 11, 15], and a target sum, e.g., 9.

• The solution involves finding indices of numbers that sum to the target.

• In the example, 2 + 7 = 9, so the output would be indices [0, 1].

• A common approach is to use a hash map for efficient lookups.

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.

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 lon...read more

Find the longest substring in a given string that reads the same forwards and backwards.

• Use dynamic programming to build a table that tracks palindromic substrings.

• Expand around potential centers (each character and between characters) to find palindromes.

• Example: In 'babad', 'bab' and 'aba' are both valid longest palindromic substrings.

• Example: In 'cbbd', 'bb' is the longest palindromic substring.

The Dutch Flag problem involves sorting an array of strings with three possible values in a specific order.

• Create three pointers to keep track of the boundaries of each color group

• Iterate through the array and swap elements to group them in the correct order

• Time complexity of O(n) can be achieved by a single pass through the array