Not so long ago, I found this page. And Today, I’m thinking to code my own self-enumerating pangram(php). Well, I’m curious on how it works and I know there are tons of codes out there on the net about pangram. I haven’t google it yet and I don’t want to because if I do, I may spoil my adventure on this and I want to discover it for myself.

For quick info, a pangram is a sentence using every alphabet at least once. Example of this is:

The quick brown fox jumps over the lazy dog

While a self-enumerating pangram is it enumerates or describe the number of letter it contains. This follows the general format of:

This sentence contains <number> a’s, <number> b’s, <number> c’s, …

For example:

Only a fool would check that this sentence contains exactly six ‘a’s, one ‘b’, six ‘c’s, three ‘d’s, thirty-four ‘e’s, five ‘f’s, two ‘g’s, ten ‘h’s, thirteen ‘i’s, one ‘j’, two ‘k’s, five ‘l’s, one ‘m’, twenty-two ‘n’s, seventeen ‘o’s, one ‘p’, one ‘q’, seven ‘r’s, thirty-two ‘s’s, twenty-six ‘t’s, three ‘u’s, seven ‘v’s, eight ‘w’s, six ‘x’s, seven ‘y’s, and one ‘z’.

Well, everything is ready it seems. Wish me luck! [it's either good or bad, it's you choice...]