NVIDIA Interview Question for Software Engineer / Developers






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

tries...
using suffix trees (which are compressed tries) it could be optimised...
addition of words take O(n) space where n is the no of chars in the word... and O(n) time...
im not sure if this is an optimised solution\approach or not...

waiting for more responses and comments

- rhino December 26, 2009 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

The cell phone like embedded devices have resource crunch (i.e. memory),
tries n suffix trees require lot of memory (spcly in case of dictionary)

Need to think it on memory aspect...

- Ashutosh December 28, 2009 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

There is a variation of Trie data structure called "Patricia Trie" This essentially shares nodes across the paths. Thus drastically reduce memory requirement.

- Sudipta July 29, 2010 | 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