How to resolve the algorithm Pangram checker step by step in the HicEst programming language

Published on 12 May 2024 09:40 PM
#Hicest

How to resolve the algorithm Pangram checker step by step in the HicEst programming language

Table of Contents

Problem Statement

A pangram is a sentence that contains all the letters of the English alphabet at least once. For example:   The quick brown fox jumps over the lazy dog.

Write a function or method to check a sentence to see if it is a   pangram   (or not)   and show its use.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Pangram checker step by step in the HicEst programming language

Source code in the hicest programming language

PangramBrokenAt("This is a Pangram.") ! => 2 (b is missing)
PangramBrokenAt("The quick Brown Fox jumps over the Lazy Dog") ! => 0 (OK)

FUNCTION PangramBrokenAt(string)
   CHARACTER string, Alfabet="abcdefghijklmnopqrstuvwxyz"
   PangramBrokenAt = INDEX(Alfabet, string, 64)
   ! option 64: verify = 1st letter of string not in Alfabet
END

You may also check:How to resolve the algorithm Solve a Hopido puzzle step by step in the Raku programming language
You may also check:How to resolve the algorithm Pascal's triangle/Puzzle step by step in the REXX programming language
You may also check:How to resolve the algorithm CSV to HTML translation step by step in the J programming language
You may also check:How to resolve the algorithm Find the missing permutation step by step in the Tcl programming language
You may also check:How to resolve the algorithm Comments step by step in the Pascal programming language