Available question text
Given a string containing '0', '1', and '!' characters, replace each '!' with either '0' or '1' to minimize the total weighted errors, where each '01' subsequence pair contributes x errors and each '10' subsequence pair contributes y errors. Return the minimum total errors modulo 10^9 + 7.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Amazon
Minimize Weighted Subsequence Pair Errors with Wildcards
Reported Jul 20, 2025 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source