Problem:-
Implement an algorithm to determine if a string has all unique characters. what if you can not use additional data structure?
Code:-
/* Implement an algorithm to determine if a string has all unique character */
#include<stdio.h>
#include<string.h>
int fre[122];
int main()
{
char s[50];
int i;
printf("Enter a string \n");
scanf("%[^\n]",s);
for(int i=0;s[i];i++)
{
int a=s[i];
fre[a]++;
}
for( i=0;i<=122;i++)
{
if(fre[i]>1)
{
printf("Not unique\n");
break;
}
}
if(i==123)
printf("All characters are unique\n");
return 0;
}
Output:-
Enter a string
easycodingzone
Not unique
Recommended Post:
Hackerearth Problems:-
- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem
Hackerrank Problems:-
- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution
Data structure:-
- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree
Key points:-
- How to set limit in the floating value in python
- What is boolean data type
- How to print any character without using format specifier
MCQs:-
