String validators Hacker Rank Solution – Queslers

Problem: String validators Hacker Rank Solution

Python has built-in string validation methods for basic data. It can check if a string is composed of alphabetical characters, alphanumeric characters, digits, etc.

str.isalnum()
This method checks if all the characters of a string are alphanumeric (a-z, A-Z and 0-9).

>>> print 'ab123'.isalnum()
True
>>> print 'ab123#'.isalnum()
False

str.isalpha()
This method checks if all the characters of a string are alphabetical (a-z and A-Z).

>>> print 'abcD'.isalpha()
True
>>> print 'abcd1'.isalpha()
False

str.isdigit()
This method checks if all the characters of a string are digits (0-9).

>>> print '1234'.isdigit()
True
>>> print '123edsd'.isdigit()
False

str.islower()
This method checks if all the characters of a string are lowercase characters (a-z).

>>> print 'abcd123#'.islower()
True
>>> print 'Abcd123#'.islower()
False

str.isupper()
This method checks if all the characters of a string are uppercase characters (A-Z).

>>> print 'ABCD123#'.isupper()
True
>>> print 'Abcd123#'.isupper()
False

Task:

You are given a string S. Your task is to find out if the string  contains: alphanumeric characters, alphabetical characters, digits, lowercase and uppercase characters.

Input Format

A single line containing a string .

Output Format

In the first line, print True if  has any alphanumeric characters. Otherwise, print False.

In the second line, print True if  has any alphabetical characters. Otherwise, print False.

In the third line, print True if  has any digits. Otherwise, print False.

In the fourth line, print True if  has any lowercase characters. Otherwise, print False.

In the fifth line, print True if  has any uppercase characters. Otherwise, print False.

Sample Input

qA2

Sample Output

True
True
True
True
True

String validators Hacker Rank Solution in Python 2

S = raw_input()
print True if any(k in "0123456789" or k.lower() in "abcdefghijklmnopqrstuvwxyz" for k in S) else False
print True if any(k.lower() in "abcdefghijklmnopqrstuvwxyz" for k in S) else False
print True if any(k in "0123456789" for k in S) else False
print True if any(k in "abcdefghijklmnopqrstuvwxyz" for k in S) else False
print True if any(k in "ABCDEFGHIJKLMNOPQRSTUVWXYZ" for k in S) else False

String validators Hacker Rank Solution in Python 3

if __name__ == '__main__':
    s = input()
    print(any(a.isalnum() for a in s) )
    print(any(a.isalpha() for a in s) )
    print(any(a.isdigit() for a in s) )
    print(any(a.islower() for a in s) )
    print(any(a.isupper() for a in s) )

String validators Hacker Rank Solution in pypy

# Enter your code here. Read input from STDIN. Print output to STDOUT
S=raw_input()
a=0
for i in range(len(S)):
    if S[i].isalnum():
         a+=1
if a>0:
    print 'True'
else:
    print 'False'

a=0
for i in range(len(S)):
    if S[i].isalpha():
         a+=1
if a>0:
    print 'True'
else:
    print 'False'
    
a=0
for i in range(len(S)):
    if S[i].isdigit():
         a+=1
if a>0:
    print 'True'
else:
    print 'False'
    
a=0
for i in range(len(S)):
    if S[i].islower():
         a+=1
if a>0:
    print 'True'
else:
    print 'False'
    
a=0
for i in range(len(S)):
    if S[i].isupper():
         a+=1
if a>0:
    print 'True'
else:
    print 'False'

String validators Hacker Rank Solution in pypy3

if __name__ == '__main__':
    s = input()
    print(any(c.isalnum() for c in s))
    print(any(c.isalpha() for c in s))
    print(any(c.isdigit() for c in s))
    print(any(c.islower() for c in s))
    print(any(c.isupper() for c in s))

String validators Hacker Rank Solution Review:

In our experience, we suggest you solve this String validators Hacker Rank Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

String validators problem is available on Hacker Rank for Free, if you are stuck anywhere between compilation, just visit Queslers to get String validators Hacker Rank Solution

Conclusion:

I hope this String validators Hacker Rank Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Hacker Rank, Leetcode, Codechef, Codeforce Solution.

This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.

Keep Learning!

More Hacker Rank Problem & Solutions >>

Staircase Hacker Rank Solution

A Very Big Sum Hacker Rank Solution

Diagonal Difference Hacker Rank Solution

Nested Lists Hacker Rank Solution

Lists Hacker Rank Solution