AlgoUniversity
  • Go Back
Discussion
Bingo String :

Author

Akshay Sharma

Difficulty Level : Easy

Submissions : 281

Asked In : TCS

Marks :100

: 0 | : 1

Rohan was Given a sentence of strings. The task is to find whether the given sentence contains all letters of the English alphabet (a to z or A to Z).

If it does not, then print all missing letters of the alphabet, otherwise, print 0.

Input

The first and the only line of string str contains a sentence that may have multiple strings separated by blank spaces

Output

For each test case print the missing words or print 0 if all words are present

Examples

Input
The four boxing wizard jumps over the quickly

Output
0
Input
Professional way to prepare programming contest problems
Output
dhjkquvxz

Note

All characters in the given sentence should be treated as case insensitive, which means that 'A' and 'a' are to be treated as the same.

The output should be in alphabetic order.

The output should contain only lowercase alphabets.

If none of the letters is missing print 0 as the output

You need to login to view your submissions.

You need to login to view all submissions.

Loading...

Result : Executed

Loading...

Feel something is wrong with the test cases?

Result : Accepted

Test Cases :

You need to Log In
We're glad that you want to attempt this problem!

But to Run or Submit the Problem, you need to Log In.

Continue to Log In
Challenge Submitted!

Your challenge has been submitted successfully.

You will get a response soon via WhatsApp or Email.

Challenge
Facing issue while trying to solve the problem! Don't worry, we got you covered!

Do let us know your issue.

Looks good!
Please enter your issue / feedback.

How do we get in touch with you?
Looks good!
Please enter your phone no.
Looks good!
Please enter your email address.