Big O Notation Interview Questions

Question

What Big-O notation questions have you been asked? Did you find them to be good questions? Did the interviewer actually understand the concept?

Answer 1

What are the expected runtimes of some common data structures? IE. HashTable, BinarySearchTree, Array, etc.

Keep in mind, the answers can and should vary depending on multiple conditions like the type of data you're storing, worst-case, average-case, the list goes on...but they should generally know which tool to use for the job.

Answer 2

Usually on some form of collection class,e.g. priority queue, stack, binary tree, the usual insertion, find, and deletion operations are what I remember getting asked.

I didn't find them to be good questions but then I'm not sure what the point was to some extent. The interviewed understood the concept, yes.