Microsoft

Current Position: SDE-1
Current Experience: 1.8 years
Current Company: Product based automobile

Round 1: Conducted by msft engineer (1h)

DSA 60 Mins :

Implement min heap from scratch

i wasnt able to use bst at that moment so i said i will insert the elem and sort it in desc the last elem will always be the required elem

Prime String Hackerank

was not able to use dp and all as i am not so much expert in them.

i started with backtracking but was not abke to get the output although ran the code

i dont know why i was moved after bad round 1 maybe it was a loop thing at the end they will see cumulative score

Round 2: lld

LLD taken by senior eng manager will not name but was very friendly

Design the backend components and classes ( not fully working code ) for an cart system where users can add , remove products. Consider features such as crud operations in the cart , Rest Api designing , association mapping

i was aksed some basic oops

will update for further rounds if i get , if i dont update means rejected

SUGGESTIONS NEEDED

i have solved qstns but no where i see these questions are present in the stamdard sheet then how can one know about these questions ???

if i solve standard question what is the guarantee that i will be able to solve the tech interview qstns as i can see they are asking unseen that are not there in standard sheeets , what is your take on this ??