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

Bitset/bitmap: what is it and when is it a good choice?

Tags
#bitset#bitmap#memory#bit-operations
Back to categoryPractice quiz

Answer

A bitset (bitmap) stores true/false flags as bits, so it is very memory efficient. Use it for fast membership on a small, dense range of integers (e.g., IDs 0..N) and for quick bit operations (AND/OR).

Related questions

Data Structures
Sparse matrix representation: when would you use CSR/COO instead of a dense array?
#sparse-matrix#csr#coo
Data Structures
What is a Bloom filter and what trade-off does it make?
#bloom-filter#probabilistic#hashing
Java
Generational garbage collection: why does the JVM split memory into young/old?
#java#gc#jvm
Java
How does Java GC work at a high level (and why is it generational)?
#gc#jvm#memory