How to check Aadhaar number is valid or not using Regular Expression
Last Updated :
10 Mar, 2023
Given string str, the task is to check whether the given string is a valid Aadhaar number or not by using Regular Expression. The valid Aadhaar number must satisfy the following conditions:
- It should have 12 digits.
- It should not start with 0 and 1.
- It should not contain any alphabet and special characters.
- It should have white space after every 4 digits.
Examples:
Input: str = “3675 9834 6012”
Output: true
Explanation:
The given string satisfies all the above mentioned conditions. Therefore, it is a valid Aadhaar number.
Input: str = “3675 9834 6012 8”
Output: false
Explanation:
The given string contains 13 digits. Therefore, it is not a valid Aadhaar number.
Approach: The idea is to use Regular Expression to solve this problem. The following steps can be followed to compute the answer:
- Get the String.
- Create a regular expression to check valid Aadhaar number as mentioned below:
regex = “^[2-9]{1}[0-9]{3}\\s[0-9]{4}\\s[0-9]{4}$”;
- Where:
- ^ represents the starting of the string.
- [2-9]{1} represents the first digit should be any from 2-9.
- [0-9]{3} represents the next 3 digits after the first digit should be any digit from 0-9.
- \\s represents white space.
- [0-9]{4} represents the next 4 digits should be any from 0-9.
- \\s represents white space.
- [0-9]{4} represents the next 4 digits should be any from 0-9.
- $ represents the ending of the string.
- Match the given string with the regular expression. In Java, this can be done by using Pattern.matcher().
- Return true if the string matches with the given regular expression, else return false.
Below is the implementation of the above approach:
C++
#include <iostream>
#include <regex>
using namespace std;
bool isValidAadhaarNumber(string str)
{
const regex pattern( "^[2-9]{1}[0-9]{3}\\s[0-9]{4}\\s[0-9]{4}$" );
if (str.empty())
{
return false ;
}
if (regex_match(str, pattern))
{
return true ;
}
else
{
return false ;
}
}
int main()
{
string str1 = "3675 9834 6015" ;
cout << isValidAadhaarNumber(str1) << endl;
string str2 = "4675 9834 6012 8" ;
cout << isValidAadhaarNumber(str2) << endl;
string str3 = "0175 9834 6012" ;
cout << isValidAadhaarNumber(str3) << endl;
string str4 = "3675 98AF 60#2" ;
cout << isValidAadhaarNumber(str4) << endl;
string str5 = "417598346012" ;
cout << isValidAadhaarNumber(str5) << endl;
return 0;
}
|
Java
import java.util.regex.*;
class GFG {
public static boolean
isValidAadhaarNumber(String str)
{
String regex
= "^[2-9]{1}[0-9]{3}\\s[0-9]{4}\\s[0-9]{4}$" ;
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 = "3675 9834 6015" ;
System.out.println(isValidAadhaarNumber(str1));
String str2 = "4675 9834 6012 8" ;
System.out.println(isValidAadhaarNumber(str2));
String str3 = "0175 9834 6012" ;
System.out.println(isValidAadhaarNumber(str3));
String str4 = "3675 98AF 60#2" ;
System.out.println(isValidAadhaarNumber(str4));
String str5 = "417598346012" ;
System.out.println(isValidAadhaarNumber(str5));
}
}
|
Python3
import re
def isValidAadhaarNumber( str ):
regex = ( "^[2-9]{1}[0-9]{3}\\" +
"s[0-9]{4}\\s[0-9]{4}$" )
p = re. compile (regex)
if ( str = = None ):
return False
if (re.search(p, str )):
return True
else :
return False
str1 = "3675 9834 6015"
print (isValidAadhaarNumber(str1))
str2 = "4675 9834 6012 8"
print (isValidAadhaarNumber(str2))
str3 = "0175 9834 6012"
print (isValidAadhaarNumber(str3))
str4 = "3675 98AF 60#2"
print (isValidAadhaarNumber(str4))
str5 = "417598346012"
print (isValidAadhaarNumber(str5))
|
C#
using System;
using System.Text.RegularExpressions;
class GFG
{
static void Main( string [] args)
{
string [] str={ "3675 9834 6015" , "4675 9834 6012 8" , "0175 9834 6012" , "3675 98AF 60#2" , "417598346012" };
foreach ( string s in str) {
Console.WriteLine( isValidAadhaarNumber(s) ? "true" : "false" );
}
Console.ReadKey(); }
public static bool isValidAadhaarNumber( string str)
{
string strRegex = @"^[2-9]{1}[0-9]{3}\s[0-9]{4}\s[0-9]{4}$" ;
Regex re = new Regex(strRegex);
if (re.IsMatch(str))
return ( true );
else
return ( false );
}
}
|
Javascript
function isValid_Aadhaar_Number(aadhaar_number)
{
let regex = new RegExp(/^[2-9]{1}[0-9]{3}\s[0-9]{4}\s[0-9]{4}$/);
if (aadhaar_number == null ) {
return "false" ;
}
if (regex.test(aadhaar_number) == true ) {
return "true" ;
}
else {
return "false" ;
}
}
let str1 = "3675 9834 6015" ;
console.log(isValid_Aadhaar_Number(str1));
let str2 = "4675 9834 6012 8" ;
console.log(isValid_Aadhaar_Number(str2));
let str3 = "7952 7614 1301" ;
console.log(isValid_Aadhaar_Number(str3));
let str4 = "0175 9834 6012" ;
console.log(isValid_Aadhaar_Number(str4));
let str5 = "3675 98AF 60#2" ;
console.log(isValid_Aadhaar_Number(str5));
|
Output:
true
false
false
false
false
Time complexity : O(1) as the regex_match function has a constant time complexity.
Space complexity :O(1) as it only uses a few variables and the regex pattern is pre-compiled and stored in a constant variable.
Share your thoughts in the comments
Please Login to comment...