Learn to Code
John F. Dumas
contact me | resume | how it works | example programs | testimonials | main page

Java - Anagrams

► Problem Description: Given a dictionary of words and an input word or phrase, find all anagrams of the input word or phrase.

► Example (input phrase: star trek):

Solution: art treks
Solution: arts trek
Solution: rat treks
Solution: rats trek
Solution: star trek
Solution: tar treks
Solution: tars trek
Solution: trek tsar

► Source Code

All files (zip file)

Back to Example Program Index

© John F. Dumas | johnfdumas@gmail.com | main page | top of page