Upload Button Icon Add office photos
Premium Employer

i

This company page is being actively managed by Myntra Team. If you also belong to the team, you can get access from here

Myntra

Compare button icon Compare button icon Compare

Filter interviews by

Myntra SDE Interview Questions and Answers

Updated 22 Oct 2024

Myntra SDE Interview Experiences

3 interviews found

SDE Interview Questions & Answers

user image Anonymous

posted on 9 Sep 2024

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Coding round has two questions ranging in medium -hard level leetcode questions

Round 2 - Technical 

(3 Questions)

  • Q1. Doubly Linked List
  • Q2. Graph - topological sort
  • Q3. Operating system, database management system
Round 3 - Technical 

(2 Questions)

  • Q1. Longest Common Subsequence
  • Ans. 

    Longest Common Subsequence is the longest sequence of characters that appear in the same order in both strings.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 2D array to store the lengths of longest common subsequences.

    • Iterate through the strings to fill the array and find the longest common subsequence.

  • Answered by AI
  • Q2. Largest area in histogram
  • Ans. 

    The largest area in a histogram refers to the rectangle with the maximum area that can be formed within the histogram bars.

    • Identify the largest rectangle that can be formed by considering each bar as a potential height and calculating the area based on the width of the rectangle.

    • Use a stack data structure to efficiently find the largest area in a histogram by keeping track of the indices of the bars in non-decreasing o...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - make sure to revise sde sheet properly for interviews

Skills evaluated in this interview

SDE Interview Questions & Answers

user image Anonymous

posted on 22 Oct 2024

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

There was only two coding questions in 50 minutes interview

Round 2 - Technical 

(3 Questions)

  • Q1. One coding question
  • Q2. Only one coding question
  • Q3. Medium level coding question

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare DSA medium level questions

SDE Interview Questions Asked at Other Companies

asked in Infosys
Q1. Return Subsets Sum to K Problem Statement Given an integer array ... read more
asked in Nagarro
Q2. Partition to K Equal Sum Subsets Problem Given an array of intege ... read more
asked in Nagarro
Q3. Sort a "K" Sorted Doubly Linked List Given a doubly-linked list w ... read more
asked in Nagarro
Q4. Maximum Meetings Selection You are tasked with scheduling meeting ... read more
asked in Amazon
Q5. There is a 12 km road and a contractor who is in-charge of repair ... read more

SDE Interview Questions & Answers

user image Anonymous

posted on 15 Apr 2024

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
4-6 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed in Oct 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Leetcode medium question

Round 2 - Technical 

(3 Questions)

  • Q1. Technical coding
  • Q2. Java basics questions were asked
  • Q3. Basics of Unix and shell scripting

Interview questions from similar companies

SDE Interview Questions & Answers

Snapdeal user image Anonymous

posted on 23 Feb 2024

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
-
Result
Selected Selected
Round 1 - Coding Test 

2 medium level leet code question.

Round 2 - Technical 

(1 Question)

  • Q1. Face to face interview, 2 medium-level dsa questions, some java and OS basic fundamentals.

SDE Interview Questions & Answers

Shopclues user image Anshul Garg

posted on 10 Mar 2015

Interview Questionnaire 

4 Questions

  • Q1. Tell me about yourself ?
  • Ans. 

    I am a highly motivated individual with a passion for learning and a strong work ethic.

    • I have a degree in computer science and have worked as a software developer for 3 years.

    • I am proficient in multiple programming languages including Java, Python, and C++.

    • I enjoy working in a team environment and am always willing to lend a helping hand.

    • In my free time, I enjoy hiking and playing guitar.

  • Answered by AI
  • Q2. What is your passion ?
  • Ans. 

    My passion is creating meaningful connections with people through storytelling and communication.

    • I love writing and sharing stories that inspire and connect with others

    • I enjoy public speaking and engaging with audiences

    • I am constantly seeking new ways to improve my communication skills

    • I believe that effective communication is key to building strong relationships

    • Examples: writing a blog, giving a TED talk, hosting a pod

  • Answered by AI
  • Q3. What do you want to achieve ?
  • Ans. 

    I want to achieve personal and professional growth while making a positive impact on the world.

    • Develop new skills and knowledge through continuous learning

    • Advance in my career and take on new challenges

    • Contribute to society through volunteering and charitable work

    • Create meaningful relationships with family, friends, and colleagues

    • Maintain a healthy work-life balance

  • Answered by AI
  • Q4. Other personal questions

