Efficiently check if a string has all unique characters without using any additional data structure
Last Updated :
20 Jul, 2024
Implement an space efficient algorithm to determine if a string (of characters from 'a' to 'z') has all unique characters or not. Use additional data structures like count array, hash, etc is not allowed.
Expected Time Complexity : O(n)
Examples :
Input : str = "aaabbccdaa"
Output : No
Input : str = "abcd"
Output : Yes
Brute Force Approach:
The brute force approach to solve this problem is to compare each character of the string with all the other characters in the string to check if it is unique or not. We can define a function that takes the input string and returns true if all the characters in the string are unique, and false otherwise.
- Traverse the string character by character.
- For each character, compare it with all the other characters in the string.
- If any other character is found to be equal to the current character, return false as the string has duplicate characters.
- If the end of the string is reached without finding any duplicate characters, return true as the string has all unique characters.
Below is the implementation of the above approach:
C++
#include<bits/stdc++.h>
using namespace std;
bool areChractersUnique(string str)
{
int n = str.length();
for(int i = 0; i < n; i++)
for(int j = i + 1; j < n; j++)
if(str[i] == str[j])
return false;
return true;
}
int main()
{
string s = "aaabbccdaa";
if (areChractersUnique(s))
cout << "Yes";
else
cout << "No";
return 0;
}
public class Main {
public static boolean areCharactersUnique(String str) {
boolean[] seen = new boolean[256]; // Assuming ASCII characters
for (char c : str.toCharArray()) {
if (seen[c]) {
return false; // Character already seen
}
seen[c] = true;
}
return true; // No duplicate characters found
}
public static void main(String[] args) {
String s = "abca";
if (areCharactersUnique(s)) {
System.out.println("Yes");
} else {
System.out.println("No");
}
}
}
# This function checks if all characters in a string are unique.
def are_characters_unique(string):
n = len(string)
for i in range(n):
for j in range(i + 1, n):
if string[i] == string[j]:
return False
return True
if __name__ == '__main__':
s = "aaabbccdaa"
if are_characters_unique(s):
print("Yes")
else:
print("No")
using System;
public class GFG
{
public static bool areChractersUnique(string str)
{
int n = str.Length;
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
if (str[i] == str[j])
return false;
return true;
}
public static void Main()
{
string s = "aaabbccdaa";
if (areChractersUnique(s))
Console.WriteLine("Yes");
else
Console.WriteLine("No");
}
}
// javascript code addition
// This function checks if all characters in a string are unique.
function areChractersUnique(str)
{
// Find the length of the string
let n = str.length;
// outer loop
for(let i = 0; i < n; i++)
// innerloop
for(let j = i + 1; j < n; j++)
if(str[i] == str[j])
return false;
return true;
}
let s = "aaabbccdaa";
if (areChractersUnique(s))
// Print "Yes" if all characters are unique.
console.log("Yes");
else
console.log("No");
// The code is contributed by Arushi Goel.
Time Complexity: O(N^2)
Auxiliary Space: O(1)
The idea is to use an integer variable and use bits in its binary representation to store whether a character is present or not. Typically an integer has at-least 32 bits and we need to store presence/absence of only 26 characters.
Below is the implementation of the idea.
C++
// A space efficient C++ program to check if
// all characters of string are unique.
#include<bits/stdc++.h>
using namespace std;
// Returns true if all characters of str are
// unique.
// Assumptions : (1) str contains only characters
// from 'a' to 'z'
// (2) integers are stored using 32
// bits
bool areChractersUnique(string str)
{
// An integer to store presence/absence
// of 26 characters using its 32 bits.
int checker = 0;
for (int i = 0; i < str.length(); ++i)
{
int val = (str[i]-'a');
// If bit corresponding to current
// character is already set
if ((checker & (1 << val)) > 0)
return false;
// set bit in checker
checker |= (1 << val);
}
return true;
}
// Driver code
int main()
{
string s = "aaabbccdaa";
if (areChractersUnique(s))
cout << "Yes";
else
cout << "No";
return 0;
}
// A space efficient Java program to check if
// all characters of string are unique.
class GFG {
// Returns true if all characters of str are
// unique.
// Assumptions : (1) str contains only characters
// from 'a' to 'z'
// (2) integers are stored using 32
// bits
static boolean areChractersUnique(String str)
{
// An integer to store presence/absence
// of 26 characters using its 32 bits.
int checker = 0;
for (int i = 0; i < str.length(); ++i)
{
int val = (str.charAt(i)-'a');
// If bit corresponding to current
// character is already set
if ((checker & (1 << val)) > 0)
return false;
// set bit in checker
checker |= (1 << val);
}
return true;
}
//driver code
public static void main (String[] args)
{
String s = "aaabbccdaa";
if (areChractersUnique(s))
System.out.print("Yes");
else
System.out.print("No");
}
}
// This code is contributed by Anant Agarwal.
# A space efficient Python3 program to check if
# all characters of string are unique
# Returns true if all characters of str are
# unique.
# Assumptions : (1) str contains only characters
# from 'a' to 'z'
# (2) integers are stored using 32
# bits
def areCharactersUnique(s):
# An integer to store presence/absence
# of 26 characters using its 32 bits
checker = 0
for i in range(len(s)):
val = ord(s[i]) - ord('a')
# If bit corresponding to current
# character is already set
if (checker & (1 << val)) > 0:
return False
# set bit in checker
checker |= (1 << val)
return True
# Driver code
s = "aaabbccdaa"
if areCharactersUnique(s):
print("Yes")
else:
print("No")
# This code is contributed
# by Mohit Kumar
// A space efficient program
// to check if all characters
// of string are unique.
using System;
class GFG {
// Returns true if all characters
// of str are unique. Assumptions:
// (1)str contains only characters
// from 'a' to 'z'.(2)integers are
// stored using 32 bits
static bool areChractersUnique(string str)
{
// An integer to store presence
// or absence of 26 characters
// using its 32 bits.
int checker = 0;
for (int i = 0; i < str.Length; ++i) {
int val = (str[i] - 'a');
// If bit corresponding to current
// character is already set
if ((checker & (1 << val)) > 0)
return false;
// set bit in checker
checker |= (1 << val);
}
return true;
}
// Driver code
public static void Main()
{
string s = "aaabbccdaa";
if (areChractersUnique(s))
Console.Write("Yes");
else
Console.Write("No");
}
}
// This code is contributed by Anant Agarwal.
<script>
// Javascript program for the above approach
// Returns true if all characters of str are
// unique.
// Assumptions : (1) str contains only characters
// from 'a' to 'z'
// (2) integers are stored using 32
// bits
function areChractersUnique(str)
{
// An integer to store presence/absence
// of 26 characters using its 32 bits.
let checker = 0;
for (let i = 0; i < str.length; ++i)
{
let val = (str[i]-'a');
// If bit corresponding to current
// character is already set
if ((checker & (1 << val)) > 0)
return false;
// set bit in checker
checker |= (1 << val);
}
return true;
}
// Driver Code
var s = "aaabbccdaa";
if (areChractersUnique(s))
document.write("Yes");
else
document.write("No");
</script>
<?php
// A space efficient PHP program
// to check if all characters of
// string are unique.
// Returns true if all characters
// of str are unique.
// Assumptions : (1) str contains
// only characters
// from 'a' to 'z'
// (2) integers are stored
// using 32 bits
function areChractersUnique($str)
{
// An integer to store presence/absence
// of 26 characters using its 32 bits.
$checker = 0;
for ($i = 0; $i < $len = strlen($str); ++$i)
{
$val = ($str[$i] - 'a');
// If bit corresponding to current
// character is already set
if (($checker & (1 << $val)) > 0)
return false;
// set bit in checker
$checker |= (1 << $val);
}
return true;
}
// Driver code
$s = "aaabbccdaa";
if (areChractersUnique($s))
echo "Yes";
else
echo "No";
// This code is contributed by aj_36
?>
Time Complexity : O(n)
Auxiliary Space : O(1)
Another Implementation: Using STL
C++
#include <bits/stdc++.h>
using namespace std;
bool unique(string s) {
sort(s.begin(),s.end());
for(int i=0;i<s.size()-1;i++)
{
if(s[i]==s[i+1])
{
return false;
break;
}
}
return true;
}
int main() {
if(unique("abca")==true)
{
cout <<"String is Unique"<<endl;
}
else
{
cout <<"String is not Unique"<<endl;
}
return 0;
}
import java.util.HashSet;
class GFG {
static boolean unique(String s)
{
HashSet<Character> set = new HashSet<>();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
if (set.contains(c)) {
return false;
}
set.add(c);
}
return true;
}
public static void main(String[] args)
{
if (unique("abca")) {
System.out.println("String is Unique");
}
else {
System.out.println("String is not Unique");
}
}
}
def unique(s):
s = list(s)
s.sort()
for i in range (len(s) - 1):
if(s[i] == s[i + 1]):
return False
break
return True
if(unique("abca") == True):
print("String is Unique")
else:
print("String is not Unique")
# This code is contributed by shivanisinghss2110
using System;
public class GFG {
static bool Unique(string s) {
// Convert string to char array and sort it
char[] charArray = s.ToCharArray();
Array.Sort(charArray);
// Check for adjacent duplicates
for (int i = 0; i < charArray.Length - 1; i++) {
if (charArray[i] == charArray[i + 1]) {
return false;
}
}
return true;
}
// Driver code
public static void Main(string[] args) {
if (Unique("ab")) {
Console.WriteLine("String is Unique");
} else {
Console.WriteLine("String is not Unique");
}
}
}
function unique(s)
{
let charSet = new Set();
for (let char of s) {
if (charSet.has(char)) {
return false;
}
charSet.add(char);
}
return true;
}
// Driver code
if (unique("abcdd")) {
console.log("String is Unique");
}
else {
console.log("String is not Unique");
}
OutputString is not Unique
Time Complexity : O(nlogn), where n is the length of the given string.
Auxiliary Space : O(1), no extra space is required so it is a constant.
This article is contributed by Mr. Somesh Awasthi.
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