Interview Question

Summer Software Engineering Internship Interview(Student Candidate) Culver City, CA

Give some examples of Big-O notation time complexity. What

  is the time complexity to insert an element into a singly-linked list? What is the time complexity to access an element in a collision-free hashmap?

Interview Answer

1 Answer


Examples: n squared, n, nlog(n)

Time complexity to insert into a linked-list: O(n)
Time complexity for a collision-free hasmap: O(1) - "constant time"

Interview Candidate on Feb 9, 2012

Add Answers or Comments

To comment on this, Sign In or Sign Up.