Leetcode 1933. Check if String Is Decomposable Into Value-Equal Substrings

Determine whether a given string can be partitioned into contiguous substrings so that every substring has the same computed "value" (typically defined by a character-to-number mapping or sum over characters). In other words, check if the sequence of character values can be split into consecutive segments whose totals are all equal.