Pascal case of a given sentence
Given a string “STR”, you need to remove spaces from the string “STR” and rewrite in the Pascal case. Your task is to return the string “STR”.

In the Pascal case writing style we don’t have spaces between words and all words begin with uppercase letters including the first word.

Note:

Input string “STR” will only consist of lowercase English Alphabets. The string will not contain white space at the beginning and end of the string.

Input Format:

The first line of input contains an integer ‘T’ denoting the number of test cases to run. Then the test case follows. The first and the only line of each test case contains the string 'STR'.

Output Format :

For each test case, return a string that is written in the Pascal case style. Output for each test case will be printed in a new line.

Note:

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

Constraints:

1

Question

Pascal case of a given sentence

Given a string “STR”, you need to remove spaces from the string “STR” and rewrite in the Pascal case. Your task is to return the string “STR”.

In the Pascal case writing style we don’t have spaces between words and all words begin with uppercase letters including the first word.

Note:

Input string “STR” will only consist of lowercase English Alphabets. The string will not contain white space at the beginning and end of the string.

Input Format:

The first line of input contains an integer ‘T’ denoting the number of test cases to run. Then the test case follows.

The first and the only line of each test case contains the string 'STR'.

Output Format :

For each test case, return a string that is written in the Pascal case style.

Output for each test case will be printed in a new line.

Note:

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

Constraints:

1 <= T <= 5
1 <= |STR| <= 10^5

Where |STR| denotes the length of “STR”

Time Limit: 1sec

Accepted Answer

Brute Force

We can iterate over the string “STR” and maintain the resultant string in “answer”. On each character check if that character is white space (‘ ’) then change the next character to uppercase and do not include white space in the string “answer”, else append that character in the string “answer”.

Algorithm:

Create an empty string “answer”.
Iterate over string “STR”, for each character
- If the STR[i] == ‘ ‘:
  - Change STR[i + 1] to upper case.
- Else
  - Append this character in “answer”.
Return “answer”.

Space Complexity: O(n)Explanation:

O(N), where ‘N’ denotes the length of STR.

Since we store at most ‘N’ characters in the string “answer”, the space complexity is O(N).

Time Complexity: O(n)Explanation:

O(N), where ‘N’ denotes the length of STR.

Since we iterate through the string “STR” only once, the time complexity is O(N).

Python (3.5)

'''

    Time Complexity: O(N)

    Space Complexity: O(N)



    Where N is the length of the given string.

'''



def pascalCase(str):



    

    # First character will always be upper

    ans = str[0].upper()



    # Now iterate through rest of the characters

    for i in range(1, len(str)):

        

        # Check for white spaces 

        if ( str[i] == ' ' ):

            

            # Add next character with upper case into 'ans'.

            ans += str[i + 1].upper()



        # If not white space, append this character in answer.

        elif( str[i - 1] != ' '):

            ans += str[i]



    return ans

Java (SE 1.8)

/*

    Time Complexity : O(N)

    Space Complexity : O(N)

    

    Where N denotes length of input string

*/



public class Solution 

{

	public static String pascalCase(String str) 

    {

        

        // to store resultant answer

        String answer = "";



        // Convert string into char array

        char charStr[] = str.toCharArray();

        

        // First character will always be upper

        charStr[0] = (char) ((int) charStr[0] - 32);



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

        {



            // check for white spaces

            if (charStr[i] == ' ')

            {

                // conversion into upper case

                charStr[i + 1] = (char) ((int) charStr[i + 1] - 32);

            }



            // If not white space, append this character in answer.

            else

            {

                answer += charStr[i];

            }

        }



        return answer;

    }

}

C++ (g++ 5.4)

/*

    Time Complexity: O(N)

    Space Complexity: O(N)



    Where N is the length is the string.

*/



string pascalCase(string str)

{



	// to store resultant answer

	string answer = "";



	// First character will always be upper

	str[0] = str[0] - 32;



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

	{

		// check for white spaces

		if (str[i] == ' ')

		{

			// conversion into upper case

			str[i + 1] = str[i + 1] - 32;

		}



		// If not white space, append this character in answer.

		else

		{

			answer += str[i];

		}

	}



	return answer;

}

Given a string “STR”, you need to remove spaces from the string “STR” and rewrite in the Pascal case. Your task is to return the string “STR”.

In the Pascal case writing style we don’t have spaces between words and all words begin with uppercase letters including the first word.

Note:

Input Format:

Output Format :

Note:

Constraints:

Top EX Squared Solutions Software Developer Intern interview questions & answers

Popular interview questions of Software Developer Intern