Myntra Interview Questions

Excerpts from Interview #1:
(An  IT student with profile as 9.01 CGPA and having 93.4 % in 12th and 89.7 % in 10th offering job profile as Software Engineer)
Technical Interview I:
  • You’re given a Boolean 2D matrix, can you find the number of islands?
  • Tell us an efficient data structure for minimizing the following operations if we have an array arr[0 . . . n-1].
  • Add a value x to array from index l to r where 0 <= l <= r <= n-1
  • Find the value of a specified element of the array arr[i] where 0 <= i <= n-1
  • Is {a, n, d} a palindrome? If you are given a random string, is it a palindrome or not?
  • Questions on Implementation of AVL tree.
Technical Interview II:
  • Find the second largest element in an array using heap sorting.
  • Write a program to implement a round robin scheduler and calculate the average waiting time.
  • Given an array of strings, find if the given strings can be chained to form a circle. A string X can be put before another string Y in circle if the last character of X is same as first character of Y.
HR Interview:
  • Why do you want to be a part of Myntra?
  • What makes you better than other candidates here?
  • What are your short term & long term career goals?
  • Use only 3 words to describe yourself.
Excerpts from Interview #2:
(A CSE student with profile as 8.47 CGPA and having 88.8% in 12th and 92.8% in 10th. Offering summer internship)
Technical interview I:
  • Given a linked list, reverse K nodes in it.
  • Search for an element in an array which has elements who’s values are first increasing and then decreasing. (Use modified binary search)
  • Find the second largest element in an array.
  • Given a sorted array which can have repeated elements, find the occurrence of an element. (Most optimal solution is O(log n) – Using binary search to find start and end occurrence)
  • Make a data structure and implement an algorithm to print all the files in a directory. (The root directory can have sub-directories too.)
Technical interview II:
  • Convert a BST into a DLL and DLL to BST in place.
  • Write a code to generate a series where the next element is the sum of last k terms.
  • Vertical traversal of a Binary Tree.
  • Lowest Common ancestor in a Binary Search Tree and Binary Tree.
  • Implement a stack with push (), pop() and min() in O(1) time.
HR Interview:
  • Why should we hire you?
  • Tell us your weaknesses that hinder your work? How will you overcome them if we hire you?
  • Are you comfortable with changing cities for the job?
  • Tell me about all your projects and internship you did while? How did you get them?
  • What makes the company different from other firms?
Excerpts from Interview #3:
(A CSE student with profile as 7.81 CGPA and having 91.3% in 12th and 88.8% in 10th. Offering job profile as Software Engineer )
Technical interview I:
  • Given in face book find an efficient way to find the mutual friends between you and one of your given friends. Hint: hashing, dictionary data structure implementation
  • For two very long numbers given, find the product of these numbers in an efficient way. Hint: using binary multiplication effectively.
  • Given a number n, find the number just greater than n using same digits as that of n.
  • Given n coins for two players playing a game. Each player picks coins from the given n coins in such a way that he can pick 1 to 5 coins in one turn and the game continues for both the players. The player who picks the last coin looses the game. You have to tell that for given n coins who loses the game?
Technical interview II:
  • Write a code to find the intersection point of two merging linked lists.
  • Write a code to delete in a binary search tree.
  • Construct a Binary Search tree using given preorder and inorder.
HR Interview:
  • Do you know someone working in Myntra?
  • How did you come to know about Myntra?
  • Do you work well under pressure?
  • What are the challenges you facing in IT?
  • Any queries?
Excerpts from Interview #4:
(A  CSE student with profile as 8.89 CGPA and having 88.9% in 12th and 91.3% in 10th. Offering job profile as SDE(Software Developer))
Technical interview I:
  • Convert Binary tree to linked list.
  • Rotate a matrix by 90 degrees.
  • What is the definition of tree?
  • What are the differences between graph and tree?
  • When can you say a graph to be a tree?
  • Write a code to design a bus reservation system defining classes and member functions.
Technical interview II:
  • Write a program to show whether a graph is a tree or not using adjacency matrix.
  • Given two numbers represented by two linked lists, write a function that returns sum list.
  • Some stack based questions like stock span problem, next greater element.
  • Some dynamic programming problems like maximum sum sub array, maximum sum sub array such that no elements are consecutive, edit distance, assembly line scheduling.
HR Interview:
  • Tell us about yourself.
  • What inspires you to be part of the Amazon family?
  • What is your dream company?
  • What did you buy via Myntra last time?
Excerpts from Interview #5:
(A CSE student with 9.19 CGPA and having 94.6% in 12th and 93.4% in 10th. Offering job profile as Software Developer.)
Technical interview I:
  • He asked me the worst case complexities of Quick sort and Merge sort.
  • Given an array that contains post-order traversal of a binary tree. Can you construct a single tree? I said no. Then he asked if i can make a binary search tree from the array to which i said yes. Then after discussing the approach, he asked to write the code.
  • Then he asked me to write the code for level-order traversal of a tree. Also asked me to calculate the complexity of the code.
  • Given a linked list placed in memory, what problems can arise if simultaneous operations are performed on the list. From here he started asking about threads because the answer was related to it.
Technical Interview II:
  • What steps are taken when the OS shifts from one-thread execution to another?
  • A set of integers are given, find the largest number possible by rearranging the contents in the array.
  • Write a code to find the nth node from the end of a linked list.
  • Write a program to implement heap sort algorithm.
HR Interview:
  • Introduce yourself.
  • Why Myntra? How is it different from its competitors?
  • Why do you want to leave your current company in such a short interval?
  • Did you ask your current company to provide that type of work as you are looking for in Myntra?
Excerpts from Interview #6:
(A CSE student with 8.6 CGPA and having 96% in 12th and 95% in 10th. Offering job profile as Software Developer.)
Technical interview I:
  • What do you mean by constant time complexity?
  • What do you mean by hashing?
  • What is the function of DML Compiler?
  • State at least four kinds of indexing?
Technical interview II:
  • Write a SQL queries on self join and inner join.
  • A BST is given,write a code to find the maximum sum between any two nodes i.e. the maximum sum of the nodes in the path between the two leaf nodes.
  • Write a program to reverse a linked list in the groups size’k’, for instance, if k=3 reverse every 3 nodes.
HR Interview:
  • Describe yourself.
  • Why did you apply for Myntra?
  • What did you buy via online shopping last time?
  • Name the founder of Myntra.
  • What are your long-term goals?
  • What will you mark as your achievement during your college life?
Test Site