There are two questions:

1.LeetCode 239 helps with sliding-window strategies
Actual Question: Maximize Decryption Value (LC)

2.LeetCode 410 helps with partitioning logic if adapted for distinct counts
Actual Question: Maximum Distinct Split Sum

These are not exactly the same questions, but they seem similar in concept.

And I just solved 0 of them because I failed due to time complexity in one problem