Interview Question for Software Engineer / Developers


Country: India
Interview Type: Written Test




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

I'm guessing that by -(107) <= x <= (107), you meant -(10^7) <= x <= (10^7), because otherwise the examples don't make sense. One very easy way to solve would be to just sort the array, and then look only at pairs of adjacent numbers. This has O(n log n) time complexity if implemented using an O(n log n) sort.

- eugene.yarovoi December 01, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

this is the obvious easy solution

Range on x will fit in a 32 bit signed integer, so that is a big clue

- Anonymous December 01, 2013 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 votes

@eugene.yarovoi 's method is correct.
We can utilize given condition 10 <= n <= 200000 by using "counting sort". It will reduce time to O(n).

- Ajeet December 01, 2013 | 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