Company: Global_foundries_8dec
Difficulty: medium
Sort and Concatenate Substrings body { font-family: -apple-system, BlinkMacSystemFont, 'Segoe UI', 'Roboto', 'Oxygen', 'Ubuntu', 'Cantarell', 'Fira Sans', 'Droid Sans', 'Helvetica Neue', sans-serif; line-height: 1.6; color: #333; max-width: 800px; margin: 20px auto; padding: 0 20px; } h1, h2 { border-bottom: 1px solid #eaecef; padding-bottom: 0.3em; } pre { background-color: #f6f8fa; border-radius: 3px; font-size: 85%; line-height: 1.45; overflow: auto; padding: 16px; } code { font-family: "SFMono-Regular", Consolas, "Liberation Mono", Menlo, Courier, monospace; } p > code, li > code { background-color: rgba(27,31,35,0.05); border-radius: 3px; font-size: 85%; margin: 0; padding: 0.2em 0.4em; } Sort and Concatenate Substrings Problem Description Write a program that takes N strings consisting of lowercase alphabets as input. Perform the following steps for each string: Divide the string into substrings of length L . If the last substring does not have L characters, keep it as is. Sort a