Available question text
Split a string into the minimal number of parts such that each part appended with a suffix " " (whose length varies with the digit counts of a and b) fits within a given length limit (all parts except possibly the last must be exactly that length); return the constructed parts or an empty array if no valid split exists.
Related questions
Continue with questions that share topics or the same question type.
- Aggregate Recent Message Events And Active Chats
Coding · Data Structure Design
- Cache With Time Limit
Coding
- Check if it is Possible to Split Array
Coding
- Construct String With Repeat Limit
Coding
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 2468. Split Message Based on Limit
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source