I spent quite some time working on the "palindromic pangram" problem. I believe I solved it, but my program took several days to finish, so there's probably an optimization I'm still missing. If my program is correct, the shortest palindromic pangram is length 57. Has anyone here done better (either a shorter solution or faster running time)?