Minimum Cost to Convert String II at Atlassian
Hard59.7% acceptance
This problem has 62.5% frequency at Atlassian.
Problem Description
You are given two **0-indexed** strings `source` and `target`, both of length `n` and consisting of **lowercase** English characters. You are also given two **0-indexed** string arrays `original` and `changed`, and an integer array `cost`, where `cost[i]` represents the cost of converting the string...
Read full problem and hintsTopics
Also asked at 2 companies
More Atlassian Questions
Rank Teams by VotesMediumMerge IntervalsMediumHigh-Access EmployeesMediumText JustificationHardNumber of Possible Sets of Closing BranchesHard
View all Atlassian questions