## Myntra Interview Experience

Round 1: Given Parent Array Such that parent[i]=j where j is the parent and Value array . Need to Find Best possible sum . Root… Read More »

Round 1: Given Parent Array Such that parent[i]=j where j is the parent and Value array . Need to Find Best possible sum . Root… Read More »

Round 1 (90 Mins) : In total there were 10 questions (6 MCQ and 4 Coding questions). MCQ questions not very tough. Coding questions were… Read More »

Process : There was an online round out of which top 30 students were selected. It was followed by 3 technical interviews and 1 technical… Read More »

Write a C program to detect a loop in a linked list and remove it. Find the kth largest element in an array. Determine if… Read More »

Myntra visited our campus on the first day of placements. Before coming to college, they held the first round which was online. Online Round (First… Read More »

First round (online round) Few mcq questions -mostly techical (C, CPP, DS, OS, DBMS, etc..) and math aptitude; which also had programming question (the question… Read More »

Online Round This round had 5 mcq’s and 2 coding questions. The mcq’s were mostly on quantitative aptitude like profit and loss, age, train, ratio… Read More »

Attended coding interview for myntra. Question was based on the movement of Robot. G-GO one unit L-Turn left R-Turn right Given an input of string… Read More »

I was recently interview for Senior Software Engineer @Myntra. This is my interview experience. Round 1 : Online Test (90 mins) Online test was help… Read More »

Recently Myntra visited our campus for hiring full timers as well as interns . I would like to share my experience as a full time… Read More »

1st round(coding) 1) Given a tree, in which leaf nodes for a doubly linked cycle Print cycle. 2) Tell me if binary tree is BST?… Read More »

First round 1) Given set of coins of different denominations like 1$(100), 5$(50) ..etc, and given an amount, I was asked to come up with… Read More »

Given an array that contains both positive and negative integers, find the product of the maximum product subarray. Expected Time complexity is O(n) and only… Read More »

Write a function which takes a list sorted in non-decreasing order and deletes any duplicate nodes from the list. The list should only be traversed… Read More »

Inversion Count for an array indicates – how far (or close) the array is from being sorted. If array is already sorted then inversion count… Read More »