Ning Inc Interview Question
Web:
www.ning.com
|
HQ:
Palo Alto, CA
Overview |
| |
Salaries |
| |
Reviews |
| |
Interviews |
| |
Photos |
| |
Jobs |
| |
|
13 Interview Reviews |
Back to all Ning Inc Interview Questions & Reviews
Interview questions and reviews posted anonymously by interview candidates
Interview Question for Manager at Ning Inc:
Jul 1, 2009
If all the keyes mapped to a single value in the hash table, what is the order of complexity to seach for the value
Add Tags
[?]
Helpful Question?
Yes |
No
Inappropriate?
Answers & Comments (2)
Sep 4, 2009
O(n) if this was unknown to the table and caller, since it would scan through all entries performing equality checks. This is probably what they expected.
O(1) if either the client or table knows.
- If the client knows then it could get the first value from the value iterator.
- If the table knows, as in a utility #asMap(Set<K> keys, V value), then it can check the value reference. This is a custom utility, but falls in the same train of thought as Collections#singletonMap(key, value) style.
O(1) if either the client or table knows.
- If the client knows then it could get the first value from the value iterator.
- If the table knows, as in a utility #asMap(Set<K> keys, V value), then it can check the value reference. This is a custom utility, but falls in the same train of thought as Collections#singletonMap(key, value) style.
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, Manager Interview Questions, Ning Inc Interview
0 of 0 people found this helpful
by Interview Candidate: