Round 1: k frequently words in a given file of huge data.
Find index of distortion in a sorted but a little bit distorted array.
Round 2:
First non repeated character in character stream of huge data.
Design of URL shorter service .
Round 3:
Projects
Round 4: with Technical partner manager .
– island problem in a mxn matrix of integers
– image compression
– Design a service which talks to three other google calanedar like serices and merges those calendars in a single view for a user .
Recommended Posts:
- Amazon Interview Experience | Set 167 (SDE I for 1 year 6 months experience)
- Microsoft IDC interview Experience | Set 47 (For 1.7 Years Experienced)
- Microsoft interview Experience | Set 48 (For 1.5 Years Experienced)
- Microsoft Interview Experience | Set 109 (2 years experienced)
- Microsoft Interview Experience | Set 111 (For 1.5 Years Experienced)
- Microsoft Interview Experience | Set 112 (For 4.5 Years Experienced)
- Microsoft Interview experience | Set 114 (2.5 Years Experienced for SDE2)
- Microsoft Interview experience | Set 115 (4 Years Experienced for IDC)
- Microsoft Interview Experience | Set 154 (For 1.5 Years Experienced)
- Microsoft Interview Experience | (SDE-2 for 3 Years Experienced)
- Microsoft Interview Experience (3 years Experienced)
- Microsoft Interview Experience for Software Engineer-2 | 3+ years experienced
- Microsoft Interview Experience for Hyderabad Office Team(2 years Experienced)
- Microsoft Interview Experience (2-3 years Experienced)
- Microsoft Interview Experience | Senior Software Engineer (4 Years Experienced)
- Microsoft Interview Experience ( 4+ years Experienced)
- Intuit Interview Experience | Set 7 (For 3.5 Years Experienced)
- Goldman Sachs Interview Experience| Set 14 (1+ Years Experienced)
- Mentor Graphics Interview Experience | Set 1 (1+ years experienced)
- Nagarro Interview Experience | Set 7 (For 2 Years Experienced)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
