2025-12-22 16:40:19 +0300 MSK
Minimum Deletion Cost to Make All Characters Equal
Links
Code
class Solution:
def minCost(self, s: str, cost: List[int]) -> int:
costs = [0] * 26
for i in range(len(s)):
char, cur_cost = s[i], cost[i]
char_val = ord(char) - ord("a")
for j in range(26):
if j != char_val:
costs[j] += cur_cost
res = float("inf")
for cost in costs:
res = min(res, cost)
return res