Given a fixed 2D grid of size N x M and a collection of numbers, design an efficient storage and retrieval layout to lookup any element with optimal time complexity (e.g., O(log N + log M)).
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.