How to validate a domain name using Regular Expression
Last Updated :
07 Aug, 2024
Given string str, the task is to check whether the given string is a valid domain name or not by using Regular Expression.
The valid domain name must satisfy the following conditions:
- The domain name should be a-z or A-Z or 0-9 and hyphen (-).
- The domain name should be between 1 and 63 characters long.
- The domain name should not start or end with a hyphen(-) (e.g. -geeksforgeeks.org or geeksforgeeks.org-).
- The last TLD (Top level domain) must be at least two characters and a maximum of 6 characters.
- The domain name can be a subdomain (e.g. write.geeksforgeeks.org).
Examples:
Input: str = "write.geeksforgeeks.org"
Output: true
Explanation:
The given string satisfies all the above mentioned conditions. Therefore, it is a valid domain name.
Input: str = "-geeksforgeeks.org"
Output: false
Explanation:
The given string starts with a hyphen (-). Therefore, it is not a valid domain name.
Input: str = "geeksforgeeks.o"
Output: false
Explanation:
The given string have last TLD of 1 character, the last TLD must be between 2 and 6 characters long. Therefore, it is not a valid domain name.
Input: str = ".org"
Output: false
Explanation:
The given string doesn't start with a-z or A-Z or 0-9. Therefore, it is not a valid domain name.
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 the valid domain name as mentioned below:
regex = "^((?!-)[A-Za-z0-9-]{1, 63}(?<!-)\\.)+[A-Za-z]{2, 6}$"
- Where:
- ^ represents the starting of the string.
- ( represents the starting of the group.
- (?!-) represents the string should not start with a hyphen (-).
- [A-Za-z0-9-]{1, 63} represents the domain name should be a-z or A-Z or 0-9 and hyphen (-) between 1 and 63 characters long.
- (?<!-) represents the string should not end with a hyphen (-).
- \\. represents the string followed by a dot.
- )+ represents the ending of the group, this group must appear at least 1 time, but allowed multiple times for subdomain.
- [A-Za-z]{2, 6} represents the TLD must be A-Z or a-z between 2 and 6 characters long.
- $ 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;
// Function to validate the domain name
bool isValidDomain(const string &str)
{
// Regex to check valid Domain Name
regex pattern("^[A-Za-z0-9-]{1,63}\\.[A-Za-z]{2,6}$");
// Return true if the string matches the regex
return regex_match(str, pattern);
}
// Driver Code
int main()
{
// Test Case 1:
string str1 = "geeksforgeeks.org";
cout << (isValidDomain(str1) ? "true" : "false") << endl;
// Test Case 2:
string str2 = "contribute.geeksforgeeks.org";
cout << (isValidDomain(str2) ? "true" : "false") << endl;
// Test Case 3:
string str3 = "-geeksforgeeks.org";
cout << (isValidDomain(str3) ? "true" : "false") << endl;
// Test Case 4:
string str4 = "geeksforgeeks.o";
cout << (isValidDomain(str4) ? "true" : "false") << endl;
// Test Case 5:
string str5 = ".org";
cout << (isValidDomain(str5) ? "true" : "false") << endl;
return 0;
}
Java
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class DomainValidator {
// Function to validate the domain name
public static boolean isValidDomain(String str)
{
// Regex to check valid Domain Name
String regex
= "^[A-Za-z0-9-]{1,63}\\.[A-Za-z]{2,6}$";
Pattern pattern = Pattern.compile(regex);
Matcher matcher = pattern.matcher(str);
// Return true if the string matches the regex
return matcher.matches();
}
public static void main(String[] args)
{
// Test Case 1:
String str1 = "geeksforgeeks.org";
System.out.println(
isValidDomain(str1)); // Expected output: true
// Test Case 2:
String str2 = "contribute.geeksforgeeks.org";
System.out.println(
isValidDomain(str2)); // Expected output: true
// Test Case 3:
String str3 = "-geeksforgeeks.org";
System.out.println(
isValidDomain(str3)); // Expected output: false
// Test Case 4:
String str4 = "geeksforgeeks.o";
System.out.println(
isValidDomain(str4)); // Expected output: false
// Test Case 5:
String str5 = ".org";
System.out.println(
isValidDomain(str5)); // Expected output: false
}
}
Python
import re
# Function to validate the domain name
def is_valid_domain(s):
# Regex to check valid Domain Name
pattern = r"^[A-Za-z0-9-]{1,63}\.[A-Za-z]{2,6}$"
# Return true if the string matches the regex
return bool(re.match(pattern, s))
# Driver Code
# Test Case 1:
str1 = "geeksforgeeks.org"
print(is_valid_domain(str1)) # Expected output: True
# Test Case 2:
str2 = "contribute.geeksforgeeks.org"
print(is_valid_domain(str2)) # Expected output: True
# Test Case 3:
str3 = "-geeksforgeeks.org"
print(is_valid_domain(str3)) # Expected output: False
# Test Case 4:
str4 = "geeksforgeeks.o"
print(is_valid_domain(str4)) # Expected output: False
# Test Case 5:
str5 = ".org"
print(is_valid_domain(str5)) # Expected output: False
C#
using System;
using System.Text.RegularExpressions;
class DomainValidator {
// Function to validate the domain name
public static bool IsValidDomain(string str)
{
// Regex to check valid Domain Name
string pattern
= @"^[A-Za-z0-9-]{1,63}\.[A-Za-z]{2,6}$";
Regex regex = new Regex(pattern);
// Return true if the string matches the regex
return regex.IsMatch(str);
}
static void Main()
{
// Test Case 1:
string str1 = "geeksforgeeks.org";
Console.WriteLine(
IsValidDomain(str1)); // Expected output: True
// Test Case 2:
string str2 = "contribute.geeksforgeeks.org";
Console.WriteLine(
IsValidDomain(str2)); // Expected output: True
// Test Case 3:
string str3 = "-geeksforgeeks.org";
Console.WriteLine(
IsValidDomain(str3)); // Expected output: False
// Test Case 4:
string str4 = "geeksforgeeks.o";
Console.WriteLine(
IsValidDomain(str4)); // Expected output: False
// Test Case 5:
string str5 = ".org";
Console.WriteLine(
IsValidDomain(str5)); // Expected output: False
}
}
JavaScript
// JavaScript program to validate domain name using Regular
// Expression
// Function to validate the domain name
function isValidDomain(str)
{
// Regex to check valid Domain Name
let regex = /^[A-Za-z0-9-]{1,63}\.[A-Za-z]{2,6}$/;
// Check if the string is null or empty
if (!str) {
return "false";
}
// Return true if the string matches the regex
return regex.test(str) ? "true" : "false";
}
// Driver Code
// Test Case 1:
let str1 = "geeksforgeeks.org";
console.log(isValidDomain(str1)); // Expected output: true
// Test Case 2:
let str2 = "contribute.geeksforgeeks.org";
console.log(isValidDomain(str2)); // Expected output: true
// Test Case 3:
let str3 = "-geeksforgeeks.org";
console.log(isValidDomain(str3)); // Expected output: false
// Test Case 4:
let str4 = "geeksforgeeks.o";
console.log(isValidDomain(str4)); // Expected output: false
// Test Case 5:
let str5 = ".org";
console.log(isValidDomain(str5)); // Expected output: false
Outputtrue
false
true
false
false
Time Complexity: O(N) for each testcase, where N is the length of the given string.
Auxiliary Space: O(1)
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Dijkstra's Algorithm to find Shortest Paths from a Source to all Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example
12 min read
Selection Sort Selection Sort is a comparison-based sorting algorithm. It sorts an array by repeatedly selecting the smallest (or largest) element from the unsorted portion and swapping it with the first unsorted element. This process continues until the entire array is sorted.First we find the smallest element an
8 min read