Leetcode 2468. Split Message Based on Limit

Split a string into the minimal number of parts such that each part appended with a suffix "<a/b>" (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.