@@ -0,0 +1,1003 @@
+package com.anuragkapur.pie.recursion;%0A%0Aimport org.junit.Test;%0A%0Aimport static org.junit.Assert.*;%0A%0A/**%0A * @author anuragkapur%0A */%0Apublic class PermutationsTest %7B%0A%0A    Permutations permutations = new Permutations();%0A%0A    @Test%0A    public void testGetPermutations1() throws Exception %7B%0A        assertNull(permutations.getPermutations(null));%0A    %7D%0A%0A    @Test%0A    public void testGetPermutations2() throws Exception %7B%0A        assertEquals(%22%5B%5D%22, permutations.getPermutations(%22%22).toString());%0A    %7D%0A%0A    @Test%0A    public void testGetPermutations3() throws Exception %7B%0A        assertEquals(%22%5Ba%5D%22, permutations.getPermutations(%22a%22).toString());%0A    %7D%0A%0A    @Test%0A    public void testGetPermutations4() throws Exception %7B%0A        assertEquals(%22%5Babc, acb, bac, bca, cab, cba%5D%22, permutations.getPermutations(%22abc%22).toString());%0A    %7D%0A%0A    @Test%0A    public void testGetPermutations5() throws Exception %7B%0A        assertEquals(%22%5Baaa, aaa, aaa, aaa, aaa, aaa%5D%22, permutations.getPermutations(%22aaa%22).toString());%0A    %7D%0A%7D

Add algo to compute string permutations