Challenging Impact, Stressful Changes
Challenging Impact, Stressful Changes
Great employee benefits, challenging work, and a good location to work.
Growing company, lots of users, high impact work. I love my coworkers. It's a product that is changing the world.
Difficult to get in. Should consider people with good experience who have worked earlier. Not an easy job. Changes impact millions of users, which can sometimes be very stressful.
Nice job. Please continue. I would recommend this company to a friend. I'm optimistic about the outlook.
Was this helpful?
Microsoft Interview Questions
Microsoft Interview Experiences
Software Development Engineer In Test (SDET)
Handed in resume at a career fair and online. Had an on-campus interview. Flew out to Seattle for a day of interviews.
Software Development Engineer In Test (SDET)
Had 5 interviews. 1st was a Technical Interview, with one design question and one programming question. I was also asked what was the most creative thing I've ever done. 2nd also had one design question and one programming question. 3rd was entire
Software Development Engineer In Test (SDET)
I was interviewed on campus for the first round. I was asked two technical questions. One was about binary trees which have no child pointers; instead, children point to the parent. The other was, given two strings, to find whether they are anagrams
Software Development Engineer In Test (SDET)
Seattle, Washington, United StatesMarch 1, 2012Handed in resume at a career fair and online. Had an on-campus interview. Flew out to Seattle for a day of interviews.
Software Development Engineer In Test (SDET)
Redmond, Washington, United StatesJune 8, 2013Had 5 interviews. 1st was a Technical Interview, with one design question and one programming question. I was also asked what was the most creative thing I've ever done. 2nd also had one design question and one programming question. 3rd was entire
Software Development Engineer In Test (SDET)
Seattle, Washington, United StatesJanuary 1, 2010I was interviewed on campus for the first round. I was asked two technical questions. One was about binary trees which have no child pointers; instead, children point to the parent. The other was, given two strings, to find whether they are anagrams
