Microsoft Interview Question for Program Managers






Comment hidden because of low score. Click to expand.
0
of 0 vote

A very light-weight Spell-checker which runs as a background process all the time.
At any time you can sign in, and see the mis-spellings that you have done in all the softwares - text editor, browser, etc.

- Sphinx April 17, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Pre-requisites
1. Create as a service which runs on background, and checks the key-typed ins
2. A program to look at full words, segregated by punctuation marks or commas
3. A API call to the existing dictionary - installed in the computer system by default to take out mapping
4. An API to mark the wrong words if there is a match and user input is incorrect
5. An API to provide suggest multiple words on search-as-you-type based on X number of letters
6. An API to add/delete to the existing dictionary.
7. An API to ignore the spell check where the service would still run, but would not validate the text.
8. An API to connect to various devices, i.e. Desktop, Web, Mobile etc
9. An API to connect to any other user defined resource along side standard default dictionary
10. A feature to correct the spelling if the user intends to change.
11. Auto correct feature as you type with most familiar/popular word which is nearest match.

- Asheesh July 16, 2015 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

abcd

- Anonymous November 16, 2015 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

SpellChecker can be designed using Ternary SearchTree. It works in 0(h) complexity. where h is height of tree. Ternary Search Tree works like trie data structure but with property of BST. In each node of Ternary Search Tree , there are 3 pointers unlike trie where there are 26 pointers for all character . This way it reduces space. One pointer is for words less than left pointer, middle pointer for values which are equal and Third pointer for values greater than right pointer value.
Also leaf node 0 and 1 is for isEndof Word true and isEndofWord false.

- vartika.1403 June 13, 2018 | Flag Reply


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More