Microsoft | SSE | Noida | Offer
Anonymous User
3436

Current Exp : 9+ yrs
Company : Adobe Noida

Round 1

Find first missing positive number
Don't remember
Round 2

Boundary Traversal of Binary Tree
Return valid list of words if a string is valid string given a list of possible valid words. Return 1st valid possible set
Round 3

Find count of all possible palindrome in a given string
Implement fill paint algorithm for MS paint
Round 4

Detail discussion on project and architecture
Design google autosuggest
Round 5

Design LLD for chess
HLD for Google doc online editing
Compensation :https://leetcode.com/discuss/compensation/1594408/MicrosoftorSSEorNoida

Comments (2)