PROBLEMS|MOD 13|HARD

Minimum ASCII Delete Sum for Two Strings

Algorithms: Searching, Sorting & Big-O

Implement algorithmic solution for **Minimum ASCII Delete Sum for Two Strings** (Hard level). Input parameters: `data`.

// EXAMPLES

Example 1:
Input: Input: 2
Output: 12
Explanation: Result for example 1 of Minimum ASCII Delete Sum for Two Strings.
Example 2:
Input: Input: 5
Output: 15
Explanation: Result for example 2 of Minimum ASCII Delete Sum for Two Strings.

// CONSTRAINTS

  • 1 <= len(input) <= 10^5
  • Time Complexity target: O(N) or O(N log N)
  • Space Complexity target: O(1) or O(N)
  • Evaluated against 600 test cases.
solution.py