Space-Efficient Sieve of Eratosthenes Using Bitset
Filed under Nutanix
The question
Implement the Sieve of Eratosthenes for numbers up to 10^6, optimizing memory footprint down to 1 bit per boolean state using integer arrays and bitwise operations.
No write-up yet. Related questions below have one.
Related Nutanix questions
Collected from public candidate posts and coding forums. Updated Nov 2026.