LeetCode Question

#2977 Minimum Cost to Convert String II

Question Details

LeetCode #2977: Minimum Cost to Convert String II. Difficulty: Hard. Topics: Array, String, Dynamic Programming, Graph Theory, Trie, Shortest Path. Asked at Microsoft in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Graph Theory Shortest Path Arrays Dynamic Programming Graph Strings Trie