Round 1:
Written round
- There was two ipl team having different height of players, find is it possible to arrange team in 2 rows so that 1st row player will have short height than second team, all player of a team will be in same row.
- Client information having clientId, creditScore and other info, Asked me to find a. maximum creditscore client, add some value in creditScore, creditScore corresponding to any client id, insert new client . It was written in declaimer that you cannot use hashmap so I solved with by BST.
Round 2:
- Vertical Traversal of tree
- Find all substring of any string
- Basic cache question
- There is bacteria who can move in all the direction in matrix and there is some box which is blocked(cant move) and a destination is given, Find minimum possible path from source to destination .I solved it with DP
Round 3:
- Design Recommendation system, I explained by keeping the probability and some ML approach he seems satisfied but later I got to know that he wasn’t able to understand that approach, he was expecting naive category approach.
- Project Discussion and some cross question
- Rest Api, how will you optimise.
- Some Other question I don’t remember
Article Tags :
Recommended Articles