{"repository":{"description":"You need to write a permute class that will take first and second strings to rearrange letters in first, followed by second.  For example, if the first is “CAT” string and second is “MAN” string, then the program would print the strings TACMAN, ATCMAN, CTAMAN, TCAMAN, ACTMAN, and CATMAN.  The first and second strings can be any length of string or a null.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":0,"owner":"CruzerK97","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"created_at":"2013-10-25T20:23:56-07:00","pushed_at":"2013-10-25T20:23:56-07:00","master_branch":"master"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/CruzerK97/assignment-is-recursive-call-and-placing-strings-in-link-list-notes"}