Epic Systems Interview Question
Developer Program EngineersCountry: United States
public class Combination {
public static void main(String[] args) {
permutation("", "123");
}
private static void permutation(String prefix, String str) {
int n = str.length();
if(n ==0)
System.out.println(prefix);
else {
for(int i = 0; i<n ;i++){
permutation(prefix+str.charAt(i), str.substring(0,i)+str.substring(i+1));
}
}
}
}
public class Combination {
public static void main(String[] args) {
permutation("", "123");
}
private static void permutation(String prefix, String str) {
int n = str.length();
if(n ==0)
System.out.println(prefix);
else {
for(int i = 0; i<n ;i++){
permutation(prefix+str.charAt(i), str.substring(0,i)+str.substring(i+1));
}
}
}
}
public static void main(String args[]) {
permuteString("", "123");
}
public static void permuteString(String beginningString, String endingString) {
if (endingString.length() <= 1)
System.out.println(beginningString + endingString);
else
for (int i = 0; i < endingString.length(); i++) {
try {
// System.out.println(i);
String newString = endingString.substring(0, i) + endingString.substring(i + 1);
permuteString(beginningString + endingString.charAt(i), newString);
} catch (StringIndexOutOfBoundsException exception) {
exception.printStackTrace();
}
}
}
public static void main(String args[]) {
permuteString("", "123");
}
public static void permuteString(String beginningString, String endingString) {
if (endingString.length() <= 1)
System.out.println(beginningString + endingString);
else
for (int i = 0; i < endingString.length(); i++) {
try {
// System.out.println(i);
String newString = endingString.substring(0, i) + endingString.substring(i + 1);
permuteString(beginningString + endingString.charAt(i), newString);
} catch (StringIndexOutOfBoundsException exception) {
exception.printStackTrace();
}
}
}
Save the integers as a HashMap where key is the integer and value is the number of occurences. Then following program solves it.
- s100banerjee May 02, 2015