Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
4 views

Strings Basics

Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views

Strings Basics

Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

{

s[i] = towlower(s[i]);

int cv=0,cc=0,cs=0;

for(int i=0;i<s.length();i++){

if(s[i]=='a'||s[i]=='e'||s[i]=='i'||s[i]=='o'||
s[i]=='u'){
int main() {
cv++;
string s="abcdcb";
}else if(s[i]==' '){
string rev=s;
cs++;
reverse(s.begin(),s.end());
}else{
if(rev==s){
cc++;
cout<<"true";
}
}else{

cout<<"false";
}
}
cout<<cv<<" "<<cs<< " "<<cc;

return 0;
return 0;
}
}

int main() {

string s="my name is Karthik"; int main() {


for (int i = 0; i < s.length(); i++) // converting char c='e';
given string to lowercase
cout<<"ASCII VALUE OF CHAR"<< int(c);
}

return 0; cout<<s;

} return 0;

int main() {

string s="my name is karthik";

for(int i=0;i<s.length();i++){
string solve(string str, int n) {
if(s[i]=='a'||s[i]=='e'||s[i]=='i'||s[i]=='o'||
s[i]=='u'){ string ans;
s.erase(i,1); for (int i = 0; i < n; i++) {
} int ascii = (int) str[i]; // ascii value
}

cout<<s; if ((ascii >= 65 && ascii <= 90) || (ascii >= 97 &&
ascii <= 122)) // if alphabets
return 0;
ans.push_back(str[i]);
}
}

return ans;

int main() {

string s="my name is karthik";

for(int i=0;i<s.length();i++){

if(s[i]==' '){

s.erase(i,1);

}
int main() {

string s=“take u forward is awesome";

int n=s.length();
int main() {
s[0]=toupper(s[0]);
string s="a+((b-c)+d)";
s[n-1]=toupper(s[n-1]);
for(int i=s.length();i>=0;i--){
for(int i=1;i<n-1;i++){
if(s[i]=='(' || s[i]==')'){
if(s[i]==' '){
s.erase(i,1);
s[i-1]=toupper(s[i-1]);
}
s[i+1]=toupper(s[i+1]);
}

cout<<s;
}
return 0;
}
}
cout<<s;

Reverse a string return 0;

}
int main() {

string s="hello";

for(int i=s.length()-1;i>=0;i--){

cout<<s[i];

}
if(s[i]==' '){

continue;

}else{

freq[s[i]-'a']++;

int main() { for(int i=0;i<n;i++){

string s=“aaaabbcaff"; if(freq[s[i]-'a']==1 ){

int n=s.length(); cout<<s[i]<<" ";

map<char,int>mp; }

for(int i=0;i<n;i++){ }

mp[s[i]]++; return 0;

} }

for(auto it:mp){

cout<<it.first<<it.second<<" ";

return 0;

int main() {

string s1="tak";

string s2="cat";

sort(s1.begin(),s1.end());

sort(s2.begin(),s2.end());

if(s1==s2){

cout<<"they are anagrams";


int main() { }else{
string s=“google"; cout<<"no";
int n=s.length(); }
int freq[200]; return 0;
for(int i=0;i<n;i++){
} }

int main() {

string s="bcabc";

int n=s.length();

int main() { set<char>st;

string s="apple"; string res=" ";

int n=s.length(); for(int i=0;i<n;i++){

map<char,int>mp; if(st.find(s[i])==st.end()){

for(int i=0;i<n;i++){ res+=s[i];

mp[s[i]]++; st.insert(s[i]);

} }}

int maxi=INT_MIN; cout<<res;

char ans; return 0;

for(auto it:mp){ }

if(it.second>maxi){

maxi=it.second;

ans=it.first;

cout<<ans;

return 0;

int main() {

string s="sinstriiintng";

int n=s.length();

map<char,int>mp;

string res=" ";


for(int i=0;i<n;i++){ }

mp[s[i]]++; return 0;

} }

for(auto it:mp){

if(it.second>1){

cout<<it.first<<" -"<<it.second<<endl;

int main() {

string s="hi my name is karthik";


return 0;
int count=1;
}
int n=s.length();

for(int i=0;i<n;i++){

if(s[i]==' '){

count++;

cout<<count;

int main() {
return 0;
string s1="abcdef";
}
string s2="cefz";

unordered_map<char,int>mp;

for(int i=0;i<s2.length();i++){

mp[s2[i]]++;

for(int i=0;i<s1.length();i++){

if(!mp[s1sss[i]]){

cout<<s1[i];

You might also like