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

Published on 12 May 2024 09:40 PM
#Easylang

How to resolve the algorithm Pangram checker step by step in the EasyLang 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 EasyLang programming language

Source code in the easylang programming language

func pangr s$ .
   len d[] 26
   for c$ in strchars s$
      c = strcode c$
      if c >= 97 and c <= 122
         c -= 32
      .
      if c >= 65 and c <= 91
         d[c - 64] = 1
      .
   .
   for h in d[]
      s += h
   .
   return s
.
repeat
   s$ = input
   until s$ = ""
   print s$
   if pangr s$ = 26
      print "  --> pangram"
   .
   print ""
.
input_data
This is a test.
The quick brown fox jumps over the lazy dog.
The quick brown fox jumped over the lazy dog.
QwErTyUiOpAsDfGhJkLzXcVbNm

You may also check:How to resolve the algorithm Sum digits of an integer step by step in the Java programming language
You may also check:How to resolve the algorithm Morse code step by step in the Haskell programming language
You may also check:How to resolve the algorithm Regular expressions step by step in the Sather programming language
You may also check:How to resolve the algorithm Associative array/Merging step by step in the AutoHotkey programming language
You may also check:How to resolve the algorithm Set step by step in the Ceylon programming language