Check if a string consists only of special characters
Last Updated :
15 Jul, 2025
Given string str of length N, the task is to check if the given string contains only special characters or not. If the string contains only special characters, then print “Yes”. Otherwise, print “No”.
Examples:
Input: str = “@#$&%!~”
Output: Yes
Explanation:
Given string contains only special characters.
Therefore, the output is Yes.
Input: str = “Geeks4Geeks@#”
Output: No
Explanation:
Given string contains alphabets, number, and special characters.
Therefore, the output is No.
Naive Approach: Iterate over the string and check if the string contains only special characters or not. Follow the steps below to solve the problem:
- Traverse the string and for each character, check if its ASCII value lies in the ranges [32, 47], [58, 64], [91, 96] or [123, 126]. If found to be true, it is a special character.
- Print Yes if all characters lie in one of the aforementioned ranges. Otherwise, print No.
Time Complexity: O(N)
Auxiliary Space: O(1)
Space-Efficient Approach: The idea is to use Regular Expression to optimize the above approach. Follow the steps below:
- Create the following regular expression to check if the given string contains only special characters or not.
regex = “[^a-zA-Z0-9]+”
where,
- [^a-zA-Z0-9] represents only special characters.
- + represents one or more times.
- Match the given string with the Regular Expression using Pattern.matcher() in Java
- Print Yes if the string matches with the given regular expression. Otherwise, print No.
Below is the implementation of the above approach:
C++
// C++ program to check if the string
// contains only special characters
#include <iostream>
#include <regex>
using namespace std;
// Function to check if the string contains only special characters.
void onlySpecialCharacters(string str)
{
// Regex to check if the string contains only special characters.
const regex pattern("[^a-zA-Z0-9]+");
// If the string
// is empty then print "No"
if (str.empty())
{
cout<< "No";
return ;
}
// Print "Yes" if the string contains only special characters
// matched the ReGex
if(regex_match(str, pattern))
{
cout<< "Yes";
}
else
{
cout<< "No";
}
}
// Driver Code
int main()
{
// Given string str
string str = "@#$&%!~";
onlySpecialCharacters(str) ;
return 0;
}
// This code is contributed by yuvraj_chandra
Java
// Java program to check if the string
// contains only special characters
import java.util.regex.*;
class GFG {
// Function to check if a string
// contains only special characters
public static void onlySpecialCharacters(
String str)
{
// Regex to check if a string contains
// only special characters
String regex = "[^a-zA-Z0-9]+";
// Compile the ReGex
Pattern p = Pattern.compile(regex);
// If the string is empty
// then print No
if (str == null) {
System.out.println("No");
return;
}
// Find match between given string
// & regular expression
Matcher m = p.matcher(str);
// Print Yes If the string matches
// with the Regex
if (m.matches())
System.out.println("Yes");
else
System.out.println("No");
}
// Driver Code
public static void main(String args[])
{
// Given string str
String str = "@#$&%!~";
// Function Call
onlySpecialCharacters(str);
}
}
Python3
# Python program to check if the string
# contains only special characters
import re
# Function to check if a string
# contains only special characters
def onlySpecialCharacters(Str):
# Regex to check if a string contains
# only special characters
regex = "[^a-zA-Z0-9]+"
# Compile the ReGex
p=re.compile(regex)
# If the string is empty
# then print No
if(len(Str) == 0):
print("No")
return
# Print Yes If the string matches
# with the Regex
if(re.search(p, Str)):
print("Yes")
else:
print("No")
# Driver Code
# Given string str
Str = "@#$&%!~"
# Function Call
onlySpecialCharacters(Str)
# This code is contributed by avanitrachhadiya2155
C#
// C# program to check if
// the string contains only
// special characters
using System;
using System.Text.RegularExpressions;
class GFG{
// Function to check if a string
// contains only special characters
public static void onlySpecialchars(String str)
{
// Regex to check if a string
// contains only special
// characters
String regex = "[^a-zA-Z0-9]+";
// Compile the ReGex
Regex rgex = new Regex(regex);
// If the string is empty
// then print No
if (str == null)
{
Console.WriteLine("No");
return;
}
// Find match between given
// string & regular expression
MatchCollection matchedAuthors =
rgex.Matches(str);
// Print Yes If the string matches
// with the Regex
if (matchedAuthors.Count != 0)
Console.WriteLine("Yes");
else
Console.WriteLine("No");
}
// Driver Code
public static void Main(String []args)
{
// Given string str
String str = "@#$&%!~";
// Function Call
onlySpecialchars(str);
}
}
// This code is contributed by Princi Singh
JavaScript
<script>
// JavaScript program to check if
// the string contains only
// special characters
// Function to check if a string
// contains only special characters
function onlySpecialchars(str)
{
// Regex to check if a string
// contains only special
// characters
var regex = /^[^a-zA-Z0-9]+$/;
// If the string is empty
// then print No
if (str.length < 1) {
document.write("No");
return;
}
// Find match between given
// string & regular expression
var matchedAuthors = regex.test(str);
// Print Yes If the string matches
// with the Regex
if (matchedAuthors) document.write("Yes");
else document.write("No");
}
// Driver Code
// Given string str
var str = "@#$&%!~";
// Function Call
onlySpecialchars(str);
</script>
Time Complexity: O(N)
Auxiliary Space: O(1)
Another approach: This is simple approach in which just checking the string contain any alphabets and digits or not. If contains then print No else print Yes.
1. Take the a string str and call the function Check_Special_Chars passing string as parameter.
2. The function Check_Special_Chars takes a string as input and loops over each character in the string using a for loop.
3. Now in the inner loop check each character is an alphabet (both upper and lower case) A to Z ASCII value (65 to 90) and a to z ASCII value(97 to 122) or not.
If the character is an alphabet, the function prints "No" and returns from the function.
4.The second inner for loop checks if the current character is a number (0 to 9) ASCII value(48 to 57). If the character is a number, the function prints "No" and returns from the function.
5. If the function loops through the entire string without finding any alphabets or numbers, it means that the string only contains special characters. In this case, the function prints "Yes".
Below the implementation of above approach.
C++
// C++ program to check if the string
// contains only special characters
#include <bits/stdc++.h>
using namespace std;
// Function to check if the string contains only special characters.
void Check_Special_Chars(string s)
{
// Looping over the string
for(int i = 0; i<s.length();i++)
{
// checking for a-z and A-Z characters
for(int k = 0; k <26; k++)
{
// if present then print No and return
if(s[i]==k+65 || s[i]==k+97)
{
cout<<"No"<<endl;
return;
}
}
// Checking for 0-9 characters
for(int k = 0; k<10; k++)
{
// if present then print No and return
if(s[i]==k+48)
{
cout<<"No"<<endl;
return;
}
}
}
// if not present a-z, A-Z and 0-9, then only special character present and print Yes
cout<<"Yes"<<endl;
}
// Driver Code
int main()
{
// Given string str
string str = "@#$&%!~";
Check_Special_Chars(str) ;
return 0;
}
Java
import java.util.*;
class Main {
// Function to check if the string contains only special characters.
static void Check_Special_Chars(String s) {
// Looping over the string
for(int i = 0; i < s.length(); i++) {
// checking for a-z and A-Z characters
for(int k = 0; k < 26; k++) {
// if present then print No and return
if(s.charAt(i) == (char)(k + 65) || s.charAt(i) == (char)(k + 97)) {
System.out.println("No");
return;
}
}
// Checking for 0-9 characters
for(int k = 0; k < 10; k++) {
// if present then print No and return
if(s.charAt(i) == (char)(k + 48)) {
System.out.println("No");
return;
}
}
}
// if not present a-z, A-Z and 0-9, then only special character present and print Yes
System.out.println("Yes");
}
// Driver Code
public static void main(String[] args) {
// Given string str
String str = "@#$&%!~";
Check_Special_Chars(str);
}
}
Python3
class Main:
# Function to check if the string contains only special characters.
@staticmethod
def Check_Special_Chars(s):
# Looping over the string
for i in range(len(s)):
# checking for a-z and A-Z characters
for k in range(26):
# if present then print No and return
if s[i] == chr(k + 65) or s[i] == chr(k + 97):
print("No")
return
# Checking for 0-9 characters
for k in range(10):
# if present then print No and return
if s[i] == chr(k + 48):
print("No")
return
# if not present a-z, A-Z and 0-9, then only special character
# present and print Yes
print("Yes")
# Driver Code
# Given string str
str = "@#$&%!~"
Main.Check_Special_Chars(str)
C#
using System;
class Program
{
// Function to check if the string contains only special
// characters.
static void Check_Special_Chars(string s)
{
// Looping over the string
for (int i = 0; i < s.Length; i++)
{
// checking for a-z and A-Z characters
for (int k = 0; k < 26; k++)
{
// if present then print No and return
if (s[i] == k + 65 || s[i] == k + 97) {
Console.WriteLine("No");
return;
}
}
// Checking for 0-9 characters
for (int k = 0; k < 10; k++)
{
// if present then print No and return
if (s[i] == k + 48) {
Console.WriteLine("No");
return;
}
}
}
// if not present a-z, A-Z and 0-9, then only
// special character present and print Yes
Console.WriteLine("Yes");
}
// Driver Code
static void Main(string[] args)
{
// Given string str
string str = "@#$&%!~";
Check_Special_Chars(str);
}
}
JavaScript
// Function to check if the string contains only special characters.
function Check_Special_Chars(s) {
// Looping over the string
for (let i = 0; i < s.length; i++) {
// checking for a-z and A-Z characters
for (let k = 0; k < 26; k++) {
// if present then print No and return
if (s[i] == String.fromCharCode(k + 65) || s[i] == String.fromCharCode(k + 97)) {
console.log("No");
return;
}
}
// Checking for 0-9 characters
for (let k = 0; k < 10; k++) {
// if present then print No and return
if (s[i] == String.fromCharCode(k + 48)) {
console.log("No");
return;
}
}
}
// if not present a-z, A-Z and 0-9, then only special character present and print Yes
console.log("Yes");
}
// Driver Code
let str = "@#$&%!~";
Check_Special_Chars(str);
Time Complexity: O(N)
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