Interview Preparation Tips

Round: Technical Interview
Experience: The first round was started with few theoretical questions. The questions were either in the form of Puzzles, Data structures & Algorithms,
and a few php questions revolving around errors in PHP, sessions & cookies.
Tips: Your resume should be both clear & concise.

Round: HR Interview
Tips: Be confident & tell what they want to hear.

Skills: Algorithms, Web skills
College Name: IIT ROORKEE
Motivation: Passion for eCommerce.

SDE Interview Questions & Answers

Amazon user image Anonymous

posted on 24 May 2015

Interview Questionnaire 

5 Questions

  • Q1. What happens when we type amazon.com ?
  • Ans. 

    Typing amazon.com in the browser's address bar takes you to Amazon's website.

    • The browser sends a request to the DNS server to resolve the domain name 'amazon.com' to an IP address.

    • The browser establishes a TCP connection with the server at the resolved IP address.

    • The browser sends an HTTP request to the server for the homepage of Amazon's website.

    • The server responds with the HTML code for the homepage, which the browse

  • Answered by AI
  • Q2. Describe transaction process in detail if we want to transfer from one account to other. Also design scheme for it
  • Ans. 

    The transaction process involves transferring funds from one account to another. A scheme is designed to ensure secure and accurate transfers.

    • Verify the availability of sufficient funds in the sender's account

    • Authenticate the sender's identity and authorization for the transaction

    • Deduct the transfer amount from the sender's account balance

    • Initiate a request to transfer the funds to the recipient's account

    • Validate the r...

  • Answered by AI
  • Q3. What happens on server side on receiving HTTP requests and how operating system interacts and then discussion related with threading, thread pool ,synchronization, hashing etc
  • Ans. 

    When a server receives an HTTP request, it interacts with the operating system, handles threading, thread pooling, synchronization, and hashing.

    • Upon receiving an HTTP request, the server creates a new thread to handle the request.

    • The operating system manages the allocation of system resources to the server process.

    • Thread pooling is used to efficiently manage and reuse threads for handling multiple requests.

    • Synchronizat...

  • Answered by AI
  • Q4. Describe ACID properties in detail
  • Ans. 

    ACID properties ensure reliability and consistency in database transactions.

    • ACID stands for Atomicity, Consistency, Isolation, and Durability.

    • Atomicity ensures that a transaction is treated as a single unit of work, either all or none of its operations are executed.

    • Consistency ensures that a transaction brings the database from one valid state to another.

    • Isolation ensures that concurrent transactions do not interfere w...

  • Answered by AI
  • Q5. How to find kth- smallest element in BST? -----/
  • Ans. 

    To find kth-smallest element in BST, perform inorder traversal and return the kth element.

    • Perform inorder traversal of the BST

    • Maintain a counter variable to keep track of the number of nodes visited

    • When the counter reaches k, return the current node's value

    • If k is greater than the number of nodes in the BST, return null or throw an exception

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Online Round: (Duration – 90 minutes)

20 MCQs and 2 coding questions. MCQs were on Algorithms, Time Complexity, Quantitative Aptitude, Probability, Operating Systems, Graphs, Data Structures, Recursion outputs etc.

Coding Questions:

1. In one of Amazon fulfillment centers, there are a no. of empty boxes kept in increasing order in a row. Kiva robots are designed to put a product in a box. The product size is given. Design a program to find the best fit box for given product size. First line contains no. of empty boxes and next line contains size of boxes with space. The next line contains size of given product. The output shows the best fit box size and -1 otherwise.For example, Input: 6

2 7 9 11 13 16

12

Output: 13 2. You have to find a string in two-dimensional array. The input contains 2-D array of characters and given string. You can move in one of eight directions . The output contains location of first letter of string if string found completely, otherwise return -1. Any one out of multiple answers is accepted, if possible.

For example, Input:

b t g

p a d

r k jString: rat

Output: (2,0)

Round: TECHNICAL INTERVIEW
Experience: Brief introduction about myself and my project.

1. Given an array of positive and negative integers, rearrange positive and negative numbers in 0(n) time .

First, I solved it using 2 arrays,each for positive and negative integers and place elements of array in these 2 arrays and them combine them back by taking one element from each array. Then he told me to do without extra space. I then segregated positive and negative elements using quicksort .Below is the link:

