← Google questions
CodingReported in a candidate post, Jul 2025

Count distinct decimal subsequences from a binary string

Filed under Google

Given a binary string, count the number of distinct decimal subsequences that can be generated from it, modulo 10^9+7, with an expected time complexity of O(N).

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Google questions

Collected from public candidate posts and coding forums. Updated Nov 2026.