Last Updated: 14 Apr, 2022

Change Case

Easy

Problem statement

You are given a non-empty string ‘STR’, consisting of both lowercase and uppercase English alphabetical letters. Your task is to convert the characters of the string into the opposite case, i.e. if a character is in lower case then convert it into the upper case and vice-versa.

For Example:

If STR = ‘aBc’,
After converting ‘a’ to ‘A’, ‘B’ to ‘b’, and ‘c’ to ‘C’ we got our final string as ‘AbC’.

Input Format :

The first line of the input contains an integer, 'T’, denoting the number of test cases.

The first and only line of each test case contains a non-empty string of characters(a - z, A - Z).

Output Format :

For each test case, print the string after converting the characters of the string into the opposite case.

Print a separate line for each test case.

Note :

You do not need to print anything, it has already been taken care of. Just implement the given function.

Constraints :

1 <= T <= 10
1 <= str.length <= 10000

Time limit: 1 sec

Solve now

Approaches

01 Approach

The ASCII values of lowercase English alphabets lie in the range 97-122 where 97 is the ASCII value of ‘a’ and 122 is of ‘z’. Similarly, the ASCII values of uppercase English alphabets lie in the range 65-90 where 65 is the ASCII value of ‘A’ and 90 is of ‘Z’. If we have an uppercase alphabet then we just have to add 32 to convert it to lowercase and if we have a lowercase alphabet then we just have to subtract 32 to convert it to uppercase.

Here is the algorithm:

Iterate over the string ‘STR’ (say iterator ‘i’)
- If STR[i] >= 'a' and STR[i] <= 'z'
  - STR[i] -= 32.
- Else
  - STR[i] += 32.

Solve now