Oracle Interview Question
Web:
www.oracle.com
|
HQ:
Redwood City, CA
Overview |
| |
Salaries |
| |
Reviews |
| |
Interviews |
| |
Photos |
| |
Jobs |
| |
|
308 Interview Reviews |
Back to all Oracle Interview Questions & Reviews
Interview questions and reviews posted anonymously by interview candidates
Interview Question for Software Development Engineer at Oracle:
Jan 18, 2012
Given array of n integers and given a number X, find all the unique pairs of elemens (a,b), whoose some is equal to X.
| Tags: | data structures See more , See less 8 |
Add Tags
[?]
See more for this Oracle Software Development Engineer Interview
Helpful Question?
Yes |
No
Inappropriate?
Answers & Comments (2)
1 of 2 people found this helpful
Mar 19, 2012
Using hashmap is great to get O(N) time complexity with O(n) space cost, however, if no additional memory is recommended, sort the list (O(nLogn)) and using a simple algorithm (O(n)) to find all pairs demoed in this video:
http://youtu.be/3VBjhiKUtmE
http://youtu.be/3VBjhiKUtmE
Helpful Answer?
Yes |
No
Inappropriate?
To comment on this
question,
Sign In with Facebook or
Sign Up
You might also be interested in: Interview Questions, Software Development Engineer Interview Questions, Oracle Interview
1 of 1 people found this helpful
by Interview Candidate:
And K be the give sum
for i=0 to arr.length - 1 do
hash(arr[i]) = i // key is the element and value is its index.
end-for
for i=0 to arr.length - 1 do
if hash(K - arr[i]) != i // if K - ele exists and is different we found a pair
print "pair i , hash(K - arr[i]) has sum K"
end-if
end-for