Sunday, 30 July 2017

Myntra Placement Tips

Related imageMynta Placement Tips





About Myntra

Myntra is an e-commerce company started by an IIT/IIM group in 2007, headquartered in Bengaluru, Karnataka. Founded in 2007, it is the largest online store for fashion and lifestyle products.

In May 2014, the company merged with Flipkart.

The Myntra Test-Pattern and Selection Process are as follows:

Selection Process:

Company conducts recruitment process every year to select new candidates. The selection process of the company consists of 4 rounds.

These rounds are as follows:

Written Exam
Technical Interview I
Technical Interview II
HR Interview

Academic Criteria:

Should be having 65% or above in graduation and 75% and above in X and XII.

Pattern of Written Exam:

Sections                       No. of questions               
Aptitude                                  5                                    
Coding                                    2
Total                                        7

Time allotted for the written exam is 90 minutes.

Aptitude consists of questions from the topics like algebra, time & work, time, speed & distance, arithmetic, percentages, profit & loss, geometry, etc. This section is of moderate level.

Coding section consists of questions from the topics like C language, Java, Data Structure.
Overall the level of the paper is easy to moderate. Only those candidates who clear the written exam will qualify for the next round.

*The Company reserves the right to make changes in the written exam.


   *********************************************************************
  (A CSE student with profile as 8.47 CGPA (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?

*******************************************************************
Jay Jagannath Swami Nayana Patha Gami Bhaba Tume Bhaba Tume ...    


Mr. Tribikram Pradhan
Research Scholar, Dept. of CSE
Indian Institute of Technology, (BHU), Varanasi
E-Mail:  tribikram14@gmail.com

No comments:

Post a Comment