Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.