@@ -0,0 +1,1198 @@
+/*%0A * Copyright (C) 2014 Pedro Vicente G%C3%B3mez S%C3%A1nchez.%0A *%0A * Licensed under the Apache License, Version 2.0 (the %22License%22);%0A * you may not use this file except in compliance with the License.%0A * You may obtain a copy of the License at%0A *%0A * http://www.apache.org/licenses/LICENSE-2.0%0A *%0A * Unless required by applicable law or agreed to in writing, software%0A * distributed under the License is distributed on an %22AS IS%22 BASIS,%0A * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.%0A * See the License for the specific language governing permissions and%0A * limitations under the License.%0A */%0Apackage com.github.pedrovgs.problem25;%0A%0A/**%0A * Given a String passed as parameter, can you write a method to calculate input word anagrams?%0A *%0A * An anagram is a type of word play, the result of rearranging the letters of a word or phrase to%0A * produce a new word or phrase, using all the original letters exactly once; for example Torchwood%0A * can be rearranged into Doctor Who. The original word or phrase is known as the subject of the%0A * anagram. Anagrams are often used as a form of mnemonic device as well.%0A *%0A * @author Pedro Vicente G%C3%B3mez S%C3%A1nchez.%0A */%0Apublic class Anagrams %7B%0A%7D%0A

Add statement to problem 25