- 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 Solvers31
Suggested Problems
-
2377 Solvers
-
1668 Solvers
-
Find the Kronecker Tensor Product without using KRON
51 Solvers
-
1464 Solvers
-
278 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!