The other forum topic was getting full, so I will ask here.

For the recursive method that takes a String and returns a list of Strings of all anagrams, it has a "loop that generates each possible substring consisting of all but one character in the input String, ie the substring that omits the first letter, then the substring that omits the second letter, etc. Within the loop, the method calls itself recursively for each substring."

I tried to do this on paper for a String "abc". I got bc and c as substrings.

"For each String in the list returned by the recursive call, add the omitted character back to the end and add the String to the list to be returned."

With my substrings bc and c, I got: bca and cb

"When the first instance of this method returns, the list will contain all anagrams of the original input String"  and the base case is to "return a list containing only a new empty String if the input String has length 0".

When the first instance returns, does it mean that the base case stopped the recursive call and the method is finished?

Also, I am confused on how to make anagrams, can you provide an example of all anagrams of a String like "abc"? For "abc", can anagrams be one, two, and three letter words?

Is there any specific examples in the lecture note slides to help me understand it?

For the recursive method that returns a list of anagrams, I am not sure how to omit a letter in the String. I only get some possible anagrams.

For starting the nonrecursive filter method, I made the list of anagrams into an array and put those values into a list.  Using this list in the recursive filter method, I am not sure how to compare it with the valid word list String by String.