R

Ram Sharma • 3.40K Points
Extraordinary

Q. Which collection guarantees O(1) time for insertion and lookup?

  • (A) TreeSet
  • (B) LinkedList
  • (C) HashSet
  • (D) ArrayList
  • Correct Answer - Option(C)
  • Views: 2
  • Filed under category Java
  • Hashtags:
Explanation by: Ram Sharma
`HashSet` offers O(1) average time for insertion and lookup using hashing.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.