Pergunta de entrevista da empresa Morgan Stanley

What Algorithm/ Data Structure would be best for a huge database that could be searched for any group of letters

Resposta da entrevista

Sigiloso

22 de out. de 2016

Properties: which is a key value pair(like hashmap) the keys would be the words while the values would be the document name and frequency of occurrence of the word in that document, so basically your building a search engine, when you query a document, you just search for the occurrence of the most words with highest frequencies in given documents output: list of documents from highest to lowest relevance( occurrence of the words in the query, remove the stop words from the query)