← All problemsSign in

Create String

Chef has two strings S1 and S2 both made up of alphabets from the word COOKOFF(C,O,K,F). He wants to know whether he can create any permutation of S1 by joining various permutations of S2 together. ### Input - The first line contains the number of test cases(T) - For each testcase, the next 2 lines contain two strings, S1 and S2 respectively ### Output Output "YES" if chef can create any permuta

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

Sign in to chat with the tutor and save your progress.

Sign in to start