CHEF AND STRINGS

CodeChefOpen on judge ↗

Chef is playing Letter Problem with his son. In this Game, Chef will provide two Strings $S1$ and $S2$ of length $l$ and $ m$ respectively, and he want his son to find number of different characters of s1 that are not present in s2 and vice versa. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a two line of input,

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI