Amazing Strings Problem Statement

Determine if the third string contains all the characters from both the first and second strings in any order. If so, return "YES"; otherwise, return "NO".

Input:

Line 1: First string
Line 2: Second string
Line 3: Third string

Output:

"YES" or "NO"

Example:

Input:

"ABC"
"DEF"
"ADBECF"

Output:

"YES"

Explanation:

All the characters from "ABC" and "DEF" are present in the third string "ADBECF".

Constraints:

1

Question

Amazing Strings Problem Statement

Determine if the third string contains all the characters from both the first and second strings in any order. If so, return "YES"; otherwise, return "NO".

Input:

Line 1: First string
Line 2: Second string
Line 3: Third string

Output:

"YES" or "NO"

Example:

Input:

"ABC"
"DEF"
"ADBECF"

Output:

"YES"

Explanation:

All the characters from "ABC" and "DEF" are present in the third string "ADBECF".

Constraints:

1 <= n (Length of 1st & 2nd Strings) <= 100

Note:

The characters in the third string should match the exact number and type of characters from the first and second strings, without any extras or omissions.

Accepted Answer

Check if the third string contains all characters from the first and second strings in any order.

Create a frequency map for characters in the first and second strings.
Check if the frequency of characters in the third string matches the frequency map of the first and second strings.
Return 'YES' if all characters are present in the third string, otherwise return 'NO'.

Amazing Strings Problem Statement

Input:

Output:

Example:

Input:

Output:

Explanation:

Constraints:

Note:

Amazon Software Developer Intern interview questions & answers

Popular interview questions of Software Developer Intern