Interview Question for Software Engineer / Developers






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

You cannot use any normal sorting technique, we need to use some extra storage to do sorting it in O(n)..........So we can use radix storing.

- Kunal Gaind December 06, 2009 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Yes, radix sort will work in O(n).
But for any O(n) = c*f(n), c has to be a constant irrespective of "n".
Radix sort on a set of integers do increase over the function of n multiplied to very small logarithmic factor. Hence not a very strict O(n) solution

- Thiyanesh December 07, 2009 | 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