- Given a set of letters, count all possible palindromes, using all of those letters.
- For example, if the set is {'A' 'A' 'A'} then the number is 1.
- If the set is {'A 'A' 'B'} then the number is 1.
- If the set is {'A' 'B' 'C'} then the number is 0.
Solution Stats
Problem Recent Solvers19
Suggested Problems
-
Return the 3n+1 sequence for n
5207 Solvers
-
Remove all the words that end with "ain"
1029 Solvers
-
1582 Solvers
-
378 Solvers
-
49 Solvers
More from this Author100
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
Problem Tags