leetcode-potd

2976. Minimum Cost to Convert String I

leetcode-potd

You are given two 0-indexed strings source and target, both of length n and consisting of lowercase English letters. You are also given two 0-indexed character arrays original and changed, and an integer array cost,

Scroll to Top