Validating Indian vehicle number plate using Regular Expression
Last Updated :
06 Jul, 2023
Given a string str, the task is to validate if this string represents an Indian vehicle number.
A Number Plate consists of three parts :
General Indian Vehicle Number PlateWhere,
UP: First two Characters denote the State Name. Basically, Initial Characters of a State is used i.e. If the vehicle is from Uttar Pradesh then,
UP Will denote the State Name.
50:Next Two Numbers indicate District's Sequential Number.
BY 1998:Next 6 (it varies from 5 to 6) letters are Unique alphanumeric string for each vehicle.
Examples:
Input: str = ”MH 05 S 9954?
Output: True
Explanation: MH – State Name
05 – District Sequential Number
S 9954 – Alphanumeric Unique Code
Input: str = ”MH 05 DL 9023 ”
Output: True
Input: str = ”123@3459?
Output: False
Explanation: It has a unique character that is against the property of the Vehicle Number Plate code.
Input: str =”9345268?
Output: False
Explanation: As Contains Number Only
Approach: The problem can be solved based on the following idea:
This problem can be dealt with regular expression. Regex will validate the entered data and will provide the exact format:
Create a regex pattern to validate the number as written below:
regex="^[A-Z]{2}[\\ -]{0, 1}[0-9]{2}[\\ -]{0, 1}[A-Z]{1, 2}[\\ -]{0, 1}[0-9]{4}$" where
^: Beginning of the String
[A-Z]: Character Set, matches a character in the range "A" to "Z"
{2}: Quantifier, Match of the two preceding items
[\\ -]{0, 1} : Matches one preceding item, It can be either space(\\) or Hyphen(-)
[0-9]{2}: Matches two preceding items, Both the item should be in the range 0 to 9
[A-Z]{1, 2}: It will match between 1 to 2, Item should be in the range "A" to "Z"
$: end of the String
Follow the steps mentioned below to implement the idea:
- Create a regex as shown above.
- Match the input string with the regex pattern.
- If the string matches the pattern then it is a valid number. Otherwise, it is not a valid number.
Below is the Code implementation of the above approach:
C++
// C++ program to validate
// Indian Vehicle Number Plate using Regular Expression
#include <bits/stdc++.h>
#include <regex>
using namespace std;
// Function to validate the
// Indian Vehicle Number Plate
string isValidVehicleNumberPlate(string NUMBERPLATE)
{
// Regex to check valid
// Indian Vehicle Number Plate
const regex pattern(
"^[A-Z]{2}[\\ -]{0,1}[0-9]{2}[\\ "
"-]{0,1}[A-Z]{1,2}[\\ -]{0,1}[0-9]{4}$");
// Indian Vehicle Number Plate
// is empty return false
if (NUMBERPLATE.empty()) {
return "false";
}
// Return true if the NUMBERPLATE
// matched the ReGex
if (regex_match(NUMBERPLATE, pattern)) {
return "true";
}
else {
return "false";
}
}
// Driver Code
int main()
{
// Test Case 1:
string str1 = "UP 50 BY 1998";
cout << isValidVehicleNumberPlate(str1) << endl;
// Test Case 2:
string str2 = "MH-05-DL-9023";
cout << isValidVehicleNumberPlate(str2) << endl;
// Test Case 3:
string str3 = "BNZAA2318JM";
cout << isValidVehicleNumberPlate(str3) << endl;
// Test Case 4:
string str4 = "MH 05 S 9954";
cout << isValidVehicleNumberPlate(str4) << endl;
// Test Case 5:
string str5 = "934517865";
cout << isValidVehicleNumberPlate(str5) << endl;
// Test Case 6:
string str6 = "MH05DL9023";
cout << isValidVehicleNumberPlate(str6) << endl;
return 0;
}
// This code is contributed by Aman Kumar.
Java
// Java program to validate
// Indian Vehicle Number Plate using Regular Expression
import java.util.regex.*;
class GFG {
// Function to validate the
// Indian Vehicle Number Plate (For India Country Only)
public static boolean
isValidVehicleNumberPlate(String NUMBERPLATE)
{
// Regex to check valid Indian Vehicle Number Plate
String regex
= "^[A-Z]{2}[\\ -]{0,1}[0-9]{2}[\\ -]{0,1}[A-Z]{1,2}[\\ -]{0,1}[0-9]{4}$";
// Compile the ReGex
Pattern p = Pattern.compile(regex);
// If the Indian Vehicle Number Plate
// is empty return false
if (NUMBERPLATE == null) {
return false;
}
// Pattern class contains matcher() method
// to find matching between given
// Indian Vehicle Number Plate Validation using
// regular expression.
Matcher m = p.matcher(NUMBERPLATE);
// Return if the Indian Vehicle Number Plate
// matched the ReGex
return m.matches();
}
// Driver Code.
public static void main(String args[])
{
// Test Case 1:
String str1 = "UP 50 BY 1998";
System.out.println(isValidVehicleNumberPlate(str1));
// Test Case 2:
String str2 = "MH-05-DL-9023";
System.out.println(isValidVehicleNumberPlate(str2));
// Test Case 3:
String str3 = "BNZAA2318JM";
System.out.println(isValidVehicleNumberPlate(str3));
// Test Case 4:
String str4 = "MH 05 S 9954";
System.out.println(isValidVehicleNumberPlate(str4));
// Test Case 5:
String str5 = "934517865";
System.out.println(isValidVehicleNumberPlate(str5));
// Test Case 6:
String str6 = "MH05DL9023";
System.out.println(isValidVehicleNumberPlate(str6));
}
}
Python3
# Python3 program to validate
# Indian Vehicle Number Plate using Regular Expression
import re
# Function to validate
# Indian Vehicle Number Plate
def isValidVehicleNumberPlate(str):
# Regex to check valid Indian Vehicle Number Plate
regex = "^[A-Z]{2}[\\s-]{0,1}[0-9]{2}[\\s-]{0,1}[A-Z]{1,2}[\\s-]{0,1}[0-9]{4}$"
# Compile the ReGex
p = re.compile(regex)
# If the string is empty
# return false
if (str == None):
return False
# Return if the string
# matched the ReGex
if(re.search(p, str)):
return True
else:
return False
# Driver code
# Test Case 1:
str1 = "UP 50 BY 1998"
print(isValidVehicleNumberPlate(str1))
# Test Case 2:
str2 = "MH-05-DL-9023"
print(isValidVehicleNumberPlate(str2))
# Test Case 3:
str3 = "BNZAA2318JM"
print(isValidVehicleNumberPlate(str3))
# Test Case 4:
str4 = "MH 05 S 9954"
print(isValidVehicleNumberPlate(str4))
# Test Case 5:
str5 = "934517865"
print(isValidVehicleNumberPlate(str5))
# Test Case 6:
str6 = "MH05DL9023"
print(isValidVehicleNumberPlate(str6))
C#
// C# program to validate
// Indian Vehicle Number Plate using Regular Expression
using System;
using System.Text.RegularExpressions;
class GFG {
// Function to validate the
// Indian Vehicle Number Plate (For India Country Only)
public static bool
isValidVehicleNumberPlate(String NUMBERPLATE)
{
// Regex to check valid Indian Vehicle Number Plate
string regex
= "^[A-Z]{2}[\\ -]{0,1}[0-9]{2}[\\ -]{0,1}[A-Z]{1,2}[\\ -]{0,1}[0-9]{4}$";
// Compile the ReGex
Regex p = new Regex(regex);
// If the Indian Vehicle Number Plate
// is empty return false
if (NUMBERPLATE == null) {
return false;
}
// Pattern class contains matcher() method
// to find matching between given
// Indian Vehicle Number Plate Validation using
// regular expression.
Match m = p.Match(NUMBERPLATE);
// Return if the Indian Vehicle Number Plate
// matched the ReGex
return m.Success;
}
// Driver Code.
public static void Main()
{
// Test Case 1:
string str1 = "UP 50 BY 1998";
Console.WriteLine(isValidVehicleNumberPlate(str1));
// Test Case 2:
string str2 = "MH-05-DL-9023";
Console.WriteLine(isValidVehicleNumberPlate(str2));
// Test Case 3:
string str3 = "BNZAA2318JM";
Console.WriteLine(isValidVehicleNumberPlate(str3));
// Test Case 4:
string str4 = "MH 05 S 9954";
Console.WriteLine(isValidVehicleNumberPlate(str4));
// Test Case 5:
string str5 = "934517865";
Console.WriteLine(isValidVehicleNumberPlate(str5));
// Test Case 6:
string str6 = "MH05DL9023";
Console.WriteLine(isValidVehicleNumberPlate(str6));
}
}
// This code is contributed by Vaibhav nandan
JavaScript
// Javascript program to validate
// Indian Vehicle Number Plate using Regular Expression
// Function to validate the
// Indian Vehicle Number Plate
function isValidVehicleNumberPlate(NUMBERPLATE) {
// Regex to check valid
// Indian Vehicle Number Plate
let regex = new RegExp(/^[A-Z]{2}[ -][0-9]{1,2}(?: [A-Z])?(?: [A-Z]*)? [0-9]{4}$/);
// Indian Vehicle Number Plate
// is empty return false
if (NUMBERPLATE == null) {
return "false";
}
// Return true if the NUMBERPLATE
// matched the ReGex
if (regex.test(NUMBERPLATE) == true) {
return "true";
}
else {
return "false";
}
}
// Driver Code
// Test Case 1:
let str1 = "UP 50 BY 1998";
console.log(isValidVehicleNumberPlate(str1));
// Test Case 2:
let str2 = "MH 05 DL 9023";
console.log(isValidVehicleNumberPlate(str2));
// Test Case 3:
let str3 = "BNZAA2318JM";
console.log(isValidVehicleNumberPlate(str3));
// Test Case 4:
let str4 = "MH 05 S 9954";
console.log(isValidVehicleNumberPlate(str4));
// Test Case 5:
let str5 = "934517865";
console.log(isValidVehicleNumberPlate(str5));
// Test Case 6:
let str6 = "MH 05 DL 9023";
console.log(isValidVehicleNumberPlate(str6));
// This code is contributed by akashish__
Outputtrue
true
false
true
false
true
Time Complexity: O(N) where N is the length of the string
Auxiliary Space: O(1)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Hereâs the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem