Algorithm


Problem Name: Python - Validating UID

Problem Link: https://www.hackerrank.com/challenges/validating-uid/problem?isFullScreen=true  

In this HackerRank Functions in PYTHON problem solution,

ABCXYZ company has up to 100 employees.
The company decides to create a unique identification number (UID) for each of its employees.
The company has assigned you the task of validating all the randomly generated UIDs.

A valid UID must follow the rules below:

  • It must contain at least 2 uppercase English alphabet characters
  • It must contain at least 3 digits (0 - 9)
  • It should only contain alphanumeric characters (a -z,A - Z & 0 - 9).
  • No character should repeat.
  • There must be exactly 10 characters in a valid UID.

Input Format

The first line contains an integer T , the number of test cases.
The next T lines contains an employee's UID.

Output Format

For each test case, print 'Valid' if the UID is valid. Otherwise, print 'Invalid', on separate lines. Do not print the quotation marks.

Sample Input

2
B1CD102354
B1CDEF2354

Sample Output

Invalid
Valid

Explanation

B1CD102354: 1 is repeating → Invalid
B1CDEF2354: Valid

 

 

 

Code Examples

#1 Code Example with Python Programming

Code - Python Programming


import re
n = int(input())
for i in range(n):
    s = input()
    if len(re.findall(r'[A-Z]',s)) >= 2:
        if len(re.findall(r'[0-9]', s)) >= 3:
            if re.match(r'^[A-Za-z0-9]+$', s):
                if  len(re.findall(r'(.).*\1', s)) == 0:
                    if len(s) == 10:
                        print('Valid')
                        continue
    print('Invalid')
Copy The Code & Try With Live Editor
Advertisements

Demonstration


Previous
[Solved] XML 1 - Find the Score in PYTHON solution in Hackerrank
Next
[Solved] XML2 - Find the Maximum Depth in PYTHON solution in Hackerrank