AmazonCoding·40 minMembers
Min Errors in 0/1/! Subsequence DP
Members only
A database string contains `0`, `1`, and unknown `!`. Each subsequence `01` costs `x`, each `10` costs `y`. Each `!` resolves to either `0` or `1`. Minimize the total cost.
SWE
string
dp
medium
Frequency
Single report
Last asked
2026-04-16
Stage
oa
Log in to continue reading the full content