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
z, inclusive, and is case
insensitive. Input will not contain non-ASCII symbols.
For installation and learning resources, refer to the exercism help page.
To work on the exercises, you will need
Base. Consult opam website for instructions on how to install
opam for your OS. Once
opam is installed open a terminal window and run the following command to install base:
opam install base
To run the tests you will need
OUnit. Install it using
opam install ounit
A Makefile is provided with a default target to compile your solution and run the tests. At the command line, type:
utop is a command line program which allows you to run Ocaml code interactively. The easiest way to install it is via opam:
opam install utop
Consult utop for more detail.
The exercism/ocaml repository on GitHub is the home for all of the Ocaml 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!
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
open OUnit2 open Pangram let ae exp got _test_ctxt = assert_equal ~printer:string_of_bool exp got let tests = [ "sentence empty" >:: ae false (is_pangram ""); "recognizes a perfect lower case pangram" >:: ae true (is_pangram "abcdefghijklmnopqrstuvwxyz"); "pangram with only lower case" >:: ae true (is_pangram "the quick brown fox jumps over the lazy dog"); "missing character 'x'" >:: ae false (is_pangram "a quick movement of the enemy will jeopardize five gunboats"); "another missing character, e.g. 'h'" >:: ae false (is_pangram "five boxing wizards jump quickly at it"); "pangram with underscores" >:: ae true (is_pangram "the_quick_brown_fox_jumps_over_the_lazy_dog"); "pangram with numbers" >:: ae true (is_pangram "the 1 quick brown fox jumps over the 2 lazy dogs"); "missing letters replaced by numbers" >:: ae false (is_pangram "7h3 qu1ck brown fox jumps ov3r 7h3 lazy dog"); "pangram with mixed case and punctuation" >:: ae true (is_pangram "\"Five quacking Zephyrs jolt my wax bed.\""); "upper and lower case versions of the same character should not be counted separately" >:: ae false (is_pangram "the quick brown fox jumps over with lazy FX"); ] let () = run_test_tt_main ("pangram tests" >::: tests)
let is_pangram str = let lower = String.lowercase_ascii str in let alphabet = Array.to_list (Array.make 26 'a' |> Array.mapi (fun i c -> int_of_char c + i |> char_of_int)) in let rec helper elements = match elements with |  -> true | (c::cs) -> if String.contains lower c then helper cs else false in helper alphabet
A huge amount can be learned from reading other people’s code. This is why we wanted to give exercism users the option of making their solutions public.
Here are some questions to help you reflect on this solution and learn the most from it.