Print a pangram

Description

A pangram is a sentence that contains every letter of the alphabet from a-z at least once. For example, this is a pangram:

The quick brown fox jumps over the lazy dog.

Print a pangram to stdout. (i.e. print any text that contains all letters a-z, ignoring case.)

Judge

(async function*(context: Context): Challenge {
  const output = (await context.run()).text.toLowerCase();
  let missing = [];
  for (let i = 0; i < 26; i++) {
    if (!output.includes(String.fromCharCode(97 + i))) {
      missing.push(String.fromCharCode(97 + i))
    }
  }
  yield context.registerTestCase(
    new TestCase("Pangram", missing.length === 0 ? "Pass" : "Fail", {Text: `Missing letters: ${missing.join(",")}`})
  );
  return context.noFailures();
})

Example Code

console.log("The quick brown fox jumps over the lazy dog.")

Comments

Mukundan314

This suggestion will automatically be accepted if it gets enough 👍

accepted

Suggestion to edit judge

Output

Expected

3 identical lines skipped for (let i = 0; i < 26; i++) { for (let i = 0; i < 26; i++) { if (!output.includes(String.fromCharCode(97+i))) { if (!output.includes(String.fromCharCode(97 + i))) { missing.push(String.fromCharCode(97+i)) missing.push(String.fromCharCode(97 + i)) } } 1 identical lines skipped yield context.registerTestCase( yield context.registerTestCase( new TestCase("Pangram", missing.length === 0 ? "Pass":"Fail", {Text: `Missing letters: ${missing.join(",")}`,}) new TestCase("Pangram", missing.length === 0 ? "Pass" : "Fail", {Text: `Missing letters: ${missing.join(",")}`}) ); );

Mukundan314

minor change to hopefully make some of the solutions fail due to the new runner