# Top 6 Myntra Coding Interview Questions from 2025


# Introduction
In this blog post, we'll share the most commonly asked coding interview questions at Myntra.  If you don't have months to study for your interviews, you can use AI tools like [Chatmagic](https://www.chatmagic.app) to generate solutions quickly and efficiently - helping you pass the interviews and get the job offer!

	
# Problem #1: [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram)
> Given an array of integers heights representing the histogram's bar height where the width of each bar is 1, return the area of the largest rectangle in the histogram.   Example 1:   Input: heights = [2,1,5,6,2,3] Output: 10 Explanation: The above is a histogram where width of each bar is 1. The largest rectangle is shown in the red area, which has an area = 10 units.  Example 2:   Input: heights = [2,4] Output: 4    Constraints:  1 <= heights.length <= 105 0 <= heights[i] <= 104  

Topics: Array, Stack, Monotonic Stack


# Problem #2: [First Missing Positive](https://leetcode.com/problems/first-missing-positive)
> Given an unsorted integer array nums. Return the smallest positive integer that is not present in nums. You must implement an algorithm that runs in O(n) time and uses O(1) auxiliary space.   Example 1:  Input: nums = [1,2,0] Output: 3 Explanation: The numbers in the range [1,2] are all in the array.  Example 2:  Input: nums = [3,4,-1,1] Output: 2 Explanation: 1 is in the array but 2 is missing.  Example 3:  Input: nums = [7,8,9,11,12] Output: 1 Explanation: The smallest positive integer 1 is missing.    Constraints:  1 <= nums.length <= 105 -231 <= nums[i] <= 231 - 1  

Topics: Array, Hash Table


# Problem #4: [3Sum](https://leetcode.com/problems/3sum)
> Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets.   Example 1:  Input: nums = [-1,0,1,2,-1,-4] Output: [[-1,-1,2],[-1,0,1]] Explanation:  nums[0] + nums[1] + nums[2] = (-1) + 0 + 1 = 0. nums[1] + nums[2] + nums[4] = 0 + 1 + (-1) = 0. nums[0] + nums[3] + nums[4] = (-1) + 2 + (-1) = 0. The distinct triplets are [-1,0,1] and [-1,-1,2]. Notice that the order of the output and the order of the triplets does not matter.  Example 2:  Input: nums = [0,1,1] Output: [] Explanation: The only possible triplet does not sum up to 0.  Example 3:  Input: nums = [0,0,0] Output: [[0,0,0]] Explanation: The only possible triplet sums up to 0.    Constraints:  3 <= nums.length <= 3000 -105 <= nums[i] <= 105  

Topics: Array, Two Pointers, Sorting


# Problem #5: [Target Sum](https://leetcode.com/problems/target-sum)
> You are given an integer array nums and an integer target. You want to build an expression out of nums by adding one of the symbols '+' and '-' before each integer in nums and then concatenate all the integers.  For example, if nums = [2, 1], you can add a '+' before 2 and a '-' before 1 and concatenate them to build the expression "+2-1".  Return the number of different expressions that you can build, which evaluates to target.   Example 1:  Input: nums = [1,1,1,1,1], target = 3 Output: 5 Explanation: There are 5 ways to assign symbols to make the sum of nums be target 3. -1 + 1 + 1 + 1 + 1 = 3 +1 - 1 + 1 + 1 + 1 = 3 +1 + 1 - 1 + 1 + 1 = 3 +1 + 1 + 1 - 1 + 1 = 3 +1 + 1 + 1 + 1 - 1 = 3  Example 2:  Input: nums = [1], target = 1 Output: 1    Constraints:  1 <= nums.length <= 20 0 <= nums[i] <= 1000 0 <= sum(nums[i]) <= 1000 -1000 <= target <= 1000  

Topics: Array, Dynamic Programming, Backtracking


# Problem #6: [Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii)
> Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal. In one move, you can increment or decrement an element of the array by 1. Test cases are designed so that the answer will fit in a 32-bit integer.   Example 1:  Input: nums = [1,2,3] Output: 2 Explanation: Only two moves are needed (remember each move increments or decrements one element): [1,2,3]  =>  [2,2,3]  =>  [2,2,2]  Example 2:  Input: nums = [1,10,2,9] Output: 16    Constraints:  n == nums.length 1 <= nums.length <= 105 -109 <= nums[i] <= 109  

Topics: Array, Math, Sorting