/* CHALLENGE! Arrange the Strings! Challenge: Arrange the strings! by: Persona Description: Your task is to sort a given string. Each word in the String will contain a single number. This number is the position the word should have in the result. Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0). If the input String is empty, return an empty String. The words in the input String will only contain valid consecutive numbers. For an input: "is2 Thi1s T4est 3a" the function should return "Thi1s is2 3a T4est" */ import java.util.*; public class Program { public static void main(String[] args) { Scanner sc = new Scanner(System.in); String input = sc.nextLine(); System.out.println("Input: " + input); System.out.println("Output: " + arrange(input)); } /** * Method to arrange the string * No more limited to 1 to 9 * @param str The string to be arranged * @throws IllegalArgumentException if any word that does not contain a valid consecutive integer * @return The arranged string */ static String arrange(String str) throws IllegalArgumentException { String[] words = str.split(" "); String[] arranged = new String[words.length]; char[] numbers = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'}; List nums = new ArrayList<>(); for(char x : numbers) nums.add(x); List itemNos = new ArrayList<>(); List items = new ArrayList<>(); for(String word : words) { char[] lets = word.toCharArray(); String num = ""; for(int i = 0;i < lets.length;i++) { if(nums.contains(lets[i])) { num += lets[i]; if(i < lets.length - 1) if (!nums .contains(lets[i + 1])) break; } } try { int x = Integer.parseInt(num); if (x < 1) throw new NumberFormatException(); itemNos .add(x); items.add(word); } catch (NumberFormatException e) { throw new IllegalArgumentException ("Invalid word:" + word + " must contain a number greater than zero"); } } int min = itemNos.get(0); int minIndex = 0; int previousMin = 0; for(int i = 0;i < arranged.length;i++) { for(int j = 0;j < itemNos.size();j++) { if(itemNos.get(j) < min && itemNos.get(j) > previousMin) { min = itemNos.get(j); minIndex = j; } } if (i > 0 && itemNos.get(minIndex) != previousMin + 1) throw new IllegalArgumentException("Numbers in words must be consecutive"); arranged[i] = items.get(minIndex); previousMin = min; min = 999999999; } return String.join(" ", arranged); } }

Arrange String Challenge(PERSONA)