- 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 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers32
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6874 Solvers
-
7892 Solvers
-
Back to basics 25 - Valid variable names
340 Solvers
-
Is the paranthesis sequence balanced ?
206 Solvers
-
612 Solvers
More from this Author99
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!