Myntra Interview Questions
- 0of 0 votes
Answersrepeat string n^n times without using extra space
- acharyashailendra1 August 30, 2019 in India| Report Duplicate | Flag | PURGE
Myntra - 1of 1 vote
AnswersThe stock exchanges work with price matching. A seller comes with a price, and a buyer, given asking for the exact same price are matched, and in quantity.
- NoOne August 22, 2017 in India
Design a system that works.
Considerations:
1. More than a million buy/sale happens in a second.
2. One needs to show a ticker prices - last sold price of a stock.| Report Duplicate | Flag | PURGE
Myntra Software Architect Algorithm - 0of 0 votes
AnswersDesign a Shopping Cart. Come up with anything, how to ensure we scale, and how to ensure discount can be done.
- NoOne August 22, 2017 in India| Report Duplicate | Flag | PURGE
Myntra Software Architect Algorithm - 1of 1 vote
AnswersA mechanical engineer is writing a design specification for two gears to transmit motion between two parts, A and B, in a machine she is designing.
- nik.cse2005 March 13, 2015 in United States
the distance between A and B is equal to D.
There are n types of gears, Agear type of i has a radius Rj and cost Cj.
The two gears specified, i and j , must have Ri+Rj >= D, inorder for there to be a way of placing them so that they touch and work togeather. The objective is
to find the pair which costs the least.
You need to produce a design table that gives the most suitable match for every gear type in the list. For every gear type 'i', you need to consider its description (Ri,Ci)
and list the gear type 'j' to pair with 'i' in table position T[i]. The best map might be the same type(Ti=i). if there are multiple solutions with the same cost,
choose the gear with the largest radius.If both the cost and radius you need are found in more than one gear type, choose the type with the smallest index j.
If no radius can be found that allow the distance D to be covered, table should contain 0.
Input
n D
R1 R2 ... Rn
C1 C2 ... Cn
Output
T1 T2 ... Tn| Report Duplicate | Flag | PURGE
Myntra SDE-2 Arrays - 0of 0 votes
AnswersGiven a bunch of floors....and egg will break only if it is thrown from a floor and any floor above that....what least number of eggs u would need if total floors are say 32..
- cvb February 20, 2014 in India
I went with binary search..where I strt from middle...throw the egg, if it doesnt break...
go to middle of upper half and if it does break..i know I should go to middle of lower half.| Report Duplicate | Flag | PURGE
Myntra Senior Software Development Engineer Dynamic Programming - -4of 6 votes
Answera Bunch of devices....u can share files etc.,..each device might support only some limited
- cvb February 20, 2014 in India
format of files. A common server hosting all the files repository.| Report Duplicate | Flag | PURGE
Myntra Senior Software Development Engineer System Design - 0of 0 votes
AnswersIf every leaf node in binary tree forms a double linked list...that is
- cvb February 20, 2014 in India
all the leaf nodes for a DLL.
ex:
1
/ \
2 3
/ \ / \
4 ......5....6.......7
.........................
print all the leaf nodes....
This involves first identifying leaf node. We can do that by checking at every node, if the its child points right back at the parent..then parent is leaf node.
After this it is simple traverssal of DLL and printing nodes.
Level order traversal.
Mirror image of tree
Ancestor in binary tree.| Report Duplicate | Flag | PURGE
Myntra Senior Software Development Engineer Algorithm - 0of 0 votes
AnswersFirst round
- cvb February 20, 2014 in India
Given set of coins of different denominations....
like 1$ (100)....5$(50)...etc., and given an amount..I was asked to come up with optimal solution
using least number of coins to get that amount.
I told greedy approach of starting wiht maximum denomination coin..use up as much as possible...then moving on to next..I was asked to tell dynamic programming approach...
..I told I will split the amount in half..and keep doing it until i reach 1 1 ..combination..start calculating optimal combination..and keep going up like ...
Next question was to try and implement google autosuggest...I told i will use tries...pseduo code and some optimizations on top of it.| Report Duplicate | Flag | PURGE
Myntra Senior Software Development Engineer Algorithm - 0of 0 votes
Answers
- veeru October 10, 2012 in IndiaFind the subsequences whose elements should not be adjacent and their sum should be maximum from the given array (contains only positive integers). Eg: int[] A = {10, 1, 3, 25} Sol: Sum: {10, 3} = 13 {1,25} = 26 {10,25} = 35 Here the Maximum subsequence is {10, 25}.
| Report Duplicate | Flag | PURGE
Myntra Software Engineer / Developer Arrays - 0of 0 votes
AnswersPreOrder traversal without recusion
- anshulzunke September 15, 2011 in -| Report Duplicate | Flag | PURGE
Myntra Software Engineer / Developer Algorithm