Symantec Interview Question
Web:
www.symantec.com
|
HQ:
Mountain View, CA
Overview |
| |
Salaries |
| |
Reviews |
| |
Interviews |
| |
Photos |
| |
Jobs |
| |
|
87 Interview Reviews |
Back to all Symantec Interview Questions & Reviews
Interview questions and reviews posted anonymously by interview candidates
Interview Question for Summer Software Engineering Internship at Symantec:
Feb 9, 2012
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?
Add Tags
[?]
See more for this Symantec Summer Software Engineering Internship Interview
Helpful Question?
Yes |
No
Inappropriate?
You might also be interested in: Interview Questions, Summer Software Engineering Internship Interview Questions, Symantec Interview
0 of 0 people found this helpful
by Interview Candidate:
Time complexity to insert into a linked-list: O(n)
Time complexity for a collision-free hasmap: O(1) - "constant time"