Interview Question


Country: -




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

This problem is similar to "Contacts" application in phones.

We can use "Trie" - but this will be of space complexity BigO(n)
To reduce the space complexity we can use TST.

- avinashbabu.donthu July 25, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

Yeah...........you r right

but how?? do you provide codes??

- Anonymous July 25, 2012 | Flag
Comment hidden because of low score. Click to expand.
-1
of 1 vote

can we use database query instead of data structure?
what is the complexity of searching a value in a database table of M rows?

- cobra July 24, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

Data structure preferred .......but you may also implement in database using different queries ..

complexity as lesser as possible( within big O)?
take rows as many you required .......no constraint.

- Anonymous July 25, 2012 | Flag


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