# Pangram

Welcome to Pangram on Exercism's Haskell Track.
If you need help running the tests or submitting your code, check out `HELP.md`.

## Instructions

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.

## Source

### Created by

- @lpalma

### Contributed to by

- @chiroptical
- @iHiD
- @navossoc
- @petertseng
- @ppartarr
- @rbasso
- @rsslldnphy
- @Sir4ur0n
- @sshine
- @tejasbubane

### Based on

Wikipedia - https://en.wikipedia.org/wiki/Pangram