# Tagged: strings

## Check Isogram String or Not

“Check Isogram String or Not” is a basic problem of string data structure. Here, we are given a string of alphabets only and our task is to write a program to check whether the string is isogram or not.  An isogram string is a string in which every character occurs...

## Remove All Blank Spaces in a String

“Remove All Blank Spaces in a String” is  again a basic problem of string data structure. Here, we are given a string of length ‘n’ and our task is to remove the blank spaces from the string. Example: INPUT: Help Me Study Bro OUTPUT: HelpMeStudyBro The steps required to Remove All...

## Find most Frequent Character in String

“Find most Frequent Character in String” is a problem of string data structure. Here, we are given a string of length ‘n’ and our task is to write a program to find the most frequent character of the string.  If there are more than one character which have same highest...

## Find Smallest and Largest Word in String

“Find Smallest and Largest Word in String” is again a basic problem of string data structure. Here, we are given a string containing some words and our task is to write a program to find smallest and largest word in string. Example: INPUT: Help Me Study Bro OUTPUT: Smallest Word:...

## Count Number of Words in a String

“Count Number of Words in a String” is a basic problem of string data structure. Here, we are given string containing some words and our task is to write a program to count the number of words present in the given string and print the count. Example: INPUT:  Help Me...

## Convert Lowercase to Uppercase and Vice Versa

“convert lowercase to uppercase and vice versa” is a basic problem of string data structure. Here, we are given a string of length ‘n’ and our task is to convert upper-case alphabets to lower-case and vice-versa. String might contain characters except alphabets too, in that case, we will ignore them. Example:...

## Check Whether String is Palindrome or not

“Check Whether String is Palindrome or not” is a very popular and basic problem of string data structure. Here, we are given a string of length ‘n’ and our task is to write a program to check whether given string is palindrome string or not. A palindromic string is a...

## Concatenate Two Character Arrays

“Concatenate Two Character Arrays” is a basic operation of character array. Here, we are given two Character Array of length ‘n’ and ‘m’. Our task is to concatenate both the Character Array and store the result into resultant Character Array. Example: INPUT: String 1: Helpme String 2: studybro OUTPUT: Resultant...

## Copy One Character Array to Another Character Array

“Copy One Character Array to Another Character Array” is a basic operation of character array. Here, we are given a character array of length ‘n’. Our task is to copy given character array to another without using any in-built function. The steps required to copy given character array to another...

## Check Type of String

“Check Type of String” is a problem to check whether the given string of length ‘n’ is alphabetic or numeric or alphanumeric. Alphabetic String: An alphabetic string is a type of string which contains only alphabets. Numeric String: A numeric string is a type of string which contains only numbers....