How should I practice Count Good Numbers?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Count Good Numbers associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Count Good Numbers (Google Onsite Interview) - Coding Interview Problem

Count Good Numbers

Google● MediumFULLTIMEONSITE INTERVIEW

Problem statement

A positive integer is good when it satisfies all of the following conditions:

The problem statement continues

Pro

Examples

Example 1

m = 21return = 18

The good numbers are 1 through 9, 12 through 19, and 21. The numbers 10 and 20 contain 0, while 11 repeats a digit. Two-digit numbers have no interior digit.

FastPrep Pro

Reported in 1 Google interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
Worked examples, explained
Guided hints and editorial
Run your code on real test cases

$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week

See Google hiring insights

CodePython 3

import heapq
from collections import defaultdict
 
class Solution:
    def solve(self, values, queries):
        # Build the adjacency structure
        n = len(values)
        graph = defaultdict(list)
        for u, v in queries:
            graph[u].append(v)
 
        best = [float("inf")] * n
        heap = [(0, 0)]
        while heap:
            cost, node = heapq.heappop(heap)
            if cost > best[node]:
                continue

Run and Submit unlock with Pro