Myntra Internship Interview Experience | On-Campus 2020
Online Coding Round: This round consisted of 5 coding problems to be solved within an hour on HackerRank Platform. Students who were able to solve all 5 were shortlisted for the interviews.
Interview Round 1(Technical – Duration: 60 minutes): The interviewer first introduced herself and then I was asked to introduce myself. I introduced myself and told her about my previous internships. I was asked 4 coding questions followed by this. The HackerRank Code Pair platform was used for the interviews.
Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!
Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!
Coding Questions asked were:
- Find Middle of Linked List: https://www.geeksforgeeks.org/write-a-c-function-to-print-the-middle-of-the-linked-list/. This is a pretty standard problem. I explained the brute force approach first and then explained the two-pointer approach. I was asked to code the two-pointer approach.
- Implement Heap using Array: https://www.geeksforgeeks.org/building-heap-from-array/. This was a follow-up question to how can you implement a priority queue. I was asked to code the implementation of a min-heap.
- Matrix Chain Multiplication: https://www.geeksforgeeks.org/matrix-chain-multiplication-dp-8/. I explained the basic approach first and then the Dynamic Programming approach. I was asked to code the DP approach.
- Check whether two line segments intersect: https://www.geeksforgeeks.org/check-if-two-given-line-segments-intersect/. I explained the mathematical approach first which will solve the problem but I was asked to think of a simpler solution not involving complex calculations. With a hint from the interviewer, I was able to solve the problem. Remember to think out loud when you don’t know the approach to a problem. The interviewer will usually help you think in the right direction.
Interview Round 2(Technical – Duration: 60 minutes): This round followed the same pattern as the previous round. Introductions followed by 3 coding questions.
Coding Questions asked were:
- Minimum number of Platforms required: https://www.geeksforgeeks.org/minimum-number-platforms-required-railwaybus-station/. I explained the brute force approach first and then the optimized approach involving sorting.
- Populate next right pointers in a binary tree: https://www.geeksforgeeks.org/connect-nodes-at-same-level-with-o1-extra-space/. I explained the level order traversal approach first and then was optimized it to constant space complexity. I was asked to code the constant space solution
- LRU Cache: https://www.geeksforgeeks.org/lru-cache-implementation/. I was first asked what is a cache and then the LRU cache problem is. I explained my approach using an unordered map and an array to store the relative ordering.