Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1933. Check if String Is Decomposable Into Value-Equal Substrings
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source