Ariba Interview Question
Web:
www.ariba.com
|
HQ:
Sunnyvale, CA
Overview |
| |
Salaries |
| |
Reviews |
| |
Interviews |
| |
Photos |
| |
Jobs |
| |
|
25 Interview Reviews |
Back to all Ariba Interview Questions & Reviews
Interview questions and reviews posted anonymously by interview candidates
Interview Question for Senior Software Engineer at Ariba:
May 29, 2009
Helpful Question?
Yes |
No
Inappropriate?
Answers & Comments (3)
0 of 2 people found this helpful
Feb 10, 2010
the above is O(n^2), you can do much better.
Single iterator plus a hash table (insert each value into hash table after searching for it in there). You get O(n).
Single iterator plus a hash table (insert each value into hash table after searching for it in there). You get O(n).
Helpful Answer?
Yes |
No
Inappropriate?
Jan 23, 2011
By "list", is this a linked list? I don't see what other type of list makes sense.
Actually, I'm pretty sure it's not O(n^2). If there is a loop, the worst case is that it loops back to the last element (this means the faster pointer will take the longest to reach the slow pointer). By the time the slow pointer reaches the point in the list where it loops back, the fast pointer will have caught up to it. So it's O(n).
Actually, I'm pretty sure it's not O(n^2). If there is a loop, the worst case is that it loops back to the last element (this means the faster pointer will take the longest to reach the slow pointer). By the time the slow pointer reaches the point in the list where it loops back, the fast pointer will have caught up to it. So it's O(n).
Helpful Answer?
Yes |
No
Inappropriate?
Members can
answer or comment on this question
–
Join Now (It's Free) or
Sign In
You might also be interested in: Interview Questions, Senior Software Engineer Interview Questions, Ariba Interview
0 of 0 people found this helpful
by Interview Candidate: