# Chef and Happy String Codechef Solution

### We Are Discuss About CODECHEF SOLUTION

Chef and Happy String Codechef Solution

## Chef and Happy String Codechef Solution

Answers will be Uploaded Shortly and it will be Notified on Telegram, So JOIN NOW

## Problem

Chef has a string S with him. Chef is happy if the string contains a contiguous substring of length strictly greater than 2 in which all its characters are vowels.

Determine whether Chef is happy or not.

Note that, in english alphabet, vowels are aeio, and u.

### Input Format

• First line will contain T, number of test cases. Then the test cases follow.
• Each test case contains of a single line of input, a string S.

### Output Format

For each test case, if Chef is happy, print HAPPY else print SAD.

You may print each character of the string in uppercase or lowercase (for example, the strings hAppYHappyhaPpY, and HAPPY will all be treated as identical).

### Constraints

• 1 \leq T \leq 1000
• 3 \leq |S| \leq 1000, where |S| is the length of S.
Answers will be Uploaded Shortly and it will be Notified on Telegram, So JOIN NOW

## Chef and Happy String Codechef Solution

Yhaa You have done it but next? if YOU Want to Get Others Please Visit Here JOIN NOW

Answers will be Uploaded Shortly and it will be Notified on Telegram, So JOIN NOW