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

Published on 12 May 2024 09:40 PM
#J

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

Source code in the j programming language

require 'strings'
isPangram=: (a. {~ 97+i.26) */@e. tolower


   isPangram 'The quick brown fox jumps over the lazy dog.'
1
   isPangram 'The quick brown fox falls over the lazy dog.'
0


  

You may also check:How to resolve the algorithm Search a list step by step in the Elena programming language
You may also check:How to resolve the algorithm Halt and catch fire step by step in the Quackery programming language
You may also check:How to resolve the algorithm Primorial numbers step by step in the Ring programming language
You may also check:How to resolve the algorithm Simple windowed application step by step in the APL programming language
You may also check:How to resolve the algorithm Tree traversal step by step in the Python programming language