Substrings with k set bits
Filed under Thoughtworks
The question
Given a binary string, find the number of substrings of length m that have at least k set bits.
No write-up yet. Related questions below have one.
Related Thoughtworks questions
Collected from public candidate posts and coding forums. Updated Nov 2026.