Regular Expressions to validate International Tracking of Imports
Last Updated :
27 Jan, 2023
Given some International Tracking of Imports, the task is to check if they are valid or not using regular expressions. Rules for the valid International Tracking of Imports are:
- It is an alphanumeric string i.e., It contains UpperCase alphabet letters (A-Z) and digits(0-9).
- It does not contain whitespaces and other special characters.
- Its length should be equal to 13.
- It can follow below one of the written formats:
- 2 Letters(A-Z)+ 9 Digits(0-9)+2 letters i.e. [A-Z]{2}[0-9]{9}[A-Z]{2}
- 13 Digits(0-9)
Examples:
Input: str = ”AA123456789AA?
Output: true
Input: str = ”12345678901?
Output: False
Explanation: As it starts with a digit so its length should be equal to 13.
Approach: The problem can be solved based on the following idea:
Create a regex pattern to validate the number as written below:
regex = “^([A-Z]{2}[0-9]{9}[A-Z]{2}| [0-9]{13})$“
Where,
- ^: Start of the string
- [A-Z]{2}: This pattern will match two of the preceding items if they are Uppercase Alphabet letters.
- [0-9]{9}: This pattern will allow 9 of the preceding tokens if they are digits.
- $: End of the string.
Follow the below steps to implement the idea:
- Create a regex expression for International Tracking of Imports.
- Use Pattern class to compile the regex formed.
- Use the matcher function to check whether the International Tracking of Imports Number is valid or not.
- If it is valid, return true. Otherwise, return false.
Below is the code implementation of the above-discussed approach:
Java
import java.util.regex.*;
class GFG {
public static boolean isValid_Imports(String str)
{
String regex
= "^([A-Z]{2}[0-9]{9}[A-Z]{2}|[0-9]{13})$" ;
Pattern p = Pattern.compile(regex);
if (str == null ) {
return false ;
}
Matcher m = p.matcher(str);
return m.matches();
}
public static void main(String args[])
{
String str1 = "AA123456789AA" ;
System.out.println(isValid_Imports(str1));
String str2 = "RR123456785AB" ;
System.out.println(isValid_Imports(str2));
String str3 = "12345678901" ;
System.out.println(isValid_Imports(str3));
String str4 = "AA123456789" ;
System.out.println(isValid_Imports(str4));
String str5 = "AA12345678AB" ;
System.out.println(isValid_Imports(str5));
}
}
|
C++
#include <iostream>
#include <regex>
using namespace std;
bool isValid_Imports(string str)
{
const regex pattern(
"^([A-Z]{2}[0-9]{9}[A-Z]{2}|[0-9]{13})$" );
if (str.empty()) {
return false ;
}
if (regex_match(str, pattern)) {
return true ;
}
else {
return false ;
}
}
int main()
{
string str1 = "AA123456789AA" ;
cout << isValid_Imports(str1) << endl;
string str2 = "RR123456785AB" ;
cout << isValid_Imports(str2) << endl;
string str3 = "12345678901" ;
cout << isValid_Imports(str3) << endl;
string str4 = "AA123456789" ;
cout << isValid_Imports(str4) << endl;
string str5 = "AA12345678AB" ;
cout << isValid_Imports(str5) << endl;
return 0;
}
|
Python3
import re
def isValid_Imports( str ):
regex = "^([A-Z]{2}[0-9]{9}[A-Z]{2}|[0-9]{13})$"
p = re. compile (regex)
if ( str = = None ):
return False
if (re.search(p, str )):
return True
else :
return False
str1 = "AA123456789AA"
print (isValid_Imports(str1))
str2 = "RR123456785AB"
print (isValid_Imports(str2))
str3 = "12345678901"
print (isValid_Imports(str3))
str4 = "AA123456789"
print (isValid_Imports(str4))
str5 = "AA12345678AB"
print (isValid_Imports(str5))
|
C#
using System;
using System.Text.RegularExpressions;
class GFG {
static void Main( string [] args)
{
string [] str = { "AA123456789AA" , "RR123456785AB" ,
"12345678901" , "AA123456789" ,
"AA12345678AB" };
foreach ( string s in str)
{
Console.WriteLine(isValid_Imports(s) ? "true"
: "false" );
}
Console.ReadKey();
}
public static bool isValid_Imports( string str)
{
string strRegex
= @"^([A-Z]{2}[0-9]{9}[A-Z]{2}|[0-9]{13})$" ;
Regex re = new Regex(strRegex);
if (re.IsMatch(str))
return ( true );
else
return ( false );
}
}
|
Javascript
function isValid_Imports(str) {
let regex = new RegExp(/^([A-Z]{2}[0-9]{9}[A-Z]{2}|[0-9]{13})$/);
if (str == null ) {
return "false" ;
}
if (regex.test(str) == true ) {
return "true" ;
}
else {
return "false" ;
}
}
let str1 = "AA123456789AA" ;
console.log(isValid_Imports(str1));
let str2 = "RR123456785AB" ;
console.log(isValid_Imports(str2));
let str3 = "12345678901" ;
console.log(isValid_Imports(str3));
let str4 = "AA123456789" ;
console.log(isValid_Imports(str4));
let str5 = "AA12345678AB" ;
console.log(isValid_Imports(str5));
|
PHP
<?php
function isValid_Imports( $str ){
if (preg_match( '/^([A-Z]{2}[0-9]{9}[A-Z]{2}|[0-9]{13})$/' , $str )) {
echo "true\n" ;
} else {
echo "false\n" ;
}
}
isValid_Imports( "AA123456789AA" );
isValid_Imports( "RR123456785AB" );
isValid_Imports( "12345678901" );
isValid_Imports( "AA123456789" );
isValid_Imports( "AA12345678AB" );
?>
|
Output
true
true
false
false
false
Time Complexity: O(N) for each testcase, where N is the length of the given string.
Auxiliary Space: O(1)
Related Articles:
Share your thoughts in the comments
Please Login to comment...