String Manipulation Programming Tasks
Uploaded by
rautapurnamashiString Manipulation Programming Tasks
Uploaded by
rautapurnamashiCommon questions
Powered by AITo sort the characters in a string alphabetically in Java: 1) Convert the string to a character array. 2) Utilize Java's `Arrays.sort()` method to sort the array. 3) Convert the sorted array back into a string. This transformed string will have its characters in alphabetical order, such as converting 'computer' to 'cemoprtu' .
To check if a string is 'unique', meaning it contains no repeated alphabets: 1) Initialize a set to keep track of encountered characters. 2) Iteratively examine each character in the string. 3) If a character has been seen before (present in the set), the string is not unique. 4) If no characters repeat, the string is unique. For example, with 'COMPUTER', which has no repeating letters, the output is 'Unique String' .
To transform a sentence so that the first character of each word is uppercase: Split the sentence into words, either using space as a delimiter or regular expressions to match word boundaries. Capitalize the first character of each word while keeping the rest in lowercase. Finally, join the words together to form the modified sentence. For example, 'india got independence in nineteen forty seven' becomes 'India Got Independence In Nineteen Forty Seven' .
To generate a word pattern in the form of a triangle or inverted triangle: 1) Accept a word from the user. 2) Depending on user choice, decide the shape of the pattern. 3) For a triangle, print increasing substrings from the start; for an inverted triangle, print from the full word length down to one character. Considerations include ensuring even character spacing for readability and handling uppercase transformation as needed. Example: For 'WATER' as an input word, a resulting pattern might be: 'W', 'WA', 'WAT', 'WATER', followed by its reverse for an inverted triangle .
To determine the frequency of each alphabet in a string: 1) Initialize a hash map or dictionary to store character frequencies. 2) Traverse the string, converting characters to uppercase or lowercase as needed. 3) For each alphabetic character, update its count in the hash map. 4) Finally, print each alphabet and its frequency in the order of their appearance. For example, for input 'COMPUTER APPLICATION', the output is 'A 2, O 2, C 2, P 3, E 1, R 1, I 1, L 1, T 2, M 1, U 1, N 1' .
To count palindrome words in a sentence, follow these steps: 1) Split the sentence into individual words. 2) For each word, check if it reads the same forwards and backwards. 3) Increment a counter for each word that is a palindrome. 4) Output this count. For instance, in the sentence 'MADAM IS MALAYALAM', both 'MADAM' and 'MALAYALAM' are palindromes, resulting in a count of 2 .
To replace specific words in a sentence: 1) Use a language function available for string replacement, such as `replace()` in Python. 2) Identify the target word(s) to replace and the replacement word. 3) Apply the replacement function across the entire string. For example, replacing 'big' with 'hot' in 'The big bottle in the big water bag.' results in 'The hot bottle in the hot water bag.' .
To convert uppercase letters to lowercase and lowercase to uppercase while keeping non-alphabetic characters unchanged: Traverse through each character in the string. If a character is uppercase, convert it to lowercase, and if it is lowercase, convert it to uppercase. Non-alphabetic characters should be left unchanged. This operation can often be achieved using functions like `swapcase()` in Python .
To convert a word into Piglatin: 1) Convert the word to uppercase. 2) Identify the first vowel in the word. 3) Begin the Piglatin word with this vowel, followed by the rest of the word. 4) Move all characters preceding the vowel to the end, and append 'AY' to form the new word. For example, 'London' becomes 'ONDONLAY' .
To count double letter pairs in a sentence: 1) Convert the sentence to a consistent case, such as uppercase. 2) Traverse the string character by character, checking pairs. 3) For each character, compare with the following one; if they match, it's a double letter pair. 4) Keep a running count of such pairs. For example, in 'SHE WAS FEEDING THE LITTLE RABBIT WITH AN APPLE', there are 4 double letter pairs: 'EE', 'TT', 'BB', 'PP' .