First clear solution for Pangram by kazuki.h - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

First solution in Clear category for Pangram by kazuki.h

from string import ascii_lowercase

def check_pangram(text):
    check = ascii_lowercase
    for s in text.lower(): check = check.replace(s, "")
    return check == ""

Dec. 27, 2021

Comments:

vtflnk on Jan. 15, 2024, 7:51 p.m.
<p>This is not a bad solution. Some people use sets. This is unreasonably difficult. So if you were to solve this problem in C, then there is an elementary solution - we create an array of 26 elements that are initially equal to zero. We look through the text and add 1 to the element corresponding to the letter of the alphabet. If 2 appears somewhere, then we don’t check further. At the end of the algorithm, we check that each element is equal to one - then the answer is positive.</p>

Strings Theory

0 %

PyCharm The Python IDE for Professional Developers. Enjoy productive Python, web and scientific development with PyCharm. Download it now!