👋Learning to code? Check out ourbrand new Bootcampfor beginners!
You work for a company that sells fonts through their website. They'd like to show a different sentence each time someone views a font on their website. To give a comprehensive sense of the font, the random sentences should use all the letters in the English alphabet.
They're running a competition to get suggestions for sentences that they can use. You're in charge of checking the submissions to see if they are valid.
Pangram comes from Greek, παν γράμμα, pan gramma, which means "every letter".
The best known English pangram is:
The quick brown fox jumps over the lazy dog.
Your task is to figure out if a sentence is a pangram.
A pangram is a sentence using every letter of the alphabet at least once.
It is case insensitive, so it doesn't matter if a letter is lower-case (e.g. k) or upper-case (e.g. K).
For this exercise, a sentence is a pangram if it contains each of the 26 letters in the English alphabet.
Consider inputs case insensitive and allow more than one of each required char.
Simply type make chez if you're using ChezScheme or make guile if you're using GNU Guile.
Sometimes the name for the scheme binary on your system will differ from the defaults.
When this is the case, you'll need to tell make by running make chez chez=your-chez-binary or make guile guile=your-guile-binary.
(load "test.scm") at the repl prompt.pangram.scm reloading as you go.(test) to check your solution.If some of the test cases fail, you should see the failing input and the expected output.
The failing input is presented as a list because the tests call your solution by (apply pangram input-list).
To learn more about apply see The Scheme Programming Language -- Chapter 5
Edit via GitHub
Sign up to Exercism to learn and master Scheme with 39 exercises, and real human mentoring, all for free.
We explore higher-order functions, set operations, using bitwise operations and more, looking at languages including Rust, Pharo, jq and Kotlin!