Blog

Your dream job? Lets Git IT.
Interactive technical interview preparation platform designed for modern developers.

XGitHub

Platform

  • Categories

Resources

  • Blog
  • About the app
  • FAQ
  • Feedback

Legal

  • Privacy Policy
  • Terms of Service

© 2025 LetsGit.IT. All rights reserved.

LetsGit.IT/Categories/Data Structures
Data Structureseasy

What is a Map (dictionary) and when would you use it instead of an array?

Tags
#map#dictionary#hashmap#lookup
Back to categoryPractice quiz

Answer

A Map stores values by key (key → value). Use it when you need fast lookup by an identifier (e.g., email → user) instead of by numeric index; a hash map is usually O(1) average for get/put.

Related questions

Data Structures
Ordered map (TreeMap) vs HashMap: when would you choose an ordered map?
#map#treemap#hashmap
Data Structures
What is an LRU cache and how can you implement it in O(1)?
#lru#cache#hashmap
Data Structures
How does a HashMap work internally?
#hashmap#hashing
#collision
MongoDB
`$lookup`: what does it do and what is a common pitfall?
#mongo#lookup#aggregation
Java
HashMap vs ConcurrentHashMap: when should you use each?
#java#collections#concurrency