← Salesforce questions
CodingReported in a candidate post, Sep 2022

Number of subsequences in a string divisible by n

Filed under Salesforce

Reported as similar to counting subsequences of a string that are divisible by n. Standard version: given a string s of digits and an integer n, count the non-empty subsequences (chosen by index)…

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 Salesforce questions

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