Sha256: 7bb615f563a3013964a4dabfb51c1e84e95f7d8dd9fdf8e02234af8ffd3eb862
Contents?: true
Size: 1.15 KB
Versions: 74
Compression:
Stored size: 1.15 KB
Contents
# Pangram
Determine if a sentence is a pangram. A pangram (Greek: παν γράμμα, pan gramma,
"every letter") is a sentence using every letter of the alphabet at least once.
The best known English pangram is:
> The quick brown fox jumps over the lazy dog.
The alphabet used consists of ASCII letters `a` to `z`, inclusive, and is case
insensitive. Input will not contain non-ASCII symbols.
## Loading your exercise implementation in PolyML
```
$ poly --use {exercise}.sml
```
Or:
```
$ poly
> use "{exercise}.sml";
```
**Note:** You have to replace {exercise}.
## Running the tests
```
$ poly -q --use test.sml
```
## Feedback, Issues, Pull Requests
The [exercism/sml](https://github.com/exercism/sml) repository on
GitHub is the home for all of the Standard ML exercises.
If you have feedback about an exercise, or want to help implementing a new
one, head over there and create an issue. We'll do our best to help you!
## Source
Wikipedia [https://en.wikipedia.org/wiki/Pangram](https://en.wikipedia.org/wiki/Pangram)
## Submitting Incomplete Solutions
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
Version data entries
74 entries across 74 versions & 1 rubygems