Built on
bitset
Articles
DS
Data structure
Bloom filter
Says “surely not” or “maybe yes” about set membership, at about 10 bits per item.
O(k)
2 problems
GRA
Algorithm
Floyd–Warshall algorithm
Shortest paths between all pairs of vertices in O(n³): dynamic programming over allowed transfers.
O(n³)
2 problems
TEC
Technique
Bit tricks
A number as a set of flags: masks, the lowest set bit, counting ones and going through subsets without recursion.
O(1) per operation on a word
1 problem
Problems
Often together
interviews 3 networks 2 contests 2 membership 1 probabilistic 1 hashing 1 sketch 1 databases 1 security 1 in production 1 shortest path 1 dynamic programming 1