This only saves 2 bytes due to the fact that the last two bytes can be implicit (would be m+dfqdlTQSleolNQ otherwise) How it works m+dfqdlTQSleolįqdlTQ - The filtered input where each element of the input is length dĮol - of the last element of the ordered list by key=lengthġ6 bytes seems a bit high for a challenge like this but oh well. Saves a few bytes by mapping a filtered list to each number in a 1-indexed range. Port of answer, so I cant really take credit for this (lol) Pyth, 14 bytes m+dfqdlTQSleol Please ask questions if you have them, this is my second attempt at a challenge. More examples can be provided if necessary but I think this should suffice for now. Input 2: My v3ry 3xc3113nt m0th3r ju5t 53rv3d u5 nin3 #JusticeForPluto
Input 1: Code Golf and Coding Challenges Meta How the word appears in input should be shown in output. including/excluding gaps (NA values, see below examples for both methods of output).So as long as the output is some form of numerically labelled rows of words, a numbered list, or a list of lists, or similar output, then it is a satisfactory answer. Order is mandatory, direction is optional, either labelled rows from shortest to longest or vice versa,.In as few bytes as possible, sort the input, a delimited string OR list/vector/array of words, words contain printable ASCII except space (ASCII values 33-126) into a numbered list, table, or something resembling a table, by length.