CodingHardcod-g482

Subject Digit dpLevel Senior–Staff~30 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Count how many integers in the inclusive range [L, R] have a digit sum divisible by k. L and R can be large (up to about 10^15), so iterate over digits, not values. Assume 0 <= L <= R and k >= 1. Note 0 counts if it falls in range and 0 is divisible by k.

Implement

count_digitsum_divisible(L: int, R: int, k: int) → int

Examples

in[1,20,3]out6

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.