← Google questions
CodingReported in a candidate post, Dec 2019

Data Structures Without O(log n) Lookup

Filed under Google

Identify and explain the lookup time complexities for Linked Lists, HashMaps, Heaps, and Binary Trees, specifically highlighting which ones do not have an O(log n) lookup time.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Google questions

Collected from public candidate posts and coding forums. Updated Nov 2026.