Re: [algogeeks] MSFT Q

2011-06-16 Thread Srikrishan Malik(gmail)
BK tree would be a good DS for this. -Sri On Wed, Jun 15, 2011 at 6:00 PM, keyan karthi keyankarthi1...@gmail.com wrote: we can even add word completion :) On Wed, Jun 15, 2011 at 5:25 PM, immanuel kingston kingston.imman...@gmail.com wrote: Use a trie data structure and pre-load it with

[algogeeks] MSFT Q

2011-06-15 Thread Piyush Sinha
*How will you design a SpellChecker for an e-mail application?* -- *Piyush Sinha* *IIIT, Allahabad* *+91-8792136657* *+91-7483122727* *https://www.facebook.com/profile.php?id=10655377926 * -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group.

Re: [algogeeks] MSFT Q

2011-06-15 Thread immanuel kingston
Use a trie data structure and pre-load it with all the words of a dictionary. Thanks, Immanuel On Wed, Jun 15, 2011 at 3:06 PM, Piyush Sinha ecstasy.piy...@gmail.comwrote: *How will you design a SpellChecker for an e-mail application?* -- *Piyush Sinha* *IIIT, Allahabad*

Re: [algogeeks] MSFT Q

2011-06-15 Thread keyan karthi
we can even add word completion :) On Wed, Jun 15, 2011 at 5:25 PM, immanuel kingston kingston.imman...@gmail.com wrote: Use a trie data structure and pre-load it with all the words of a dictionary. Thanks, Immanuel On Wed, Jun 15, 2011 at 3:06 PM, Piyush Sinha