import java.util.Scanner; import java.util.Set; import java.util.List; import java.util.HashSet; import java.util.LinkedList; import java.util.Collections; public class Program { public static void main(String[] args) { Scanner sc = new Scanner(System.in); String string = sc.next(); sc.close(); permute(string); } public static void permute(String s) { if(null==s || s.isEmpty()) { return; } List strings = new LinkedList(); strings.add(String.valueOf(s.charAt(0))); // add the first element to the list // Temp list that holds the set of strings for // appending the current character to all position in each word in the original list List tempList = new LinkedList(); for(int i=1; i< s.length(); i++) { for(int j=0; j merge(Character c, String s) { if(s==null || s.isEmpty()) { return null; } int len = s.length(); StringBuilder sb = new StringBuilder(); Set list = new HashSet(); for(int i=0; i<= len; i++) { sb = new StringBuilder(); sb.append(s.substring(0, i) + c + s.substring(i, len)); list.add(sb.toString()); } return list; } }

All angrams of a word (without recursion).