-----. Program to check whether strings are rotation of each other or not. I approached as below:

-----/

He then told to solve without using strstr. I used naive searching method.

Round: HR INTERVIEW
Experience: Brief introduction and some behavioral questions.

Given a BST and a key sum, design an algorithm to find all pairs of integers whose sum equal to key.

I first approached using an array and placing elements into it in inorder fashion and then find pairs. He told to do in-place and I solved with 2 traversals (inorder and reverse- inorder

Round: Technical Interview
Experience: Based on CS Fundamentals and also had 15 minutes discussion on my internship project.
Q.Given a Binary tree, full_path_sum is sum of all nodes from root to leaf in a path. Given a min_sum value, delete nodes if path has full_path_sum less than min_sum . Delete all such nodes . For example,Given min_sum =8 1
2 3
4 5 6 7

College Name: NA

Skills evaluated in this interview

SDE Interview Questions & Answers

Amazon user image Anonymous

posted on 25 May 2015

Interview Preparation Tips

Round: Test
Experience: Online Round :(Duration – 90 minutes)20 MCQs to solve and 2 coding questions. 20MCQs were on Algorithms,Data Structures, C Output, Quantitative Aptitude, etc.

Coding questions were of 10 marks each.

MCQ’s had negative marking.

Correct : +1

Wrong : -0.25Q1– Given an array of numbers, arrange them in an alternate fashion such that every number is followed by a number of opposite sign. Also the order was to be maintained. If the count of negative numbers is more keep the extra at last in array and same for positive numbers.Example :

Input: -3 -2 6 0 7 -1 -8

Output: -3 6 -2 0 -1 7 -8Q2– String of characters as arranged in a cellphone i.e.

1- NULL

2-a,b,c

3-d,e,f

4-g,h,i

.

.

.

9-w,x,y,z

0-NULLPrint all combinations for given number of digits(k) in lexicographical order .

Constraint : 1<=k<4

For Example : Input = 234

Output : adg adh adi aeg aeh aei afg afh afi bdg bdh bdi beg beh bei bfg bfh bfi cdg cdh cdi ceg che dei cfg cfh cfi

Round: TECHNICAL INTERVIEW
Experience: Q1– Design a shuffle function which would play songs randomly in your device (unique song_id) and code it.

After i gave him a solution with hash function , he asked me to improve the algorithm such that once a song is played it should be played only when all the other songs are played,

Solution’s Complexity : Space – O(n) , Time – O(1) ; n—> number of songs

After that he asked me to improve my solution and do it without using extra space.

Solution’s Complexity : Space – O(1) , Time – O(n) ; n—>number of songs

Hint : Maintain indices and once a song is played shift it in range of played songs index.

After that i was asked about each part of the hash function and how i came up with that.Q2– Add two linked lists. And code it.Input : 1->2->3->4->NULL

8->2->NULL

Output : 1->3->1->6->NULLFirst he asked to do it without recursion and then with recursion.We also talked about theproblem we face if we store the value of the linked list in an integer or long if the number of digits were above certain limits in the non-recursive function.

Round: TECHNICAL INTERVIEW
Experience: Q1 – Find the largest sub tree which is binary search tree in a given Binary Tree. Then to optimize it and then asked me to code it.
Q2 – Given a linked list with a next pointer and an arbitrary pointer pointing to any node in the list , copy the linked list.After i gave him a solution which changed the links of the initial linked list, he asked me to do without changing the links.So i gave him a O(n^2) solution . He asked me to give another way or optimize my solution.He helped me to figure out the solution.Hint – Hash map.The interviewers were really helping and supporting and were more interested in seeing the efforts you make and the way you get to the logic.They help throughout by giving hints.

College Name: NA

SDE Interview Questions & Answers

Amazon user image Anonymous

posted on 2 Jun 2015

Interview Questionnaire 

2 Questions

  • Q1. Find top 10 selling product given the count of sales of each product
  • Ans. 

    To find the top 10 selling products, sort the products by their sales count in descending order and select the first 10.

    • Sort the products by their sales count in descending order

    • Select the first 10 products from the sorted list

  • Answered by AI
  • Q2. Design a valet parking lot with basic use-case of assigning ticket to customer and retrieving the car later. Three sizes available. Use best fit and nearest distance
  • Ans. 

    Design a valet parking lot with ticket assignment and car retrieval using best fit and nearest distance.

    • Create a parking lot with designated spots for each size of car

    • Assign a ticket to the customer upon entry and record the spot number

    • Retrieve the car by searching for the nearest available spot of the appropriate size

    • Use best fit algorithm to minimize empty spots

    • Implement a system for payment upon exit

  • Answered by AI

Interview Preparation Tips

College Name: NA

Skills evaluated in this interview

SDE Interview Questions & Answers

Amazon user image Anonymous

posted on 4 Jun 2015

Interview Questionnaire 

7 Questions

  • Q1. In a binary tree, a random pointer is given in each node. If this pointer pointing other than any successor of the node then set it as NULL. Otherwise let it remain untouched. Write code
  • Q2. You will be given the number of pairs of parenthesis. Find out the total possible valid unique combinations and there should not be any duplicity. Write code
  • Ans. 

    Find total possible valid unique combinations of given number of pairs of parenthesis without duplicity.

    • Use recursion to generate all possible combinations

    • Check for validity of each combination using a stack

    • Use a set to avoid duplicity

  • Answered by AI
  • Q3. Given an in-order traversal of a special binary tree having property that the node is always greater than its left and right child. Construct the tree and write code
  • Ans. 

    Construct a binary tree from in-order traversal with nodes greater than left and right child.

    • The root node will be the maximum value in the in-order traversal

    • Recursively construct the left and right subtrees using the left and right portions of the in-order traversal

    • Repeat until all nodes are added to the tree

  • Answered by AI
  • Q4. Find top 10 trending words inserted by users in sites like twitter. Only algorithm
  • Ans. 

    An algorithm to find top 10 trending words inserted by users in sites like Twitter.

    • Collect a large dataset of tweets

    • Tokenize the tweets into individual words

    • Remove stop words and punctuation

    • Count the frequency of each word

    • Sort the words by frequency in descending order

    • Select the top 10 words

  • Answered by AI
  • Q5. Write an efficient code to find the first occurrence of 1 in a sorted binary array
  • Ans. 

    Find the first occurrence of 1 in a sorted binary array.

    • Use binary search to find the first occurrence of 1.

    • If the mid element is 1, check if it's the first occurrence or if the element before it is 0.

    • If the mid element is 0, search in the right half of the array.

    • If the mid element is 1 and the element before it is also 1, search in the left half of the array.

  • Answered by AI
  • Q6. Remove duplicated from a string in O(n) without using hash
  • Ans. 

    Remove duplicates from a string in O(n) without using hash

    • Use an array of boolean values to keep track of characters already seen

    • Iterate through the string and mark characters as seen in the array

    • If a character has already been seen, remove it from the string

  • Answered by AI
  • Q7. Ind the first occurrence of 1 in a sorted infinite binary tree
  • Ans. 

    Find the first occurrence of 1 in a sorted infinite binary tree.

    • Use binary search to traverse the tree.

    • If the current node is 1, check if its left child is also 1. If yes, move to the left subtree, else return the current node.

    • If the current node is 0, move to the right subtree.

    • Repeat until the first occurrence of 1 is found or the tree is exhausted.

  • Answered by AI

Interview Preparation Tips

Round: Telephonic
Experience: Q1. For a given number, find the next greatest number which is just greater than previous one and made up of same digits.

Q2. Find immediate ancestor of a given Node

Q3. Clone the linked list having an extra random pointer in nodes which is pointing random node in the list.

Round: HR Interview
Experience: Amazon has many visitors to its site. And it tracks what pages the customers visited, etc and other stuff.Make an efficient data structure for storing 3 days of information of all those customers who have visited site exactly two different days and searched more than 3 unique pages of the site in those 2 days.So whoever visited site exactly two days out of these three days and visited more then 3 unique pages should be in the contact list.

College Name: NA

Skills evaluated in this interview

SDE Interview Questions & Answers

Amazon user image Anonymous

posted on 25 May 2015

Interview Questionnaire 

7 Questions

  • Q1. Find the second largest element in an array. (-----/)
  • Ans. 

    Find the second largest element in an array.

    • Sort the array and return the second last element

    • Iterate through the array and keep track of the two largest elements

    • Use a priority queue to find the second largest element

  • Answered by AI
  • Q2. Given a sorted array which can have repeated elements, find the occurrence of an element. (Most optimal solution is O(logn) – Using binary search to find start and end occurrence)
  • Ans. 

    Given a sorted array with repeated elements, find the occurrence of a given element using binary search.

    • Use binary search to find the first occurrence of the element

    • Use binary search to find the last occurrence of the element

    • Calculate the occurrence by subtracting the indices of the last and first occurrences and adding 1

  • Answered by AI
  • Q3. Make a data structure and implement an algorithm to print all the files in a directory. (the root directory can have sub-directories too.) I used an n-ary tree and BFS to print files. It can also be done u...
  • Ans. 

    Implement a data structure and algorithm to print all files in a directory, including sub-directories.

    • Use an n-ary tree or stack to represent the directory structure

    • Implement a BFS or DFS algorithm to traverse the directory and print files

    • Handle sub-directories recursively

    • Consider using a queue or stack to keep track of directories to visit

  • Answered by AI
  • Q4. He asked some question about my CV
  • Q5. Print a matrix diagonally. (-----/)
  • Ans. 

    Print a matrix diagonally.

    • Start from the top left corner and print the diagonal elements

    • Move down and right to print the next diagonal

    • Repeat until all diagonals are printed

  • Answered by AI
  • Q6. DFS of binary tree, n-ary tree
  • Ans. 

    DFS is a traversal algorithm used to visit all nodes of a tree or graph. It can be applied to binary as well as n-ary trees.

    • DFS stands for Depth First Search.

    • In DFS, we start from the root node and visit its children recursively until we reach a leaf node.

    • There are two types of DFS: Preorder (root, left, right) and Postorder (left, right, root).

    • DFS can be implemented using recursion or a stack data structure.

    • Example: I...

  • Answered by AI
  • Q7. Then he asked some question from other subjects. OS – Scheduling DBMS – Normalization, Transaction OOPS – Abstraction

Interview Preparation Tips

Round: Test
Experience: They had an online aptitude test on day 1. It was 90 minutes: 20 MCQs + 2 coding questions (choice between C/C++/Java for coding). MCQs were based on DSA, OS, and Math. They were apparently difficult.

Round: Test
Experience: 1. Keypad problem ( -----/ )– Little difficult problem on backtracking.2. Given an array, find the count of impossible triangle ( -----/ )

Round: Test
Experience: Questions involved DSA and strongly based on optimising the code:



1. Given a linked list, reverse K nodes in it eg :- 1->2->3->4->5->NULL , k = 3 3->2->1->5->4 2. Search for an element in an array which has elements who’s values are first increasing and then decreasing. (Use modified binary search)
Duration: 60 minutes
Total Questions: 2

College Name: NA

Skills evaluated in this interview

Myntra Interview FAQs

How many rounds are there in Myntra SDE interview?
Myntra interview process usually has 2-3 rounds. The most common rounds in the Myntra interview process are Technical and Coding Test.
What are the top questions asked in Myntra SDE interview?

Some of the top questions asked at the Myntra SDE interview -

  1. Longest Common Subseque...read more
  2. largest area in histog...read more
  3. operating system, database management sys...read more

Tell us how to improve this page.

Myntra SDE Interview Process

based on 3 interviews

2 Interview rounds

  • Coding Test Round
  • Technical Round
View more

SDE Interview Questions from Similar Companies

Amazon SDE Interview Questions
4.1
 • 44 Interviews
Flipkart SDE Interview Questions
4.0
 • 5 Interviews
Meesho SDE Interview Questions
3.7
 • 3 Interviews
Snapdeal SDE Interview Questions
3.8
 • 1 Interview
Swiggy SDE Interview Questions
3.8
 • 1 Interview
Blinkit SDE Interview Questions
3.7
 • 1 Interview
LinkedIn SDE Interview Questions
4.3
 • 1 Interview
View all
Myntra SDE Salary
based on 4 salaries
₹18 L/yr - ₹35 L/yr
20% more than the average SDE Salary in India
View more details
Data Analyst
209 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Manager
207 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Assistant
193 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Officer
184 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Manager
178 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Myntra with

Flipkart

4.0
Compare

Amazon

4.1
Compare

Meesho

3.7
Compare

LimeRoad

2.6
Compare
Did you find this page helpful?
Yes No
write
Share an Interview