Minimum Deletion Cost to Avoid Repeating LettersMinimum Deletion Cost to Avoid Repeating Letters

Minimum Deletion Cost to Avoid Repeating Letters

This is a Leet Code problem (1578 – Minimum Deletion Cost to Avoid Repeating Letters) solved in Java, the problem description is:

Given a string s and an array of integers cost where cost[i] is the cost of deleting the ith character in s.

Continue reading