Merge pull request #83 from prashant3360/master

Submission for the Problem " All Permutation of a given String "

Author: srsandy

Practice Problems/Backtracking/PermutationsOfString/PermutationsOfString.java

@@ -0,0 +1,48 @@
+import java.util.HashSet;
+
+public class PermutationsOfString {
+
+	public static void main(String args[]) {
+
+		String input = "ABC";
+		HashSet<String> resultSet = new HashSet<String>();
+
+		permutation(input, 0, resultSet);
+
+		for (String str : resultSet) {
+			System.out.println(str);
+		}
+
+	}
+
+	public static void permutation(String input, int fixedIndex, HashSet<String> resultSet) {
+
+
+		if (fixedIndex == input.length()-1) {
+			resultSet.add(input);
+			return;
+		}
+
+		for (int i = fixedIndex; i < input.length(); i++) {
+
+			input = swap(input, fixedIndex, i);
+			resultSet.add(input);
+			permutation(input, fixedIndex+1, resultSet);
+			input = swap(input, fixedIndex, i);
+
+		}
+
+	}
+
+	public static String swap(String s, int i, int j) {
+
+		char[] input = s.toCharArray();
+
+		char temp = input[i];
+		input[i] = input[j];
+		input[j] = temp;
+
+		return String.valueOf(input);
+	}
+
+}

Practice Problems/Backtracking/PermutationsOfString/README.md

@@ -0,0 +1,26 @@
+# Permutations of a given string
+
+**Problem from GeeksForGeeks**
+
+A permutation, also called an “arrangement number” or “order,” is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. A string of length n has n! permutation.
+Your task is to print all permutations of a given `input` string in new line.
+
+### Examples:
+
+#### 1
+
+**Input** : 
+```java 
+input = "ABC"
+```
+
+**Output:** : 
+```java 
+ACB
+BCA
+ABC
+CBA
+BAC
+CAB
+```
+